Convergence of polynomial restart Krylov methods for eigenvalue computations

SIAM Review

Volumn 47, Issue 3, 2005, Pages 492-515

  Beattie, Christopher A ^a   Embree, Mark ^b   Sorensen, D C ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b Rice University   (United States)

Author keywords

Arnoldi algorithm; Containment gap; Eigenvalue computations; Krylov subspaces; Lanczos algorithm; Pseudospectra

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; POLYNOMIALS;

ARNOLDI ALGORITHM; CONTAINMENT GAP; EIGENVALUE COMPUTATIONS; KRYLOV SUBSPACES; LANCZOS ALGORITHM; PSEUDOSPECTRA;

COMPUTATIONAL METHODS;

EID: 21244459027     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144503433077     Document Type: Article

References (30)

1. J. Baglama, D. Calvetti, and L. Reichel, Iterative methods for the computation of a few eigenvalues of a large symmetric matriz, BIT, 36 (1996), pp. 400-421.
2. Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. Van Der Vorst, EDS., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000.
3. C. Beattie, M. Embree, and J. Rossi, Convergence of restarted Krylov subspaces to invariant subspaces, SIAM J. Matrix Anal. Appl., 25 (2004), pp. 1074-1109.
4. E. A. Burroughs, L. A. Romero, R. B. Lehoucq, and A. G. Salinger, Linear stability of flow in a differentially heated cavity via large-scale eigenvalue calculations, Internat. J. Numer. Methods Heat Fluid Flow, 14 (2004), pp. 803-822.
5. D. Calvetti, L. Reichel, and D. C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal., 2 (1994), pp. 1-21.
6. T. A. Driscoll, A Matlab toolbox for Schwarz-Christofel mapping, ACM Trans. Math. Software, 22 (1996), pp. 168-186. Associated software available from http://www.math.udel.edu/~Driscoll/SC/.
7. T. A. Driscoll, K.-C. Toh, and L. N. Trefethen, From potential theory to matrix iterations in six steps, SIAM Rev., 40 (1998), pp. 547-578.
8. B. Fischer and J. Modersitzki, An algorithm for complex linear approximation based on semi-infinite programming, Numer. Algorithms, 5 (1993), pp. 287-297. Associated software available from http://www. math.mu-luebeck.de/workers/modersitzki/COCA/coca5.html.
9. B. Fischer and L. Reichel, Newton interpolation in Fejér and Chebyshev points, Math. Comp., 53 (1989), pp. 265-278.
10. D. Gaier, Lectures on Complex Approximation, Birkhäuser, Boston, 1987.
11. F. R. Gantmacher, Theory of Matrices, Vol. 1, 2nd ed., Chelsea, New York, 1959.
12. V. Heuveline and M. Sadkane, Arnoldi-Faber method for large non-Hermitian eigenvalue problems, Electron. Trans. Numer. Anal., 5 (1997), pp. 62-76.
13. Z. Jia, The convergence of generalized Lanczos methods for large unsymmetric eigenproblems, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 843-862.
14. T. Kato, Perturbation Theory for Linear Operators, corrected 2nd ed., Springer-Verlag, Berlin, 1980.
15. R. B. Lehoucq, Implicitly restarted Arnoldi methods and subspace iteration, SIAM J. Matrix. Anal. Appl., 23 (2001), pp. 551-562.
16. R. B. Lehoucq, D. C. Sorensen, and C. Yang, ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998. Associated software available from http://www.caam.rice.edu/software/ARPACK.
17. N. M. Nachtigal, L. Reichel, and L. N. Trefethen, A hybrid GMRES algorithm for nonsymmetric linear systems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 796-825.
18. V. Paulsen, Completely Bounded Maps and Operator Algebras, Cambridge University Press, Cambridge, UK, 2002.
19. L. Reichel, Newton interpolation at Leja points, BIT, 30 (1990), pp. 332-346.
20. L. Reichel and L. N. Trefethen, Eigenvalues and pseudo-eigenvalues of Toeplitz matrices, Linear Algebra Appl., 162-164 (1992), pp. 153-185.
21. M. Robbé and M. Sadkane, A priori error bounds on invariant subspace approximations by block Krylov subspaces, Linear Algebra Appl., 350 (2002), pp. 89-103.
22. Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34 (1980), pp. 269-295.
23. V. Simoncini, Ritz and pseudo-Ritz values using matrix polynomials, Linear Algebra Appl., 241-243 (1996), pp. 787-801.
24. D. C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix. Anal. Appl., 13 (1992), pp. 357-385.
25. D. C. Sorensen, Numerical methods for large eigenvalue problems, in Acta Numerica, Cambridge University Press, Cambridge, UK, 2002, pp. 519-584.
26. G. W. Stewart and J.-G. Sun, Matrix Perturbation Theory, Academic Press, Boston, MA, 1990.
27. L. N. Trefethen, Pseudospectra of matrices, in Numerical Analysis 1991, D. F. Griffiths and G. A. Watson, eds., Longman Scientific and Technical, Harlow, Essex, 1992, pp. 234-266.
28. L. N. Trefethen, Computation of pseudospectra, in Acta Numerica 8, Cambridge University Press, Cambridge, UK, 1999, pp. 247-295.
29. J. L. Walsh, Interpolation and Approximation by Rational Functions in the Complex Domain, 5th ed., AMS, Providence, RI, 1969.
30. T. G. Wright, Eig Tool, 2002. Software available from http://www.comlab.ox.ac.uk/pseudospectra/eigtool.