On Lehmer’s method for finding the zeros of a polynomial
Open Access
- 1 January 1969
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 23 (108) , 829-835
- https://doi.org/10.1090/s0025-5718-1969-0266425-3
Abstract
Lehmer’s method for finding a zero of a polynomial is a procedure for searching the complex plane in such a way that a zero is isolated in a sequence of disks of decreasing radii. In this paper modifications of the method that improve its stability are given. The convergence of the method and the use of the resulting approximate zero to deflate the polynomial are discussed.Keywords
This publication has 5 references indexed in Scilit:
- A stopping criterion for polynomial root findingCommunications of the ACM, 1967
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966
- A Machine Method for Solving Polynomial EquationsJournal of the ACM, 1961
- ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem KreiseMathematische Zeitschrift, 1922
- Über algebraische Gleichungen, die nur Wurzeln mif negativen Realteilen besitzenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1921