Inexact Krylov subspace methods for linear systems

SIAM Journal on Matrix Analysis and Applications

Volumn 26, Issue 1, 2005, Pages 125-153

  Van Den Eshof, Jasper ^a   Sleijpen, Gerard L G ^a,b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Approximate matrix vector product; CG; Chebyshev iteration; FOM; GMRES; Inexact matrix vector product; Krylov subspace methods; Orthores; Residual gap; Richardson iteration

Indexed keywords

APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; ERROR ANALYSIS; ITERATIVE METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SENSITIVITY ANALYSIS; SET THEORY; VECTORS;

APPROXIMATE MATRIX-VECTOR PRODUCT; CG; CHEBYSHEV ITERATION; FOM; GMRES; INEXACT MATRIX-VECTOR PRODUCT; KRYLOV SUBSPACE METHODS; ORTHORES; RESIDUAL GAP; RICHARDSON ITERATION;

MATRIX ALGEBRA;

EID: 13844311486     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479802403459     Document Type: Article

References (33)

1. R. E. BANK AND T. F. CHAN, An analysis of the composite step biconjugate gradient method, Numer. Math., 66 (1993), pp. 295-319.
2. A. BJÖRCK, T. ELFVING, AND Z. STRAKOŠ, Stability of conjugate gradient and Lanczos methods for linear least squares problems, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 720-736.
3. A. BOURAS AND V. FRAYSSÉ, A Relaxation Strategy for Inexact Matrix-Vector Products for Krylov Methods, Technical Report TR/PA/00/15, CERFACS, France, 2000.
4. A. BOURAS, V. FRAYSSÉ, AND L. GIRAUD, A Relaxation Strategy for Inner-Outer Linear Solvers in Domain Decomposition Methods, Technical Report TR/PA/00/17, CERFACS, France, 2000.
5. P. N. BROWN, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
6. B. FISCHER, Polynomial Based Iteration Methods for Symmetric Linear Systems, John Wiley & Sons Ltd., Chichester, 1996.
7. L. Fox AND I. B. PARKER, Chebyshev Polynomials in Numerical Analysis, Oxford University Press, London, 1972.
8. A. FROMMER, T. LIPPERT, B. MEDEKE, AND K. SCHILLING, EDS., Numerical Challenges in Lattice Quantum Chromodynamics, Lecture Notes in Computational Science and Engineering, Springer Verlag, Heidelberg, 2000.
9. E. GILADI, G. H. GOLUB, AND J. B. KELLER, Inner and outer iterations for the Chebyshev algorithm, SIAM J. Numer. Anal., 35 (1998), pp. 300-319.
10. G. H. GOLUB AND M. L. OVERTON, The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems, Numer. Math., 53 (1988), pp. 571-593.
11. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The John Hopkins University Press, Baltimore, London, 3rd ed., 1996.
12. G. H. GOLUB AND Q. YE, Inexact preconditioned conjugate gradient method with inner-outer iteration, SIAM J. Sci. Comput., 21 (1999), pp. 1305-1320.
13. G. H. GOLUB, Z. ZHANG, AND H. ZHA, Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner-outer iterations, Linear Algebra Appl., 309 (2000), pp. 289-306.
14. A. GREENBAUM, Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences, Linear Algebra Appl., 113 (1989), pp. 7-63.
15. A. GREENBAUM, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 535-551.
16. A. GREENBAUM, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
17. A. GREENBAUM, V. L. DRUSKIN, AND L. A. KNIZHNERMAN, On solving indefinite symmetric linear systems by means of the Lanczos method, Zh. Vychisl. Mat. Mat. Fiz., 39 (1999), pp. 371-377.
18. M. H. GUTKNECHT, Lanczos-type solvers for nonsymmetric linear systems of equations, in Acta Numerica, 1997, Cambridge Univ. Press, Cambridge, UK, 1997, pp. 271-397.
19. M. H. GUTKNECHT AND S. RÖLLIN, The Chebyshev iteration revisited, Parallel Computing, 28 (2002), pp. 263-283.
20. M. H. GUTKNECHT AND Z. STRAKOŠ, Accuracy of two three-term and three two-term recurrences for Krylov space solvers, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 213-229.
21. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards, 49 (1952), pp. 409-436.
22. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
23. C. C. PAIGE, Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18 (1976), pp. 341-349.
24. Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Comput., 14 (1993), pp. 461-469.
25. V. SIMONCINI AND D. B. SZYLD, Flexible inner-outer Krylov methods (and inexact Krylov methods), presentation, Zürich, 2002.
26. V. SIMONCINI AND D. B. SZYLD, Theory of inexact krylov subspace methods and applications to scientific computing, SIAM J. Sci. Comput., 25 (2003), pp. 454-477.
27. G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND D. R. FOKKEMA, BiCGstab(l) and other hybrid Bi-CG methods, Numer. Algorithms, 7 (1994), pp. 75-109.
28. G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND J. MODERSITZKI, Differences in the effects of rounding errors in Krylov solvers for symmetric indefinite linear systems, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 726-751.
29. G. W. STEWART AND J.-G. SUN, Matrix Perturbation Theory, Academic Press, San Diego, 1990.
30. J. VAN DEN ESHOF, A. FROMMER, T. LIPPERT, K. SCHILLING, AND H. VAN DE VORST, Numerical methods for the QCD overlap operator: I. sign-function and error bounds, Comput. Phys. Comm., 146 (2002), pp. 203-224.
31. H. A. VAN DER VORST AND C. VUIK, GMRESR: a family of nested GMRES methods, Numer. Linear Algebra Appl., 1 (1994), pp. 369-386.
32. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.
33. H. WOZNIAKOWSKI, Numerical stability of the Chebyshev method for the solution of large linear systems, Numer. Math., 28 (1977), pp. 191-209.