Computational methods for large eigenvalue problems

Handbook of Numerical Analysis

Volumn 8, Issue , 2002, Pages 3-179

  van der Vorst, Henk A ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1342299960     PISSN: 15708659     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-8659(02)08003-1     Document Type: Review

References (183)

1. Anderson E., Bai Z., Bischof C., Demmel J., Dongarra J., Ducroz J., Greenbaum A., Hammarling S., McKenney A., Ostrouchov S., and Sorensen D. LAPACK User's Guide (1992), SIAM, Philadelphia, PA
2. Arnoldi W.E. The principle of minimized iteration in the solution of the matrix eigenproblem. Quart. Appl. Math. 9 (1951) 17-29
3. Baglama J., Calvetti D., Reichel L., and Ruttan A. Computation of a few close eigenvalues of a large matrix with application to liquid crystal modeling. J. Comput. Phys. 146 (1998) 203-226
4. Bai Z., Day D., Demmel J., Dongarra J., Gu M., Ruhe A., and van der Vorst H. Templates for linear algebra problems. In: van Leeuwen J. (Ed). Computer Science Today (1995), Springer Verlag, Berlin 115-140
5. Bai Z., Day D., and Ye Q. ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems. Technical Report Research Report 95-04 (1995), University of Kentucky, Lexington, KY
6. Bai Z., Demmel J., Dongarra J., Ruhe A., and van der Vorst H. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide (2000), SIAM, Philadelphia, PA
7. Bai Z., and Demmel J.W. On swapping diagonal blocks in real Schur form. Linear Algebra Appl. 186 (1993) 73-95
8. Bai Z., Hu D., and Reichel L. A Newton basis GMRES implementation. IMA J. Numer. Anal. 14 (1991) 563-581
9. Bai Z., and Stewart G.W. SRRIT - A FORTRAN subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix. Technical Report 2908 (1992), Department of Computer Science, University of Maryland
10. Barrett R., Berry M., Chan T., Demmel J., Donato J., Dongarra J., Eijkhout V., Pozo R., Romine C., and van der Vorst H. Templates for the Solution of Linear Systems: Building Blocks for Iterative methods (1994), SIAM, Philadelphia, PA
11. Bauer F.L., and Fike C.T. Norms and exclusion theorems. Numer. Math. 2 (1960) 137-141
12. Beattie C. Harmonic Ritz and Lehmann bounds. ETNA 7 (1998) 18-39
13. Bischof C.H. The two-sided block Jacobi method on hypercube architectures. In: Heath M.T. (Ed). Hypercube Multiprocessors (1987), SIAM, Philadelphia, PA
14. Bodewig E. Matrix Calculus (1956), Amsterdam, North-Holland
15. Fokkema D.R., Sleijpen G.L.G., and van der Vorst H.A. Jacobi-Davidson methods for generalized MHD-eigenvalue problems. Zeitschrift Angew. Math. Mechanik (ZAMM) 76 (1996) 131-134
16. Braconnier T., Chatelin F., and Frayssé V. The influence of large nonnormality on the quality of convergence of iterative methods in linear algebra. Technical Report TR-PA-94/07 (1994), CERFACS, Toulouse
17. Braconnier T., and Higham N.J. Computing the field of values and pseudospectra using the Lanczos method with continuation. BIT 36 3 (1996) 422-440
18. Brent R.P., and Luk F.T. The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays. SIAM J. Sci. Statist. Comput. 6 (1985) 69-84
19. Brezinski C., and Redivo-Zaglia M. Treatment of near breakdown in the CGS algorithm. Numer. Algorithms 7 (1994) 33-73
20. Carpraux J.F., Erhel J., and Sadkane M. Spectral portrait for non-Hermitian large sparse matrices. Computing 53 (1994) 301-310
21. Chaitin-Chatelin F. Is nonnormality a serious difficulty?. Technical Report TR-PA-94/18 (1994), CERFACS, Toulouse
22. Chatelin F. Spectral Approximation of Linear Operators (1983), Academic Press, New York
23. Chatelin F. Collection mathématiques appliquées pour la maÎtrise. Valeurs propres de matrices (1988), Masson, Paris
24. Crouzeix M., Philippe B., and Sadkane M. The Davidson method. SIAM J. Sci. Comput. 15 (1994) 62-76
25. Cullum J. Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems. BIT 36 3 (1996) 470-493
26. Cullum J., Kerner W., and Willoughby R. A generalized nonsymmetric Lanczos procedure. Comput. Phys. Comm. 53 (1989) 19-48
27. Cullum J., and Willoughby R.A. A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices. In: Cullum J., and Willoughby R.A. (Eds). Large Scale Eigenvalue Problems (1986), Amsterdam, North-Holland 193-240
28. Cuppen J.J.M. A divide and conquer method for the symmetric eigenproblem. Numer. Math. 36 (1981) 177-195
29. Daniel J.W., Gragg W.B., Kaufmann L., and Stewart G.W. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comput. 30 (1976) 772-795
30. 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
31. Davidson E.R. Monster matrices: their eigenvalues and eigenvectors. Comput. in Phys. 7 (1993) 519-522
32. Davis C., and Kahan W. The rotation of eigenvectors by a perturbation-III. Soc. Ind. Appl. Math. J. Numer. Anal. 7 (1970) 1-46
33. Davis C.J. Numerical solution of a quadratic matrix equation. SIAM J. Sci. Statist. Comput. 2 (1981) 164-175
34. de Sturler E., and van der Vorst H.A. Reducing the effect of global communication in GM-RES(m) and CG on parallel distributed memory computers. Appl. Numer. Math. 18 (1995) 441-459
35. Dembo R.S., Eisenstat S.C., and Steihaug T. Inexact Newton methods. SIAM J. Numer. Anal. 19 (1982) 400-408
36. Demmel J., Heath M., and van der Vorst H. Parallel numerical linear algebra. Acta Numerica (1993), Cambridge University Press, Cambridge
37. Demmel J.W. Applied Numerical Linear Algebra (1997), SIAM, Philadelphia, PA
38. Demmel J.W., and Veselic K. Jacobi's method is more accurate than QR. SIAM J. Matrix Anal. Appl. 13 (1992) 1204-1245
39. den Boer A. De Jacobi methode van 1845 tot 1990, Master's thesis (1991), Department of Mathematics, University Utrecht (in Dutch)
40. Dongarra J.J., and Sorensen D.C. A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. Sci. Statist. Comput. 8 (1987) 139-154
41. Duff I.S., Erisman A.M., and Reid J.K. Direct Methods for Sparse Matrices (1986), Oxford University Press, London
42. Duffin R.J. A minimax theory for overdamped networks. J. Rational Mechanics Anal. 4 (1955) 221-233
43. Eberlein P.J. Solution to the complex eigenproblem by a norm-reducing Jacobi-type method. Numer. Math. 14 (1970) 232-245
44. Embree M. Convergence of Krylov subspace methods for non-normal matrices. PhD thesis (1999), Oxford University Computing Laboratory, Oxford
45. Faber V., and Manteuffel T.A. Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Anal. 21 2 (1984) 352-362
46. Feingold D.G., and Varga R.S. Block diagonally dominant matrices in generalizations of the Gerschgorin circle theorem. Pacific J. Math. 12 (1962) 1241-1250
47. Feldmann P., and Freund R.W. A linear circuit analysis by Padé approximation via the Lanczos process. IEEE Trans. Computer-Aided Design 14 (1995)
48. Flanders D.A., and Shortley G. Numerical determination of fundamental modes. J. Appl. Phys. 21 (1950) 1322-1328
49. Fokkema D.R. Subspace methods for linear, nonlinear, and eigen problems. PhD thesis (1996), Utrecht University, Utrecht
50. Fokkema D.R., Sleijpen G.L.G., and van der Vorst H.A. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20 (1998) 94-125
51. Francis J.G.F. The QR transformation: a unitary analogue to the LR transformation, Parts I and II. Comput. J. 4 (1961) 265-272
52. Francis J.G.F. The QR transformation: a unitary analogue to the LR transformation, Parts I and II. Comput. J. 4 (1961) 332-345
53. Freund R.W., Gutknecht M.H., and Nachtigal N.M. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput. 14 (1993) 137-158
54. Freund R.W., and Nachtigal N.M. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part 2. Technical Report 90.46 (1990), RIACS, NASA Ames Research Center
55. Freund R.W., and Nachtigal N.M. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60 (1991) 315-339
56. Freund R.W., and Nachtigal N.M. QMRPACK: a package of QMR algorithms. ACM Trans. Math. Softw. 22 (1996) 46-77
57. Freund R.W. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. J. Comput. Appl. Math. 43 (1992) 135-158
58. Gantmacher F. The Theory of Matrices vols. I and II (1959), Chelsea, New York
59. Gerschgorin S. über die Abgrenzung der Eigenwerte einer Matrix. Izv. Akad. Nauk SSSR, Ser. Fiz.-Mat. 6 (1931) 749-754
60. Goldstine H.H., Murray F.J., and von Neumann J. The Jacobi method for real symmetric matrices. J. ACM 6 (1959) 176-195
61. Golub G.H., and Underwood R. The block Lanczos method for computing eigenvalues. In: Rice J.R. (Ed). Mathematical Software III (1977), Academic Press, New York 361-377
62. Golub G.H., and van der Vorst H.A. Eigenvalue computation in the 20th century. J. Comput. Appl. Math. (2001) to appear
63. Golub G.H., and Van Loan C.F. Matrix Computations (1996), Johns Hopkins University Press, Baltimore
64. Golub G.H., and Wilkinson J.H. III-conditioned eigensystems and the computation of the Jordan canonical form. SIAM Rev. 18 (1976) 578-619
65. Goossens S., and Roose D. Ritz and Harmonic Ritz values and the convergences of FOM and GMRES. Numer. Linear Algebra Appl. 6 4 (1999) 281-293
66. Greenstadt J. A method for finding roots of arbitrary matrices. Math. Tables Aids Comput. 9 (1955) 47-52
67. Gregory R.T. Computing eigenvalues and eigenvectors of a symmetric matrix on the ILLIAC. Math. Tables Aids Comput. 7 (1953) 215-220
68. Grimme E.J., Sorensen D.C., and Van Dooren P. Model reduction of state space systems via an Implicitly Restarted Lanczos method. Technical Report Report TR94-21 (1994), Dept. of Comp. and Appl. Math., Rice University, Houston, TX
69. Gu M., and Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 (1995) 172-191
70. Guo J.-S., Lin W.-W., and Wang C.-S. Numerical solutions for large sparse quadratic eigenvalue problems. Linear Algebra Appl. 225 (1995) 57-89
71. 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
72. Gutknecht M.H. Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica (1997), Cambridge University Press, Cambridge 271-397
73. Heeg R. Stability and transition of attachment-line flow. PhD thesis (1998), Universiteit Twente, Enschede, The Netherlands
74. 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
75. Higham N.J. Accuracy and Stability of Numerical Algorithms (1996), SIAM, Philadelphia, PA
76. Hoffmann W., and Parlett B.N. A new proof of global convergence for the tridiagonal QL algorithm. SIAM J. Numer. Anal. 15 (1978) 929-937
77. Jacobi C.G.J. Ueber eine neue Auflösungsart der bei der Methode der kleinsten Quadrate vorkommende linearen Gleichungen. Astronom. Nachr. (1845) 297-306
78. Jacobi C.G.J. Ueber ein leichtes Verfahren, die in der Theorie der SÄcularstörungen vorkommenden Gleichungen numerisch aufzulösen. J. Reine Angew. Math. 30 (1846) 51-94
79. Jia Z. Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems. Linear Algebra Appl. 259 (1997) 1-23
80. Jia Z. A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems. Linear Algebra Appl. 270 (1998) 171-189
81. Jia Z. Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and implicitly restarted refined Arnoldi algorithm. Linear Algebra Appl. 287 (1999) 191-214
82. Jia Z., and Stewart G.W. An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Technical Report TR-99-24/TR-4015 (1999), University of Maryland, Department of Computer Science
83. K»gström B. The generalized singular value decomposition and the general A - λB problem. BIT 24 (1985) 568-583
84. 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
85. Kaniel S. Estimates for some computational techniques in linear algebra. Math. Comp. 20 (1966) 369-378
86. Kato T. On the upper and lower bounds of eigenvalues. J. Phys. Soc. Japan 4 (1949) 334-339
87. 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
88. Lancaster P. Lambda-Matrices and Vibrating Systems (1969), Pergamon Press, Oxford, UK
89. 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
90. Lanczos C. Applied Analysis (1956), Prentice-Hall, Englewood Cliffs, NJ
91. Lee S.L. A practical upper bound for departure from normality. SIAM J. Matrix Anal. Appl. 16 (1995) 462-468
92. Lehmann N.J. Optimale Eigenwerteinschlie§ungen. Numer. Math. 5 (1963) 246-272
93. Lehmann N.J. Zur Verwendung optimaler Eigenwerteingrenzungen bei der Lösung symmetrischer Matrizenaufgaben. Numer. Math. 8 (1966) 42-55
94. Lehoucq R., and Maschoff K. Block Arnoldi method. In: Bai Z., Demmel J., Dongarra J., Ruhe A., and van der Vorst H. (Eds). Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide (2000), SIAM, Philadelphia, PA
95. Lehoucq R.B. Analysis and implementation of an implicitly restarted iteration. PhD thesis (1995), Rice University, Houston, TX
96. Lehoucq R.B., and Meerbergen K. Using generalized Cayley transformations within an inexact rational Krylov sequence method. SIAM J. Matrix Anal. Appl. 20 (1998) 131-148
97. Lehoucq R.B., and Scott J.A. An evaluation of software for computing eigenvalues of sparse non-symmetric matrices. Technical Report Preprint MCS-P547-1195 (1996), Math. and Comp. Science Div., Argonne National Laboratory
98. Lehoucq R.B., Sorensen D.C., Vu P., and Yang C. ARPACK: An implementation of the Implicitly Re-started Arnoldi Iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix. Technical report (1995), Rice University, Houston, TX
99. Lehoucq R.B., Sorensen D.C., and Yang C. ARPACK User's Guide - Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods (1998), SIAM, Philadelphia, PA
100. Lui S.H. Domain decomposition methods for eigenvalue problems. Technical Report (1996), Hong Kong University of Science and Technology, Hong Kong
101. Lui S.H. Computation of pseudospectra by continuation. SIAM J. Sci. Comput. 18 (1997) 565-573
102. Lui S.H., and 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
103. Lui S.H., Keller H.B., and Kwok W.C. Homotopy method for the large sparse real nonsymmetric eigenvalue problem. SIAM J. Matrix Anal. Appl. 18 2 (1997) 312-333
104. Manteuffel T.A. The Tchebychev iteration for nonsymmetric linear systems. Numer. Math. 28 (1997) 307-327
105. Meerbergen K. Robust methods for the calculation of rightmost eigenvalues of nonsymmetric eigenvalue problems. PhD thesis (1996), Katholieke Universiteit Leuven, Leuven, Belgium
106. Meerbergen K. Locking and restarting quadratic eigenvalue solvers. Technical Report RAL-TR-1999-011 (1999), Rutherford Appleton Laboratory, Oxon, England
107. Meerbergen K., and Morgan R. Inexact methods. In: Bai Z., Demmel J., Dongarra J., Ruhe A., and van der Vorst H. (Eds). Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide (2000), SIAM, Philadelphia, PA
108. Moler C.B., and Stewart G.W. An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal. 10 (1973) 241-256
109. Morgan R.B. Computing interior eigenvalues of large matrices. Linear Algebra Appl. (1991) 154-156
110. Morgan R.B. Computing interior eigenvalues of large matrices. Linear Algebra Appl. (1991) 289-309
111. Morgan R.B. Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices. J. Comp. Phys. 101 (1992) 287-291
112. Morgan R.B., and 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
113. Morgan R.B., and Scott D.S. Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J. Sci. Comput. 14 (1993) 585-593
114. Nool M., and van der Ploeg A. Parallel Jacobi-Davidson for solving generalized eigenvalue problems. In: Palma J.M.L.M., Dongarra J., and Hernández V. (Eds). Vector and Parallel Processing - VECPAR'98. Lecture Notes in Comput. Sci. 1573 (1999), Springer Verlag, Berlin 58-70
115. Olsen J., JØrgensen P., and Simons J. Passing the one-billion limit in full configuration-interaction (FCI) calculations. Chem. Phys. Lett. 169 (1990) 463-472
116. Ortega J.M. Numerical Analysis - A Second Course (1990), SIAM, Philadelphia, PA
117. Ostrowski A.M. On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors. I. Arch. Rational Mesh. Anal. 1 (1958) 233-241
118. Ostrowski A.M. On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors. V. Arch. Rational Mesh. Anal. 3 (1959) 472-481
119. Paardekooper M.H.C. An eigenvalue algorithm for skew symmetric matrices. Numer. Math. 17 (1971) 189-202
120. Paige C.C. The computation of eigenvalues and eigenvectors of very large matrices. PhD thesis (1971), Univ. of London
121. Paige C.C. Computational variants of the Lanczos method for the eigenproblem. J. Inst. Math. Appl. 10 (1972) 373-381
122. Paige C.C. Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix. J. Inst. Math. Appl. 18 (1976) 341-349
123. Paige C.C., Parlett B.N., and van der Vorst H.A. Approximate solutions and eigenvalue bounds from Krylov subspaces. Num. Linear Algebra Appl. 2 2 (1995) 115-134
124. Paige C.C., and Saunders M.A. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12 (1975) 617-629
125. Parlett B.N. The Symmetric Eigenvalue Problem (1980), Prentice-Hall, Englewood Cliffs, NJ
126. Parlett B.N. Misconvergence in the Lanczos algorithm. In: Cox M.G., and Hammarling S. (Eds). Reliable Numerical Computation (1990), Clarendon Press, Oxford, UK Chapter 1
127. Parlett B.N., and Scott D.S. The Lanczos algorithm with selective orthogonalization. Math. Comp. 33 (1979) 217-238
128. Parlett B.N., Taylor D.R., and Liu Z.A. A look-ahead Lanczos algorithm for unsymmetric matrices. Math. Comp. 44 (1985) 105-124
129. Petition S.G. Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2). Appl. Numer. Math. 10 (1992) 19-36
130. Pope D.A., and Tompkins C. Maximizing functions of rotations: experiments concerning speed of diagonalization of symmetric matrices using Jacobi's method. J. ACM 4 (1957) 459-466
131. Ruhe A. Algorithms for the nonlinear eigenvalue problem. SIAM J. Numer. Anal. 10 (1973) 674-689
132. Ruhe A. Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Math. Comput. 33 (1979) 680-687
133. Ruhe A. The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices. BIT 34 (1994) 165-176
134. Ruhe A. Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. Matrix pairs. Linear Algebra Appl. 197/198 (1994) 283-295
135. Saad Y. On the rates of convergence of the Lanczos and block Lanczos methods. SIAM J. Numer. Anal. 17 (1980) 687-706
136. Saad Y. Numerical Methods for Large Eigenvalue Problems (1992), Manchester University Press, Manchester, UK
137. Saad Y., and Schultz M.H. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7 (1986) 856-869
138. Sameh A. On Jacobi and Jacobi-like algorithms for a parallel computer. Math. Comp. 25 (1971) 579-590
139. Schönhage A. Zur Konvergenz des Jacobi-Verfahrens. Numer. Math. 3 (1961) 374-380
140. Sleijpen G.L.G., Booten J.G.L., Fokkema D.R., and van der Vorst H.A. Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT 36 (1996) 595-633
141. Sleijpen G.L.G., and van der Sluis A. Further results on the convergence behavior of Conjugate-Gradients and Ritz values. Linear Algebra Appl. 246 (1996) 233-278
142. Sleijpen G.L.G., and van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17 (1996) 401-425
143. Sleijpen G.L.G., and van der Vorst H.A. The Jacobi-Davidson method for eigenproblems and its relation with accelerated inexact Newton schemes. In: Margenov S.D., and Vassilevski P.S. (Eds). Iterative methods in Linear Algebra II, Proceedings of the Second IMACS International Symposium. Blagoevgrad, June 17-21, 1995 (1996) (North-Holland, Amsterdam)
144. Sleijpen G.L.G., van der Vorst H.A., and Meijerink E. Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems. ETNA 7 (1998) 75-89
145. Sleijpen G.L.G., van der Vorst H.A., and van Gijzen M.B. Quadratic eigenproblems are no problem. SIAM News 29 (1996) 8-9
146. Sorensen D.C. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13 1 (1992) 357-385
147. Stewart G.W. On the sensitivity of the eigenvalue problem Ax = λBx. SIAM J. Numer. Anal. 9 (1972) 669-686
148. Stewart G.W. Perturbation theory for the generalized eigenvalue problem. In: de Boor C., and Golubs G.H. (Eds). Recent Advances in Numerical Analysis (1978), Academic Press, New York
149. Stewart G.W., and Sun J.-G. Matrix Perturbation Theory (1990), Academic Press, San Diego, CA
150. Sun J.-G. Perturbation analysis of quadratic eigenvalue problems. Technical Report UNINF 99.01 (1999), Dept. Computer Science, Ume» University, Sweden
151. Szegö G. Orthogonal Polynomials. 3rd edn. Colloq. Publ. No. 23 (1967), Amer. Math. Soc., New York
152. Taussky O. A recurring theorem on determinants. Amer. Math. Monthly 56 (1949) 672-676
153. Taylor D.R. Analysis of the look ahead Lanczos algorithm. PhD thesis (1982), University of California, Berkeley, CA
154. Temple G. The accuracy of Raleigh's method of calculating the natural frequencies of vibrating systems. Proc. Roy. Soc. A 211 (1952) 204-224
155. Tisseur F. Backward error and condition of polynomial eigenvalue problems. Technical Report NA-332 (1998), University of Manchester, Manchester, UK
156. Tisseur F., and Dongarra J. A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput. 20 6 (1999) 2223-2236
157. Toh K.-C., and Trefethen L.N. Calculation of the pseudospectra by the Arnoldi method. SIAM J. Sci. Comput. 17 (1996) 1-15
158. Trefethen L.N. Pseudospectra of matrices. In: Griffiths D.F., and Watson G.A. (Eds). Numerical Analysis 1991 (1992), Longman, New York 234-266
159. Trefethen L.N. Computation of pseudospectra. Acta Numer. 8 (1999) 247-295
160. Trefethen L.N., and Trummer M.R. An instability phenomenon in spectral methods. SIAM J. Numer. Anal. 24 (1987) 1008-1023
161. Turnbull H.W., and Aitken A.C. Introduction to the Theory of Canonical Matrices (1961), Dover Publications, Dover, NY
162. van der Sluis A., and van der Vorst H.A. The rate of convergence of conjugate gradients. Numer. Math. 48 (1986) 543-560
163. van der Sluis A., and 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
164. van der Sluis A., and van der Vorst H.A. Numerical solution of large sparse linear algebraic systems arising from tomographic problems. In: Nolet G. (Ed). Seismic Tomography (1987), Reidel Pub. Comp., Dordrecht 49-83 Chapter 3
165. van der Vorst H.A. A generalized Lanczos scheme. Math. Comp. 39 160 (1982) 559-561
166. van der Vorst H.A., and Golub G.H. 150 Years old and still alive: Eigenproblems. In: Duff I.S., and Watson G.A. (Eds). The State of the Art in Numerical Analysis (1997), Clarendon Press, Oxford 93-119
167. van Dooren P. The computation of Kronecker's canonical form of a singular pencil. Linear Algebra Appl. 27 (1979) 103-140
168. Van Dooren P. The generalized eigenstructure problem in linear system theory. IEEE Trans. Auto. Cont. AC 26 (1981) 111-128
169. Van Dooren P. A generalized eigenvalue approach of solving Ricatti equations. SIAM J. Sci. Statist. Comput. 2 (1981) 121-135
170. 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
171. van Kempen H.P.M. On quadratic convergence of the special cyclic Jacobi method. Numer. Math. 9 (1966) 19-22
172. Varga R.S. Matrix Iterative Analysis (1962), Prentice-Hall, Englewood Cliffs, NJ
173. Walker H.F. Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Statist. Comput. 9 (1988) 152-163
174. Watkins D.S. Fundamentals of Matrix Computations (1991), John Wiley and Sons, New York
175. Watkins D.S. Some perspectives on the eigenvalue problem. SIAM Rev. 35 (1993) 430-471
176. Watkins D.S. QR-like algorithms for eigenvalue problems. J. Comp. Appl. Math. (2001) to appear
177. Watkins D.S., and Elsner L. Chasing algorithms for the eigenvalue problem. SIAM J. Matrix Anal. Appl. 12 (1991) 374-384
178. Wilkinson J.H. The Algebraic Eigenvalue Problem (1965), Clarendon Press, Oxford
179. Wilkinson J.H. Linear differential equations and Kronecker's canonical form. In: de Boor C., and Golub G.H. (Eds). Recent Advances in Numerical Analysis (1978), Academic Press, New York 231-265
180. Wilkinson J.H. Kronecker's canonical form and the QZ algorithm. Linear Algebra Appl. 28 (1979) 285-303
181. Wilkinson J.H. Eigenvalue problems. In: Iserles A., and Powell M.J.D. (Eds). The State of the Art in Numerical Analysis (1987), Clarendon Press, Oxford 1-39
182. Handbook for Automatic Computation. In: J.H. W., and Reinsch C. (Eds). Linear Algebra Vol. 2 (1971), Springer Verlag, Heidelberg - Berlin - New York
183. Zhang T., Law K.H., and Golub G.H. On the homotopy method for symmetric modified generalized eigenvalue problems. SIAM J. Numer. Anal. 35 (1998) 300-319