zbMATH — the first resource for mathematics

Improving a method of search for solving polynomial equations. (English) Zbl 0877.65028
Summary: This paper is related to the Lehmer-Schur methods in numerical mathematics in the complex plane. It is shown that by a slight modification of the “optimized” Lehmer-Schur method of A. Galántai [Alkalmazott Mat. Lapok 11, 319-334 (1985; Zbl 0615.65070)], the “speed” quotient 0.6094 can be reduced to 0.5758. The crucial idea is based on a discrete geometrical observation.

65H05 Numerical computation of solutions to single equations
65E05 General theory of numerical methods in complex analysis (potential theory, etc.)
30C15 Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
12Y05 Computational aspects of field theory and polynomials (MSC2010)
Full Text: DOI
[1] Lehmer, D.H., A machine method for solving polynomial equations, J. ACM, 2, 151-163, (1961) · Zbl 0106.10203
[2] Lehmer, D.H., Search procedures for polynomial equation solving, () · Zbl 0182.21503
[3] Ralston, A., A first course in numerical analysis, (1965), McGraw-Hill New York · Zbl 0139.31603
[4] Stewart, G.W., On Lehmer’s method for finding the zeros of a polynomial, Math. comp., 23, 829-835, (1969) · Zbl 0214.14802
[5] Henrici, P., Methods of search for solving polynomial equations, J. ACM, 17, 273-283, (1970) · Zbl 0222.65057
[6] Galántai, A., On the optimization of the Lehmer-Schur method [hungarian; English summary], Alk. mat. lapok [hungary], 11, 319-334, (1985) · Zbl 0615.65070
[7] Galántai, A., Remarks on the optimization of the Lehmer-Schur method, Studia sci. math. hung., 24, 453-460, (1989) · Zbl 0782.65065
[8] Bezdek, K., Über einige kreisüberdeckungen, Beitr. algebra geom., 14, 7-13, (1983) · Zbl 0507.52009
[9] Neville, E.H., On the solution of numerical functional equations, (), 308-326 · JFM 45.1230.05
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.