Restarted block-GMRES with deflation of eigenvalues

Applied Numerical Mathematics

Volumn 54, Issue 2, 2005, Pages 222-236

  Morgan, Ronald B ^a  

^a BAYLOR UNIVERSITY   (United States)

Author keywords

Block methods; Deflation; Eigenvalues; GMRES; Iterative methods; Linear equations

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LINEAR EQUATIONS; MATRIX ALGEBRA; PROBLEM SOLVING;

BLOCK METHODS; DEFLATION; GMRES; ORTHOGONALIZATION;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 19144373302     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apnum.2004.09.028     Document Type: Conference Paper

References (49)

1. J.I. Aliaga, D.L. Boley, R.W. Freund, and V. Hernández A Lanczos-type method for multiple starting vectors Math. Comp. 69 2000 1577 1601
2. J. Baglama, D. Calvetti, G.H. Golub, and L. Reichel Adaptively preconditioned GMRES algorithms SIAM J. Sci. Comput. 20 1998 243 269
3. Z. Bai, D. Day, and Q. Ye Able: an adaptive block Lanczos method for non-Hermitian eigenvalue problems SIAM J. Matrix Anal. Appl. 20 1999 1060 1082
4. K. Burrage, and J. Erhel On the performance of various adaptive preconditioned GMRES strategies Numer. Linear Algebra Appl. 5 1998 101 121
5. C.L. Calvez, and B. Molina Implicitly restarted and deflated GMRES Numer. Algorithms 21 1999 261 285
6. T.F. Chan, and W. Wan Analysis of projection methods for solving linear systems with multiple right-hand sides SIAM J. Sci. Comput. 18 1997 1698 1721
7. A. Chapman, and Y. Saad Deflated and augmented Krylov subspace techniques Numer. Linear Algebra Appl. 4 1997 43 66
8. J. Cullum, and W.E. Donath A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large sparse real symmetric matrices Proc. of the 1974 IEEE Conf. on Decision and Control, Phoenix, Arizona 1974 505 509
9. E. De Sturler Truncation strategies for optimal Krylov subspace methods SIAM J. Numer. Anal. 36 1999 864 889
10. I.S. Duff, R.G. Grimes, and J.G. Lewis Sparse matrix test problems ACM Trans. Math. Software 15 1989 1 14
11. J. Erhel, and F. Guyomarc'h An augmented conjugate gradient method for solving consecutive symmetric positive definite linear systems SIAM J. Matrix Anal. Appl. 21 2000 1279 1299
12. J. Erhel, K. Burrage, and B. Pohl Restarted GMRES preconditioned by deflation J. Comput. Appl. Math. 69 1996 303 318
13. R.W. Freund Quasi-kernel polynomials and their use in non-Hermitian matrix iterations J. Comput. Appl. Math. 43 1992 135 158
14. R.W. Freund A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems SIAM J. Sci. Comput. 14 1993 470 482
15. R.W. Freund, and M. Malhotra A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides Linear Algebra Appl. 254 1997 119 157
16. R.W. Freund, and N.M. Nachtigal QMR: A quasi-minimal residual method for non-Hermitian linear systems Numer. Math. 60 1991 315 339
17. G.H. Golub, and R. Underwood The block Lanczos method for computing eigenvalues J. Rice Mathematical Software III 1977 Academic Press New York 364 377
18. G.H. Golub, R. Underwood, J.H. Wilkinson, The Lanczos algorithm for the symmetric A x = λ B x problem, Tech. Rep., Stanford University Computer Science Department, Stanford, CA, 1972
19. G. Gu, and Z. Cao A block GMRES method augmented with eigenvectors Appl. Math. Comput. 121 2001 271 289
20. S.A. Kharchenko, and A.Y. Yeremin Eigenvalue translation based preconditioners for the GMRES(k) method Numer. Linear Algebra Appl. 2 1995 51 77
21. R.B. Lehoucq, and D.C. Sorensen Deflation techniques for an implicitly restarted Arnoldi iteration SIAM J. Matrix Anal. Appl. 17 1996 789 821
22. R.B. Morgan Computing interior eigenvalues of large matrices Linear Algebra Appl. 154-156 1991 289 309
23. R.B. Morgan A restarted GMRES method augmented with eigenvectors SIAM J. Matrix Anal. Appl. 16 1995 1154 1171
24. R.B. Morgan On restarting the Arnoldi method for large nonsymmetric eigenvalue problems Math. Comp. 65 1996 1213 1230
25. R.B. Morgan Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations SIAM J. Matrix Anal. Appl. 21 2000 1112 1135
26. R.B. Morgan GMRES with deflated restarting SIAM J. Sci. Comput. 24 2002 20 37
27. R.B. Morgan, and W. Wilcox Deflation of eigenvalues for GMRES in lattice QCD Nucl. Phys. B (Proc. Suppl.) 106 2002 1067 1069
28. R.B. Morgan, and M. Zeng Harmonic projection methods for large non-symmetric eigenvalue problems Numer. Linear Algebra Appl. 5 1998 33 55
29. R.B. Morgan, M. Zeng, Harmonic restarted Arnoldi for calculating eigenvalues and determining multiplicity, Preprint, 2003
30. A.A. Nikishin, and Y.Y. Yeremin Variable block CG algorithms for solving large sparse symmetric positive definite linear systems on parallel computers, I: General iterative scheme SIAM J. Matrix Anal. Appl. 16 1995 1135 1153
31. D.P. O'Leary The block conjugate gradient algorithm and related methods Linear Algebra Appl. 29 1980 293 322
32. 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
33. B.N. Parlett A new look at the Lanczos algorithm for solving symmetric systems of linear equations Linear Algebra Appl. 29 1980 323 346
34. B.N. Parlett The Symmetric Eigenvalue Problem 1980 Prentice-Hall Englewood Cliffs, NJ
35. A. Ruhe The block Lanczos method for computing eigenvalues Math. Comp. 33 1979 680 687
36. Y. Saad On the Lanczos method for solving symmetric linear systems with several right-hand sides Math. Comp. 48 1987 651 662
37. Y. Saad Numerical Methods for Large Eigenvalue Problems 1992 Halsted Press New York
38. Y. Saad Iterative Methods for Sparse Linear Systems 1996 PWS Publishing Boston, MA
39. Y. Saad Analysis of augmented Krylov subspace techniques SIAM J. Matrix Anal. Appl. 18 1997 435 449
40. Y. Saad, and M.H. Schultz GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 7 1986 856 869
41. Y. Saad, M.C. Yeung, J. Erhel, and F. Guyomarc'h A deflated version of the conjugate gradient algorithm SIAM J. Sci. Comput. 21 2000 1909 1926
42. V. Simoncini, and E. Gallopoulos An iterative method for nonsymmetric systems with multiple right-hand sides SIAM J. Sci. Comput. 16 1995 917 933
43. C. Smith, A. Peterson, and R. Mittra A conjugate gradient algorithm for the treatment of multiple incident electromagnetic fields IEEE Trans. Antennas Propag. 37 1989 1490 1493
44. D.C. Sorensen Implicit application of polynomial filters in a k-step Arnoldi method SIAM J. Matrix Anal. Appl. 13 1992 357 385
45. G.W. Stewart A Krylov-Schur algorithm for large eigenproblems SIAM J. Matrix Anal. Appl. 23 2001 601 614
46. H.A. van der Vorst An iterative method for solving f (A) x = b using Krylov subspace information obtained for the symmetric positive definite matrix A J. Comput. Appl. Math. 18 1987 249 263
47. H.A. van der Vorst Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems SIAM J. Sci. Statist. Comput. 12 1992 631 644
48. H.A. van der Vorst, and C. Vuik The superlinear convergence behaviour of GMRES J. Comput. Appl. Math. 48 1993 327 341
49. K. Wu, and H. Simon Thick-restart Lanczos method for symmetric eigenvalue problems SIAM J. Matrix Anal. Appl. 22 2000 602 616