The amended DSeSC power method for polynomial root-finding

Computers and Mathematics with Applications

Volumn 49, Issue 9-10, 2005, Pages 1515-1524

  Pan, V Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Frobenius matrices; Polynomial roots; Repeated squaring; Root clusters

Indexed keywords

ALGORITHMS; DIFFERENCE EQUATIONS; INTEGRODIFFERENTIAL EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING; TOPOLOGY;

FROBENIUS MATRICES; POLYNOMIAL ROOTS; REPEATED SQUARING; ROOT CLUSTER;

POLYNOMIALS;

EID: 23344435553     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2004.09.011     Document Type: Article

References (25)

1. V.Y. Pan Solving a polynomial equation: Some history and recent progress SIAM Review 39 2 1997 187 220
2. B. Mourrain, and V.Y. Pan Multivariate polynomials, duality and structured matrices J. of Complexity 16 1 2000 110 180
3. J.M. McNamee Bibliography on roots of polynomials J. Comp. Appl. Math. 47 1993 391 394
4. http://www.elsevier.nl/homepage/sac/cam/mcnamee/index.html J.M. McNamee A supplementary bibliography on roots of polynomials J. Computational Applied Mathematics 78 1 1997
5. J.M. McNamee A 2002 updated supplementary bibliography on roots of polynomials J. Computational Applied Mathematics 110 2002 305 306
6. J.M. McNamee A 2000 updated supplementary bibliography on roots of polynomials J. Computational Applied Mathematics 142 2000 433 434
7. D.A. Bini, L. Gemignani, and V.Y. Pan Improved initialization of the accelerated and robust QR-like polynomial root-finding Electronic Transaction on Numerical Analysis 17 2004 195 205
8. Preprint V.Y. Pan, B. Murphy, R.E. Rosholt, Y. Tang, X. Wang, and X. Yan Root-finding via eigen-solving 2005
9. th Ann. ACM Symp. on Theory of Computing 1995 ACM Press New Delhi 741 750
10. V.Y. Pan Optimal and nearly optimal algorithms for approximating polynomial zeros Computers Math. Applic. 31 12 1996 97 138
11. V.Y. Pan Univariate polynomials: Nearly optimal algorithms for factorization and rootfinding Journal of Symbolic Computations 33 5 2002 701 733
12. (to appear); also, see Technical Report 1470 D.A. Bini, L. Gemignani, and V.Y. Pan Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations July Numericshe Math. 2003 Department of Math., University of Pisa New York
13. A.S. Householder The Numerical Treatment of a Single Nonlinear Equation 1970 McGraw-Hill Pisa, Italy
14. J. Sebastiao e Silva Sur une méthode d'approximation semblable a celle de Graeffe Portugal Math 2 1941 271 279
15. A.S. Householder Generalization of an algorithm by Sebastiao e Silva Numerische Math 16 1971 375 382
16. J.P. Cardinal, On two iterative methods for approximating the roots of a polynomial (Edited by J. Renegar M. Shub S. Smale), Park City, UT, 1995;
17. Lectures in Applied Mathematics, Volume 32, pp. 165-188, American Mathematical Society, Providence, RI, (1996).
18. G.H. Golub, and C.F. Van Loan Matrix Computations Third Edition 1996 Johns Hopkins University Press Providence, RI
19. G.W. Stewart Matrix Algorithms, Vol. II, Eigensystems 1998 SIAM Baltimore, MD
20. D.A. Bini, L. Gemignani, and V.Y. Pan Inverse power and Durand/Kerner iteration for univariate polynomial root-finding Computers Math. Applic. 47 2/3 2004 447 459
21. R.M. Corless, P.M. Gianni, B.M. Trager, and S.M. Watt The singular value decomposition for polynomial systems Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC'95) 1995 ACM Press Philadelphia, PA 195 207
22. V.Y. Pan Computation of approximate polynomial GCDs and an extension Information and Computation 167 2001 71 85
23. A.L. Toom The complexity of a scheme of functional elements realizing the multiplication of integers Soviet Mathematics Doklady 3 1963 714 715
24. V.Y. Pan Structured Matrices and Polynomials: Unified Superfast Algorithms 2001 Birkhäuser/Springer New York
25. D. Bini, and V.Y. Pan Polynomial and Matrix Computations, Vol. 1: Fundamental Algorithms 1994 Birkhäuser Boston, MA