I have a recursive function that will eventually converge to either a fixed value or a limit cycle. Depending on the inputs, it will converge to different values (or cycles) at different rates. How could I go about measuring the rate of convergence for different inputs, regardless of what type of limit it ends up at? To be specific, the relevant equation is: pt+1 = f(a0,...,a2r+1;pt) f(x) = [itex]\sum[/itex]ai(pt)i(1-pt)2r+1-i The solution must be numerical as it will be part of a computer program. The program will be used to search for inputs that produce long convergence times.