Bairstow's method
Root-finding algorithm for polynomials

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
+
u
x
+
v
{\displaystyle 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 the polynomial to be solved
P
(
x
)
=
∑
i
=
0
n
a
i
x
i
{\displaystyle P(x)=\sum _{i=0}^{n}a_{i}x^{i}}
by
x
2
+
u
x
+
v
{\displaystyle x^{2}+ux+v}
yields a quotient
Q
(
x
)
=
∑
i
=
0
n
−
2
b
i
x
i
{\displaystyle Q(x)=\sum _{i=0}^{n-2}b_{i}x^{i}}
and a remainder
c
x
+
d
{\displaystyle cx+d}
such that
P
(
x
)
=
(
x
2
+
u
x
+
v
)
(
∑
i
=
0
n
−
2
b
i
x
i
)
+
(
c
x
+
d
)
.
{\displaystyle P(x)=(x^{2}+ux+v)\left(\sum _{i=0}^{n-2}b_{i}x^{i}\right)+(cx+d).}
A second division of
Q
(
x
)
{\displaystyle Q(x)}
by
x
2
+
u
x
+
v
{\displaystyle x^{2}+ux+v}
is performed to yield a quotient
R
(
x
)
=
∑
i
=
0
n
−
4
f
i
x
i
{\displaystyle R(x)=\sum _{i=0}^{n-4}f_{i}x^{i}}
and remainder
g
x
+
h
{\displaystyle gx+h}
with
Q
(
x
)
=
(
x
2
+
u
x
+
v
)
(
∑
i
=
0
n
−
4
f
i
x
i
)
+
(
g
x
+
h
)
.
{\displaystyle Q(x)=(x^{2}+ux+v)\left(\sum _{i=0}^{n-4}f_{i}x^{i}\right)+(gx+h).}
The variables
c
,
d
,
g
,
h
{\displaystyle c,\,d,\,g,\,h}
, and the
{
b
i
}
,
{
f
i
}
{\displaystyle \{b_{i}\},\;\{f_{i}\}}
are functions of
u
{\displaystyle u}
and
v
{\displaystyle v}
.
Begin with the source’s own compact description: “Bairstow's method” is root-finding algorithm for polynomials. The dossier treats that line as a proposition to test through Bairstow's, method and Root-finding, not as a finished interpretation.
Why this record matters
The phrase “root-finding algorithm for polynomials” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Feb 6, 2025. The linked authority identifier is Q384021. None of the 0 selected statements returned an explicit reference. The first chronological checks are 1920.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Bairstow's method”, its source revision and the description used here.
- Expand the search: follow Bairstow's method primary sources, Bairstow's method archive and Bairstow's research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Bairstow's method”?
- Which institution is responsible for the underlying evidence?
- Which cited source is closest to the event, object or claim?
Search terms from this dossier
This entry incorporates text from “Bairstow's method” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.