What are the conditions for cubic convergence in functional iteration?

  • Thread starter Thread starter DeadxBunny
  • Start date Start date
  • Tags Tags
    Functional
DeadxBunny
Messages
29
Reaction score
0

Homework Statement


Consider an iteration function of the form F(x) = x + f(x)g(x), where f(r) = 0 and f'(r) != 0. Find the precise conditions on the function g so that the method of functional iteration will converge cubically to r if started near r.

Homework Equations


I really don't know.



The Attempt at a Solution


I have no idea how to even begin!

Thanks in advance!
 
Physics news on Phys.org
DeadxBunny said:
I have no idea how to even begin!
Try starting with definitions.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top