Section 4.1 Newton's Method
Solving equations is one of the most important things we do in mathematics, yet we are surprisingly limited in what we can solve analytically. For instance, equations as simple as \(x^5+x+1=0\) or \(\cos(x) =x\) cannot be solved by algebraic methods in terms of familiar functions. Fortunately, there are methods that can give us approximate solutions to equations like these. These methods can usually give an approximation correct to as many decimal places as we like. In SectionÂ 1.5 we learned about the Bisection Method. This section focuses on another technique (which generally works faster), called Newton's Method.
Newton's Method is built around tangent lines. The main idea is that if \(x\) is sufficiently close to a root of \(f(x)\text{,}\) then the tangent line to the graph at \((x,f(x))\) will cross the \(x\)axis at a point closer to the root than \(x\text{.}\)
We start Newton's Method with an initial guess about roughly where the root is. Call this \(x_0\text{.}\) (See FigureÂ 4.1.1.(a).) Draw the tangent line to the graph at \((x_0,f(x_0))\) and see where it meets the \(x\)axis. Call this point \(x_1\text{.}\) Then repeat the process â€” draw the tangent line to the graph at \((x_1, f(x_1))\) and see where it meets the \(x\)axis. (See FigureÂ 4.1.1.(b).) Call this point \(x_2\text{.}\) Repeat the process again to get \(x_3\text{,}\) \(x_4\text{,}\) etc. This sequence of points will often converge rather quickly to a root of \(f\text{.}\)
We can use this geometric process to create an algebraic process. Let's look at how we found \(x_1\text{.}\) We started with the tangent line to the graph at \((x_0,f(x_0))\text{.}\) The slope of this tangent line is \(\fp(x_0)\) and the equation of the line is
This line crosses the \(x\)axis when \(y=0\text{,}\) and the \(x\)value where it crosses is what we called \(x_1\text{.}\) So let \(y=0\) and replace \(x\) with \(x_1\text{,}\) giving the equation:
Now solve for \(x_1\text{:}\)
Since we repeat the same geometric process to find \(x_2\) from \(x_1\text{,}\) we have
In general, given an approximation \(x_n\text{,}\) we can find the next approximation, \(x_{n+1}\) as follows:
We summarize this process as follows.
Key Idea 4.1.2. Newton's Method.
Let \(f\) be a differentiable function on an interval \(I\) with a root in \(I\text{.}\) To approximate the value of the root, accurate to \(d\) decimal places:
Choose a value \(x_0\) as an initial approximation of the root. (This is often done by looking at a graph of \(f\text{.}\))

Create successive approximations iteratively; given an approximation \(x_n\text{,}\) compute the next approximation \(x_{n+1}\) as
\begin{equation*} x_{n+1} = x_n  \frac{f(x_n)}{\fp(x_n)}\text{.} \end{equation*} Stop the iterations when successive approximations do not differ in the first \(d\) places after the decimal point.
Let's practice Newton's Method with a concrete example.
Example 4.1.3. Using Newton's Method.
Approximate the real root of \(x^3x^21=0\text{,}\) accurate to the first three places after the decimal, using Newton's Method and an initial approximation of \(x_0=1\text{.}\)
To begin, we compute \(\fp(x)=3x^22x\text{.}\) Then we apply the Newton's Method algorithm, outlined in Key IdeaÂ 4.1.2.
\(\displaystyle \begin{aligned} x_1\amp=1\frac{f(1)}{\fp(1)}\\ \amp=1\frac{1^31^21}{3\cdot 1^22\cdot 1}\\ \amp =2\end{aligned}\)
\(\displaystyle \begin{aligned} x_2\amp =2\frac{f(2)}{\fp(2)}\\ \amp =2\frac{2^32^21}{3\cdot 2^22\cdot 2}\\ \amp=1.625\end{aligned}\)
\(\displaystyle \begin{aligned} x_3\amp =1.625\frac{f(1.625)}{\fp(1.625)}\\ \amp = 1.625\frac{1.625^31.625^21}{3\cdot 1.625^22\cdot 1.625}\\ \amp \approx 1.48579\end{aligned}\)
\(\displaystyle \begin{aligned} x_4 \amp =1.48579\frac{f(1.48579)}{\fp(1.48579)}\\ \amp \approx 1.46596\end{aligned}\)
\(\displaystyle \begin{aligned} x_5 \amp = 1.46596  \frac{f(1.46596)}{\fp(1.46596)}\\ \amp \approx 1.46557\end{aligned}\)
We performed five iterations of Newton's Method to find a root accurate to the first three places after the decimal; our final approximation is \(1.465\text{.}\) The exact value of the root, to six decimal places, is \(1.465571\text{;}\) It turns out that our \(x_5\) is accurate to more than just three decimal places.
A graph of \(f(x)\) is given in FigureÂ 4.1.4. We can see from the graph that our initial approximation of \(x_0=1\) was not particularly accurate; a closer guess would have been \(x_0=1.5\text{.}\) Our choice was based on ease of initial calculation, and shows that Newton's Method can be robust enough that we do not have to make a very accurate initial approximation.
We can automate this process on a calculator that has an ANS
key that returns the result of the previous calculation. Start by pressing 1
and then Enter
. (We have just entered our initial guess, \(x_0=1\text{.}\)) Now compute
by entering the following and repeatedly press the Enter
key.
ANS(ANS^3ANS^21)/(3*ANS^22*ANS)
Each time we press the Enter
key, we are finding the successive approximations, \(x_1\text{,}\) \(x_2\text{,}\) â€¦, and each one is getting closer to the root. In fact, once we get past around \(x_7\) or so, the approximations don't appear to be changing. They actually are changing, but the change is far enough to the right of the decimal point that it doesn't show up on the calculator's display. When this happens, we can be pretty confident that we have found an accurate approximation.
Using a calculator in this manner makes the calculations simple; many iterations can be computed very quickly.
Example 4.1.5. Using Newton's Method to find where functions intersect.
Use Newton's Method to approximate a solution to \(\cos(x) = x\text{,}\) accurate to five places after the decimal.
Newton's Method provides a method of solving \(f(x) = 0\text{;}\) it is not (directly) a method for solving equations like \(f(x) = g(x)\text{.}\) However, this is not a problem; we can rewrite the latter equation as \(f(x)  g(x)=0\) and then use Newton's Method.
So we rewrite \(\cos(x) =x\) as \(\cos(x)x=0\text{.}\) Written this way, we are finding a root of \(f(x)=\cos(x) x\text{.}\) We compute \(\fp(x)=\sin(x)  1\text{.}\) Next we need a starting value, \(x_0\text{.}\) Consider FigureÂ 4.1.6, where \(f(x) = \cos(x) x\) is graphed. It seems that \(x_0=0.75\) is pretty close to the root, so we will use that as our \(x_0\text{.}\) (The figure also shows the graphs of \(y=\cos(x)\) and \(y=x\text{.}\) Note how they intersect at the same \(x\) value as when \(f(x) = 0\text{.}\))
We now compute \(x_1\text{,}\) \(x_2\text{,}\) etc. The formula for \(x_1\) is
Apply Newton's Method again to find \(x_2\text{:}\)
We can continue this way, but it is really best to automate this process. On a calculator with an ANS
key, we would start by entering 0.75
, then Enter
, inputting our initial approximation. We then enter:
ANS  (cos(ANS)ANS)/(sin(ANS)1)
Repeatedly pressing the Enter
key gives successive approximations. We quickly find:
Our approximations \(x_2\) and \(x_3\) did not differ for at least the first five places after the decimal, so we could have stopped. However, using our calculator in the manner described is easy, so finding \(x_4\) was not hard. It is interesting to see how we found an approximation, accurate to as many decimal places as our calculator displays, in just four iterations.
If you know how to program, you can translate the following pseudocode into your favorite language to perform the computation in this problem.
x = 0.75 while true oldx = x x = x  (cos(x)x)/(sin(x)1) print x if abs(xoldx) < 0.0000000001 break
This code calculates \(x_1\text{,}\) \(x_2\text{,}\) etc., storing each result in the variable x
. The previous approximation is stored in the variable oldx
. We continue looping until the difference between two successive approximations, abs(xoldx)
, is less than some small tolerance, in this case, 0.0000000001
.
Convergence of Newton's Method.
What should one use for the initial guess, \(x_0\text{?}\) Generally, the closer to the actual root the initial guess is, the better. However, some initial guesses should be avoided. For instance, consider ExampleÂ 4.1.3 where we sought the root to \(f(x) = x^3x^21\text{.}\) Choosing \(x_0=0\) would have been a particularly poor choice. Consider FigureÂ 4.1.7, where \(f(x)\) is graphed along with its tangent line at \(x=0\text{.}\) Since \(\fp(0)=0\text{,}\) the tangent line is horizontal and does not intersect the \(x\)axis. Graphically, we see that Newton's Method fails.
We can also see analytically that it fails. Since
and \(\fp(0)=0\text{,}\) we see that \(x_1\) is not well defined.
This problem can also occur if, for instance, it turns out that \(\fp(x_5)=0\text{.}\) Adjusting the initial approximation \(x_0\) by a very small amount will likely fix the problem.
It is also possible for Newton's Method to not converge while each successive approximation is well defined. Consider \(f(x) = x^{1/3}\text{,}\) as shown in FigureÂ 4.1.8. It is clear that the root is \(x=0\text{,}\) but let's approximate this with \(x_0=0.1\text{.}\) FigureÂ 4.1.8.(a) shows graphically the calculation of \(x_1\text{;}\) notice how it is farther from the root than \(x_0\text{.}\) FigureÂ 4.1.8.(b) and FigureÂ 4.1.8.(c) show the calculation of \(x_2\) and \(x_3\text{,}\) which are even farther away; our successive approximations are getting worse. (It turns out that in this particular example, each successive approximation is twice as far from the true answer as the previous approximation.)
There is no â€śfixâ€ť to this problem; Newton's Method simply will not work and another method must be used. (In this case the particular reason Newton's Method fails is that the tangent line is vertical at the root).
While Newton's Method does not always work, it does work â€śmost of the time,â€ť and it is generally very fast. Once the approximations get close to the root, Newton's Method can as much as double the number of correct decimal places with each successive approximation. A course in Numerical Analysis will introduce the reader to more iterative root finding methods, as well as give greater detail about the strengths and weaknesses of Newton's Method.
Exercises Exercises
Terms and Concepts
1.
True
False
2.
True
False
Problems
Exercise Group.
The roots of the function \(f(x)\) are known or are easily found. Use five iterations of Newton's Method with the given initial approximation to approximate the root. Compare it to the known value of the root.
3.
\(f(x) = {\cos\!\left(x\right)}\text{,}\) \(x_0=1.5\)
4.
\(f(x) = {\sin\!\left(x\right)}\text{,}\) \(x_0=1\)
5.
\(f(x) = {x^{2}+x2}\text{,}\) \(x_0=0\)
6.
\(f(x) = {x^{2}2}\text{,}\) \(x_0=1.5\)
7.
\(f(x) = {\ln\!\left(x\right)}\text{,}\) \(x_0=2\)
8.
\(f(x) = {x^{3}x^{2}+x1}\text{,}\) \(x_0=2\)
Exercise Group.
Use Newton's Method to approximate all roots of the given function accurate to three places after the decimal. If an interval is given, find only the roots that lie within that interval. Use technology to obtain good initial approximations.
9.
\(f(x)={x^{3}+5x^{2}x1}\)
10.
\(f(x)={x^{4}+2x^{3}7x^{2}x+5}\)
11.
\(f(x)={x^{17}2x^{13}10x^{8}+10}\) on \((2,2)\)
12.
\(f(x)={x^{2}\cos\!\left(x\right)+\left(x1\right)\sin\!\left(x\right)}\) on \((3,3)\)
Exercise Group.
Use Newton's Method to approximate when the given functions are equal, accurate to 3 places after the decimal. Use technology to obtain good initial approximations.
13.
\(f(x)={x^{2}}\text{,}\) \(g(x)={\cos\!\left(x\right)}\)
14.
\(f(x)={x^{2}1}\text{,}\) \(g(x)={\sin\!\left(x\right)}\)
15.
\(f(x)={e^{x^{2}}}\text{,}\) \(g(x)={\cos\!\left(x\right)}\)
16.
\(f(x)={x}\text{,}\) \(g(x)={\tan\!\left(x\right)}\) on \([6,6]\)
17.
Why does Newtonâ€™s Method fail in finding a root of \(f(x) = x^33x^2+x+3\) when \(x_0=1\text{?}\)
18.
Why does Newtonâ€™s Method fail in finding a root of \(f(x) = 17x^4+130x^3301x^2+156x+156\) when \(x_0=1\text{?}\)