A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity

Linear Algebra and Its Applications

Volumn 415, Issue 1, 2006, Pages 96-113

  Morgan, Ronald B ^a   Zeng, Min ^b  

^a BAYLOR UNIVERSITY   (United States)

^b Department of Social and Behavioral Sciences   (United States)

Author keywords

Arnoldi; Eigenvalues; Harmonic Ritz values; Krylov subspaces

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; HARMONIC ANALYSIS;

ARNOLDI; HARMONIC RITZ VALUES; KRYLOV SUBSPACES;

ALGORITHMS;

EID: 33645210838     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2005.07.024     Document Type: Article

References (24)

1. W.E. Arnoldi The principle of minimized iterations in the solution of the matrix eigenvalue problem Quart. Appl. Math. 9 1951 17 29
2. A. Bai, D. Day, J. Demmel, J. Dongarra, A test matrix collection for non-Hermitian eigenvalue problems, Technical Report CS-97-355, University of Tennessee, Knoxville, TN, 1997.
3. M. Eiermann, O.G. Ernst, and O. Schneider Analysis of acceleration strategies for restarted minimal residual methods J. Comput. Appl. Math. 123 2000 261 292
4. R.W. Freund Quasi-kernel polynomials and their use in non-Hermitian matrix iterations J. Comput. Appl. Math. 43 1992 135 158
5. Z. Jia Arnoldi type algorithms for large unsymmetric multiple eigenvalue problems J. Comput. Math. 17 1999 257 274
6. R.B. Lehoucq Implicitly restarted Arnoldi methods and subspace iteration SIAM J. Matrix Anal. Appl. 23 2001 551 562
7. R.B. Lehoucq, and D.C. Sorensen Deflation techniques for an implicitly restarted Arnoldi iteration SIAM J. Matrix Anal. Appl. 17 1996 789 821
8. R.B. Morgan Computing interior eigenvalues of large matrices Linear Algebra Appl. 154-156 1991 289 309
9. R.B. Morgan On restarting the Arnoldi method for large nonsymmetric eigenvalue problems Math. Comp. 65 1996 1213 1230
10. R.B. Morgan Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations SIAM J. Matrix Anal. Appl. 21 2000 1112 1135
11. R.B. Morgan GMRES with deflated restarting SIAM J. Sci. Comput. 24 2002 20 37
12. R.B. Morgan Restarted block-GMRES with deflation of eigenvalues Appl. Numer. Math. 54 2005 222 236
13. R.B. Morgan, and M. Zeng Harmonic projection methods for large non-symmetric eigenvalue problems Numer. Linear Algebra Appl. 5 1998 33 55
14. C.C. Paige, B.N. Parlett, and H.A. van der Vorst Approximate solutions and eigenvalue bounds from Krylov subspaces Numer. Linear Algebra Appl. 2 1995 115 133
15. B.N. Parlett The Symmetric Eigenvalue Problem 1980 Prentice-Hall Englewood Cliffs, NJ
16. Y. Saad Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices Linear Algebra Appl. 34 1980 269 295
17. Y. Saad Numerical Methods for Large Eigenvalue Problems 1992 Halsted Press New York, NY
18. G.L.G. Sleijpen, and H.A. van der Vorst A Jacobi-Davidson iteration method for linear eigenvalue problems SIAM J. Matrix Anal. Appl. 17 1996 401 425
19. D.C. Sorensen Implicit application of polynomial filters in a k-step Arnoldi method SIAM J. Matrix Anal. Appl. 13 1992 357 385
20. D.C. Sorensen, Deflation for implicitly restarted Arnoldi methods, Technical Report TR98-12, Rice University, Houston, TX, 1998.
21. A. Stathopoulos, Y. Saad, and K. Wu Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods SIAM J. Sci. Comput. 19 1998 227 245
22. G.W. Stewart A Krylov-Schur algorithm for large eigenproblems SIAM J. Matrix Anal. Appl. 23 2001 601 614
23. G.W. Stewart Matrix Algorithms II: Eigensystems 2001 SIAM Philadelphia
24. K. Wu, and H. Simon Thick-restart Lanczos method for symmetric eigenvalue problems SIAM J. Matrix Anal. Appl. 22 2000 602 616