Math 2.0

Numerical analysis Nonlinear equations Theorem

Laguerre's method

Builds on Root of a polynomialMultiplicity of a rootRate of convergenceComplex numbers

Statement

Let pp be a polynomial of degree n≥2n \ge 2 with complex coefficients. For a point xx with p(x)≠0p(x) \ne 0, put G=p′(x)p(x),H=G2−p′′(x)p(x),a=nG±(n−1)(nH−G2),G = \frac{p'(x)}{p(x)}, \qquad H = G^2 - \frac{p''(x)}{p(x)}, \qquad a = \frac{n}{G \pm \sqrt{(n - 1)(nH - G^2)}}, where the sign is chosen so that the denominator has the larger absolute value. Laguerre's method is the iteration xk+1=xk−ax_{k+1} = x_k - a, with G,H,aG, H, a computed at x=xkx = x_k. Then:

  1. If rr is a root of pp of multiplicity 11, then for x0x_0 close enough to rr the iterates converge to rr with order 33.
  2. If all roots of pp are real, then for every real x0x_0 the iterates stay real and converge to a root of pp.

Remarks

The formula comes from a model of pp near xx. Assume that one root rr is at distance a=x−ra = x - r, and that the other n−1n - 1 roots all sit at a common distance bb. The identities G=∑i1x−riG = \sum_i \frac{1}{x - r_i} and H=∑i1(x−ri)2H = \sum_i \frac{1}{(x - r_i)^2} over the roots rir_i then give two equations for aa and bb, whose solution is the formula above. For polynomials with only real roots, a real starting point between two consecutive roots leads to one of these two roots. A real starting point outside all roots leads to the nearest root on that side. At a multiple root the convergence is only linear. The square root can be non-real, so the method also finds the complex roots of real polynomials.

Going deeper

For a student

The method uses pp, p′p' and p′′p'', which Horner's scheme evaluates cheaply. Its convergence from almost any start makes it a robust choice for finding all roots one at a time, with deflation after each root. Its behaviour on polynomials with only real roots is a rare case of guaranteed global convergence.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Complex numbers object
  2. Multiplicity of a root concept
  3. Rate of convergence concept
  4. Root of a polynomial concept
  5. Laguerre's method statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Laguerre%27s_method
About this page
TagY277TCXZ9Z
URIm2://Y277TCXZ9Z
Kindstatement, theorem
WritingW0 stub
MSC65H04
StatusThis copy of the site has no build data. Run m2 status Y277TCXZ9Z.
AboutRoot of a polynomial
UsesRoot of a polynomial, Multiplicity of a root, Rate of convergence, Complex numbers
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.