A bibliography on roots of polynomials
John Michael McNamee
Department of Computer Science and Mathematics,
Atkinson College, York University,
4700 Keele Street, North York, Ontario, Canada M3J 1P3.
E-mail: mcnamee@yorku.ca.
In this work we present a comprehensive bibliography on roots of
polynomials, covering (hopefully) most published work between the ``Dawn of
History'' and 1994. This could be of help to anyone contemplating
research into methods of calculating polynomial roots. To keep the length
manageable we have excluded theses, unpublished reports, and works in very
obscure journals or very obscure languages.
Introduction by J.M. McNamee (excerpt
from the 1993 edition)
Addendum to the 1996 hypertext edition
A 2002 update of the supplementary bibliography on roots of polynomials
The general subject of polynomial root finding has been divided into 29
categories that you can search or view:
- Bracketing methods (real roots only).
- Newton's method.
- Simultaneous root-finding methods.
- Graeffe's method.
- Integral methods, esp. Lehmer's.
- Bernoulli's and QD method.
- Interpolation methods such as secant, Muller's.
- Minimization methods.
- Jenkins--Traub method.
- Sturm sequences, greatest common divisors, resultants.
- Stability questions (Routh--Hurwitz criterion, etc.).
- Interval methods.
- Miscellaneous.
- Lin and Bairstow methods.
- Methods involving derivatives higher than first.
- Complexity, convergence and efficiency questions.
- Evaluation of polynomials and derivatives.
- A priori bounds.
- Low-order polynomials (special methods).
- Integer and rational arithmetic.
- Special cases such as Bessel polynomials.
- Vincent's method.
- Mechanical devices.
- Acceleration techniques.
- Existence questions.
- Error estimates, deflation, sensitivity, continuity.
- Roots of random polynomials.
- Relation between roots of a polynomial and those of its derivative
- Nth roots.