Re: Speed of convergence of recursions

On Tue, 25 Apr 2006 18:02:11 +0200, "LordBeotian"
<pokipsy76@xxxxxxxxxxxxxxxx> wrote:


Consider a recursion

x_{n+1}=f(x_n)

where f(x)=ax+bx^2+cx^3+... (so 0=f(0) is a fixed point)

How can I compute the (asimptotical) speed of convergence to 0?

It might _not_ converge to 0. That would depend on how
close to 0 you start,

I'm interested in the particular case of a=1.

and also of course on the value of a. If a = 1
and all the other coefficients vanish how fast
does the convergence appear to you?

Can someone give me some reference?


David C. Ullrich
.

Relevant Pages