A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane

Full text

Pdf (376 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 3 (July 1978) table of contents

Pages: 415 - 420

Year of Publication: 1978

ISSN:0004-5411

Author

Herbert S. Wilf

Department of Mathematics, University of Pennsylvania, Philadelphia, PA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 41, Citation Count: 2

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/322077.322084 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	GANTMACHER, F R. Apphcat:ons of the Theory of Matr:ces Wlley-lnterscience, New York, 1959, Ch V
	2	GARGANTINI, I, AND HENRICI, P Circular arithmetic and the determination of polynomml zeros Numer Math 18 (1972), 305-320
	3	HENRICl, P Umformly convergent algorithms for the simultaneous determination of all zeros of a polynomial Studies m Numer Analy 2 (1968), I-8
	4	HENRICI, P,, AND GARGANTINI, I Uniformly convergent algorithms for the simultaneous determination of all zeros of a polynomial Proc Symp on Constructwe Aspects of the Fundamental Theorem of Algebra, B Dejon and P Henrlcl, Eds, Wdey-lnterscience, London, 1969, pp 77-114
	5	P. Henrici , Bruce O. Watkins, Finding zeros of a polynomial by the Q-D algorithm, Communications of the ACM, v.8 n.9, p.570-574, Sept. 1965 [doi>10.1145/365559.365619]
	6	JENKINS, i A, AND TRAUB, J F A three-stage variable-shift iteration for polynomial zeros Numer Math 14 (1970), 252-263
	7	M. A. Jenkins , J. F. Traub, Principles for Testing Polynomial Zerofinding Programs, ACM Transactions on Mathematical Software (TOMS), v.1 n.1, p.26-34, March 1975 [doi>10.1145/355626.355632]
	8	D. H. Lehmer, A Machine Method for Solving Polynomial Equations, Journal of the ACM (JACM), v.8 n.2, p.151-162, April 1961 [doi>10.1145/321062.321064]
	9	NtJENHUlS, A, ANt)WiLF, H S Comb:natorlal Algorithms Academic Press, New York, 1975
	10	James R. Pinkert, An Exact Method for Finding the Roots of a Complex Polynomial, ACM Transactions on Mathematical Software (TOMS), v.2 n.4, p.351-363, Dec. 1976 [doi>10.1145/355705.355710]
	11	WEYL, H Randbemerkungen zu Hauptproblemen der Mathematik, II Fundamentalsatz der Algebra und Grundlagen der Mathematik Math Z 20 (1924), 131-150
	12	WILF, H S Mathematics for the Physscal Sciences Wiley, New York, 1962

CITED BY 2

	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
	J.-C. Yakoubsohn, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Journal of Complexity, v.21 n.5, p.652-690, October 2005