An efficient algorithm for infallible polynomial complex root isolation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An efficient algorithm for infallible polynomial complex root isolation

Full text

Pdf (571 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents

Berkeley, California, United States

Pages: 189 - 194

Year of Publication: 1992

ISBN:0-89791-489-9

Authors

George E. Collins
Werner Krandick

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 24, Citation Count: 4

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/143242.143308 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	G. E. Collins. infallible calculation of polynomial zeros to specified precision. Mathemattcal Soft. ware, Academic Press, New York, pages 35-68, 1977.
	2	Jeremy R. Johnson. Algorithms for polynomial real root isolation. Technical Research Report OSU- CISRC-8/91-TR21, The Ohio State University, 2036 Neil Avenue Mall, Columbus, Ohio 43210, Phone: 614-292-5813, 1991.
	3	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]
	4	Morris Uarden. The geometry of the zeros of a polynomial zn a complex vamable. American Mathematical Society, New York, 1949.
	5	James Robert Pinkert, Algebraic algorithms for computing the complex zeros of gaussian polynomials., 1973
	6	James R. Pinkert, An Exact Method for Finding the Roots of a Complex Polynomial, University of Tennessee, Knoxville, TN, 1975
	7	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]
	8	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 [doi>10.1145/322077.322084]

CITED BY 4

	Wolfram Koepf, Power series, Bieberbach conjecture and the de Branges and Weinstein functions, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.169-175, August 03-06, 2003, Philadelphia, PA, USA
	George E. Collins , Werner Krandick, A tangent-secant method for polynomial complex root calculation, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.137-141, July 24-26, 1996, Zurich, Switzerland
	Dinesh Manocha , James Demmel, Algorithms for intersecting parametric and algebraic curves I: simple intersections, ACM Transactions on Graphics (TOG), v.13 n.1, p.73-100, Jan. 1994
	George E. Collins , Werner Krandick, A hybrid method for high precision calculation of polynomial real roots, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.47-52, July 06-08, 1993, Kiev, Ukraine