Relationship between Newton's method an fixed-point iteration The formula for Newton's iteration method (which is a zero-finding problem) is $$ x_{k+1}=x_{k} - \frac{f(x_k)}{f'(x_k)}$$
I read in my textbook that this can be also be seen as a fixed-point iteration, where the zero of this function $f$ is a fixed point for another function $g$. Tha is, something like this: $$g(x)=x - \frac{f(x)}{f'(x)}$$ 
My question is, why is this useful? 
For example if we wanted to prove that a function $f(x)=x^2-2$ converges in the interval $[1,2]$, how could the fixed point property be useful? I don't see what the point is, and how it is different than just using Newton's method.
 A: A lot is known about fixed point iterations, and this can be applied to the case of the Newton iteration.  "Just using Newton's method", you may be able to tell what happens when you start at a particular initial point, but how can you tell whether it will converge for all initial points in a certain interval?  Using the theory of fixed point iterations, this may be possible.
For example, here's one of my favourite results.  Say you're using Newton's method to solve $f(x) = 0$, and $x=r$ is one solution.  What is the largest interval around $r$ such that if you start in that interval, Newton's method always converges to $r$?  This interval will be of the form $(a,b)$, where there are just four possibilities:


*

*$a = -\infty, b = +\infty$.

*$a = -\infty, b$ is finite, where $f'(b) = 0$ and $\lim_{x \to b-} g(x) = -\infty$.

*$a$ is finite, $b = +\infty$, where $f'(a) = 0$ and $\lim_{x \to a+} g(x) = +\infty$.

*A two-cycle: $g(a) = b$, $g(b) = a$.

A: Fixed point iteration means that $x_{n+1}=f(x_n)$
Newton's Method is a special case of fixed point iteration for a function $g(x)$ where $x_{n+1}=x_n-\frac{g(x_n)}{g'(x_n)}$
If you take $f(x)=x-\frac{g(x)}{g'(x)}$ then Newton's Method IS indeed a special case of fixed point iteration.
This means that everything that you know about fixed point iteration also applies to Newton's Method; which is useful, since much is know about the behaviour of fixed point iteration.
A: There is the Banach fixed point theorem, which is valid in even a more general settings. it tells us, that the iteration method converges unter certain conditions. in the real case, the condition $|g(x)| < q < 1$ with $q$ constant suffices. and this is the case for your $g$ as you defined it, therefore we know the newton method converges in that case.
