Polynomial zerofinders based on Szego polynomials

Journal of Computational and Applied Mathematics

Volumn 127, Issue 1-2, 2001, Pages 1-16

  Ammar, G S ^a   Calvetti, D ^b   Gragg, W B ^c   Reichel, L ^d  

^a NORTHERN ILLINOIS UNIVERSITY   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

^c NAVAL POSTGRADUATE SCHOOL   (United States)

^d KENT STATE UNIVERSITY   (United States)

Author keywords

Companion matrix; Continuation method; Eigenvalue problem; Parallel computation; Szego Hessenberg matrix

Indexed keywords

COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; POLES AND ZEROS; PROBLEM SOLVING;

SZEGO POLYNOMIALS; SZEGO-HESSENBERG MATRIX;

POLYNOMIALS;

EID: 0035151524     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00491-X     Document Type: Article

References (27)

1. Akhiezer N.I. The Classical Moment Problem. 1965;Oliver & Boyd, London.
2. Ammar G.S., Calvetti D., Reichel L. Continuation methods for the computation of zeros of Szego polynomials. Linear Algebra Appl. 249:1996;125-155.
3. G.S. Ammar, W.B. Gragg, L. Reichel, On the eigenproblem for orthogonal matrices, in: Proceedings of the 25th IEEE Conference on Decision and Control, Athens, 1986, Institute for Electrical and Electronic Engineers, New York, 1986, pp. 1963-1966.
4. Ammar G.S., Reichel L., Sorensen D.C. An implementation of a divide and conquer algorithm for the unitary eigenproblem. ACM Trans. Math. Software. 18:1992;292-307.
5. Ammar G.S., Reichel L., Sorensen D.C. Algorithm 730. ACM Trans. Math. Software. 20:1994;161.
6. Bunse-Gerstner A., Elsner L. Schur parameter pencils for the solution of the unitary eigenproblem. Linear Algebra Appl. 154-156:1991;741-778.
7. Edelman A., Murakami H. Polynomial roots from companion matrix eigenvalues. Math. Comp. 64:1995;763-776.
8. Gautschi W. On the condition of algebraic equations. Numer. Math. 21:1973;405-424.
9. W. Gautschi, Question of numerical condition related to polynomials, in: G.H. Golub (Ed.), Studies in Numerical Analysis, The Mathematical Association of America, Washington, D.C., 1984, pp. 140-177.
10. Goedecker S. Remark on algorithms to find roots of polynomials. SIAM J. Sci. Comput. 15:1994;1059-1063.
11. W.B. Gragg, Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle, J. Comput. Appl. Math. 46 (1993) 183-198. (This is a slight revision of a paper originally published (in Russian) E.S. Nikolaev (Ed.), Numerical Methods in Linear Algebra, Moscow University Press, Moscow, 1982, pp. 16-32.
12. W.B. Gragg, Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle, J. Comput. Appl. Math. 46 (1993) 183-198. (This is a slight revision of a paper originally published (in Russian) E.S. Nikolaev (Ed.), Numerical Methods in Linear Algebra, Moscow University Press, Moscow, 1982, pp. 16-32.
13. Gragg W.B. The QR algorithm for unitary Hessenberg matrices. J. Comput. Appl. Math. 16:1986;1-8.
14. Gragg W.B. Stabilization of the UHQR algorithm. Chen Z., Li Y., Micchelli C., Xu Y. Advances in Computational Mathematics. Lecture Notes in Pure and Applied Mathematics. Vol. 202:1999;139-154 Marcel Dekker, Hong Kong.
15. Gragg W.B., Reichel L. A divide and conquer method for the unitary eigenproblem. Heath M.T. Hypercube Multiprocessors 1987. 1987;639-647 SIAM, Philadelphia, PA.
16. Gragg W.B., Reichel L. A divide and conquer method for unitary and orthogonal eigenproblems. Numer. Math. 57:1990;695-718.
17. Grenander U., Szego G. Toeplitz Forms and Applications. 1984;Chelsea, New York.
18. Henrici P. Applied and Computational Complex Analysis, Vol. 1. 1974;Wiley, New York.
19. Jenkins M.A., Traub J.F. A three-stage variable shift iteration for polynomial zeros and its relation to generalized Ritz iteration. Numer. Math. 14:1970;252-263.
20. Lehmer D.H. A machine method for solving polynomial equations. J. Assoc. Comput. Mach. 8:1961;151-162.
21. Li T.-Y., Zeng Z. Homotopy-determinant algorithm for solving nonsymmetric eigenvalue problems. Math. Comp. 59:1992;483-502.
22. J.M. McNamee, An updated supplementary bibliography on roots of polynomials, J. Comput. Appl. Math. 110 (1999) 305-306. (This reference discusses the bibliography. The actual bibliography is available on the world wide web at http: // www.elsevier.nl / locate / cam .).
23. Moler C. Cleve's corner: roots - of polynomials, that is. The MathWorks Newsletter. 5(1):1991;8-9.
24. Ostrowski A.M. A method for automatic solution of algebraic equations. Dejon B., Henrici P. Constructive Aspects of the Fundamental Theorem of Algebra. 1969;209-224 WileyInterscience, London.
25. Parks T.W., Burrus C.S. Digital Filter Design. 1987;Wiley, New York.
26. Smith B., Boyle J., Ikebe Y., Klema V., Moler C. Matrix Eigensystem Routines: EISPACK Guide. 2nd Edition:1976;Springer, Berlin.
27. Stoer J., Bulirsch R. Introduction to Numerical Analysis. 2nd Edition:1993;Springer, New York.