A stopping criterion for polynomial root finding

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A stopping criterion for polynomial root finding

Full text

Pdf (483 KB)

Source

Communications of the ACM archive
Volume 10 , Issue 10 (October 1967) table of contents

Pages: 655 - 658

Year of Publication: 1967

ISSN:0001-0782

Author

Duane A. Adams

Stanford Univ., Stanford, CA

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms

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/363717.363775 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	Allan Gibb, Algorithm 61: procedures for range arithmetic, Communications of the ACM, v.4 n.7, p.319-320, July 1961 [doi>10.1145/366622.366637]
	2	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]
	3	W. Kahan , I. Farkas, Algorithm 167: calculation of confluent divided differences, Communications of the ACM, v.6 n.4, p.164-165, April 1963 [doi>10.1145/366349.366444]
	4	MOORE, R. E. Interval arithmetic and automatic error analysis in digital computing. Tech. Rep. No. 25, Appl. Math and Statistics Lab., Stanford U., Stanford, Calif., Nov. 1962, 134 pp.
	5	TRAUB, J. F. A class of globally convergent iteration functions for the solution of polynomial equations. Math. Comput. 20 (1966), 113-138.
	6	---, The calculation of zeros of polynomials and analytic functions. In Proceedings of a Symposium on Mathematical Aspects of Computer Science, American Mathematical Society, Providence, R. I., to appear. Also available as Tech, Rept. 36 Computer Science Dept., Stanford U., Stanford, Calif,
	7	James H. Wilkinson, Rounding Errors in Algebraic Processes, Dover Publications, Incorporated, 1994
	8	J. H. Wilkinson, The algebraic eigenvalue problem, Oxford University Press, Inc., New York, NY, 1988

CITED BY 6

	J. Rokne, Automatic errorbounds for simple zeros of analytic functions, Communications of the ACM, v.16 n.2, p.101-104, Feb. 1973
	Nai-kuan Tsao, Some a Posteriori Error Bounds in Floating-Point Computations, Journal of the ACM (JACM), v.21 n.1, p.6-17, Jan. 1974
	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
	T. E. Hull , R. Mathon, The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence, ACM Transactions on Mathematical Software (TOMS), v.22 n.3, p.261-280, Sept. 1996
	Richard J. Fateman, Computer algebra and numerical integration, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.228-232, August 05-07, 1981, Snowbird, Utah, United States
	Brian T. Smith, Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems, Journal of the ACM (JACM), v.17 n.4, p.661-674, Oct. 1970

INDEX TERMS

Primary Classification:
G. Mathematics of Computing
G.1 NUMERICAL ANALYSIS

General Terms:
Algorithms, Theory

Adobe Acrobat

QuickTime

Windows Media Player

Real Player