Bairstow's method

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.

Description of the method

Bairstow's approach is to use Newton's method to adjust the coefficients "u" and "v" in the quadratic $x^2\; +\; 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 :$P(x)=sum\_\{i=0\}^n\; a\_i\; x^i$ by $x^2\; +\; ux\; +\; v$ yields a quotient:$Q(x)=sum\_\{i=0\}^n\; b\_i\; x^i$ and a remainder $cx+d$ such that:$P(x)=(x^2+ux+v)left(sum\_\{i=0\}^n\; b\_i\; x^i\; ight)\; +\; (cx+d).$The variables $c$, $d$, and the $\{b\_i\}$ are functions of $u$ and $v$. They can be found recursively as follows.:$,b\_n\; =\; b\_\{n-1\}\; =\; 0,$:$,b\_i=a\_\{i+2\}-ub\_\{i+1\}-vb\_\{i+2\}\; qquad\; (i=n-2,ldots,0),$:$,c=a\_1-ub\_0-vb\_1,$:$,d=a\_0-vb\_0.$The quadratic evenly divides the polynomial when:$c(u,v)=d(u,v)=0.\; ,$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.

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.

External links

* [http://mathworld.wolfram.com/BairstowsMethod.html Bairstow's Algorithm on Mathworld]
* [http://library.lanl.gov/numerical/bookfpdf.html Numerical Recipes in Fortran 77 Online]
* [http://www.savetman.com/roots.html Compute roots of polynomials interactively using Bairstow's Method on savetman.com]
* [http://www.polarhome.com:793/~amate2/php/polysolver_en.php Determine the roots of polynomials (gr(P)<= 10) using Bairstow's Method]
* [http://www.vtk.org/doc/nightly/html/classvtkMath.html LinBairstowSolve, an open-source C++ implementation of the Lin-Bairstow method is available as a method of the VTK library]