|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{About|Newton's method for finding roots|Newton's method for finding minima|Newton's method in optimization}}
| | They get in touch with me Keith and I think it sounds fairly very good when you say it. Massachusetts is in which my residence is but I need to have to go for my family members. [http://www.Adobe.com/cfusion/search/index.cfm?term=&Bee+maintaining&loc=en_us&siteSection=home Bee maintaining] is a thing that I'm entirely [http://www.Ehow.com/search.html?s=addicted addicted] to. I am presently an accounting officer. If you want to discover out additional check out his site: http://www.teethwhiteningreviews.com/messageboard/profile.php?id=121400<br><br>My web site; [http://www.teethwhiteningreviews.com/messageboard/profile.php?id=121400 natural bad breath remedy] |
| | |
| {{more footnotes|date=February 2014}}
| |
| {{ref improve|date=November 2013}}
| |
| 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 [[root of a function|roots]] (or zeroes) of a [[Real number|real]]-valued [[function (mathematics)|function]].
| |
| :<math>x : f(x) = 0 \,.</math>
| |
| | |
| The Newton–Raphson method in one variable is implemented as follows:
| |
| | |
| Given a function ''ƒ'' defined over the reals ''x'', and its [[derivative]] ''ƒ''{{void}}', we begin with a first guess ''x''<sub>0</sub> for a root of the function ''f''. Provided the function satisfies all the assumptions made in the derivation of the formula, a better approximation ''x''<sub>1</sub> is
| |
| :<math>x_{1} = x_0 - \frac{f(x_0)}{f'(x_0)} \,.</math>
| |
| | |
| Geometrically, (''x''<sub>1</sub>, 0) is the intersection with the ''x''-axis of the [[tangent]] to the [[graph of a function|graph]] of ''f'' at (''x''<sub>0</sub>, ''f'' (''x''<sub>0</sub>)).
| |
| | |
| The process is repeated as
| |
| :<math>x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} \,</math>
| |
| | |
| until a sufficiently accurate value is reached.
| |
| | |
| This algorithm is first in the class of [[Householder's method]]s, succeeded by [[Halley's method]]. The method can also be extended to complex functions and to systems of equations.
| |
| | |
| ==Description==
| |
| <!-- [[Image:newton iteration.svg|alt Illustration of Newton's method|thumb|right|300px|An illustration of one iteration of Newton's method (the function ''ƒ'' is shown in blue and the tangent line is in red). We see that ''x''<sub>''n''+1</sub> is a better approximation than ''x''<sub>''n''</sub> for the root ''x'' of the function ''f''.]] -->
| |
| [[Image:NewtonIteration Ani.gif|alt Illustration of Newton's method|thumb|right|300px|The function ''ƒ'' is shown in blue and the tangent line is in red. We see that ''x''<sub>''n''+1</sub> is a better approximation than ''x''<sub>''n''</sub> for the root ''x'' of the function ''f''.]]
| |
| | |
| 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 ''x''-intercept of this tangent line (which is easily done with elementary algebra). This ''x''-intercept will typically be a better approximation to the function's root than the original guess, and the method can be [[iterative method|iterated]].
| |
| | |
| Suppose ''ƒ'' : [''a'', ''b''] → '''R''' is a [[derivative|differentiable]] function defined on the [[interval (mathematics)|interval]] [''a'', ''b''] with values in the [[real number]]s '''R'''. The formula for converging on the root can be easily derived. Suppose we have some current approximation ''x''<sub>''n''</sub>. Then we can derive the formula for a better approximation, ''x''<sub>''n''+1</sub> by referring to the diagram on the right. The equation of the [[tangent line]] to the curve ''y'' = ''ƒ''(''x'') at the point ''x=x''<sub>''n''</sub> is
| |
| | |
| :<math>y = f'(x_n) \, (x-x_n) + f(x_n),</math>
| |
| | |
| where, ''ƒ''' denotes the [[derivative]] of the function ''ƒ''.
| |
| | |
| The ''x''-intercept of this line (the value of ''x'' such that ''y''=0) is then used as the next approximation to the root, ''x''<sub>''n''+1</sub>. In other words, setting ''y'' to zero and ''x'' to ''x''<sub>''n''+1</sub> gives
| |
| :<math>0 = f'(x_n) \, (x_{n+1}-x_n) + f(x_n).</math>
| |
| | |
| Solving for ''x''<sub>''n''+1</sub> gives
| |
| :<math>x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}. \,\!</math>
| |
| | |
| We start the process off with some arbitrary initial value ''x''<sub>0</sub>. (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 ''ƒ'''(''x''<sub>0</sub>) ≠ 0. Furthermore, for a zero of [[Multiplicity (mathematics)|multiplicity]] 1, the convergence is at least quadratic (see [[rate of convergence]]) in a [[neighbourhood (mathematics)|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|analysis section]] below.
| |
| | |
| The [[Householder's method]]s 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.
| |
| | |
| ==History==
| |
| 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 (mathematician)|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 <math>x_n</math>, 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 [[Franciscus Vieta|Vieta]]. The essence of Vieta's method can be found in the work of the [[Mathematics in medieval Islam|Persian mathematician]] [[Sharaf al-Din al-Tusi]], while his successor [[Jamshīd al-Kāshī]] used a form of Newton's method to solve <math>x^P - N = 0</math> 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 17th-century Japanese mathematician [[Seki Kōwa]] to solve single-variable 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]]. 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''<sub>''n''</sub> 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 Newton-Fourier 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.
| |
| | |
| ==Practical considerations==
| |
| Newton's method is an extremely powerful technique—in general the [[rate of convergence|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.
| |
| | |
| ===Difficulty in calculating derivative of a function===
| |
| 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.
| |
| | |
| ===Failure of the method to converge to the root===
| |
| It is important to review the [[#Proof of quadratic convergence for Newton's iterative method|proof of quadratic convergence]] of Newton's Method before implementing it. Specifically, one should review the assumptions made in the proof. For [[#Failure analysis|situations where the method fails to converge]], it is because the assumptions made in this proof are not met.
| |
| | |
| ====Overshoot====
| |
| 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
| |
| | |
| :<math>f(x)=|x|^a,\quad 0 < a < \tfrac{1}{2}</math>
| |
| | |
| for which the root will be overshot and the sequence of {{mvar|x}} will diverge. For {{math|{{var|a}} {{=}} 1/2}}, the root will still be overshot, but the sequence will oscillate between two values. For {{math|1/2 < {{var|a}} < 1}}, the root will still be overshot but the sequence will converge, and for {{math|{{var|a}} ≥ 1}} the root will not be overshot at all.
| |
| | |
| In some cases, the Newton's method can be stabilized by using [[successive over-relaxation#Other applications of the method|successive over-relaxation]], or the speed of convergence can be increased by using the same method.
| |
| | |
| ====Stationary point====
| |
| If a [[stationary point]] of the function is encountered, the derivative is zero and the method will terminate due to [[division by zero]].
| |
| | |
| ====Poor initial estimate====
| |
| A large error in the initial estimate can contribute to non-convergence of the algorithm.
| |
| | |
| ====Mitigation of non-convergence====
| |
| 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.
| |
| | |
| ===Slow convergence for roots of multiplicity > 1===
| |
| If the root being sought has [[Multiplicity (mathematics)#Multiplicity of a root of a polynomial|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 <math>m</math> of the root is known, one can use the following modified algorithm that preserves the quadratic convergence rate:
| |
| | |
| :<math>x_{n+1} = x_n - m\frac{f(x_n)}{f'(x_n)}. \,\!</math> <ref>{{cite web|title=Accelerated and Modified Newton Methods|url=http://math.fullerton.edu/mathews/n2003/newtonacceleratemod.html}}</ref>
| |
| | |
| This is equivalent to using [[successive over-relaxation#Other applications of the method|successive over-relaxation]]. On the other hand, if the multiplicity <math>m</math> of the root is not known, it is possible to estimate <math>m</math> after carrying out one or two iterations, and then use that value to increase the rate of convergence.
| |
| | |
| ==Analysis==
| |
| {{ref improve|section|date=February 2014}}
| |
| Suppose that the function ''ƒ'' has a zero at α, i.e., ''ƒ''(α) = 0.
| |
| | |
| If ''f'' is continuously differentiable and its derivative is nonzero at α, then there exists a [[topological neighborhood|neighborhood]] of α such that for all starting values ''x''<sub>0</sub> in that neighborhood, the [[sequence]] {''x''<sub>''n''</sub>} will [[limit of a sequence|converge]] to α. This can easily be proved by constructing a sequence such that the first term is ''x''<sub>0</sub> away from α and the next term is equal to the distance from α after one iteration of Newton's method. It can be proven that this sequence is bounded and monotonically decreasing so it must converge to α by the [[monotone convergence theorem]].
| |
| | |
| 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:
| |
| :<math>\Delta x_{i+1} = \frac{f^{\prime\prime} (\alpha)}{2 f^\prime (\alpha)} (\Delta x_{i})^2 + O[\Delta x_{i}]^3 \,,</math>
| |
| | |
| where <math>\Delta x_i \triangleq x_i - \alpha \,.</math>
| |
| | |
| If the derivative is 0 at α, then the convergence is usually only linear. Specifically, if ''ƒ'' is twice continuously differentiable, ''ƒ''<nowiki> '</nowiki>(''α'') = 0 and ''ƒ''<nowiki> ''</nowiki>(''α'') ≠ 0, then there exists a neighborhood of α such that for all starting values ''x''<sub>0</sub> in that neighborhood, the sequence of iterates converges linearly, with [[rate of convergence|rate]] log<sub>10</sub> 2 (Süli & Mayers, Exercise 1.6). Alternatively if ''ƒ''<nowiki> '</nowiki>(''α'') = 0 and ''ƒ''<nowiki> '</nowiki>(''x'') ≠ 0 for ''x'' ≠ α, ''x'' in a [[topological neighborhood|neighborhood]] ''U'' of α, α being a zero of [[Multiplicity (mathematics)|multiplicity]] ''r'', and if ''ƒ'' ∈ ''C''<sup>''r''</sup>(''U'') then there exists a neighborhood of α such that for all starting values ''x''<sub>0</sub> 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<sub>+</sub>'' of α, if ''f'' is twice differentiable in ''U<sub>+</sub>'' and if <math>f' \ne 0 \!</math>, <math>f \cdot f'' > 0 \!</math> in ''U<sub>+</sub>'', then, for each ''x''<sub>0</sub> in ''U''<sub>+</sub> the sequence ''x<sub>k</sub>'' is monotonically decreasing to α.
| |
| | |
| ===Proof of quadratic convergence for Newton's iterative method===
| |
| 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 <math>\alpha \,.</math> Then the expansion of f(α) about ''x''<sub>''n''</sub> is:
| |
| {{NumBlk|:|<math>f(\alpha) = f(x_n) + f^\prime(x_n)(\alpha - x_n) + R_1 \,</math>|{{EquationRef|1}}}}
| |
| | |
| where the [[Lagrange remainder|Lagrange form of the Taylor series expansion remainder]] is
| |
| :<math>R_1 = \frac{1}{2!}f^{\prime\prime}(\xi_n)(\alpha - x_n)^{2} \,,</math>
| |
| | |
| where ξ<sub>''n''</sub> is in between ''x''<sub>''n''</sub> and <math>\alpha \,.</math>
| |
| | |
| Since <math>\alpha \,</math> is the root, ({{EquationNote|1}}) becomes:
| |
| {{NumBlk|:|<math>0 = f(\alpha) = f(x_n) + f^\prime(x_n)(\alpha - x_n) + \frac{1}{2}f^{\prime\prime}(\xi_n)(\alpha - x_n)^{2} \,</math>|{{EquationRef|2}}}}
| |
| | |
| Dividing equation ({{EquationNote|2}}) by <math> f^\prime(x_n)\,</math> and rearranging gives
| |
| {{NumBlk|:|<math> \frac {f(x_n)}{f^\prime(x_n)}+\left(\alpha-x_n\right) = \frac {- f^{\prime\prime} (\xi_n)}{2 f^\prime(x_n)}\left(\alpha-x_n\right)^2 </math>|{{EquationRef|3}}}}
| |
| | |
| Remembering that ''x''<sub>''n''+1</sub> is defined by
| |
| {{NumBlk|:|<math> x_{n+1} = x_{n} - \frac {f(x_n)}{f^\prime(x_n)} \,,</math>|{{EquationRef|4}}}}
| |
| | |
| one finds that
| |
| :<math> \underbrace{\alpha - x_{n+1}}_{\epsilon_{n+1}} = \frac {- f^{\prime\prime} (\xi_n)}{2 f^\prime(x_n)} (\underbrace{\alpha - x_n}_{\epsilon_{n}})^2 \,.</math>
| |
| | |
| That is,
| |
| {{NumBlk|:|<math> \epsilon_{n+1} = \frac {- f^{\prime\prime} (\xi_n)}{2 f^\prime(x_n)} \, {\epsilon_n}^2 \,.</math>|{{EquationRef|5}}}}
| |
| | |
| Taking absolute value of both sides gives
| |
| {{NumBlk|:|<math> \left| {\epsilon_{n+1}}\right| = \frac {\left| f^{\prime\prime} (\xi_n) \right| }{2 \left| f^\prime(x_n) \right|} \, {\epsilon_n}^2 \, </math> |{{EquationRef|6}}}}
| |
| | |
| Equation ({{EquationNote|6}}) shows that the [[rate of convergence]] is quadratic if following conditions are satisfied:
| |
| | |
| # <math>f'(x)\ne0; \forall x\in I \text{, where }I \text{ is the interval }[\alpha-r,\alpha+r] \text{ for some } r \ge \left\vert(\alpha-x_0)\right\vert;\,</math>
| |
| # <math>f''(x) \text{ is finite },\forall x\in I; \,</math>
| |
| # <math> x_0 \,</math> ''sufficiently'' close to the root <math> \alpha \,</math>
| |
| | |
| The term ''sufficiently'' close in this context means the following:
| |
| | |
| (a) Taylor approximation is accurate enough such that we can ignore higher order terms,
| |
| | |
| (b) <math>\frac 1 {2}\left |{\frac {f^{\prime\prime} (x_n)}{f^\prime(x_n)}}\right |<C\left |{\frac {f^{\prime\prime} (\alpha)}{f^\prime(\alpha)}}\right |, \text{ for some } C<\infty,\,</math>
| |
| | |
| (c) <math>C \left |{\frac {f^{\prime\prime} (\alpha)}{f^\prime(\alpha)}}\right |\epsilon_n<1, \text{ for }n\in \Zeta ^+\cup\{0\} \text{ and }C \text{ satisfying condition (b) }.\, </math>
| |
| | |
| Finally, ({{EquationNote|6}}) can be expressed in the following way:
| |
| :<math> \left | {\epsilon_{n+1}}\right | \le M{{\epsilon}^2}_n \, </math>
| |
| where M is the [[w:supremum|supremum]] of the variable coefficient of <math>{\epsilon^2}_n \, </math> on the interval <math>I\,</math> defined in the condition 1, that is:
| |
| | |
| <math>M = \sup_{x \in I} \frac 1 {2}\left |{\frac {f^{\prime\prime} (x)}{f^\prime(x)}}\right |. \,</math>
| |
| | |
| The initial point <math>x_0 \,</math> has to be chosen such that conditions 1 through 3 are satisfied, where the third condition requires that <math>M\left |\epsilon_0 \right |<1.\,</math>
| |
| | |
| ===Basins of attraction===
| |
| The [[basin of attraction|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,<ref>Dence, Thomas, "Cubics, chaos and Newton's method", ''[[Mathematical Gazette]]'' 81, November 1997, 403-408.</ref> for the function <math>f(x)=x^3-2x^2-11x+12</math>, the following initial conditions are in successive basins of attraction:
| |
| | |
| :2.35287527 converges to 4;
| |
| :2.35284172 converges to −3;
| |
| :2.35283735 converges to 4;
| |
| :2.352836327 converges to −3;
| |
| :2.352836323 converges to 1.
| |
| | |
| ==Failure analysis==
| |
| 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.
| |
| | |
| ===Bad starting points===
| |
| 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 <math>\infty</math> or <math>- \infty</math>. In such cases a different method, such as [[Bisection method|bisection]], should be used to obtain a better estimate for the zero to use as an initial point.
| |
| | |
| ====Iteration point is stationary====
| |
| Consider the function:
| |
| | |
| :<math>f(x) = 1-x^2.\!</math>
| |
| | |
| 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''<sub>0</sub> = 0 (where the derivative is zero), ''x''<sub>1</sub> will be undefined, since the tangent at (0,1) is parallel to the ''x''-axis:
| |
| | |
| :<math>x_1 = x_0 - \frac{f(x_0)}{f'(x_0)} = 0 - \frac{1}{0}.</math>
| |
| | |
| 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.
| |
| | |
| ====Starting point enters a cycle====
| |
| [[Image:NewtonsMethodConvergenceFailure.svg|thumb|300px|The tangent lines of ''x''<sup>3</sup> - 2''x'' + 2 at 0 and 1 intersect the ''x''-axis at 1 and 0 respectively, illustrating why Newton's method oscillates between these values for some starting points.]]
| |
| For some functions, some starting points may enter an infinite cycle, preventing convergence. Let
| |
| | |
| :<math>f(x) = x^3 - 2x + 2 \!</math>
| |
| | |
| 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 2-cycle is stable: there are neighborhoods around 0 and around 1 from which all points iterate asymptotically to the 2-cycle (and hence not to the root of the function). In general, the behavior of the sequence can be very complex (see [[Newton fractal]]).
| |
| | |
| ===Derivative issues===
| |
| 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. | |
| | |
| ====Derivative does not exist at root====
| |
| A simple example of a function where Newton's method diverges is the cube root, which is continuous and infinitely differentiable, except for ''x'' = 0, where its derivative is undefined (this, however, does not affect the algorithm, since it will never require the derivative if the solution is already found):
| |
| | |
| :<math>f(x) = \sqrt[3]{x}.</math>
| |
| | |
| For any iteration point ''x<sub>n</sub>'', the next iteration point will be:
| |
| | |
| :<math>x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} = x_n - \frac{{x_n}^{\frac{1}{3}}}{\frac{1}{3}\,{x_n}^{\frac{1}{3}-1}} = x_n - 3\,x_n = -2\,x_n.</math>
| |
| | |
| The algorithm overshoots the solution and lands on the other side of the ''y''-axis, 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 <math>f(x) = |x|^\alpha</math>, where <math>0 < \alpha < \tfrac{1}{2}</math>. In the limiting case of <math>\alpha = \tfrac{1}{2}</math> (square root), the iterations will alternate indefinitely between points ''x''<sub>0</sub> and −''x''<sub>0</sub>, so they do not converge in this case either.
| |
| | |
| ====Discontinuous derivative====
| |
| If the derivative is not continuous at the root, then convergence may fail to occur in any neighborhood of the root. Consider the function
| |
| | |
| :<math>f(x) = \begin{cases} | |
| 0 & \text{if } x = 0,\\
| |
| x + x^2\sin\left(\frac{2}{x}\right) & \text{if } x \neq 0.
| |
| \end{cases}</math>
| |
| | |
| Its derivative is:
| |
| :<math>f'(x) = \begin{cases}
| |
| 1 & \text{if } x = 0,\\
| |
| 1 + 2\,x\,\sin\left(\frac{2}{x}\right) - 2\,\cos\left(\frac{2}{x}\right) & \text{if } x \neq 0.
| |
| \end{cases}</math>
| |
| | |
| 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''<sup>2</sup> > 0 for 0 < ''x'' < 1.
| |
| | |
| So ''f''(''x'')/''f''<nowiki>'</nowiki>(''x'') is unbounded near the root, and Newton's method will diverge almost everywhere in any neighborhood of it, even though:
| |
| *the function is differentiable (and thus continuous) everywhere;
| |
| *the derivative at the root is nonzero;
| |
| *''f'' is infinitely differentiable except at the root; and
| |
| *the derivative is bounded in a neighborhood of the root (unlike ''f''(''x'')/''f''<nowiki>'</nowiki>(''x'')).
| |
| | |
| ===Non-quadratic convergence===
| |
| 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.
| |
| | |
| ====Zero derivative====
| |
| If the first derivative is zero at the root, then convergence will not be quadratic. Indeed, let
| |
| | |
| :<math>f(x) = x^2 \!</math>
| |
| | |
| then <math>f'(x) = 2x \!</math> and consequently <math>x - f(x)/f'(x) = x/2 \!</math>. 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
| |
| | |
| :<math>f(x) = x^2(x-1000)+1.\!</math>
| |
| | |
| Then the first few iterates starting at ''x''<sub>0</sub> = 1 are
| |
| 1, 0.500250376, 0.251062828, 0.127507934, 0.067671976, 0.041224176, 0.032741218, 0.031642362; it takes six iterations to reach a point where the convergence appears to be quadratic.
| |
| | |
| ====No second derivative====
| |
| If there is no second derivative at the root, then convergence may fail to be quadratic. Indeed, let
| |
| :<math>f(x) = x + x^\frac{4}{3}.\!</math>
| |
| Then
| |
| :<math>f'(x) = 1 + \frac{4}{3}x^\frac{1}{3}.\!</math>
| |
| And
| |
| :<math>f''(x) = \frac{4}{9}x^{-\frac{2}{3}} \!</math>
| |
| except when <math>x = 0 \!</math> where it is undefined. Given <math>x_n \!</math>,
| |
| | |
| :<math>x_{n+1} = x_n - \frac{f(x_n)}{f '(x_n)} = \frac{\frac{1}{3}{x_n}^\frac{4}{3}}{(1 + \frac{4}{3}{x_n}^\frac{1}{3})} \!</math>
| |
| | |
| which has approximately 4/3 times as many bits of precision as <math>x_n \!</math> 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 <math>f \!</math> is infinitely differentiable except at the desired root.
| |
| | |
| ==Generalizations==
| |
| ===Complex functions===
| |
| [[image:newtroot 1 0 0 0 0 m1.png|thumb|Basins of attraction for x<sup>5</sup> - 1 = 0; darker means more iterations to converge.]]
| |
| {{main|Newton fractal}}
| |
| When dealing with [[complex analysis|complex functions]], Newton's method can be directly applied to find their zeroes. 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 [[fractal]]s.
| |
| | |
| 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,<ref>Strang, Gilbert, "A chaotic search for ''i''", ''''[[The College Mathematics Journal]]'' 22, January 1991, pp. 3-12 (esp. p. 6).</ref> if one uses a real initial condition to seek a root of <math>x^2+1</math>, all subsequent iterates will be real numbers and so the iterations cannot converge to either root, since both roots are non-real. In this case [[almost all]] initial conditions lead to [[chaos theory|chaotic behavior]], while some initial conditions iterate either to infinity or to repeating cycles of any finite length.
| |
| | |
| ===Nonlinear systems of equations===
| |
| ====k variables, k functions====
| |
| One may also use Newton's method to solve systems of ''k'' (non-linear) equations, which amounts to finding the zeroes of continuously differentiable functions ''F'' : '''R'''<sup>''k''</sup> <tt>→</tt> '''R'''<sup>''k''</sup>. In the formulation given above, one then has to left multiply with the inverse of the ''k''-by-''k'' [[Jacobian matrix]] ''J''<sub>''F''</sub>(''x''<sub>''n''</sub>) instead of dividing by ''f'' '(''x''<sub>''n''</sub>).
| |
| | |
| Rather than actually computing the inverse of this matrix, one can save time by solving the [[system of linear equations]]
| |
| | |
| :<math>J_F(x_n) (x_{n+1} - x_n) = -F(x_n)\,\!</math>
| |
| | |
| for the unknown ''x''<sub>''n''+1</sub> − ''x''<sub>''n''</sub>.
| |
| | |
| ====k variables, m equations, with m > k====
| |
| The k-dimensional Newton's method can be used to solve systems of ''>k'' (non-linear) equations as well if the algorithm uses the [[generalized inverse]] of the non-square [[Jacobian matrix and determinant|Jacobian]] matrix J<sup>+</sup> = ((J<sup>T</sup>J)<sup>−1</sup>)J<sup>T</sup> instead of the inverse of J. If the nonlinear system has no solution, the method attempts to find a solution in the [[non-linear least squares]] sense. See [[Gauss–Newton algorithm]] for more information.
| |
| | |
| ===Nonlinear equations in a Banach space===
| |
| Another generalization is Newton's method to find a root of a [[Functional (mathematics)|functional]] ''F'' defined in a [[Banach space]]. In this case the formulation is
| |
| | |
| :<math>X_{n+1}=X_n-[F^{\prime}(X_n)]^{-1}F(X_n),\,</math>
| |
| | |
| where <math>F^{\prime}(X_n)</math> is the [[Fréchet derivative]] computed at <math>X_n</math>. One needs the Fréchet derivative to be boundedly invertible at each <math>X_n</math> in order for the method to be applicable. A condition for existence of and convergence to a root is given by the [[Kantorovich theorem|Newton–Kantorovich theorem]].
| |
| | |
| ===Nonlinear equations over ''p''-adic numbers===
| |
| In ''p''-adic analysis, the standard method to show a polynomial equation in one variable has a ''p''-adic root is [[Hensel's lemma]], which uses the recursion from Newton's method on the ''p''-adic numbers. Because of the more stable behavior of addition and multiplication in the ''p''-adic numbers compared to the real numbers (specifically, the unit ball in the ''p''-adics 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.
| |
| | |
| ===Newton-Fourier method===
| |
| | |
| Assume that <math>f(x)</math> is twice continuously differentiable on <math>[a, b]</math> and that <math>f</math> contains a root in this interval. Assume that <math>f'(x) f''(x) \neq 0</math> on this interval (this is the case for instance if <math>f(a) < 0</math>, <math>f(b) > 0</math>, and <math>f'(x) > 0</math>, and <math>f''(x) > 0</math> on this interval). This guarantees that there is a unique root on this interval, call it <math>\alpha</math>. If it is concave down instead of concave up then replace <math>f(x)</math> by <math>-f(x)</math> since they have the same roots.
| |
| | |
| Let <math>x_0 = b</math> be the right endpoint of the interval and let <math>z_0 = a</math> be the left endpoint of the interval. Given <math>x_n</math>, define <math>x_{n + 1} = x_n - \frac{f(x_n)}{f'(x_n)}</math>, which is just Newton's method as before. Then define <math>z_{n + 1} = z_n - \frac{f(z_n)}{f'(x_n)}</math> and note that the denominator has <math>f'(x_n)</math> and not <math>f'(z_n)</math>. The iterates <math>x_n</math> will be strictly decreasing to the root while the iterates <math>z_n</math> will be strictly increasing to the root. Also, <math>\lim_{n\to \infty} \frac{x_{n + 1} - z_{n + 1}}{(x_n - z_n)^2} = \frac{f''(\alpha)}{2f'(\alpha)}</math> so that distance between <math>x_n</math> and <math>z_n</math> decreases quadratically.
| |
| | |
| ==Applications==
| |
| ===Minimization and maximization problems===
| |
| {{main|Newton's method in optimization}}
| |
| 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 minima and maxima can be found by applying Newton's method to the derivative. The iteration becomes:
| |
| | |
| :<math>x_{n+1} = x_n - \frac{f'(x_n)}{f''(x_n)}. \,\!</math>
| |
| | |
| ===Multiplicative inverses of numbers and power series===
| |
| An important application is [[Division algorithm#Newton–Raphson division|Newton–Raphson division]], which can be used to quickly find the [[Multiplicative inverse|reciprocal]] of a number, using only multiplication and subtraction.
| |
| | |
| Finding the reciprocal of ''a'' amounts to finding the root of the function
| |
| :<math>f(x)=a-\frac{1}{x}</math>
| |
| Newton's iteration is
| |
| :<math> \begin{align}
| |
| x_{n+1}&=x_n-\frac{f(x_n)}{f'(x_n)}\\
| |
| &=x_n-\frac{a-\frac{1}{x_n}}{\frac{1}{x_n^2}}\\
| |
| &=x_n\,(2-ax_n)
| |
| \end{align}
| |
| </math>
| |
| 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]].
| |
| | |
| ===Solving transcendental equations===
| |
| Many [[transcendental_equation|transcendental equations]] can be solved using Newton's method. Given the equation
| |
| :<math>g(x) = h(x), \,\!</math>
| |
| with ''g(x)'' and/or ''h(x)'' a [[transcendental function]], one writes
| |
| :<math>f(x) = g(x) - h(x). \,\!</math>
| |
| The values of ''x'' that solves the original equation are then the roots of ''f(x)'', which may be found via Newton's method.
| |
| | |
| ==Examples==
| |
| ===Square root of a number===
| |
| Consider the problem of finding the square root of a number. There are many [[methods of computing square roots]], and Newton's method is one.
| |
| | |
| For example, if one wishes to find the square root of 612, this is equivalent to finding the solution to
| |
| | |
| :<math>\,x^2 = 612</math>
| |
| | |
| The function to use in Newton's method is then,
| |
| | |
| :<math>\,f(x) = x^2 - 612</math>
| |
| | |
| with derivative,
| |
| | |
| :<math> f'(x) = 2x. \, </math>
| |
| | |
| With an initial guess of 10, the sequence given by Newton's method is
| |
| | |
| :<math>\begin{matrix}
| |
| x_1 & = & x_0 - \dfrac{f(x_0)}{f'(x_0)} & = & 10 - \dfrac{10^2 - 612}{2 \cdot 10} & = & 35.6 \quad\quad\quad{} \\
| |
| x_2 & = & x_1 - \dfrac{f(x_1)}{f'(x_1)} & = & 35.6 - \dfrac{35.6^2 - 612}{2 \cdot 35.6} & = & \underline{2}6.395505617978\dots \\
| |
| x_3 & = & \vdots & = & \vdots & = & \underline{24.7}90635492455\dots \\
| |
| x_4 & = & \vdots & = & \vdots & = & \underline{24.7386}88294075\dots \\
| |
| x_5 & = & \vdots & = & \vdots & = & \underline{24.7386337537}67\dots
| |
| \end{matrix}
| |
| </math>
| |
| | |
| Where the correct digits are underlined. With only a few iterations one can obtain a solution accurate to many decimal places.
| |
| | |
| === Solution of cos(''x'') = ''x''<sup>3</sup> ===
| |
| Consider the problem of finding the positive number ''x'' with cos(''x'') = ''x''<sup>3</sup>. We can rephrase that as finding the zero of ''f''(''x'') = cos(''x'') − ''x''<sup>3</sup>. We have ''f'''(''x'') = −sin(''x'') − 3''x''<sup>2</sup>. Since cos(''x'') ≤ 1 for all ''x'' and ''x''<sup>3</sup> > 1 for ''x'' > 1, we know that our zero lies between 0 and 1. We try a starting value of ''x''<sub>0</sub> = 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 zero.)
| |
| | |
| :<math>\begin{matrix}
| |
| x_1 & = & x_0 - \dfrac{f(x_0)}{f'(x_0)} & = & 0.5 - \dfrac{\cos(0.5) - (0.5)^3}{-\sin(0.5) - 3(0.5)^2} & = & 1.112141637097 \\
| |
| x_2 & = & x_1 - \dfrac{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}
| |
| </math>
| |
| | |
| The correct digits are underlined in the above example. In particular, ''x''<sub>6</sub> is correct to the number of decimal places given. We see that the number of correct digits after the decimal point increases from 2 (for ''x''<sub>3</sub>) to 5 and 10, illustrating the quadratic convergence.
| |
| | |
| | |
| ==Pseudocode==
| |
| The following is an example of using the Newton's Method to help find a root of a function <code>f</code> which has derivative <code>fprime</code>.
| |
| | |
| The initial guess will be <math>x_0 = 1</math> and the function will be <math>f(x) = x^2 - 2</math> so that <math>f'(x) = 2x</math>.
| |
| | |
| Each new iterative of Newton's method will be denoted by <code>x1</code>. We will check during the computation of the denominator (<code>yprime</code>) becomes too small (smaller than <code>epsilon</code>), which would be the case if <math>f'(x_n) \approx 0</math>, since otherwise a large amount of error could be introduced.
| |
| | |
| <source lang="matlab">
| |
| %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 %Were we able to find the solution to the desired tolerance? not 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
| |
| fprintf('WARNING: denominator is too small\n')
| |
| break; %Leave the loop
| |
| end
| |
| | |
| x1 = x0 - y/yprime %Do Newton's computation
| |
|
| |
| if(abs(x1 - x0)/abs(x1) < tolerance) %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) % We found a solution within tolerance and maximum number of iterations
| |
| fprintf('The root is: %f\n', x1);
| |
| else %If we weren't able to find a solution to within the desired tolerance
| |
| fprintf("Warning: Not able to find solution to within the desired tolerance of %f\n", tolerance);
| |
| fprintf("The last computed approximate root was %f\n", x1)
| |
| end
| |
| </source>
| |
| | |
| ==See also==
| |
| * [[Aitken's delta-squared process]]
| |
| * [[Bisection method]]
| |
| * [[Euler method]]
| |
| * [[Fast inverse square root]]
| |
| * [[Scoring_algorithm#Fisher_scoring|Fisher scoring]]
| |
| * [[Gradient descent]]
| |
| * [[Integer square root]]
| |
| * [[Laguerre's method]]
| |
| * [[Leonid Kantorovich]], who initiated the convergence analysis of Newton's method in Banach spaces.
| |
| * [[Methods of computing square roots]]
| |
| * [[Richardson extrapolation]]
| |
| * [[Root-finding algorithm]]
| |
| * [[Secant method]]
| |
| * [[Steffensen's method]]
| |
| * [[Subgradient method]]
| |
| | |
| ==References==
| |
| <references />
| |
| * Kendall E. Atkinson, ''An Introduction to Numerical Analysis'', (1989) John Wiley & Sons, Inc, ISBN 0-471-62489-6
| |
| * Tjalling J. Ypma, Historical development of the Newton-Raphson method, ''SIAM Review'' '''37''' (4), 531–551, 1995. {{doi|10.1137/1037125}}.
| |
| * {{cite book|last1=Bonnans|first1=J. Frédéric|last2=Gilbert|first2=J. Charles|last3=Lemaréchal|first3=Claude| authorlink3=Claude Lemaréchal|last4=Sagastizábal|first4=Claudia A.|title=Numerical optimization: Theoretical and practical aspects|url=http://www.springer.com/mathematics/applications/book/978-3-540-35445-1|edition=Second revised ed. of translation of 1997 <!-- ''Optimisation numérique: Aspects théoriques et pratiques'' --> French| series=Universitext|publisher=Springer-Verlag|location=Berlin|year=2006|pages=xiv+490|isbn=3-540-35445-X|doi=10.1007/978-3-540-35447-5|mr=2265882}}
| |
| * 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-89871-461-3.
| |
| *{{Cite book | last1=Press | first1=WH | last2=Teukolsky | first2=SA | last3=Vetterling | first3=WT | last4=Flannery | first4=BP | year=2007 | title=Numerical Recipes: The Art of Scientific Computing | edition=3rd | publisher=Cambridge University Press | publication-place=New York | isbn=978-0-521-88068-8 | chapter=Chapter 9. Root Finding and Nonlinear Sets of Equations Importance Sampling | chapter-url=http://apps.nrbook.com/empanel/index.html#pg=442}}. See especially Sections [http://apps.nrbook.com/empanel/index.html#pg=456 9.4], [http://apps.nrbook.com/empanel/index.html#pg=473 9.6], and [http://apps.nrbook.com/empanel/index.html#pg=477 9.7].
| |
| * [[Endre Süli]] and David Mayers, ''An Introduction to Numerical Analysis'', Cambridge University Press, 2003. ISBN 0-521-00794-1.
| |
| * {{Cite document | last1=Kaw | first1=Autar | last2=Kalu | first2=Egwu | year=2008 | title=Numerical Methods with Applications | edition=1st | publisher= | postscript=<!-- Bot inserted parameter. Either remove it; or change its value to "." for the cite to end in a ".", as necessary. -->{{inconsistent citations}}}}.
| |
| | |
| ==External links==
| |
| {{Commons category|Newton Method}}
| |
| * {{springer|title=Newton method|id=p/n066560}}
| |
| *{{MathWorld|title=Newton's Method|urlname=NewtonsMethod}}
| |
| | |
| <!--======================== {{No more links}} ============================
| |
| | PLEASE BE CAUTIOUS IN ADDING MORE LINKS TO THIS ARTICLE. Wikipedia |
| |
| | is not a collection of links nor should it be used for advertising. |
| |
| | |
| |
| | Excessive or inappropriate links WILL BE DELETED. |
| |
| | See [[Wikipedia:External links]] & [[Wikipedia:Spam]] for details. |
| |
| | |
| |
| | If there are already plentiful links, please propose additions or |
| |
| | replacements on this article's discussion page, or submit your link |
| |
| | to the relevant category at the Open Directory Project (dmoz.org) |
| |
| | and link back to that category using the {{dmoz}} template. |
| |
| ======================={{No more links}}=============================-->
| |
| | |
| {{Optimization algorithms}}
| |
| | |
| {{use dmy dates|date=January 2012}}
| |
| {{DEFAULTSORT:Newton's Method}}
| |
| [[Category:Optimization algorithms and methods]]
| |
| [[Category:Root-finding algorithms]]
| |
| | |
| {{Link GA|de}}
| |
| {{Link GA|ru}}
| |