Bairstow's method
From Wikipedia, the free encyclopedia
In numerical analysis, Bairstow's method is an efficient algorithm for finding the roots of a real polynomial of arbitrary degree. The algorithm first appeared in the appendix of the 1920 book "Applied Aerodynamics" by Leonard Bairstow. The algorithm finds the roots in complex conjugate pairs using only real arithmetic.
See root-finding algorithm for other algorithms.
[edit] Description of the method
Bairstow's approach is to use Newton's method to adjust the coefficients u and v in the quadratic x2 + ux + v until its roots are also roots of the polynomial being solved. The roots of the quadratic may then be determined, and the polynomial may be divided by the quadratic to eliminate those roots. This process is then iterated until the polynomial becomes quadratic or linear, and all the roots have been determined.
Long division of a polynomial
by x2 + ux + v yields a quotient
and a remainder cx + d such that
The variables c, d, and the {bi} are functions of u and v. They can be found recursively as follows.
The quadratic evenly divides the polynomial when
Values of u and v for which this occurs can be discovered by picking starting values and iterating Newton's method in two dimensions
until convergence occurs.
[edit] Performance
Bairstow's algorithm inherits the quadratic convergence of Newton's method, except in the case of quadratic factors of multiplicity higher than 1, when convergence can be rather slow.
[edit] External links
- Bairstow's Algorithm on Mathworld
- Numerical Recipes in Fortran 77 Online
- Compute roots of polynomials interactively using Bairstow's Method on savetman.com
- Determine the roots of polynomials (gr(P)<= 10) using Bairstow's Method
- LinBairstowSolve, an open-source C++ implementation of the Lin-Bairstow method is available as a method of the VTK library