Approximating with Newton’s Method Cont.
Failures of Newton’s Method
Typically, Newton’s method is used to find roots fairly quickly. However, things can go wrong. Some reasons why Newton’s method might fail include the following:
- At one of the approximations xnxn, the derivative f′f′ is zero at xnxn, but f(xn)≠0f(xn)≠0. As a result, the tangent line of ff at xnxn does not intersect the xx-axis. Therefore, we cannot continue the iterative process.
- The approximations x0,x1,x2,⋯x0,x1,x2,⋯ may approach a different root. If the function ff has more than one root, it is possible that our approximations do not approach the one for which we are looking, but approach a different root (see Figure 4). This event most often occurs when we do not choose the approximation x0x0 close enough to the desired root.
- The approximations may fail to approach a root entirely. In the example below, we provide an example of a function and an initial guess x0x0 such that the successive approximations never approach a root because the successive approximations continue to alternate back and forth between two values.

Consider the function f(x)=x3−2x+2f(x)=x3−2x+2. Let x0=0x0=0. Show that the sequence x1,x2,⋯x1,x2,⋯ fails to approach a root of ff.
For f(x)=x3−2x+2, let x0=−1.5 and find x1 and x2.
From the example above, we see that Newton’s method does not always work. However, when it does work, the sequence of approximations approaches the root very quickly. Discussions of how quickly the sequence of approximations approach a root found using Newton’s method are included in texts on numerical analysis.