Algorithm 835: MULTROOT - A matlab package for computing polynomial roots and multiplicities

ACM Transactions on Mathematical Software

Volumn 30, Issue 2, 2004, Pages 218-236

  Zeng, Zhonggang ^a  

^a NORTHEASTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Multiple root; Multiple zero; Multiplicity identification; Polynomial; Root finding

Indexed keywords

MULTIPLE ROOTS; MULTIPLE ZERO; MULTIPLICITY IDENTIFICATION; ROOT-FINDING;

COMPUTER SOFTWARE; ERROR ANALYSIS; ITERATIVE METHODS; NONLINEAR EQUATIONS; POLYNOMIALS;

ALGORITHMS;

EID: 2942692216     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/992200.992209     Document Type: Article

References (21)

1. BINI, D. A. AND FIORENTINO, G. 1999. Numerical computation of polynomial roots using mpsolve version 2.0. Manuscript, available at ftp://ftp.dm.unipi.it/ pub/mpsolve/.
2. BINI, D. A. AND MOURRAIN, B. 1996. Polynomial test suite, http://www-sop.inria.fr/saga/POL.
3. BRUGNANAO, L. AND TRIGIANTE, D. 1995. Polynomial roots: the ultimate answer? Linear Alg. and Its Appl. 225, 207-219.
4. DVORČUK, J. 1969. Factorization of a polynomial into quadratic factors by Newton method. Apl. Mat. 14, 54-80.
5. FARMER, M. R. AND LOIZOU, G. 1975. A class of iteration functions for improving, simultaneously, approximation to the zeros of a polynomial. BIT 15, 250-258.
6. GOEDECKER, S. 1994. Remarks on algorithms to find roots of polynomials. SIAM J. Sci. Comput 15, 1059-1063.
7. IGARASHI, M. AND YPMA, T. 1984. Relationships between order and efficiency of a class of methods for multiple zeros of polynomials. J. Comput. Appl. Math. 60, 101-113.
8. ILIEV, A. I. 2000. A generalization of Obreshkoff-Ehrlich method for multiple roots of algebraic, trigonometric and exponential equations. Math. Balkanica 14, 17-18.
9. JENKINS, M. A. AND TRAUB, J. F. 1975. Principles for testing polynomial zerofinding programs. ACM Trans. Math. Soft. 1, 1, 26-34.
10. KAHAN, W. 1972. Conserving confluence curbs ill-condition. Tech. Rep. 6, Computer Science, University of California, Berkeley.
11. LI, T. Y. AND ZENG, Z. 2003. A rank-revealing method and its applications. SIAM J. Matrix Annal. Appli., to appear.
12. LOIZOU, G. 1983. Higher-order iteration functions for simultaneously approximating polynomial zeros. Intern. J. Comput. Math. 14, 45-58.
13. MCNAMEE, J. 1993. A bibliography on roots of polynomials. J. Comput. Appl. Math. 47, 391-394.
14. MIYAKODA, T. 1989. Iterative methods for multiple zeros of a polynomial by clustering. J. Comput. Appl. Math. 28, 315-326.
15. PAN, V. Y. 1997. Solving polynomial equations: some history and recent progress. SLAM Review 39, 187-220.
16. PETKOVIĆ, M. 1989. Iterative Methods for Simultaneous Inclusion of Polynomial zeros, Lecture Notes in Mathematics, 1387. Springer-Verlag.
17. STOLAN, J. A. 1995. An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros. J. Comput. Appl. Math. 64, 247-268.
18. TOH, K. C. AND TREFETHEN, L. N. 1994. Pseudozeros of polynomials and pseudospectra of companion matrices. Numer. Math. 68, 403-425.
19. 2) time. Linear and Multilinear Algebra 46, 327-359.
20. ZENG, Z. 2003. Computing multiple roots of inexact polynomials. Math. Comp., to appear.
21. ZHANG, H. 2001. Numerical condition of polynomials in different forms. Elec. Trans. Numer. Anal. 12, 66-87.