General polynomial roots and their multiplicities in O(N) memory and O(N2) time

Linear and Multilinear Algebra

Volumn 46, Issue 4, 1999, Pages 327-359

  Uhllg, Frank ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

Complexity; DQR algorithm; Eigenvalue; Euclidean algorithm; Operations count; Polynomial root; Root multiplicity; Tridiagonal matrix

Indexed keywords

EID: 0346549071     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: 10.1080/03081089908818625     Document Type: Article

References (36)

1. Bauhuber, F. (1970). Diskrete Verfahren zur Berechnung der Nullstellen von Polynomen, Computing, 5, 97-118.
2. Bini, D. and Pan, V. Y., Polynomial and Matrix Computations, 1, Birkhäuser, Basel, 1994, 390 p.
3. Brugnano, L. (1995). Numerical implementation of a new algorithm for polynomials with multiple roots, J. Difference Equ. Appl., 1, 187-207.
4. Brugnano, L. (1996). Errata to: Numerical implementation of a new algorithm for polynomials with multiple roots, J. Difference Equ. Appl., 2, 101.
5. Brugnano, L. and Trigiante, D. (1995). Polynomial roots: the ultimate answer?, Lin. Alg. Appl., 225, 207-219.
6. Cullum, J. K. and Willoughby, R. A. (1996). A QL procedure for computing the eigenvalues of complex symmetric tridiagonal matrices, SIAM J. Matr. Anal. Appl., 17, 83-109.
7. Cooley, J. W. and Tukey, J. W. (1965). An algorithm for the machine calculation of complex Fourier series, Math. Comp., 19, 297-301.
8. Cuppen, J. (1981). A divide and conquer method for the symmetric tridiagonal eigenproblem, Num. Math., 36, 177-195.
9. Durand, E., Solutions Numériques des Équations Algébriques, 1, Masson, Paris, 1960, 327 p.
10. Dejon, B. and Henrici, P., Constructive Aspects of the Fundamental Theorem of Algebra, Proceedings, Wiley-Interscience, 1969, 337 p.
11. Demmel, J. W., Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997, 419 p.
12. Edelman, A, and Murakami, H. (1995). Polynomial roots from companion matrix eigenvalues, Math. Comp., 64, 763-776.
13. Engeln-Müllges, G. and Uhlig, F., Numerical Algorithms with C, Springer Verlag, 1996, 596 p.;
14. Numerical Algorithms with FORTRAN, Springer Verlag, 1996, 602 p.
15. Fiedler, M. (1990). Expressing a polynomial as characteristic polynomial of a symmetric matrix, Lin. Alg. Appl., 141, 265-270.
16. Gauß, C. F., Demonstratio nova theorematis omnem functionem algebraicam rationalem integram unis variabilis in factures reales primi vel secundi gradus resolvi posse, Ph.D. Thesis, Universität Helmstedt, Germany, 1799; Werke, Vol. III, 1-31.
17. Gautschi, W. (1973). On the condition of algebraic equations, Num. Math., 21, 405-424.
18. Goedecker, S. (1994). Remark on algorithms to find roots of polynomials, SIAM J. Sci. Comput., 15, 1059-1063.
19. Golub, G. H. and van Loan, C. F., Matrix Computations, second edn., Johns Hopkins U Press, 1989, 642 p.
20. Henrici, P., Applied and Computational Complex Analysis, 1, John Wiley, New York, 1974, 682
21. Henrici, P. and Gargantini, I., Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, In: "Constructive Aspects of the Fundamental Theorem of Algebra" [10], Proceedings, Wiley-Interscience, 1969, pp. 77-113.
22. Householder, A. S., The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970, 216 p.
23. Jenkins, M. A. and Traub, J. F., An algorithm for the automatic general polynomial solver, In: "Constructive Aspects of the Fundamental Theorem of Algebra' [10], Proceedings, Wiley-Interscience, 1969, pp. 151-180.
24. Jessup, E. R. (1993). A case against the divide and conquer approach to the nonsymmetric eigenvalue problem, Appl. Num. Math., 12, 403-420.
25. Muller, D. E. (1956). A method for solving algebraic equations using an automatic computer, Math. Tables Aids Comp., 10, 208-215.
26. Pan, V. Y. (1995). Weyl's quadtree algorithm for the unsymmetric eigenvalue problem, Appl. Math. Lett., 8, 87-88.
27. Pan, V. Y. (1997). Solving the polynomial equation: some history and recent progress, SIAM Review, 39, 187-220.
28. Parlett, B. N., The Symmetric Eigenvalue Problem, Prentice-Hall, 1980, 348 p.
29. Schmeisser, G. (1993). A real symmetric tridiagonal matrix with a given characteristic polynomial, Lin. Alg. Appl., 193, 11-18.
30. Strassen, V. (1969). Gaussian elimination is not optimal, Num. Math., 13, 354-356.
31. Taussky, O. and Todd, J. (1991). Another look at a matrix of Marc Kac, Lin. Alg. Appl., 150, 341-360.
32. Uhlig, F. (1992). Are the coefficients of a polynomial well-conditioned functions of its roots? Num. Math., 61, 383-393.
33. Uhlig, F. (1997). The DQR algorithm, basic theory, convergence and conditional stability, Num. Math., 76, 515-553.
34. Watkins, D. S. (1995). Forward stability and transmission of shifts in the QR algorithm, SIAM J. Matrix Anal. Appl., 16, 467-487.
35. Weyl, H. (1924). Randbemerkungen zu Hauptproblemen der Algebra, II, Fundamentalsatz der Algebra und Grundlagen der Mathematik, Math. Z., pp. 131-151.
36. Zeng, Z., On ill-conditioned eigenvalues, multiple roots of polynomials and their accurate computations, manuscript, zzeng@neiu.edu