Inverse Power and Durand-Kerner Iterations for Univariate Polynomial Root-Finding

Computers and Mathematics with Applications

Volumn 47, Issue 2-3, 2004, Pages 447-459

  Bini, D A ^a   Gemignani, L ^a   Pan, V Y ^b  

^a UNIVERSITY OF PISA   (Italy)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Generalized companion matrices; Higher order root finders; Inverse power iteration; Matrix methods for root finding; Polynomial root finding; Weierstrass (Durand Kerner) algorithm

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; INVERSE PROBLEMS; ITERATIVE METHODS; MATRIX ALGEBRA;

GENERALIZED MATRICES; INVERSE POWER ITERATION; MATHEMATICAL ROOTS; POLYNOMIAL ROOT-FINDING; WEIERSTRASS ALGORITHM;

POLYNOMIAL APPROXIMATION;

EID: 1242307407     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0898-1221(04)90037-5     Document Type: Article

References (29)

1. J.M. McNamee, Bibliography on roots of polynomials, J. Comp. Appl. Math. 47, 391-394, (1993).
2. J.M. McNamee, A supplementary bibliography on roots of polynomials, J. Computational Applied Mathematics 78 (1), (1997); http://www.elsevier.nl/homepage/sac/cam/mcnamee/index.html.
3. V.Y. Pan, Solving a polynomial equation: Some history and recent progress, SIAM Review 30 (2), 187-220, (1997).
4. th Ann. ACM Symp. on Theory of Computing, pp. 741-750, ACM Press, New York, (May 1995).
5. V.Y. Pan, Univariate polynomials: Nearly optimal algorithms for factorization and rootfinding, In Proc. Intern. Symposium on Symbolic and Algorithmic Computation (ISSAC '01), pp. 253-267, ACM Press, New York, (2001).
6. V.Y. Pan, Univariate polynomials: Nearly optimal algorithms for factorization and rootfinding, Journal of Symbolic Computations 33 (5), 701-733, (2002).
7. M.S. Petkovic, D. Herceg and S. Illic, Safe convergence of simultaneous method for polynomials zeros, Numer. Algorithms 17, 313-331, (1998).
8. M. Fiedler, Expressing a polynomial as the characteristic polynomial of a symmetric matrix, Linear Algebra Appl. 141, 265-270, (1990).
9. K.C. Toh and L.N. Trefethen, Pseudozeros of polynomials and pseudospectra of companion matrices, Numerische Math. 68, 403-425, (1994).
10. A. Edelman and H. Murakami, Polynomial roots from companion matrix eigenvalues, Mathematics of Computation 64, 763-776, (1995).
11. F. Malek and R. Vaillancourt, Polynomial zerofinding iterative matrix algorithms, Computers Math. Applic. 29 (1), 1-13, (1995).
12. F. Malek and R. Vaillancourt, A composite polynomial zerofinding matrix algorithm, Computers Math. Applic. 30 (2), 37-47, (1995).
13. S. Fortune, Polynomial root finding using iterated eigenvalue computation, In Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC '01), pp. 121-128, ACM Press, New York, (2001).
14. S. Barnett, Congenial matrices, Linear Algebra Appl. 41, 277-298, (1981).
15. C. Carstensen, On a linear construction of companion matrices, Linear Algebra Appl. 149, 191-214, (1991).
16. C. Carstensen, Inclusion of the roots of a polynomial based on Gershgorin's theorem, Numerische Math. 59, 349-360, (1991).
17. D.A. Bini, Numerical computation of polynomial zeros by means of Aberth's method, Numerical Algorithms 13 (3-4), 179-200, (1996).
18. D.A. Bini and G. Fiorentino, Design, analysis, and implementation of a multiprecision polynomial rootfinder, Numerical Algorithms 23, 127-173, (2000).
19. M.-hi Kim and S. Sutherland, Polynomial root-finding algorithms and branched covers, SIAM J. on Computing 23 (2), 415-436, (1994).
20. J. Hubbard, D. Schleicher and S. Sutherland, How to find all roots of complex polynomials by Newton's method, Inventiones Math. 146, 1-33, (2001).
21. D.A. Bini and V.Y. Pan, Polynomial and Matrix Computations, Volume 2: Fundamental and Practical Algorithms, Birkhauser, Boston, MA (to appear).
22. L. Elsner, A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin theorem, Numer. Math. 21, 425-427, (1973).
23. C. Carstensen, On Grau's method for simultaneous factorization of polynomials, SIAM J. of Numerical Analysis 29 (2), 601-613, (1992).
24. G.H. Golub and C.F. Van Loan, Matrix Computations, Third Edition, The Johns Hopkins University Press, Baltimore, MD, (1996).
25. Y. Eidelman and I. Gohberg, Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices, Computers Math. Applic. 33 (4), 69-79, (1997).
26. N. Mastronardi, S. Chandrasekaran and S. Van Huffel, Fast and stable two-way algorithm for diagonal plus semi-separable systems of linear equations, Numer. Linear Algebra Appl. 8 (1), 7-12, (2001).
27. J.H. Wilkinson, Rounding Errors in Algebraic Processes, Notes on Applied Science No. 32, Her Majesty's Stationery Office, London, (1963); Prentince-Hall, Englewood Cliffs, NJ, U.S.A.
28. N.J. Higham, Accuracy and Stability of Numerical Algorithms, Second Edition, SIAM, Philadelphia, PA, (2002).
29. D.A. Bini, L. Gemignani and B. Meini, Computations with infinite Toeplitz matrices and polynomials, Linear Algebra Appl. 343/344, 21-61, (2002).