1 |
L. Trefethen and D. Bau III. Numerical Linear Algebra. SIAM, 1997.
|
2 |
D. Watkins. Understanding the qr algorithm. SIAM Review, 24:427–439, 1982.
DOI
ScienceOn
|
3 |
D. Watkins. Qr-like algorithms for eigenvalue problems. J. Comput. Appl. Math., 123:67–83, 2000.
DOI
ScienceOn
|
4 |
J. Francis. The qr transformation i. Comput. J., 4:265–271, 1961.
DOI
|
5 |
J. Francis. The qr transformation ii. Comput. J., 4:332–345, 1961.
|
6 |
G. Golub and C. Loan. Matrix Computations. The John Hopkins University Press, 1989.
|
7 |
B. Kagstrom and A. Ruhe. Matrix pencils. Springer-Verlag Lecture Notes in Mathematics, 973, 1983.
|
8 |
V. Kublanovskaya. On some algorithms for the solution of the complete eigenvalue problem. USSR Comput. Math. Math. Phys., 3:637–657, 1961.
|
9 |
R. Burnside and P. Guest. A simple proof of the transposed qr algorithm. SIAM Review, 38:306–308, 1996.
DOI
ScienceOn
|
10 |
G. Ammar, D. Calvetti, W. Gragg, and L. Reichel. Polynomial zerofinders based on szego polynomials. J. Comput. Appl. Math., 127:1–16, 2001.
DOI
ScienceOn
|
11 |
D. Calvetti, S. Kim, and L. Reichel. The restarted qr-algorithm for eigenvalue computation of structured matrices. J. Comput. Appl. Math., 149:415–422, 2002.
DOI
ScienceOn
|