Eigenvalue computation in the 20th century

Journal of Computational and Applied Mathematics

Volumn 123, Issue 1-2, 2000, Pages 35-65

  Golub, Gene H ^a   Van Der Vorst, Henk A ^b  

^a STANFORD UNIVERSITY   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

65F15; 65N25; Arnoldi's method; Jacobi's method; Jacobi Davidson; Lanczos' method; Perturbation theory; Power iteration; QR; QZ; RKS; SVD

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LINEAR ALGEBRA; LINEAR SYSTEMS; NUMERICAL ANALYSIS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; VECTORS;

ARNOLDIS METHOD; JACOBIS METHOD; LANCZOS METHOD; NUMERICAL LINEAR ALGEBRA; POWER ITERATION; SINGULAR VALUE DECOMPOSITION;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0034321492     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00413-1     Document Type: Article

References (164)

1. Arnoldi W.E. The principle of minimized iteration in the solution of the matrix eigenproblem. Quart. Appl. Math. 9:1951;17-29.
2. Z. Bai, D. Day, Q. Ye, ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems, Technical Report Research Report 95-04, University of Kentucky, Lexington, KY, 1995.
3. Bai Z., Demmel J., Dongarra J., Ruhe A., van der Vorst H. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide. 1999;SIAM, Philadelphia, PA.
4. Z. Bai, G.W. Stewart, SRRIT - A FORTRAN subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix, Technical Report 2908, Department of Computer Science, University of Maryland, 1992.
5. Bai Z. Progress in the numerical solution of the nonsymmetric eigenvalue problem. Numer. Linear Algebra Appl. 2:1995;219-234.
6. V. Bargmann, C. Montgomery, J. von Neumann, Solution of linear systems of high order, Technical Report, Princeton, Institute for Advanced Study, 1946.
7. Bauer F.L. Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischers Eigenwertprobleme. Z. Angew. Math. Phys. 8:1957;214-235.
8. Bauer F.L., Fike C.T. Norms and exclusion theorems. Numer. Math. 2:1960;137-141.
9. Bischof C.H. The two-sided block Jacobi method on hypercube architectures. Heath M.T. Hypercube Multiprocessors. 1987;SIAM, Philadelphia, PA.
10. Blackford L., Choi J., Cleary A., D'Azevedo E., Demmel J., Dhillon I., Dongarra J., Hammarling S., Henry G., Petitet A., Stanley K., Walker D., Whaley R. ScaLAPACK User's Guide. 1997;SIAM, Philadelphia, PA.
11. Bodewig E. Matrix Calculus. 1956;North-Holland, Amsterdam.
12. T. Braconnier, F. Chatelin, V. Frayssé, The influence of large nonnormality on the quality of convergence of iterative methods in linear algebra, Technical Report TR-PA-94/07, CERFACS, Toulouse, 1994.
13. Braconnier T., Higham N.J. Computing the field of values and pseudospectra using the Lanczos method with continuation. BIT. 36:1996;422-440.
14. Brent R.P., Luk F.T. The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays. SIAM J. Sci. Statist. Comput. 6:1985;69-84.
15. Businger P.A., Golub G.H. Algorithm 358: Singular value decomposition of a complex matrix. Comm. Assoc. Comp. Mach. 12:1969;564-565.
16. Carpraux J.F., Erhel J., Sadkane M. Spectral portrait for non-Hermitian large sparse matrices. Computing. 53:1994;301-310.
17. F. Chaitin-Chatelin, Is nonnormality a serious difficulty? Technical Report TR-PA-94 / 18, CERFACS, Toulouse, 1994.
18. Chatelin F. Spectral Approximation of Linear Operators. 1983;Academic Press, New York.
19. F. Chatelin, Eigenvalues of Matrices, Wiley, Chichester, 1993; Masson, Paris, 1988.
20. Crouzeix M., Philippe B., Sadkane M. The Davidson method. SIAM J. Sci. Comput. 15:1994;62-76.
21. Cullum J., Kerner W., Willoughby R. A generalized nonsymmetric Lanczos procedure. Comput. Phys. Comm. 53:1989;19-48.
22. Cullum J., Willoughby R.A. Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. I. 1985;Birkhaüser, Boston, MA.
23. Cullum J., Willoughby R.A. Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. II. 1985;Birkhaüser, Boston, MA.
24. Cullum J., Willoughby R.A. A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices. Cullum J., Willoughby R.A. Large Scale Eigenvalue Problems. 1986;193-240 Amsterdam, North-Holland.
25. Cuppen J.J.M. A divide and conquer method for the symmetric eigenproblem. Numer. Math. 36:1981;177-195.
26. Davidson E.R. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices. J. Comput. Phys. 17:1975;87-94.
27. Davis C., Kahan W. The rotation of eigenvectors by a perturbation-iii. Soc. Ind. Appl. Math. J. Num. Anal. 7:1970;1-46.
28. Demmel J.W. Applied Numerical Linear Algebra. 1997;SIAM, Philadelphia, PA.
29. Demmel J.W., Veselić K. Jacobi's method is more accurate than QR. SIAM J. Matrix Anal. Appl. 13:1992;1204-1246.
30. den Boer A. De Jacobi-methode van 1845 tot 1990, Master Thesis, Department of Mathematics. 1991;Utrecht University.
31. Dongarra J.J., Duff I.S., Sorensen D.C., van der Vorst H.A. Numerical Linear Algebra for High-Performance Computers. 1998;SIAM, Philadelphia, PA.
32. Dongarra J.J., Sorensen D.C. A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. Sci. Statist. Comput. 8:1987;139-154.
33. Dongarra J.J., Walker D.W. Software libraries for linear algebra computations on high performance computers. SIAM Rev. 37:1995;151-180.
34. Duffin R.J. A minimax theory for overdamped networks. J. Rational Mech. Anal. 4:1955;221-233.
35. D'yakonov E.G. Iterative methods in eigenvalue problems. Math. Notes. 34:1983;945-953.
36. Eberlein P.J. Solution to the complex eigenproblem by a norm-reducing Jacobi-type method. Numer. Math. 14:1970;232-245.
37. Engeli M., Ginsburg T., Rutishauser H., Stiefel E. Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems. 1959;Birkhäuser, Basel, / Stuttgart.
38. Feingold D.G., Varga R.S. Block diagonally dominant matrices in generalizations of the Gerschgorin circle theorem. Pacific J. Math. 12:1962;1241-1250.
39. Fokkema D.R., Sleijpen G.L.G., van der Vorst H.A. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20:1996;94-125.
40. J.G.F. Francis, The QR transformation: a unitary analogue to the LR transformation, Parts I and II Comput. J. 4 1961 265-272, 332-345.
41. Freund R.W., Nachtigal N.M. QMRPACK: a package of QMR algorithms. ACM Trans. Math. Software. 22:1996;46-77.
42. Freund R.W. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. J. Comput. Appl. Math. 43:1992;135-158.
43. Gantmacher F. The Theory of Matrices, Vols. I and II. 1959;Chelsea, New York.
44. Gerschgorin S. Über die Abgrenzung der Eigenwerte einer Matrix. Izv. Akad. Nauk SSSR, Ser. Fiz.-Mat. 6:1931;749-754.
45. W. Givens, Numerical computation of the characteristic values of a real symmetric matrix, Oak Ridge National Lab., ORNL-1574, 1954.
46. Goldstine H.H., Murray F.J., von Neumann J. The Jacobi method for real symmetric matrices. J. Assoc. Comput. Mach. 6:1959;176-195.
47. Golub G.H. Some uses of the Lanczos algorithm in numerical linear algebra. Miller J.J.H. Topics in Numerical Analysis. 1973;173-184 Academic Press, New York.
48. G.H. Golub, Sparse matrix computations: Eigenvalues and linear equations, Seminaries Iria, Inst. Rech. D'Informatique et d'Automatique, Rocquencourt, 1975, pp. 117-140.
49. Golub G.H., Kahan W. Calculating the singular values and pseudo-inverse of a matrix. SIAM J. Numer. Anal. 2:1965;205-224.
50. G.H. Golub, H.A. van der Vorst, 150 Years old and still alive: Eigenproblems, in: I.S. Duff, G.A. Watson (Eds.), The State of the Art in Numerical Analysis, Clarendon Press, Oxford, 1997, pp. 93-119.
51. Golub G.H., Van Loan C.F. Matrix Computations. 1996;The Johns Hopkins University Press, Baltimore.
52. Golub G.H., Wilkinson J.H. Ill-conditioned eigensystems and the computation of the Jordan canonical form. SIAM Rev. 18:1976;578-619.
53. Greenstadt J. A method for finding roots of arbitrary matrices. Math. Tables Aids Comput. 9:1955;47-52.
54. Gregory R.T. Computing eigenvalues and eigenvectors of a symmetric matrix on the ILLIAC. Math. Tables Aids Comput. 7:1953;215-220.
55. Gu M., Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16:1995;172-191.
56. Guo J.-S., Lin W.-W., Wang C.-S. Numerical solutions for large sparse eigenvalue problems. Linear Algebra Appl. 225:1995;57-89.
57. Gutknecht M.H. A completed theory of the unsymmetric Lanczos process and related algorithms, Part I. SIAM J. Matrix Anal. Appl. 13:1992;594-639.
58. Heeg R. Stability and transition of attachment-line flow, Ph.D. Thesis, Universiteit Twente. 1998;Enschede, The Netherlands.
59. Henrici P. On the speed of convergence of cyclic and quasicyclic Jacobi methods for computing the eigenvalues of Hermitian matrices. SIAM J. Appl. Math. 6:1958;144-162.
60. Hessenberg K. Auflösung linearer Eigenwertaufgaben met Hilfe der Hamilton-Cayleyschen Gleichung, Ph.D. Thesis. 1940;Technische Hochschule, Darmstadt.
61. Hoffmann W., Parlett B.N. A new proof of global convergence for the tridiagonal QL algorithm. SIAM J. Numer. Anal. 15:1978;929-937.
62. Horst P. A method of factor analysis by means of which all coordinates of the factor matrix are given simultaneously. Psychometrika. 2:1937;225-236.
63. Householder A.S. Unitary triangularization of a nonsymmetric matrix. J. ACM. 5:1958;339-342.
64. Householder A.S. The Theory of Matrices in Numerical Analysis. 1964;Dover, New York.
65. C.G.J. Jacobi, Über ein leichtes Verfahren, die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen, J. Reine Angew. Math. 30 (1846) 51-94.
66. Kågström B. The generalized singular value decomposition and the general. A-λ B problem BIT. 24:1985;568-583.
67. Kågström B. RGSVD: an algorithm for computing the Kronecker structure and reducing subspaces of singular. A-λ B pencils SIAM J. Sci. Statist. Comput. 7:1986;185-211.
68. Kahan W., Parlett B.N. How far should you go with the Lanczos process. Bunch J.R., Rose D.J. Sparse Matrix Computations. 1976;Academic Press, New York.
69. Kaniel S. Estimates for some computational techniques in linear algebra. Math. Comput. 20:1966;369-378.
70. Kato T. On the upper and lower bounds of eigenvalues. J. Phys. Soc. Japan. 4:1949;334-339.
71. Knyazev A.V. Preconditioned eigensolvers - an oxymoron? Electron. Trans. Numer. Anal. 7:1998;104-123.
72. A. Knyazev, Preconditioned eigensolvers, in: Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, H. van der Vorst (Eds.), Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide, SIAM, Philadelphia, PA, 2000, in press.
73. A.N. Krylov, O cislennom resenii uravnenija, kotorym v techniceskih voprasah opredeljajutsja castoty malyh kolebanii material'nyh sistem, Izv. Akad. Nauk SSSR. Ser. Fiz.-Mat. 4 (1931) 491-539.
74. Kublanovskaja V.N. On some algorithms for the solution of the complete eigenvalue problem. Zh. Vych. Mat. 1:1961;555-570.
75. Kublanovskaja V.N. On an application of Newton's method to the determination of eigenvalues of. λ -matrices Soviet Math. Dokl. 10:1969;1240-1241.
76. Kublanovskaja V.N. On an approach to the solution of the generalized latent value problem for. λ -matrices SIAM J. Numer. Anal. 7:1970;532-537.
77. Lancaster P. Lambda-Matrices and Vibrating Systems. 1969;Pergamon Press, Oxford, UK.
78. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45:1950;225-280.
79. Landau H.J. On Szegö's eigenvalue distribution theory and non-Hermitian kernels. J. Anal. Math. 28:1975;335-357.
80. Lee S.L. A practical upper bound for departure from normality. SIAM J. Matrix Anal. Appl. 16:1995;462-468.
81. Lehoucq R.B., Sorensen D.C., Yang C. ARPACK User's Guide - Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. 1998;SIAM, Philadelphia, PA.
82. Li T.-Y., Zeng Z. Homotopy-determinant algorithm for solving nonsymmetric eigenvalue problems. Math. Comput. 59:1992;483-502.
83. R. Lippert, A. Edelman, Nonlinear eigenvalue problems with orthogonality constraints, in: Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, H. van der Vorst (Eds.), Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide, SIAM, Philadelphia, PA, 2000, in press.
84. Lui S.H. Computation of pseudospectra by continuation. SIAM J. Sci. Comput. 18:1997;565-573.
85. Lui S.H., Golub G.H. Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators. Numer. Algorithms. 10:1995;363-378.
86. S.H. Lui, H.B. Keller, W.C. Kwok, Homotopy method for the large sparse real nonsymmetric eigenvalue problem, SIAM J. Matrix Anal. Appl. 18 (1997) 312-333.
87. K. Meerbergen, Robust methods for the calculation of rightmost eigenvalues of nonsymmetric eigenvalue problems, Ph.D. Thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1996.
88. Meerbergen K., Morgan R. Inexact methods. Bai Z., Demmel J., Dongarra J., Ruhe A., van der Vorst H. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide. 1999;SIAM, Philadelphia, PA.
89. Meerbergen K., Roose D. The restarted Arnoldi method applied to iterative linear system solvers for the computation of rightmost eigenvalues. SIAM J. Matrix Anal. Appl. 18:1997;1-20.
90. Moler C.B., Morrison D. Singular value analysis of cryptograms. Amer. Math. Monthly. 90:1983;78-87.
91. Moler C.B., Stewart G.W. An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal. 10:1973;241-256.
92. Morgan R.B. Computing interior eigenvalues of large matrices. Linear Algebra Appl. 154-156:1991;289-309.
93. Morgan R.B., Scott D.S. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Statist. Comput. 7(3):1986;817-825.
94. Olsen J., J ø rgensen P., Simons J. Passing the one-billion limit in full configuration-interaction (FCI) calculations. Chem. Phys. Lett. 169:1990;463-472.
95. A.M. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors I-VI, Arch. Rational. Mesh. Anal. I 1:233-241, II 2:423-428, III 3:325-340, IV 3:341-347, V 3:472-481, VI 4:153-165, 1958-1959.
96. A.M. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors I-VI, Arch. Rational. Mesh. Anal. I 1:233-241, II 2:423-428, III 3:325-340, IV 3:341-347, V 3:472-481, VI 4:153-165, 1958-1959.
97. A.M. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors I-VI, Arch. Rational. Mesh. Anal. I 1:233-241, II 2:423-428, III 3:325-340, IV 3:341-347, V 3:472-481, VI 4:153-165, 1958-1959.
98. A.M. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors I-VI, Arch. Rational. Mesh. Anal. I 1:233-241, II 2:423-428, III 3:325-340, IV 3:341-347, V 3:472-481, VI 4:153-165, 1958-1959.
99. A.M. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors I-VI, Arch. Rational. Mesh. Anal. I 1:233-241, II 2:423-428, III 3:325-340, IV 3:341-347, V 3:472-481, VI 4:153-165, 1958-1959.
100. A.M. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors I-VI, Arch. Rational. Mesh. Anal. I 1:233-241, II 2:423-428, III 3:325-340, IV 3:341-347, V 3:472-481, VI 4:153-165, 1958-1959.
101. Paardekooper M.H.C. An eigenvalue algorithm for skew symmetric matrices. Numer. Math. 17:1971;189-202.
102. C.C. Paige, The computation of eigenvalues and eigenvectors of very large matrices, Ph.D. Thesis, University of London, 1971.
103. Paige C.C., Parlett B.N., van der Vorst H.A. Approximate solutions and eigenvalue bounds from Krylov subspaces. Numer. Linear Algebra Appl. 2(2):1995;115-134.
104. Paige C.C., Saunders M.A. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12:1975;617-629.
105. Parlett B.N. The Symmetric Eigenvalue Problem. 1980;Prentice-Hall, Englewood Cliffs, NJ.
106. B.N. Parlett, Misconvergence in the Lanczos algorithm, in: M.G. Cox, S. Hammarling (Eds.), Reliable Numerical Computation, Clarendon Press, Oxford, UK, 1990, pp. 7-24 (Chapter 1).
107. Parlett B.N., Reid J.K. Tracking the progress of the Lanczos algorithm for large symmetric eigenproblems. IMA J. Numer. Anal. 1:1981;135-155.
108. Parlett B.N., Scott D.S. The Lanczos algorithm with selective orthogonalization. Math. Comput. 33:1979;217-238.
109. Parlett B.N., Taylor D.R., Liu Z.A. A look-ahead Lanczos algorithm for unsymmetric matrices. Math. Comput. 44:1985;105-124.
110. Pope D.A., Tompkins C. Maximizing functions of rotations: experiments concerning speed of diagonalization of symmetric matrices using Jacobi's method. J. ACM. 4:1957;459-466.
111. Rogers E.H. A minimax theory for overdamped systems. Arch. Rational Mech. Anal. 19:1964;89-96.
112. Ruhe A. Algorithms for the nonlinear eigenvalue problem. SIAM J. Numer. Anal. 10:1973;674-689.
113. Ruhe A. Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Math. Comput. 33:1979;680-687.
114. Ruhe A. The rational Krylov algorithm for nonsymmetric eigenvalue problems. iii. complex shifts for real matrices. BIT. 34:1994;165-176.
115. Ruhe A. Rational Krylov algorithms for nonsymmetric eigenvalue problems. ii. Matrix pairs. Linear Algebra Appl. 197 / 198:1994;283-295.
116. Rutishauser H. Solution of eigenvalue problems with the LR-transformation. Nat. Bur. Standards Appl. Math. Ser. 49:1958;47-81.
117. Rutishauser H. Computational aspects of F.L. Bauer's simultaneous iteration method. Numer. Math. 13:1969;4-13.
118. Rutishauser H. Simultaneous iteration method for symmetric matrices. Wilkinson J.H., Reinsch C. Handbook for Automatic Computation, Vol. 2, Linear Algebra. 1971;284-302 Springer Verlag, Heidelberg.
119. Saad Y. On the rates of convergence of the Lanczos and the block Lanczos methods. SIAM J. Numer. Anal. 17:1980;687-706.
120. Saad Y. Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl. 34:1980;269-295.
121. Saad Y. Numerical Methods for Large Eigenvalue Problems. 1992;Manchester University Press, Manchester, UK.
122. Saad Y., Schultz M.H. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7:1986;856-869.
123. Sameh A. On Jacobi and Jacobi-like algorithms for a parallel computer. Math. Comput. 25:1971;579-590.
124. Schönhage A. Zur Konvergenz des Jacobi-Verfahrens. Numer. Math. 3:1961;374-380.
125. Sleijpen G.L.G., Booten J.G.L., Fokkema D.R., van der Vorst H.A. Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT. 36:1996;595-633.
126. Sleijpen G.L.G., van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17:1996;401-425.
127. Sleijpen G.L.G., van der Vorst H.A., Meijerink E. Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems. Electron. Trans. Numer. Anal. 7:1998;75-89.
128. Sleijpen G.L.G., van der Vorst H.A., van Gijzen M.B. Quadratic eigenproblems are no problem. SIAM News. 29:1996;8-9.
129. P. Smit, Numerical analysis of eigenvalue algorithms based on subspace iterations, Ph.D. Thesis, Tilburg University, The Netherlands, 1997.
130. Sorensen D.C. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13(1):1992;357-385.
131. Stewart G.W. Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices. Numer. Math. 25:1976;123-136.
132. G.W. Stewart, SRRIT: a Fortran subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix, Technical Report TR 154, Department of Computer Science, University of Maryland, 1978.
133. Stewart G.W. On the early history of the singular value decomposition. SIAM Rev. 35:1993;551-566.
134. Stewart G.W., Sun Ji-Guang Matrix Perturbation Theory. 1990;Academic Press, San Diego, CA.
135. Sun J.G. Perturbation analysis of quadratic eigenvalue problems, Report UNINF 99.01, Dept. Comp. Science. 1999;Umeå University, Sweden.
136. Taussky O. A recurring theorem on determinants. Amer. Math. Monthly. 56:1949;672-676.
137. Temple G. The accuracy of Rayleigh's method of calculating the natural frequencies of vibrating systems. Proc. Roy. Soc. A. 211:1952;204-224.
138. F. Tisseur, Backward error and condition of polynomial eigenvalue problems, Technical Report NA-332, University of Manchester, Manchester, UK, 1998.
139. Tisseur F., Dongarra J. A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput. 20:1999;2223-2236.
140. Trefethen L.N. Pseudospectra of matrices. Griffiths D.F., Watson G.A. Numerical Analysis 1991. 1992;234-266 Longman.
141. Trefethen L.N. Computation of pseudospectra. Acta Numer. 8:1999;247-295.
142. Trefethen L.N., Bau D. III, Numerical Linear Algebra. 1997;SIAM, Philadelphia, PA.
143. Trefethen L.N., Trefethen A.E., Reddy S.C., Driscoll T.A. Hydrodynamic stability without eigenvalues. Science. 261:1993;578-584.
144. Trefethen L.N., Trummer M.R. An instability phenomenon in spectral methods. SIAM J. Numer. Anal. 24:1987;1008-1023.
145. Turnbull H.W., Aitken A.C. Introduction to the Theory of Canonical Matrices. 1961;Dover Publications, New York.
146. R.R. Underwood, An iterative block Lanczos method for the solution of large sparse symmetric eigenproblems, Technical Report STAN-CS-75-495, Department of Computer Science, Stanford University, Stanford, CA, 1975.
147. van der Sluis A., van der Vorst H.A. The convergence behavior of Ritz values in the presence of close eigenvalues. Linear Algebra Appl. 88 / 89:1987;651-694.
148. Van Dooren P. The computation of Kronecker's canonical form of a singular pencil. Linear Algebra Appl. 27:1979;103-140.
149. Van Dooren P. The generalized eigenstructure problem in linear system theory. IEEE Trans. Automat. Control AC. 26:1981;111-128.
150. Van Dooren P. A generalized eigenvalue approach of solving Ricatti equations. SIAM J. Sci. Statist. Comput. 2:1981;121-135.
151. Van Dooren P. Algorithm 590, DUSBSP AND EXCHQZZ: FORTRAN subroutines for computing deflating subspaces with specified spectrum. ACM Trans. Math. Software. 8:1982;376-382.
152. van Kempen H.P.M. On quadratic convergence of the special cyclic Jacobi method. Numer. Math. 9:1966;19-22.
153. Varga R.S. Matrix Iterative Analysis. 1962;Prentice-Hall, Englewood Cliffs, NJ.
154. R. von Mises, H. Pollaczek-Geiringer, Praktische Verfahren der Gleichungsauflösung, Z. Angew. Math. Mech. 9 (1929) 58-77, 152-164.
155. Watkins D.S. Fundamentals of Matrix Computations. 1991;Wiley, New York.
156. Watkins D.S. Some perspectives on the eigenvalue problem. SIAM Rev. 35:1993;430-471.
157. Watkins D.S., Elsner L. Chasing algorithms for the eigenvalue problem. SIAM J. Matrix Anal. Appl. 12:1991;374-384.
158. Weinberger H.F. Variational Methods for Eigenvalue Approximation. 1974;SIAM, Philadelphia.
159. Wilkinson J.H. The Algebraic Eigenvalue Problem. 1965;Clarendon Press, Oxford.
160. Wilkinson J.H. Linear differential equations and Kronecker's canonical form. de Boor C., Golub G.H. Recent advances in Numerical Analysis. 1978;231-265 Academic Press, New York.
161. Wilkinson J.H. Kronecker's canonical form and the QZ algorithm. Linear Algebra Appl. 28:1979;285-303.
162. Wilkinson J.H. Eigenvalue problems. Iserles A., Powell M.J.D. The State of the Art in Numerical Analysis. 1987;1-39 Clarendon Press, Oxford.
163. Wilkinson J.H., Reinsch (Eds.) C. Handbook for Automatic Computation, Vol. 2, Linear Algebra. 1971;Springer, Heidelberg.
164. Zhang T., Law K.H., Golub G.H. On the homotopy method for perturbed symmetric generalized eigenvalue problems. SIAM J. Numer. Anal. 35(1):1998;300-319.