Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 4, 2000, Pages 1112-1135

  Morgan, Ronald B ^a  

^a BAYLOR UNIVERSITY   (United States)

Author keywords

GMRES; Harmonic Ritz values; Implicit restarting; Iterative methods; Nonsymmetric systems

Indexed keywords

EID: 0034144749     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897321362     Document Type: Article

References (55)

1. W. E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math., 9 (1951), pp. 17-29.
2. S. F. ASHBY, T. A. MANTEUFFEL, AND P. E. SAYLOR, A taxonomy for conjugate gradient methods, SIAM J. Numer. Anal., 27 (1990), pp. 1542-1568.
3. J. BAGLAMA, D. CALVETTI, G. H. GOLUB, AND L. REICHEL, Adaptively preconditioned GMRES algorithms, SIAM J. Sci. Comput., 20 (1999), pp. 243-269.
4. A. CHAPMAN AND Y. SAAD, Deflated and augmented Krylov subspace techniques, Numer. Linear Algebra Appl., 4 (1997), pp. 43-66.
5. V. L. DRUSKIN AND L. A. KNIZHNERMAN, Two polynomial methods of calculating functions of a symmetric matrices, Comput. Math. Math. Phys., 29 (1989), pp. 112-121.
6. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
7. J. ERHEL, K. BURRAGE, AND B. POHL, Restarted GMRES preconditioned by deflation, J. Comput. Appl. Math., 69 (1996), pp. 303-318.
8. R. W. FREUND, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. J. Comput. Appl. Math., 43 (1992), pp. 135-158.
9. R. W. FREUND, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput., 14 (1993), pp. 470-482.
10. R. W. FREUND, G. H. GOLUB, AND N. M. NACHTIGAL, Iterative solution of linear systems, Acta Numerica, 1 (1992), pp. 57-100.
11. R. W. FREUND, M. H. GUTKNECHT, AND N. M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
12. R. W. FREUND AND N. M. NACHTIGAL, QMR: a quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
13. G. H. GOLUB AND D. P. O'LEARY, Some history of the conjugate gradient and Lanczos algorithms: 1948-1976, SIAM Rev., 31 (1989), pp. 50-102.
14. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore. MD, 1989.
15. A. GREENBAUM, V. PTAK, AND Z. STRAKOS, Any nonincreasing convergence curve is possible for GMRES, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 465-469.
16. A. GREENBAUM AND L. N. TREFETHEN, GMRESICR and Arnoldi Lanczos as matrix approximation problems. SIAM J. Sci. Comput., 15 (1994). pp. 359-368.
17. L. A. HAGEMAN AND D. M. YOUNG, Applied Iterative Methods, Academic Press, New York, 1981.
18. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards, 49 (1952), pp. 409-436.
19. W. JOUBERT, A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems, SIAM J. Sci. Comput., 15 (1994), pp. 427-439.
20. S. A. KHARCHENKO AND A. Y. YEREMIN, Eigenvalue translation based preconditioned for the GMRES(k) method, Numer. Linear Algebra Appl., 2 (1995), pp. 51-77.
21. C. LANCZOS, An iterative method for the solution of the eigenvalue problem of linear differential and integral operators, J. Research Nat. Bur. Standards, 45 (1950), pp. 255-282.
22. C. LANCZOS, Solution of systems of linear equations by minimized iterations, J. Research Nat. Bur. Standards, 49 (1952), pp. 33-53.
23. R. B. LEHOUCQ, Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, Ph.D. thesis, Rice University, Houston, TX, 1995.
24. R. B. LEHOUCQ AND D. C. SORENSEN, Deflation techniques for an implicitly restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 789-821.
25. T. A. MANTEUFFEL AND J. OTTO, On the roots of orthogonal polynomials and residual polynomials associated with a conjugate gradient method, Numer. Linear Algebra Appl., 1 (1994), pp. 449-475.
26. T. A. MANTEUFFEL AND G. STARKE, On hybrid iterative methods for nonsymmetric systems of linear equations, Numer. Math., 73 (1996), pp. 489-506.
27. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154-156 (1991), pp. 289-309.
28. R. B. MORGAN, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1154-1171.
29. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp., 65 (1996), pp. 1213-1230.
30. R. B. MORGAN AND M. ZENG, Harmonic projection methods for large non-symmetric eigenvalue problems, Numer. Linear Algebra Appl., 5 (1998), pp. 33-55.
31. 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.
32. R. A. NICOLAIDES, Deflation of conjugate gradients with applications to boundary value problems, SIAM J. Numer. Anal., 24 (1987), pp. 355-365.
33. 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), pp. 115-133.
34. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
35. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
36. B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp., 44 (1985), pp. 105-124.
37. Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34 (1980), pp. 269-295.
38. Y. SAAD, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp., 37 (1981), pp. 105-126.
39. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Halsted Press, New York, NY, 1992.
40. Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Comput., 14 (1993), pp. 461-469.
41. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, MA, 1995.
42. Y. SAAD, Analysis of augmented Krylov subspace techniques, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 435-449.
43. Y. SAAD AND M. H. SCHULTZ, GMRES: a generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
44. P. E. SAYLOR AND D. C. SMOLARSKI, Implementation of an adaptive algorithm for Richardson's method, Linear Algebra Appl., 154/156 (1991), pp. 615-646.
45. 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), pp. 401-425.
46. P. SONNEVELD, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 36-52.
47. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
48. 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), pp. 227-245.
49. E. DE STURLER, Truncation strategies for optimal Krylov subspace methods. Technical report TR-96-38, Swiss Center for Scientific Computing (ETH Zurich), Zurich, Switzerland, 1996.
50. E. DE STURLER AND D. R. FOKKEMA, Nested Krylov methods and preserving the orthogonality, in Proceedings Sixth Copper Mountain Conference on Multigrid Methods, NASA Con. Publ. 3224, Part 1, S. F. McCormick, N. D. Melson, and T. A. Manteuffel, eds., NASA Langley Research Center, Hampton, VA, 1993.
51. C. H. TONG, A comparative study of preconditioned lanczos methods for nonsymetric linear systems, Technical report SAND91-8240, Sandia National Laboratories, Albuquerque, NM, 1992.
52. H. A. VAN DER VORST AND C. VUIK, The superlinear convergence behaviour of GMRES, J. Comput. Appl. Math., 48 (1993), pp. 327-341.
53. H. A. VAN DER VORST AND C. VUIK, GMRESR: A family of nested GMRES methods, Numer. Linear Algebra Appl., 1 (1994), pp. 369-386.
54. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, New York, 1965.
55. M. ZENG, Finding Interior Eigenvalues of Large Nonsyrnmetric Matrices, Ph.D. thesis, University of Missouri, Columbia, MO, 1996.