An efficient QR algorithm for a Hessenberg submatrix of a unitary matrix

Lecture Notes in Control and Information Sciences

Volumn 321, Issue , 2005, Pages 1-14

  Ammar, Gregory S ^a   Gragg, William B ^b   He, Chunyang ^c  

^a NORTHERN ILLINOIS UNIVERSITY   (United States)

^b NAVAL POSTGRADUATE SCHOOL   (United States)

^c UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL FILTERS; POLYNOMIALS;

AUTOREGRESSIVE FILTERS; CHARACTERISTIC POLYNOMIALS; COMPLEX PLANES; DESIGN AND IMPLEMENTATIONS; HESSENBERG MATRIX; QR ALGORITHMS; SUBUNITARY MATRICES; UNITARY MATRIX;

TIME SERIES ANALYSIS;

EID: 33947496596     PISSN: 01708643     EISSN: None     Source Type: Book Series    
DOI: 10.1007/10984413_1     Document Type: Article

References (26)

1. G. Ammar, D. Calvetti, W. Gragg, and L. Rcichel. Polynomial zerofinders based on Szego polynomials. J. Comput. Appl. Math., 127:1-16, 2001.
2. G. S. Ammar, D. Calvetti, and L. Reichel. Continuation methods for the computation of zeros of Szego polynomials. Lin. Alg. Appl., 249:125-155, 1996.
3. G. S. Ammar and W. B. Gragg. The generalized Schur algorithm for the superfast solution of Toeplitz systems. In J. Gilewicz, M. Pindor, and W. Siemaszko, editors, Rational Approximation and its Applications in Mathematics and Physics, number 1237 in Lecture Notes in Mathematics, pages 315-330. Springer-Verlag, Berlin, 1987.
4. G. S. Ammar and C. F. Martin. The geometry of matrix eigenvalue methods. Acta Applicandae Math., 5:239-278, 1986.
5. G. S. Ammar, L. Reichel, and D. C. Sorensen. An implementation of a divide and conquer algorithm for the unitary eigenproblem. ACM Trans. Math. Software, 18:292-307, 1992.
6. G. S. Ammar, L. Reichel, and D. C. Sorensen. Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem. ACM Trans. Math. Software, 20:161, 1994. (Mathematical software.).
7. A. Bunse-Gerstner and L. Elsner. Schur parameter pencils for the solution of the unitary eigenproblem. Lin. Alg. Appl., 154-156:741-778, 1991.
8. A. Bunse-Gerstner and C. He. On the Sturm sequence of polynomials for unitary Hessenberg matrices. SIAM J. Matrix Anal. Appl., 16(4):1043-1055, October 1995.
9. D. Calvetti, S.-M. Kim, and L. Reichel. The restarted QR-algorithm for eigenvalue computation of structured matrices. J. Comput. Appl. Math., 149:415-422, 2002.
10. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, third edition, 1996.
11. W. B. Gragg. The QR algorithm for unitary Hessenberg matrices. J. Comput. Appl. Math., 16:1-8, 1986.
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:183-198, 1993.
13. Originally published (in Russian) in: E.S. Nikolaev, Ed., Numerical Methods in Linear Algebra, Moscow Univ. Press, 1982, pp. 16-32.
14. W. B. Gragg. Stabilization of the uhqr algorithm. In Z. Chen, Y. Li, C. Micchelli, and Y. Xu, editors, Advances in Computational Mathematics: Proceedings of the Guangzhou International Symposium, pages 139-154, New York, 1999. Marcel Dekker.
15. W. B. Gragg and L. Reichel. A divide and conquer method for the unitary eigenproblem. In M. T. Heath, editor, Hypercube Multiprocessors 1987, Philadelphia, 1987. SIAM.
16. W. B. Gragg and L. Reichel. A divide and conquer method for unitary and orthogonal eigenproblems. Numer. Math., 57:695-718, 1990.
17. U. Grenander and G. Szego. Toeplitz Forms and Their Applications. Chelsea, New York, second edition, 1984.
18. M. Gu, R. Guzzo, X.-B. Chi, and X.-Q. Cao. A stable divide and conquer algorithm for the unitary eigenproblem. SIAM J. Matrix Anal. Appl., 25(2):385-404, 2003.
19. B. N. Parlett. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia, 1998.
20. G. W. Stewart. Introduction to Matrix Computations. Academic Press, New York, 1973.
21. M. Stewart. Stability properties of several variants of the unitary Hessenberg QR algorithm. In V. Olshevsky, editor, Structured Matrices in Mathematics, Engineering, and Computer Science II (Boulder, CO, 1999), volume 281 of Contemporary Math., pages 57-72, Providence, RI, 2001. Amer. Math. Soc.
22. M. Stewart. An error analysis of a unitary Hessenberg QR algorithm. Preprint, 2004.
23. G. Szego. Orthogonal Polynomials. American Math. Soc., Providence, RI, fourth edition, 1975.
24. T.-L. Wang and W. B. Gragg. Convergence of the shifted QR algorithm for unitary Hessenberg matrices. Math. Comp., 71:1473-1496, 2002.
25. T.-L. Wang and W. B. Gragg. Convergence of the unitary QR algorithm with a unimodular Wilkinson shift. Math. Comp., 72:375-385, 2003.
26. D. S. Watkins. Fundamentals of Matrix Computations. John Wiley and Sons, New York, 1991.