Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider the rootfinding problem $f(x)=0$ with root $α$, with $f´(x)≠0$.

Convert it to the fixed-point problem $x=x+cf(x)≡g(x)$ with $c$ a nonzero constant.

How should c be chosen to ensure rapid convergence of $x_{n+1}=x_{n}+cf(x_{n})$ to α (Provided that $x_{0}$ is chosen sufficiently close to $α$)? Apply your way of choosing c to the rootfinding problem $x^3-5=0$

Does anyone could help me with this exercise please?

share|cite|improve this question
Hint: The fixed point iteration for $g(x)=x$ behaves nicely if $|g'(x)|$ is small near the fixed point. Smallest possible is $0$. – André Nicolas Nov 20 '12 at 20:53

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.