Newton's method: Difference between revisions

Content deleted Content added

Inline

Revision as of 13:27, 9 March 2006

In numerical analysis, Newton's method (or the Newton-Raphson method) is an efficient algorithm for finding approximations to the zeros (or roots) of a real-valued function. As such, it is an example of a root-finding algorithm. It can also be used to find a minimum or maximum of such a function, by finding a zero in the function's first derivative, see Newton's method as an optimization algorithm.

Description of the method

The idea of the method is as follows: one starts with a value which is reasonably close to the true zero, then replaces the function by its tangent (which can be computed using the tools of calculus) and computes the zero of this tangent (which is easily done with elementary algebra). This zero of the tangent will typically be a better approximation to the function's zero, and the method can be iterated.

Suppose f : [a, b] -> R is a differentiable function defined on the interval [a, b] with values in the real numbers R. We start with an arbitrary value x₀ (the closer to the zero the better) and then define for each natural number n:

x_{n+1}=x_{n}-{\frac {f(x_{n})}{f'(x_{n})}}.

Here, f ' denotes the derivative of the function f.

Newton's method will usually converge provided the initial guess is close enough to the unknown zero. Furthermore, for a zero of multiplicity 1, the convergence is quadratic, which intuitively means that the number of correct digits roughly doubles in every step. More details can be found in the "Analysis" section.

An illustration of Newton's method. We see that $x_{n+1}$ is a better guess than $x_{n}$ for the zero x_* of the function f.

Example

Consider the problem of finding the positive number x with cos(x) = x³. We can rephrase that as finding the zero of f(x) = cos(x) - x³. We have f '(x) = -sin(x) - 3x². Since cos(x) ≤ 1 for all x and x³ > 1 for x>1, we know that our zero lies between 0 and 1. We try a starting value of x₀ = 0.5.

{\begin{matrix}x_{1}&=&x_{0}-{\frac {f(x_{0})}{f'(x_{0})}}&=&0.5-{\frac {\cos(0.5)-0.5^{3}}{-\sin(0.5)-3\times 0.5^{2}}}&=&1.112141637097\\x_{2}&=&x_{1}-{\frac {f(x_{1})}{f'(x_{1})}}&&\vdots &=&{\underline {0}}.909672693736\\x_{3}&&\vdots &&\vdots &=&{\underline {0.86}}7263818209\\x_{4}&&\vdots &&\vdots &=&{\underline {0.86547}}7135298\\x_{5}&&\vdots &&\vdots &=&{\underline {0.8654740331}}11\\x_{6}&&\vdots &&\vdots &=&{\underline {0.865474033102}}\end{matrix}}

The correct digits are underlined in the above example. In particular, all digits of x₆ are correct. We see that the number of correct digits after the decimal point increases from 2 (for x₃) to 5 and 10, illustrating the quadratic convergence.

Consider the following example in pseudocode.

 function newtonIterationFunction(x) {
    return  x - (cos(x) - x^3) / (-sin(x) - 3*x^2)     
 }  
 
 var x := 0.5
 
 for i from 0 to 99 {
     print "Iteration: " + i
     print "Guess: " + x
     xold := x
     x := newtonIterationFunction(x) 
     if x = xold {
         print "Solution found!"
         break    
     }    
 }

Here is the same using a calculator.

${\begin{matrix}0.5\;{\mbox{(enter)}}&=&x_{0}&=&0.5\\Ans-{\frac {\cos(Ans)-Ans^{3}}{-\sin(Ans)-3*Ans^{2}}}\;{\mbox{(enter)}}&=&x_{1}&=&1.1121416371\\{\mbox{(enter)}}&=&x_{2}&=&0.909672693736\\{\mbox{(enter)}}&=&x_{3}&=&0.867263818209\\\vdots &&\vdots &&\vdots \end{matrix}}$

History

Newton's method was described by Isaac Newton in De analysi per aequationes numero terminorum infinitas (written in 1669, published in 1711 by William Jones) and in De metodis fluxionum et serierum infinitarum (written in 1671, translated and published as Method of Fluxions in 1736 by John Colson). However, his description differs substantially from the modern description given above: Newton applies the method only to polynomials. He does not compute the successive approximations x_n, but computes a sequence of polynomials and only at the end, he arrives at an approximation for the root x. Finally, Newton views the method as purely algebraic and fails to notice the connection with calculus. Isaac Newton probably derived his method from a similar but less precise method by François Viète. The essence of Viète's method can be found in the work of the Persian mathematician Sharaf al-Din al-Tusi.

Heron of Alexandria used essentially the same method in book 1, chapter 8, of his Metrica to determine the square root of 720.

Newton's method was first published in 1685 in A Treatise of Algebra both Historical and Practical by John Wallis. In 1690, Joseph Raphson published a simplified description in Analysis aequationum universalis. Raphson again viewed Newton's method purely as an algebraic method and restricted its use to polynomials, but he describes the method in terms of the successive approximations x_n instead of the more complicated sequence of polynomials used by Newton. Finally, in 1740, Thomas Simpson described Newton's method as an iterative method for solving general nonlinear equations using fluxional calculus, essentially giving the description above. In the same publication, Simpson also gives the generalization to systems of two equations and notes that Newton's method can be used for solving optimization problems by setting the gradient to zero.

Practical considerations

In general the convergence is quadratic: the error is essentially squared at each step (that is, the number of accurate digits doubles in each step). There are some caveats, however. First, Newton's method requires that the derivative be calculated directly. If instead the derivative is approximated by the slope of the line through two points on the function's graph, the secant method results — though depending on how one measures computational effort, the secant method may be more efficient. Second, if the starting value is too far removed from the true zero, Newton's method can fail to converge at all. Because of this, all practical implementations of Newton's method put an upper limit on the number of iterations and perhaps on the size of the iterates. Third, if the root being sought has multiplicity greater than one, the convergence rate is reduced to linear (errors reduced by a constant factor at each step) unless special steps are taken.

Analysis

Suppose that the function f has a zero at α, i.e., f(α) = 0.

If f is continuously differentiable and its derivative does not vanish at α, then there exists a neighborhood of α such that for all starting values x₀ in that neighborhood, the sequence {x_n} will converge quadratically towards α.

If the derivative does vanish at α, then the convergence is usually only linear. Specifically, if f is twice continuously differentiable, f'(α) = 0, and f''(α) ≠ 0, then there exists a neighborhood of α such that for all starting values x₀ in that neighborhood, the sequence of iterates converges linearly, with rate log₁₀ 2 (Süli & Mayers, Exercise 1.6). However, even linear convergence is not guaranteed in pathological situations.

Generalizations

Basins of attraction for x⁵ − 1 = 0; darker means more iterations to converge.

One may use Newton's method also to solve systems of k (non-linear) equations, which amounts to finding the zeros of continuously differentiable functions F : R^k -> R^k. In the formulation given above, one then has to multiply with the inverse of the k-by-k Jacobian matrix J_F(x_n) instead of dividing by f '(x_n). Rather than actually computing the inverse of this matrix, one can save time by solving the system of linear equations

J_{F}(x_{n})(x_{n+1}-x_{n})=-F(x_{n})

for the unknown x_n+1 - x_n. Again, this method only works if the initial value x₀ is close enough to the true zero. Typically, a region which is well-behaved is located first with some other method and Newton's method is then used to "polish" a root which is already known approximately.

Complex functions

When dealing with complex functions, however, Newton's method can be directly applied to find their zeros. For many complex functions, the boundary of the set (also know as the basin of attraction) of all starting values that cause the method to converge to the true zero is a fractal.

References

Tjalling J. Ypma, Historical development of the Newton-Raphson method, SIAM Review 37 (4), 531–551, 1995.
P. Deuflhard, Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms. Springer Series in Computational Mathematics, Vol. 35. Springer, Berlin, 2004. ISBN 3-540-21099-7.
C. T. Kelley, Solving Nonlinear Equations with Newton's Method, no 1 in Fundamentals of Algorithms, SIAM, 2003. ISBN 0-89871-546-6.
J. M. Ortega, W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. Classics in Applied Mathematics, SIAM, 2000. ISBN 0-898-71461-3.
W. H. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling, "Numerical Recipes in C : The Art of Scientific Computing", Cambridge University Press, 1992. ISBN 0521431085. (online, with code samples: [1])
W. H. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling, "Numerical Recipes in Fortran", Cambridge University Press, 1992. ISBN 052143064X (online, with code samples: [2])
Endre Süli and David Mayers, An Introduction to Numerical Analysis, Cambridge University Press, 2003. ISBN 0-521-00794-1.

External links

Newton's method on the Mathcad Application Server (with animation)
[3] (with animation)

@@ Line 55: / Line 55: @@
 <math>\begin{matrix}
-\mbox{What to type} & & & \\
 .5\;\mbox{(enter)} & = & x_0 & = & 0.5 \\
 Ans - \frac{\cos (Ans) - Ans^3}{-\sin (Ans) - 3 * Ans^2}\;\mbox{(enter)} & = & x_1 & = & 1.1121416371 \\