Newton's method generates a sequence to find the root of a function starting from an initial guess. This initial guess should be close enough to the root for the convergence to be guaranteed. We construct the tangent of at and we find an approximation of by computing the root of the tangent. Repeating this iterative process we obtain the sequence .
It's clear from the derivation that the error of Newton's method is given by
Newton's method error formula:
From this we note that if the method converges, then the order of convergence is 2. On the other hand, the convergence of Newton's method depends on the initial guess .
The following theorem holds
Assume that and are continuous in neighborhood of the root and that . Then, taken close enough to , the sequence , with , defined by the Newton's method converges to . Moreover the order of convergence is , as
Advantages and Disadvantages of the Newton-Raphson Method[edit | edit source]
Advantages of using Newton's method to approximate a root rest primarily in its rate of convergence. When the method converges, it does so quadratically. Also, the method is very simple to apply and has great local convergence.
The disadvantages of using this method are numerous. First of all, it is not guaranteed that Newton's method will converge if we select an that is too far from the exact root. Likewise, if our tangent line becomes parallel or almost parallel to the x-axis, we are not guaranteed convergence with the use of this method. Also, because we have two functions to evaluate with each iteration ( and , this method is computationally expensive. Another disadvantage is that we must have a functional representation of the derivative of our function, which is not always possible if we working only from given data.