Speed of convergence of recursions




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?
I'm interested in the particular case of a=1.
Can someone give me some reference?
.