Calculus/Newton's Method

Newton's Method (also called the Newton-Raphson method) is a recursive algorithm for approximating the root of a differentiable function. We know simple formulas for finding the roots of linear and quadratic equations, and there are also more complicated formulae for cubic and quartic equations. At one time it was hoped that there would be formulas found for equations of quintic and higher-degree, though it was later shown by Neils Henrik Abel that no such equations exist. The Newton-Raphson method is a method for approximating the roots of polynomial equations of any order. In fact the method works for any equation, polynomial or not, as long as the function is differentiable in a desired interval.

Newton's Method Let $f(x)$ be a differentiable function. Select a point $x_0$ based on a first approximation to the root, arbitrarily close to the function's root. To approximate the root you then recursively calculate using: $x_{n+1}=x_n-\frac{f(x_n)}{f^{\prime }(x_n)}$ As you recursively calculate, the $x_{n+1}$'s often become increasingly better approximations of the function's root.

In order to explain Newton's method, imagine that $x_0$ is already very close to a 0 of $f(x)$ . We know that if we only look at points very close to $x_0$ then $f(x)$ looks like its tangent line. If $x_0$ was already close to the place where $f(x)$ was 0, and near $x_0$ we know that $f(x)$ looks like its tangent line, then we hope the 0 of the tangent line at $x_0$ is a better approximation then $x_0$ itself.

The equation for the tangent line to $f(x)$ at $x_0$ is given by

$y=f^{\prime }(x_0)\cdot (x-x_0)+f(x_0)$

Now we set $y=0$ and solve for $x$ .

$0=f^{\prime }(x_0)\cdot (x-x_0)+f(x_0)$

$-f(x_0)=f^{\prime }(x_0)\cdot (x-x_0)$

$\frac{-f(x_0)}{f^{\prime }(x_0)}=(x-x_0)$

$x=\frac{-f(x_0)}{f^{\prime }(x_0)}+x_0$

This value of $x$ we feel should be a better guess for the value of $x$ where $f(x)=0$ . We choose to call this value of $x_1$ , and a little algebra we have

$x_1=x_0-\frac{f(x_0)}{f^{\prime }(x_0)}$

If our intuition was correct and $x_1$ is in fact a better approximation for the root of $f(x)$ , then our logic should apply equally well at $x_1$ . We could look to the place where the tangent line at $x_1$ is zero. We call $x_2$ , following the algebra above we arrive at the formula

$x_2=x_1-\frac{f(x_1)}{f^{\prime }(x_1)}$

And we can continue in this way as long as we wish. At each step, if your current approximation is $x_n$ our new approximation will be $x_{n+1}=x_n-\frac{f(x_n)}{f^{\prime }(x_n)}$ .

Examples

Find the root of the function $f(x)=x^2$.

Figure 1: A few iterations of Newton's method applied to $y=x^2$ starting with $x_0=4$ . The blue curve is $f(x)$ . The other solid lines are the tangents at the various iteration points.

$\begin{array}{ccc}{x}_0& =& 4\\ x_1& =& x_0-\frac{f(x_0)}{f^{\prime }(x_0)}=4-\frac{16}{8}=2\\ x_2& =& x_1-\frac{f(x_1)}{f^{\prime }(x_1)}=2-\frac{4}{4}=1\\ x_3& =& x_2-\frac{f(x_2)}{f^{\prime }(x_2)}=1-\frac{1}{2}=\frac{1}{2}\\ x_4& =& x_3-\frac{f(x_3)}{f^{\prime }(x_3)}=\frac{1}{2}-\frac{\frac{1}{4}}{1}=\frac{1}{4}\\ x_5& =& x_4-\frac{f(x_4)}{f^{\prime }(x_4)}=\frac{1}{4}-\frac{\frac{1}{16}}{\frac{1}{2}}=\frac{1}{8}\\ x_6& =& x_5-\frac{f(x_5)}{f^{\prime }(x_5)}=\frac{1}{8}-\frac{\frac{1}{64}}{\frac{1}{4}}=\frac{1}{16}\\ x_7& =& x_6-\frac{f(x_6)}{f^{\prime }(x_6)}=\frac{\frac{1}{256}}{\frac{1}{8}}=\frac{1}{32}\end{array}$

As you can see $x_n$ is gradually approaching 0 (which we know is the root of $f(x)$) . One can approach the function's root with arbitrary accuracy.

Answer: $f(x)=x^2$ has a root at $x=0$.

Notes

Figure 2: Newton's method applied to the function
$f(x)=\{\begin{array}{cc}\sqrt{x-4},& \text{for }x\ge 4\\ -\sqrt{4-x},& \text{for }x<4\end{array}$
starting with $x_0=2$ .

This method fails when $f^{\prime }(x)=0$ . In that case, one should choose a new starting place. Occasionally it may happen that $f(x)=0$ and $f^{\prime }(x)=0$ have a common root. To detect whether this is true, we should first find the solutions of $f^{\prime }(x)=0$ , and then check the value of $f(x)$ at these places.

Newton's method also may not converge for every function, take as an example:

$f(x)=\{\begin{array}{cc}\sqrt{x-r},& \text{for }x\ge r\\ -\sqrt{r-x},& \text{for },x<r\end{array}$

For this function choosing any $x_1=r-h$ then $x_2=r+h$ would cause successive approximations to alternate back and forth, so no amount of iteration would get us any closer to the root than our first guess.

Figure 3: Newton's method, when applied to the function $f(x)=x^5-x+1$ with initial guess $x_0=0$ , eventually iterates between the three points shown above.

Newton's method may also fail to converge on a root if the function has a local maximum or minimum that does not cross the x-axis. As an example, consider $f(x)=x^5-x+1$ with initial guess $x_0=0$ . In this case, Newton's method will be fooled by the function, which dips toward the x-axis but never crosses it in the vicinity of the initial guess.

See also

• Wikipedia:Newton's method
• Wikibooks
• Wikipedia:Abel–Ruffini theorem