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?(adsbygoogle = window.adsbygoogle || []).push({});

To be specific, the relevant equation is:

p^{t+1}= f(a_{0},...,a_{2r+1};p^{t})

f(x) = [itex]\sum[/itex]a_{i}(p^{t})^{i}(1-p^{t})^{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.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Convergence time of a recursive function

**Physics Forums | Science Articles, Homework Help, Discussion**