The Mathematical Basis and a Prototype Implementation of a New Polynomial Rootfinder with Quadratic Convergence

ACM Transactions on Mathematical Software

Volumn 22, Issue 3, 1996, Pages 261-280

  Hull, T E ^a   Mathon, R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Error analysis; G.1.0 numerical analysis : General error analysis; G.1.5 numerical analysis : Roots of nonlinear equations convergence; Iterative methods; Methods for polynomials; Numerical algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SOFTWARE; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; ITERATIVE METHODS; NONLINEAR EQUATIONS;

POLYNOMIAL ROOTFINDER; POLYNOMIAL ZEROFINDER; QUADRATIC CONVERGENCE;

POLYNOMIALS;

EID: 0030244864     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/232826.232830     Document Type: Article

References (20)

1. ABERTH, O. 1973. Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comput. 27, 122, 339-344. See also Statement of Priority. Math. Comput. 30, 135 (Apr. 1976), 680.
2. ABERTH, O. 1973. Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comput. 27, 122, 339-344. See also Statement of Priority. Math. Comput. 30, 135 (Apr. 1976), 680.
3. ABERTH, O. 1988. Precise Numerical Analysis. William C. Brown, Dubuque, Iowa.
4. ADAMS, D. A. 1967. A stopping criterion for polynomial root finding. Commun. ACM 10, 10 (Oct.), 655-658.
5. DOCHEV, K. 1962. A modified Newton method for the simultaneous approximate calculation of all the roots of a given algebraic equation. Phys. Math. J. Bulgarian Acad. Sci. 5, 136-139. In Bulgarian.
6. DURAND, E. 1960. Solutions Numériques des Équations Algébriques. Vol. 1, Équations du Type F(x) = 0, Racines d'un Polynôme. Masson, Paris.
7. FREEMAN, T. L. 1989. Calculating polynomial zeros on a local memory parallel computer. Parallel Comput. 12, 351-358.
8. FREEMAN, T. L. AND BANE, M. K. 1991. Asynchronous polynomial zero-finding algorithms. Parallel Comput. 17, 673-681.
9. IMSL. 1985. User's Manual. International Mathematical and Statistical Libraries, Houston, Tex.
10. JENKINS, M. A. AND TRAUB, J. F. 1975. Principles for testing polynomial zerofinding programs. ACM Trans. Math. Softw. 1, 1 (Mar.), 26-34.
11. KERNER, I. O. 1966. Ein Gesamtschrittfahren zur Berechnung der Nullstellen von Polynomen. Num. Math. 8, 290-294.
12. MILOVANOVIĆ, G. V. AND PETKOVIĆ, M. S. 1986. On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros. ACM Trans. Math. Softw. 12, 4 (Dec.), 295-306.
13. NAG. 1991. Fortran Library Manual, Mark 15A. Numerical Algorithms Group Ltd., Oxford.
14. PASQUINI, L. AND TRIGIANTE, D. 1985. A globally convergent method for simultaneously finding polynomial roots. Math. Comput. 44, 169 (Jan.), 135-149.
15. PETERS, G. AND WILKINSON, J. H. 1971. Practical problems arising in the solution of polynomial equations. J. Inst. Math. Appl. 8, 16-35.
16. SMITH, B. T. 1970. Error bounds for zeros of a polynomial based upon Gerschgorin's theorems. J. ACM 17, 4 (Oct.), 661-674.
17. SOLOWIEJ, M. 1983. N-dimensional Newton method with precision control for determining roots of complex polynomials. M.Sc. thesis, Dept. of Computer Science, Univ. of Toronto, Toronto, Canada.
18. TREVIZAN, C. A. 1977. A zero finding algorithm for complex polynomials. M.Sc. thesis, Dept. of Computer Science, Univ. of Toronto, Toronto, Canada.
19. WEIERSTRASS, K. 1891. Neuer Beweis des Satzes, dass jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Veränderlichen. Reproduced in Ges. Werke 3 (1903), 251-269.
20. WlLKINSON, J. H. 1963. Rounding Errors in Algebraic Processes. Prentice-Hall, Englewood Cliffs, N.J.