On Lehmer's Method for Finding the Zeros of a Polynomial

DOI10.2307/2004970zbMath0214.14802OpenAlexW4254928251MaRDI QIDQ5616475

G. W. Stewart

Publication date: 1969

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2004970

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

Improving a method of search for solving polynomial equations, Modified Newton method in circular interval arithmetic, A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial, An algorithm for the total, or partial, factorization of a polynomial, A Schur's modified sequence and the number of zeros of a real polynomial in the unit disk: Testing its numerical quality, Locating multiple zeros interactively, Effective numerical method of spectral analysis of quantum graphs