|
|
|
|
|
Laguerre's MethodIn numerical analysis, Laguerre's method is a root-finding algorithm tailored to polynomials. In other words, Laguerre's method can be used to solve numerically the equation - p(x) = 0
for a given polynomial p. Definition Let x0 be an initial guess for the root to be determined. Laguerre's method tries to improve this approximation iteratively by using the recurrence relation -
where the ± in the denominator is + or − according to which alternative yields the denominator with greater modulus. Furthermore, n denotes the degree of the polynomial p and S1 and S2 are the first and second logarithmic derivatives of p, i.e. -
-
Properties If x is a simple root of the polynomial p, then Laguerre's method converges cubically whenever the initial guess x0 is close enough to the root x. On the other hand, if x is a multiple root then the convergence is only linear. This means that Laguerre's method converges even faster than Newton's method. However, Laguerre's method requires one to compute the first and the second derivative of p, while Newton's method requires only one derivative. Laguerre's method also works for polynomials with real coefficients that have complex roots. Even if the initial guess is real, then the method will step off the real axis if the expression under the root sign is negative. This is in contrast to Newton's method, which will always stay on the real axis in this case. References Wankere R. Mekwi (2001). Iterative Methods for Roots of Polynomials. Master's thesis, University of Oxford.
|
 |
| |
|
|