Laguerre's method

In numerical analysis, Laguerre's method is a root-finding algorithm tailored to polynomials. In other words, Laguerre's method can be used to numerically solve the equation $p (x) = 0$ for a given polynomial $p (x)$ . One of the most useful properties of this method is that it is, from extensive empirical study, very close to being a "sure-fire" method, meaning that it is almost guaranteed to always converge to some root of the polynomial, no matter what initial guess is chosen. This method is named in honour of Edmond Laguerre, a French mathematician.

The algorithm of the Laguerre method to find one root of a polynomial $p (x)$ of degree $n$ is:

If a root has been found, the corresponding linear factor can be removed from p. This deflation step reduces the degree of the polynomial by one, so that eventually, approximations for all roots of p can be found. Note however that deflation can lead to approximate factors that differ significantly from the corresponding exact factors. This error is least if the roots are found in the order of increasing magnitude.

The fundamental theorem of algebra states that every nth degree polynomial $p$ $p$ can be written in the form

such that $x_{k}$ $x_{k}$ where $(k=1,2,...,n)$ $(k=1,2,...,n)$ are the roots of the polynomial. If we take the natural logarithm of both sides, we find that

...
Wikipedia