A fast implicit QR eigenvalue algorithm for companion matrices

Linear Algebra and Its Applications

Volumn 432, Issue 8, 2010, Pages 2006-2031

  Bini, D A ^a   Boito, P ^a   Eidelman, Y ^b   Gemignani, L ^a   Gohberg, I ^b  

^a UNIVERSITY OF PISA   (Italy)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Companion matrix; Complexity; Eigenvalue computation; QR iteration; Quasiseparable structure

Indexed keywords

COMPANION MATRIX; EIGENVALUE ALGORITHMS; EIGENVALUE COMPUTATION; EIGENVALUES; MATRIX; MEMORY STORAGE; NUMERICAL EXPERIMENTS; QR ITERATIONS;

CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 75749127295     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2009.08.003     Document Type: Article

References (18)

1. Ammar G.S., Gragg W.B., and He C. An efficient QR algorithm for a Hessenberg submatrix of a unitary matrix. New Directions and Applications in Control Theory. Lecture Notes in Control and Information Science vol. 321 (2005), Springer, Berlin 1-14
2. In: Bai Z., Demmel J., Dongarra J., Ruhe A., and van der Vorst H. (Eds). Templates for the Solution of Algebraic Eigenvalue Problems. Software, Environments, and Tools vol. 11 (2000), Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA A practical guide
3. Bini D.A., Eidelman Y., Gemignani L., and Gohberg I. The unitary completion and QR iterations for a class of structured matrices. Math. Comp. 77 261 (2008) 353-378
4. Bini D.A., Eidelman Y., Gemignani L., and Gohberg I. Fast QR eigenvalue algorithms for Hessenberg matrices which are rank-one perturbations of unitary matrices. SIAM J. Matrix Anal. Appl. 29 2 (2007) 566-585
5. Bini D.A., Gemignani L., and Pan V.Y. Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations. Numer. Math. 100 3 (2005) 373-408
6. Chandrasekaran S., Gu M., Xia J., and Zhu J. A fast QR algorithm for companion matrices. Recent Advances in Matrix and Operator Theory. Oper. Theory Adv. Appl. vol. 179 (2008), Birkhäuser, Basel 111-143
7. Eidelman Y., Gemignani L., and Gohberg I. On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms. Linear Algebra Appl. 420 (2007) 86-101
8. Eidelman Y., Gemignani L., and Gohberg I. Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations. Numer. Algorithms 47 1 (2008) 253-273
9. Eidelman Y., Gohberg I., and Olshevsky V. The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order. Linear Algebra Appl. 404 (2005) 305-324
10. Francis J.G.F. The QR transformation: a unitary analogue to the LR transformation. I. Comput. J. 4 (1961/1962) 265-271
11. Francis J.G.F. The QR transformation. II. Comput. J. 4 (1961/1962) 332-345
12. Golub G.H., and Van Loan C.F. Matrix Computations. third ed. Johns Hopkins Studies in the Mathematical Sciences (1996), Johns Hopkins University Press, Baltimore, MD
13. Jenkins M.A., and Traub J.F. Principles for testing polynomial zerofinding programs. ACM Trans. Math. Software 1 (1975) 26-34
14. Press W.H., Teukolsky S.A., Vetterling W.T., and Flannery B.P. Numerical Recipes. third ed. (2007), Cambridge University Press, Cambridge The art of scientific computing
15. F. Tisseur, Backward stability of the QR algorithm, Technical Report 239, UMR 5585 Lyon Saint-Etienne, 1996.
16. M. Van Barel, P. Van Dooren, R. Vandebril, Computing the eigenvalues of a companion matrix, in: Slides of the Talk on the Conference Structured Linear Algebra Problems: Analysis, Algorithms, and Applications, Cortona, Italy, September 15-19, 2008. .
17. Watkins D.S. Fundamentals of Matrix Computations. second ed. Pure and Applied Mathematics (2002), Wiley-Interscience [John Wiley & Sons], New York
18. Wilkinson J.H. The Algebraic Eigenvalue Problem (1965), The Oxford University Press