A Machine Method for Solving Polynomial Equations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Machine Method for Solving Polynomial Equations

Full text

Pdf (517 KB)

Source

Journal of the ACM (JACM) archive
Volume 8 , Issue 2 (April 1961) table of contents

Pages: 151 - 162

Year of Publication: 1961

ISSN:0004-5411

Author

D. H. Lehmer

University of California, Berkeley

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 40, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321062.321064 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	RALSTON, A., AND WILF, I~I. S MathematicaZ Methods for D~g~tal Computers, p. 236. New York, London 1960.
	2	James A. Ward, The Down-Hill Method of Solving f(z) = 0, Journal of the ACM (JACM), v.4 n.2, p.148-150, April 1957 [doi>10.1145/320868.320873]
	3	SCHUR, I. Uber Potenzreihen, die in Innern des Elnheltskreises beschrankt sind J. Reine Angew Math. 138 (1918), 134 See also M Marden, The Geometry of lhe Zeros of a Polynomial ~n a Complex Variable. Amer. Math Soc Surveys No 3, New York 1949, Ch 10
	4	MOORE, E. F A new general method for finding roots of polynomial equations Math. Tables. A~ds Comput 8 (1949), 486-488

CITED BY 6

	Herbert S. Wilf, A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane, Journal of the ACM (JACM), v.25 n.3, p.415-420, July 1978
	Peter Henrici, Methods of Search for Solving Polynomial Equations, Journal of the ACM (JACM), v.17 n.2, p.273-283, April 1970
	J. N. Lyness, Numerical algorithms based on the theory of complex variable, Proceedings of the 1967 22nd national conference, p.125-133, January 1967, Washington, D.C., United States
	Armin Friedli, Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations, Journal of the ACM (JACM), v.20 n.2, p.290-300, April 1973
	George E. Collins , Werner Krandick, An efficient algorithm for infallible polynomial complex root isolation, Papers from the international symposium on Symbolic and algebraic computation, p.189-194, July 27-29, 1992, Berkeley, California, United States
	Prashant Batra, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, Electronic Notes in Theoretical Computer Science (ENTCS), 202, p.201-218, March, 2008