The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments

IMA Journal of Numerical Analysis

Volumn 29, Issue 3, 2009, Pages 467-485

  Golub, Gene ^a   Uhlig, Frank ^b  

^a Stanford University   (United States)

^b AUBURN UNIVERSITY   (United States)

Author keywords

Francis Implicit Q Theorem; History of computation; History of math; John Francis; Matrix computation; Matrix eigenvalue; Matrix eigenvector; Numerical algorithm; QR algorithm; Vera Kublanovskaya

Indexed keywords

COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS;

FRANCIS IMPLICIT Q THEOREM; JOHN FRANCIS; MATRIX COMPUTATION; MATRIX EIGENVALUES; NUMERICAL ALGORITHMS; QR ALGORITHMS; VERA KUBLANOVSKAYA;

MATRIX ALGEBRA;

EID: 67651213594     PISSN: 02724979     EISSN: 14643642     Source Type: Journal    
DOI: 10.1093/imanum/drp012     Document Type: Article

References (94)

1. (1916-1975) Catalogue of the Papers and Correspondence of Christopher Strachey. Reference NCUACS 71.1.80 (Administrative history). Bodleian Library, Special Collections, Oxford University. Available at http://www. nationalarchives.gov.uk/a2a/records.aspx?cat =161-csac71180.
2. Editorial. (2000). Higher-Order Symbolic Comput., 13, 5-6.
3. BJÖRN ADLERBORN, BO KÅ GSTRÖM & DANIEL KRESSNER (2008) Parallel variants of the multishift QZ algorithm with advanced deflation techniques. Applied Parallel Computing. State of the Art in Scientific Computing, vol. 4699. Lecture Notes in Computer Science. Springer, pp. 117-126.
4. ILAN BAR-ON & BRUNO CODENOTTI (1995) A fast and stable parallel QR algorithm for symmetric tridiagonal matrices. Linear Algebra Appl., 220, 63-95.
5. PETER BENNER, HEIKE FAßBENDER & DAVID S. WATKINS (1998) Two connections between the SR and HR eigenvalue algorithms. Linear Algebra Appl., 272, 17-32.
6. PETER BENNER, HEIKE FAßBENDER & DAVID S. WATKINS (1999) SR and SZ algorithms for the symplectic (butterfly) eigenproblem. Linear Algebra Appl., 287, 41-76.
7. DAVID BINDEL, SHIV CHANDRASEKARAN, JAMES DEMMEL, DAVID GARMIRE & MING GU (2005) A fast and stable nonsymmetric eigensolver for certain structured matrices. Technical Report. Berkeley, CA: University of California.
8. DARIO BINI, YULI EIDELMAN, LUCA GEMIGNANI & ISRAEL GOHBERG (2007) Fast QR eigenvalue algorithms for Hessenberg matrices which are rank-one perturbations of unitary matrices. SIAM J. Matrix Anal. Appl., 29, 566-585.
9. DARIO BINI, LUCA GEMIGNANI & VICTOR PAN (2003) QR-like algorithms for generalized semiseparable matrices. Technical Report 1470. Pisa: Department of Mathematics, University of Pisa.
10. DARIO BINI, LUCA GEMIGNANI & VICTOR PAN (2005) Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations. Numer. Math., 100, 373-408.
11. DANIEL BOLEY, ROBERT MAIER & JOUNG KIM (1989) A parallel QR algorithm for the nonsymmetric eigenvalue problem. Comput. Phys. Commun., 53, 61-70.
12. KAREN BRAMAN, RALPH BYERS & ROY MATHIAS (2002a) The multishift QR algorithm. Part I: maintaining well-focused shifts and level 3 performance. SIAM J. Matrix Anal. Appl., 23, 929-947.
13. KAREN BRAMAN, RALPH BYERS & ROY MATHIAS (2002b) The multishift QR algorithm. Part II: aggressive early deflation. SIAM J. Matrix Anal. Appl., 23, 948-973.
14. ANGELIKA BUNSE-GERSTNER (1981) An analysis of the HR algorithm for computing the eigenvalues of a matrix. Linear Algebra Appl., 35, 155-173.
15. ANGELIKA BUNSE-GERSTNER (1986) Symplectic QR-like methods. Habilitationsschrift, University of Bielefeld, Germany.
16. ANGELIKA BUNSE-GERSTNER, RALPH BYERS & VOLKER MEHRMANN (1992) A chart of numerical methods for structured eigenvalue problems. SIAM J. Matrix Anal. Appl., 13, 419-453.
17. ANGELIKA BUNSE-GERSTNER & VOLKER MEHRMANN (1986) A symplectic QR like algorithm for the solution of the real algebraic Ricatti equation. IEEE Trans. Autom. Control, 31, 1104-1113.
18. ANGELIKA BUNSE-GERSTNER, VOLKER MEHRMANN & DAVID S. WATKINS (1989) An SR algorithm for Hamiltonian matrices based on Gaussian elimination. Methods Oper. Res., 58, 339-358.
19. HENDRIK JAN BUUREMA (1970) A geometric proof of convergence for the QR method. Ph.D. Thesis, Rijksuni-versiteit te Groningen, The Netherlands.
20. RALPH BYERS (1986) A Hamiltonian QR algorithm. SIAM J. Sci. Stat. Comput., 7, 212-229.
21. É LIE JOSEPH CARTAN (1938) La Théorie des Spineurs I, II. Actualités Scientifiques et Industrielles, nos 643 and 701. Paris: Hermann.
22. SHIV CHANDRESEKARAN, MING GU, JIANLIN XIA & JIANG ZHU (2008) A fast QR algorithm for companion matrices. Recent Advances in Matrix and Operator Theory. Operator Theory: Advances and Applications, vol. 179. Basel: Birkhäuser, pp. 111-143.
23. BARRY A. CIPRA (2000) The best of the 20th century: editors name top 10 algorithms. SIAM News, 33. Available at http://www.siam.org/news/news.php?id=637.
24. PERCY DEIFT, JAMES DEMMEL, CHAU LI & CARLOS TOMEI (1991) The bidiagonal singular value decomposition and Hamiltonian mechanics. SIAM J. Numer. Anal., 28, 1463-1516.
25. STEVEN DELVAUX & MARC VAN BAREL (2008) A QR-based solver for rank structured matrices. SIAM J. Matrix Anal. Appl., 30, 464-490.
26. JAMES DEMMEL (1992) The Inherent Inaccuracy of Implicit Tridiagonal QR, vol. 963. Minneapolis, MN: IMA Preprint Series, Institute for Mathematics and its Applications, University of Minnesota.
27. JAMES DEMMEL & WILLIAM KAHAN (1990) Accurate singular values of bidiagonal matrices. SIAM J. Sci. Stat. Comput., 11, 873-912.
28. 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem. Ph.D. Thesis, University of California, Berkeley, CA.
29. INDERJIT S. DHILLON, GEORGE FANN & BERESFORD N. PARLETT (1997) Application of a new algorithm for the symmetric eigenproblem to computational quantum chemistry. Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing. Minneapolis.
30. JEAN DIEUDONNÉ (1948) Sur les Groupes Classiques. Actualités Scientifiques et Industrielles, no. 1040. Paris: Hermann.
31. JACK DONGARRA & FRANCIS SULLIVAN (2000) The top 10 algorithms. Comput. Sci. Eng., 2, 22-23.
32. YULI EIDELMAN, LUCA GEMIGNANI & ISRAEL GOHBERG (2008) Efficient eigenvalue computation for quasi-separable Hermitian matrices under low rank perturbations. Numer. Algorithms, 47, 253-273.
33. YULI EIDELMAN, ISRAEL GOHBERG & VADIM OLSHEVSKY (2005) The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order. Linear Algebra Appl., 404, 305-324.
34. ERIK ELMROTH & FRED GUSTAVSON (2000) Applying recursion to serial and parallel QR factorization leads to better performance. IBM J. Res. Dev., 44, 605-624.
35. ERIK ELMROTH & FRED GUSTAVSON (2001) High-performance library software for QR factorization. Applied Parallel Computing. New Paradigms for HPC in Industry and Academia. Lecture Notes in Computer Science, vol. 1947. Springer, pp. 53-63.
36. SAID ELNASHAIE, FRANK UHLIG & CHADIA AFFANE (2007) Numerical Techniques and MATLAB Codes for Chemical and Biological Engineers, A Simple Bifurcation Approach. Springer.
37. DIMITRI K. FADDEEV & VERA NIKOLAEVNA FADDEEVA (1963) Computational Methods of Linear Algebra, vol. 28 (in Russian) pp. 734. [MR 061454, #666897].
38. HEIKE FASSBENDER (2000) Symplectic Methods for the Symplectic Eigenproblem. New York: Kluwer.
39. HEIKE FASSBENDER (2006) A detailed derivation of the parameterized SR algorithm and the symplectic Lanc-zos method for Hamiltonian matrices. Technical Report. Germany: Institut Computational Mathematics, TU Braunschweig, Germany.
40. HEIKE FASSBENDER (2007) The parameterized SR algorithm for Hamiltonian matrices. ETNA, 26, 121-145.
41. K. VINCE FERNANDO & BERESFORD N. PARLETT (1994) Accurate singular values and differential qd algorithms. Numer. Math., 67, 191-229.
42. CHARLES T. FIKE (1959) Note on the practical computation of proper values. J. Assoc. Comput. Mach., 6, 360-362.
43. JOHN G. F. FRANCIS (1961/1962a) The QR transformation, a unitary analogue to the LR transformation - part 1. Comput. J., 4, 265-271. [MR 0130111, vol. 23 #B3143], [Zbl 0104.34304].
44. JOHN G. F. FRANCIS (1961/1962b) The QR transformation - part 2. Comput. J., 4, 332-345. [MR 0137289, vol. 25 #744], [Zbl 0104.34304].
45. LUCA GEMIGNANI (1999) Fast QR factorization of low-rank changes of Vandermonde-like matrices. CALCOLO, 36, 1-15.
46. LUCA GEMIGNANI & FRANK UHLIG (2009) Numerical behavior of the DQR method for rank-structured matrices (submitted).
47. GENE GOLUB, BO KÅ GSTRÖM, AXEL RUHE & PAUL VAN DOREN (1990) Dedication to Vera N. Kublanovskaya on her 70th birthday. SIAM J. Matrix Anal. Appl., 11, vii-ix.
48. GENE GOLUB & WILLIAM KAHAN (1965) Calculating the singular values and pseudo-inverse of a matrix. J. SIAM Numer. Anal. Ser. B, 2, 205-224.
49. MIKE GORDON (2000) Christopher Strachey: recollection of his influence. Higher-Order Symbolic Comput., 13, 65-67.
50. BRIAN GUNTER & ROBERT VAN DE GEIJN (2005) Parallel out-of-core computation and updating of the QR factorization. ACM Trans Math. Softw., 31, 60-78.
51. GREG HENRY & ROBERT VAN DE GEIJN (1996) Parallelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: myths and reality. SIAM J. Sci. Comput., 17, 870-883.
52. GREG HENRY, DAVID WATKINS & JACK DONGARRA (2002) A parallel implementation of the nonsymmetric QR algorithm for distributed memory architectures. SIAM J. Sci. Comput., 24, 284-311.
53. MAGNUS R. HESTENES & EDUARD STIEFEL (1952) Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand., 49, 409-436.
54. NICHOLAS J. HIGHAM (2003) SIAG/LA prize winners speed up QR algorithm. SIAM News, 36.
55. ALSTON S. HOUSEHOLDER (1964) The Theory of Matrices in Numerical Analysis. New York: Blaisdell.
56. BO KÅ GSTRÖM & AXEL RUHE (1980) An algorithm for the numerical computation of the Jordan normal form of a complex matrix. ACM Trans. Math. Softw., 6, 398-419.
57. T. YA. KONKOVA, V. N. SIMONOVA & VLADIMIR B. KHAZANOV (2003) Vera Nikolaevna Kublanovskaya. Short biography. J. Math. Sci., 114, 1755-1756.
58. DANIEL KRESSNER (2005) Numerical Methods for General and Structured Eigenvalue Problems. Springer.
59. VERA N. KUBLANOVSKAYA (1961a) Certain algorithms for the solution of the complete eigenvalue problem. Dokl. Akad. Nauk. SSSR, 136, 26-28 (in Russian). English translation in Soviet Math. Dokl., 2 (1961), 17-19. [MR 0142195, vol. 25, #5588], [Zbl 0104.10102].
60. VERA N. KUBLANOVSKAYA (1961b) Some algorithms for the solution of the complete eigenvalue problem. Z. Vycisl. Mat. i Mat. Fiz., 1, 555-570 (in Russian). [MR0136058, vol. 24, #2097], [Zbl 0128.11702].
61. VERA N. KUBLANOVSKAYA (1962) The solution of the eigenvalue problem for an arbitrary matrix. Trudy Mat. Inst. Steklov., 66, 113-135 (in Russian). [MR0150940, vol. 27, #B929], [Zbl 0131.14205].
62. VERA N. KUBLANOVSKAYA (1968) On a method for solving the complete eigenvalue problem for a degenerate matrix. Z. Vycisl. Mat. i Mat. Fiz., 6, 611-620 (in Russian). English translation in USSR Comput. Math. Math. Phys., 6 (1966), 1-14. [Zbl 0171.36003].
63. VERA N. KUBLANOVSKAYA & VLADAMIR B. KHAZANOV (1988a) Spectral problems for matrix pencils. Methods and algorithms. I. Sov. J. Numer. Anal. Math. Model., 3, 337-371 (in Russian).
64. VERA N. KUBLANOVSKAYA & VLADAMIR B. KHAZANOV (1988b) Spectral problems for matrix pencils. Methods and algorithms. II. Sov. J. Numer. Anal. Math. Model., 3, 467-485 (in Russian).
65. VERA N. KUBLANOVSKAYA, VLADAMIR B. KHAZANOV & VLADAMIR A. BELIY (1989) Spectral problems for matrix pencils. Methods and algorithms. III. Sov. J. Numer. Anal. Math. Model., 4, 19-51 (in Russian).
66. CORNELIUS LANCZOS (1950) An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand., 45, 255-282.
67. NICOLA MASTRONARDI,DANIEL KRESSNER, VASILE SIMA, PAUL VAN DOOREN &SABINE VAN HUFFEL (2001) A fast algorithm for subspace state-space system identification via exploitation of the displacement structure. J. Comput. Appl. Math., 132, 71-81.
68. GEORGE S. MIMINIS & CHRIS C. PAIGE (1988) A direct algorithm for pole assignment of time invariant multi-input linear systems using state feedback. Automatica, 24, 343-356.
69. CLEVE B. MOLER & G. W. STEWART (1973) An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal., 10, 241-256.
70. ROBERT W. NUMRICH (2008) Dimensional analysis applied to a parallel QR algorithm. Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science, vol. 4967. Springer, pp. 148-155.
71. BERESFORD PARLETT (2000) The QR algorithm. Comput. Sci. Eng., 2, 38-42.
72. ROGER PENROSE (2000) Reminiscences of Christopher Strachey. Higher-Order And Symbolic Computation, 13, 83-84.
73. HEINZ RUTISHAUSER (1954a) Der Quotienten-Differenzen- Algorithmus. Z. Angew. Math. Phys., 5, 233-251 (in German). [MR0063763 (16,176c)], [Zbl 0055.34702].
74. HEINZ RUTISHAUSER (1954b) Anwendungen des Quotienten-Differenzen-Algorithmus. Z. Angew. Math. Phys., 5, 496-508 (in German). [MR0068314 (16,863c)], [Zbl 0056.35001].
75. HEINZ RUTISHAUSER (1955) Une méthode pour la détermination des valeurs propres d'une matrice. C. R. Acad. Sci., 240, 34-36 (in French). [MR0067844 (16,785c)], [Zbl 0056.35002].
76. HEINZ RUTISHAUSER (1958) Solution of eigenvalue problems with the LR-transformation. Nat. Bur. Stand. Appl. Math. Ser., 49, 47-81. [MR0090118 (19,770c)], [Zbl 0123.11303].
77. HEINZ RUTISHAUSER (1960) Über eine kubisch konvergente Variante der LR-Transformation. Z. Angew. Math. Mech., 40, 49-54 (in German). [MR0114295 (22 #5119)], [Zbl 0128.11701].
78. HEINZ RUTISHAUSER & FRIEDRICH L. BAUER (1955) Détermination des vecteurs propres d'une matrice par une méthode itérative avec convergence quadratique. C. R. Acad. Sci., 240, 1680-1681 (in French). [MR0070269 (16,1157a)].
79. PETER SCHERK (1950) On the decomposition of orthogonalities into symmetries. Proc. Am. Math. Soc., 1, 481-491.
80. HERMANN AMADEUS SCHWARZ (1885) Über ein die Flächen kleinsten Flächeninhalts betreffendes Problem der Variationsrechnung. Acta Soc. Sci. Fennicae, 15, 315-362.
81. G. W. STEWART (1973) Introduction to Matrix Computations. New York: Academic Press.
82. EDUARD STIEFEL (1953) Zur Interpolation von tabellierten Funktionen durch Exponentialsummen und zur Berech-nung von Eigenwerten aus den Schwarzschen Konstanten. Z. Angew. Math. Mech., 33, 260-262 (in German). [Zbl 0051.09604].
83. CHRISTOPHER STRACHEY & JOHN G. F. FRANCIS (1961/1962) The reduction of a matrix to codiagonal form by eliminations. Comput. J., 4, 168-176. [MR0129125 (23 #B2162)], [Zbl 0103.10005].
84. LLOYD N. TREFETHEN & DAVID BAU III (1997) Numerical Linear Algebra. Philadelphia, PA: SIAM.
85. FRANK UHLIG (1997) The DQR algorithm, basic theory, convergence and conditional stability. Numer. Math., 76, 515-553.
86. 2) time. Linear Multilinear Algebra, 46, 327-359.
87. FRANK UHLIG (2001) Constructive ways for generating (generalized) real orthogonal matrices as products of (generalized) symmetries. Linear Algebra Appl., 332-334, 459-467.
88. CHARLES VAN LOAN (1984) A symplectic method for computing all the eigenvalues of a Hamiltonian matrix. J. Linear Algebra Appl., 61, 233-251.
89. RAF VANDEBRIL, MARC VAN BAREL & NICOLA MASTRONARDI (2005) An Implicit QR algorithm for semisep-arable matrices. Numer. Linear Algebra Appl., 12, 625-658.
90. DAVID S. WATKINS (1982) Understanding the QR algorithm. SIAM Rev., 24, 427-440.
91. DAVID S. WATKINS (2008) The QR algorithm revisited. SIAM Rev., 50, 133-145.
92. HELMUT WIELANDT (1944) Beiträge zur mathematischen Behandlung komplexer Eigenwertprobleme, Teil V: Bestimmung höherer Eigenwerte durch gebrochene Iteration. Berichte Aerodynamische Versuchsanstalt G öttingen, B 44/J/37.
93. JAMES H. WILKINSON (1959) Stability of the reduction of a matrix to almost triangular and triangular forms by elementary similarity transformations. J. Assoc. Comput. Mach., 6, 336-359.
94. JAMES H. WILKINSON (1965) The Algebraic Eigenvalue Problem. Oxford: Clarendon Press.