Bairstow's method

In numerical analysis, Bairstow's method is an efficient algorithm for finding the root 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 <math>x^2 + ux + v</math> 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 the polynomial to be solved

<math>P(x)=sum_^n a_i x^i</math>

by <math>x^2 + ux + v</math> yields a quotient <math>Q(x)=sum_^ b_i x^i</math> and a remainder <math> cx+d </math> such that

<math> P(x)=(x^2+ux+v)left(sum_^ b_i x^iright) + (cx+d). </math>

A second division of <math>Q(x)</math> by <math>x^2 + ux + v</math> is performed to yield a quotient <math>R(x)=sum_^ f_i x^i</math> and remainder <math>gx+h</math> with

<math> Q(x)=(x^2+ux+v)left(sum_^ f_i x^iright) + (gx+h). </math>

The...
Read More