Algorithm 493: Zeros of a Real Polynomial [C2]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 493: Zeros of a Real Polynomial [C2]

Full text

Pdf (545 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 1 , Issue 2 (June 1975) table of contents

Pages: 178 - 189

Year of Publication: 1975

ISSN:0098-3500

Author

M. A. Jenkins

Department of Computing and Information Science, Queen's University, Kingston, Ont., Canada K7L 3N6

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 181, Citation Count: 6

Additional Information:

appendices and supplements 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/355637.355643 What is a DOI?

APPENDICES and SUPPLEMENTS

RPOLY (493.gz) (6 KB)

Jenkins and Traub: zeros of a real polynomial
Gams: F1a1

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	JENKINS, M.A., AND TRAUB, J.F. A three-stage algorithm for real polynomials using quadratic iteration. SIAM J. Numer. Anal. 7 (1970), 545-566.
	2	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]

CITED BY 6

	P. A. Fox , A. P. Hall , N. L. Schryer, The PORT Mathematical Subroutine Library, ACM Transactions on Mathematical Software (TOMS), v.4 n.2, p.104-126, June 1978
	S. Schmidt , J. A. Brown , M. A. Jenkins, Eigenanalysis and polynomial root finding primitive functions, ACM SIGAPL APL Quote Quad, v.13 n.1, p.320-324, September 1982
	Leonidas J. Guibas , Menelaos I. Karavelas, Interval methods for kinetic simulations, Proceedings of the fifteenth annual symposium on Computational geometry, p.255-264, June 13-16, 1999, Miami Beach, Florida, United States
	Arnold Neumaier, Enclosing clusters of zeros of polynomials, Journal of Computational and Applied Mathematics, v.156 n.2, p.389-401, 15 July 2003
	T. A. Rice , L. H. Jamieson, A Highly Parallel Algorithm for Root Extraction, IEEE Transactions on Computers, v.38 n.3, p.443-449, March 1989
	On Pose Recovery for Generalized Visual Sensors, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.26 n.7, p.848-861, July 2004

INDEX TERMS

Primary Classification:
G. Mathematics of Computing

Additional Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.1 Numerical Algorithms and Problems
Subjects: Computations on polynomials; Number-theoretic computations (e.g., factoring, primality testing)

G. Mathematics of Computing
G.1 NUMERICAL ANALYSIS
G.1.5 Roots of Nonlinear Equations
Subjects: Polynomials, methods for

General Terms:
Algorithms, Theory

Collaborative Colleagues:

M. A. Jenkins: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player