This page uses content from Wikipedia and is licensed under CC BYSA.
In numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a realvalued function. It is one example of a rootfinding algorithm.
The Newton–Raphson method in one variable is implemented as follows:
The method starts with a function f defined over the real numbers x, the function's derivative f ′, and an initial guess x_{0} for a root of the function f. If the function satisfies the assumptions made in the derivation of the formula and the initial guess is close, then a better approximation x_{1} is
Geometrically, (x_{1}, 0) is the intersection of the xaxis and the tangent of the graph of f at (x_{0}, f (x_{0})).
The process is repeated as
until a sufficiently accurate value is reached.
This algorithm is first in the class of Householder's methods, succeeded by Halley's method. The method can also be extended to complex functions and to systems of equations.
The idea of the method is as follows: one starts with an initial guess which is reasonably close to the true root, then the function is approximated by its tangent line (which can be computed using the tools of calculus), and one computes the xintercept of this tangent line (which is easily done with elementary algebra). This xintercept will typically be a better approximation to the function's root than the original guess, and the method can be iterated.
Suppose f : [a, b] → ℝ is a differentiable function defined on the interval [a, b] with values in the real numbers ℝ. The formula for converging on the root can be easily derived. Suppose we have some current approximation x_{n}. Then we can derive the formula for a better approximation, x_{n + 1} by referring to the diagram on the right. The equation of the tangent line to the curve y = f (x) at the point x = x_{n} is
where f′ denotes the derivative of the function f.
The xintercept of this line (the value of x such that y = 0) is then used as the next approximation to the root, x_{n + 1}. In other words, setting y to zero and x to x_{n + 1} gives
Solving for x_{n + 1} gives
We start the process off with some arbitrary initial value x_{0}. (The closer to the zero, the better. But, in the absence of any intuition about where the zero might lie, a "guess and check" method might narrow the possibilities to a reasonably small interval by appealing to the intermediate value theorem.) The method will usually converge, provided this initial guess is close enough to the unknown zero, and that f ′(x_{0}) ≠ 0. Furthermore, for a zero of multiplicity 1, the convergence is at least quadratic (see rate of convergence) in a neighbourhood of the zero, which intuitively means that the number of correct digits roughly at least doubles in every step. More details can be found in the analysis section below.
The Householder's methods are similar but have higher order for even faster convergence. However, the extra computations required for each step can slow down the overall performance relative to Newton's method, particularly if f or its derivatives are computationally expensive to evaluate.
The name "Newton's method" is derived from Isaac Newton's description of a special case of the method 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 method differs substantially from the modern method 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 arrives at an approximation for the root x. Finally, Newton views the method as purely algebraic and makes no mention of the connection with calculus. Newton may have derived his method from a similar but less precise method by Vieta. The essence of Vieta's method can be found in the work of the Persian mathematician Sharaf alDin alTusi, while his successor Jamshīd alKāshī used a form of Newton's method to solve x^{P} − N = 0 to find roots of N (Ypma 1995). A special case of Newton's method for calculating square roots was known much earlier and is often called the Babylonian method.
Newton's method was used by 17thcentury Japanese mathematician Seki Kōwa to solve singlevariable equations, though the connection with calculus was missing.
Newton's method was first published in 1685 in A Treatise of Algebra both Historical and Practical by John Wallis.^{[1]} In 1690, Joseph Raphson published a simplified description in Analysis aequationum universalis.^{[2]} 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 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.
Arthur Cayley in 1879 in The NewtonFourier imaginary problem was the first to notice the difficulties in generalizing Newton's method to complex roots of polynomials with degree greater than 2 and complex initial values. This opened the way to the study of the theory of iterations of rational functions.
Newton's method is an extremely powerful technique—in general the convergence is quadratic: as the method converges on the root, the difference between the root and the approximation is squared (the number of accurate digits roughly doubles) at each step. However, there are some difficulties with the method.
Newton's method requires that the derivative be calculated directly. An analytical expression for the derivative may not be easily obtainable and could be expensive to evaluate. In these situations, it may be appropriate to approximate the derivative by using the slope of a line through two nearby points on the function. Using this approximation would result in something like the secant method whose convergence is slower than that of Newton's method.
It is important to review the proof of quadratic convergence of Newton's Method before implementing it. Specifically, one should review the assumptions made in the proof. For situations where the method fails to converge, it is because the assumptions made in this proof are not met.
If the first derivative is not well behaved in the neighborhood of a particular root, the method may overshoot, and diverge from that root. An example of a function with one root, for which the derivative is not well behaved in the neighborhood of the root, is
for which the root will be overshot and the sequence of x will diverge. For a = 1/2, the root will still be overshot, but the sequence will oscillate between two values. For 1/2 < a < 1, the root will still be overshot but the sequence will converge, and for a ≥ 1 the root will not be overshot at all.
In some cases, Newton's method can be stabilized by using successive overrelaxation, or the speed of convergence can be increased by using the same method.
If a stationary point of the function is encountered, the derivative is zero and the method will terminate due to division by zero.
A large error in the initial estimate can contribute to nonconvergence of the algorithm. To overcome this problem one can often linearise the function that is being optimized using calculus, logs, differentials, or even using evolutionary algorithms, such as the Stochastic Funnel Algorithm. Good initial estimates lie close to the final globally optimal parameter estimate. In nonlinear regression, the sum of squared errors (SSE) is only "close to" parabolic in the region of the final parameter estimates. Initial estimates found here will allow the NewtonRaphson method to quickly converge. It is only here that the Hessian matrix of the SSE is positive and the first derivative of the SSE is close to zero.
In a robust implementation of Newton's method, it is common to place limits on the number of iterations, bound the solution to an interval known to contain the root, and combine the method with a more robust root finding method.
If the root being sought has multiplicity greater than one, the convergence rate is merely linear (errors reduced by a constant factor at each step) unless special steps are taken. When there are two or more roots that are close together then it may take many iterations before the iterates get close enough to one of them for the quadratic convergence to be apparent. However, if the multiplicity of the root is known, the following modified algorithm preserves the quadratic convergence rate:^{[3]}
This is equivalent to using successive overrelaxation. On the other hand, if the multiplicity m of the root is not known, it is possible to estimate after carrying out one or two iterations, and then use that value to increase the rate of convergence.
Suppose that the function f has a zero at α, i.e., f (α) = 0, and f is differentiable in a neighborhood of α.
If f is continuously differentiable and its derivative is nonzero at α, then there exists a neighborhood of α such that for all starting values x_{0} in that neighborhood, the sequence {x_{n}} will converge to α.^{[4]}
If the function is continuously differentiable and its derivative is not 0 at α and it has a second derivative at α then the convergence is quadratic or faster. If the second derivative is not 0 at α then the convergence is merely quadratic. If the third derivative exists and is bounded in a neighborhood of α, then:
where
If the derivative is 0 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_{0} in that neighborhood, the sequence of iterates converges linearly, with rate 1/2^{[5]} Alternatively if f ′(α) = 0 and f ′(x) ≠ 0 for x ≠ α, x in a neighborhood U of α, α being a zero of multiplicity r, and if f ∈ C^{r}(U) then there exists a neighborhood of α such that for all starting values x_{0} in that neighborhood, the sequence of iterates converges linearly.
However, even linear convergence is not guaranteed in pathological situations.
In practice these results are local, and the neighborhood of convergence is not known in advance. But there are also some results on global convergence: for instance, given a right neighborhood U_{+} of α, if f is twice differentiable in U_{+} and if f ′ ≠ 0, f · f ″ > 0 in U_{+}, then, for each x_{0} in U_{+} the sequence x_{k} is monotonically decreasing to α.
According to Taylor's theorem, any function f (x) which has a continuous second derivative can be represented by an expansion about a point that is close to a root of f (x). Suppose this root is α. Then the expansion of f (α) about x_{n} is:


(1) 
where the Lagrange form of the Taylor series expansion remainder is
where ξ_{n} is in between x_{n} and α.
Since α is the root, (1) becomes:


(2) 
Dividing equation (2) by f ′(x_{n}) and rearranging gives


(3) 
Remembering that x_{n + 1} is defined by


(4) 
one finds that
That is,


(5) 
Taking absolute value of both sides gives


(6) 
Equation (6) shows that the rate of convergence is quadratic if the following conditions are satisfied:
The term sufficiently close in this context means the following:
Finally, (6) can be expressed in the following way:
where M is the supremum of the variable coefficient of ε_{n}^{2} on the interval I defined in condition 1, that is:
The initial point x_{0} has to be chosen such that conditions 1 to 3 are satisfied, where the third condition requires that M ε_{0} < 1.
The disjoint subsets of the basins of attraction—the regions of the real number line such that within each region iteration from any point leads to one particular root—can be infinite in number and arbitrarily small. For example,^{[6]} for the function f (x) = x^{3} − 2x^{2} − 11x + 12 = (x − 4)(x − 1)(x + 3), the following initial conditions are in successive basins of attraction:
87527 2.352  converges to  4; 
84172 2.352  converges to  −3; 
83735 2.352  converges to  4; 
836327 2.352  converges to  −3; 
836323 2.352  converges to  1. 
Newton's method is only guaranteed to converge if certain conditions are satisfied. If the assumptions made in the proof of quadratic convergence are met, the method will converge. For the following subsections, failure of the method to converge indicates that the assumptions made in the proof were not met.
In some cases the conditions on the function that are necessary for convergence are satisfied, but the point chosen as the initial point is not in the interval where the method converges. This can happen, for example, if the function whose root is sought approaches zero asymptotically as x goes to ∞ or −∞. In such cases a different method, such as bisection, should be used to obtain a better estimate for the zero to use as an initial point.
Consider the function:
It has a maximum at x = 0 and solutions of f (x) = 0 at x = ±1. If we start iterating from the stationary point x_{0} = 0 (where the derivative is zero), x_{1} will be undefined, since the tangent at (0,1) is parallel to the xaxis:
The same issue occurs if, instead of the starting point, any iteration point is stationary. Even if the derivative is small but not zero, the next iteration will be a far worse approximation.
For some functions, some starting points may enter an infinite cycle, preventing convergence. Let
and take 0 as the starting point. The first iteration produces 1 and the second iteration returns to 0 so the sequence will alternate between the two without converging to a root. In fact, this 2cycle is stable: there are neighborhoods around 0 and around 1 from which all points iterate asymptotically to the 2cycle (and hence not to the root of the function). In general, the behavior of the sequence can be very complex (see Newton fractal). The real solution of this equation is 29235…. −1.769
If the function is not continuously differentiable in a neighborhood of the root then it is possible that Newton's method will always diverge and fail, unless the solution is guessed on the first try.
A simple example of a function where Newton's method diverges is trying to find the cube root of zero. The cube root is continuous and infinitely differentiable, except for x = 0, where its derivative is undefined:
For any iteration point x_{n}, the next iteration point will be:
The algorithm overshoots the solution and lands on the other side of the yaxis, farther away than it initially was; applying Newton's method actually doubles the distances from the solution at each iteration.
In fact, the iterations diverge to infinity for every f (x) = x^{α}, where 0 < α < 1/2. In the limiting case of α = 1/2 (square root), the iterations will alternate indefinitely between points x_{0} and −x_{0}, so they do not converge in this case either.
If the derivative is not continuous at the root, then convergence may fail to occur in any neighborhood of the root. Consider the function
Its derivative is:
Within any neighborhood of the root, this derivative keeps changing sign as x approaches 0 from the right (or from the left) while f (x) ≥ x − x^{2} > 0 for 0 < x < 1.
So f (x)/f ′(x) is unbounded near the root, and Newton's method will diverge almost everywhere in any neighborhood of it, even though:
In some cases the iterates converge but do not converge as quickly as promised. In these cases simpler methods converge just as quickly as Newton's method.
If the first derivative is zero at the root, then convergence will not be quadratic. Let
then f ′(x) = 2x and consequently
So convergence is not quadratic, even though the function is infinitely differentiable everywhere.
Similar problems occur even when the root is only "nearly" double. For example, let
Then the first few iterations starting at x_{0} = 1 are
it takes six iterations to reach a point where the convergence appears to be quadratic.
If there is no second derivative at the root, then convergence may fail to be quadratic. Let
Then
And
except when x = 0 where it is undefined. Given x_{n},
which has approximately 4/3 times as many bits of precision as x_{n} has. This is less than the 2 times as many which would be required for quadratic convergence. So the convergence of Newton's method (in this case) is not quadratic, even though: the function is continuously differentiable everywhere; the derivative is not zero at the root; and f is infinitely differentiable except at the desired root.
When dealing with complex functions, Newton's method can be directly applied to find their zeroes.^{[7]} Each zero has a basin of attraction in the complex plane, the set of all starting values that cause the method to converge to that particular zero. These sets can be mapped as in the image shown. For many complex functions, the boundaries of the basins of attraction are fractals.
In some cases there are regions in the complex plane which are not in any of these basins of attraction, meaning the iterates do not converge. For example,^{[8]} if one uses a real initial condition to seek a root of x^{2} + 1, all subsequent iterates will be real numbers and so the iterations cannot converge to either root, since both roots are nonreal. In this case almost all real initial conditions lead to chaotic behavior, while some initial conditions iterate either to infinity or to repeating cycles of any finite length.
Curt McMullen has shown that for any possible purely iterative algorithm similar to Newton's Method, the algorithm will diverge on some open regions of the complex plane when applied to some polynomial of degree 4 or higher. However, McMullen gave a generally convergent algorithm for polynomials of degree 3.^{[9]}
One may also use Newton's method to solve systems of k (nonlinear) equations, which amounts to finding the zeroes of continuously differentiable functions F : ℝ^{k} → ℝ^{k}. In the formulation given above, one then has to left multiply with the inverse of the k × 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
for the unknown x_{n + 1} − x_{n}.
The kdimensional variant of Newton's method can be used to solve systems of greater than k (nonlinear) equations as well if the algorithm uses the generalized inverse of the nonsquare Jacobian matrix J^{+} = (J^{T}J)^{−1}J^{T} instead of the inverse of J. If the nonlinear system has no solution, the method attempts to find a solution in the nonlinear least squares sense. See Gauss–Newton algorithm for more information.
Another generalization is Newton's method to find a root of a functional F defined in a Banach space. In this case the formulation is
where F′(X_{n}) is the Fréchet derivative computed at X_{n}. One needs the Fréchet derivative to be boundedly invertible at each X_{n} in order for the method to be applicable. A condition for existence of and convergence to a root is given by the Newton–Kantorovich theorem.
In padic analysis, the standard method to show a polynomial equation in one variable has a padic root is Hensel's lemma, which uses the recursion from Newton's method on the padic numbers. Because of the more stable behavior of addition and multiplication in the padic numbers compared to the real numbers (specifically, the unit ball in the padics is a ring), convergence in Hensel's lemma can be guaranteed under much simpler hypotheses than in the classical Newton's method on the real line.
The Newton–Fourier method is Joseph Fourier's extension of Newton's method to provide bounds on the absolute error of the root approximation, while still providing quadratic convergence.
Assume that f (x) is twice continuously differentiable on [a, b] and that f contains a root in this interval. Assume that f ′(x), f ″(x) ≠ 0 on this interval (this is the case for instance if f (a) < 0, f (b) > 0, and f ′(x) > 0, and f ″(x) > 0 on this interval). This guarantees that there is a unique root on this interval, call it α. If it is concave down instead of concave up then replace f (x) by −f (x) since they have the same roots.
Let x_{0} = b be the right endpoint of the interval and let z_{0} = a be the left endpoint of the interval. Given x_{n}, define
which is just Newton's method as before. Then define
where the denominator is f ′(x_{n}) and not f ′(z_{n}). The iterations x_{n} will be strictly decreasing to the root while the iterations z_{n} will be strictly increasing to the root. Also,
so that distance between x_{n} and z_{n} decreases quadratically.
When the Jacobian is unavailable or too expensive to compute at every iteration, a quasiNewton method can be used.
Newton's method can be generalized with the qanalog of the usual derivative. Its convergence is discussed in Rajkovic, Stankovic & Marinkovic (2002).
A nonlinear equation has multiple solutions in general. But if the intial value is not appropriate, Newton's method may not converge to the desired solution or may converge to the same solution found earlier. When we have already found N solutions of , then the next root can be found by applying Newton's method to the next equation (Press et al. (1992), Stoer & Bulirsch (1980)):
This method is applied to obtain zeros of the Bessel function of the second kind (Zhang & Jin (1996)).
Hirano's modified Newton method is a modification conserving the convergence of Newton method and avoiding unstableness (Murota (1982)). It is developed to solve complex polynomials.
Newton's method can be used to find a minimum or maximum of a function . The derivative is zero at a minimum or maximum, so local minima and maxima can be found by applying Newton's method to the derivative. The iteration becomes:
An important application is Newton–Raphson division, which can be used to quickly find the reciprocal of a number, using only multiplication and subtraction.
Finding the reciprocal of a amounts to finding the root of the function
Newton's iteration is
Therefore, Newton's iteration needs only two multiplications and one subtraction.
This method is also very efficient to compute the multiplicative inverse of a power series.
Many transcendental equations can be solved using Newton's method. Given the equation
with g(x) and/or h(x) a transcendental function, one writes
The values of x that solve the original equation are then the roots of f (x), which may be found via Newton's method.
Newton's method is applied to the ratio of Bessel functions in order to obtain its root.^{[10]}
A numerical verification for solutions of nonlinear equations has been established by using Newton's method multiple times and forming a set of solution candidates.^{[11]}^{[12]}
Consider the problem of finding the square root of a number. Newton's method is one of many methods of computing square roots.
For example, if one wishes to find the square root of 612, this is equivalent to finding the solution to
The function to use in Newton's method is then
with derivative
With an initial guess of 10, the sequence given by Newton's method is
where the correct digits are underlined. With only a few iterations one can obtain a solution accurate to many decimal places.
Consider the problem of finding the positive number x with cos x = x^{3}. We can rephrase that as finding the zero of f (x) = cos(x) − x^{3}. We have f ′(x) = −sin(x) − 3x^{2}. Since cos(x) ≤ 1 for all x and x^{3} > 1 for x > 1, we know that our solution lies between 0 and 1. We try a starting value of x_{0} = 0.5. (Note that a starting value of 0 will lead to an undefined result, showing the importance of using a starting point that is close to the solution.)
The correct digits are underlined in the above example. In particular, x_{6} is correct to 12 decimal places. We see that the number of correct digits after the decimal point increases from 2 (for x_{3}) to 5 and 10, illustrating the quadratic convergence.
The following is an example of an implementation of the Newton's Method for finding a root of a function f
which has derivative fprime
.
The initial guess will be x_{0} = 1 and the function will be f (x) = x^{2} − 2 so that f ′(x) = 2x.
Each new iterative of Newton's method will be denoted by x1
. We will check during the computation whether the denominator (yprime
) becomes too small (smaller than epsilon
), which would be the case if f ′(x_{n}) ≈ 0, since otherwise a large amount of error could be introduced.
%These choices depend on the problem being solved
x0 = 1 %The initial value
f = @(x) x^2  2 %The function whose root we are trying to find
fprime = @(x) 2*x %The derivative of f(x)
tolerance = 10^(7) %7 digit accuracy is desired
epsilon = 10^(14) %Don't want to divide by a number smaller than this
maxIterations = 20 %Don't allow the iterations to continue indefinitely
haveWeFoundSolution = false %Have not converged to a solution yet
for i = 1 : maxIterations
y = f(x0)
yprime = fprime(x0)
if(abs(yprime) < epsilon) %Don't want to divide by too small of a number
% denominator is too small
break; %Leave the loop
end
x1 = x0  y/yprime %Do Newton's computation
if(abs(x1  x0) <= tolerance * abs(x1)) %If the result is within the desired tolerance
haveWeFoundSolution = true
break; %Done, so leave the loop
end
x0 = x1 %Update x0 to start the process again
end
if (haveWeFoundSolution)
... % x1 is a solution within tolerance and maximum number of iterations
else
... % did not converge
end
Wikimedia Commons has media related to Newton Method. 
For a list of words relating to Newton's method, see the Newton's method category of article in Wikibooks. 