Restarted GMRES for shifted linear systems

SIAM Journal on Scientific Computing

Volumn 19, Issue 1, 1998, Pages 15-26

  Frommer, Andreas ^a,b   Glässner, Uwe ^a  

^a UNIVERSITY OF WUPPERTAL   (Germany)

^b STANFORD UNIVERSITY   (United States)

Author keywords

GMRES; Krylov methods; QCD; Shifted systems

Indexed keywords

EID: 0004525912     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596304563     Document Type: Article

References (26)

1. I. BARBOUR, N. BEHLIL, P. GIBBS, M. RAFIQ, K. MORIARTY, AND G. SCHIERHOLZ, Updating fermions with the Lanczos method, J. Comput. Phys., 68 (1987), pp. 227-236.
2. A. BURKITT AND A. IRVING, Inversion of the fermion matrix and the equivalence of the conjugate gradient and Lanczos algorithms, Computer Phys. Comm., 59 (1990), pp. 447-454.
3. B. DATTA AND Y. SAAD, Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment, Linear Algebra Appl., 154-156 (1991), pp. 225-244.
4. S. DUANE, A. KENNEDY, B. PENDLETON, AND D. ROWETH, Hybrid Monte Carlo, Phys. Lett. B, 195 (1987) pp. 216-222.
5. S. EISENSTAT, H. ELMAN, AND M. SCHULTZ, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal., 20 (1983), pp. 345-357.
6. S. FISCHER, A. FROMMER, U. GLÄSSNER, TH. LIPPERT, G. RITZENHÖFER, AND K. SCHILLING, A parallel SSOR preconditioner for lattice QCD, Comput. Phys. Comm., 98 (1996), pp. 20-34.
7. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Proc. of the Dundee Biennal Conference on Numerical Analysis 1974, G.A. Watson, ed., Springer-Verlag, New York, 1975, pp. 73-89.
8. R. FREUND, A transpose-free quasi-minimal residual algorithm for non-hermitian linear systems, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 470-482.
9. R. FREUND, Solution of shifted linear systems by quasi-minimal residual iterations, in Numerical Linear Algebra, L. Reichet, A. Ruttan, and R.S. Varga, eds., de Gruyter, Berlin, 1993, pp. 101-121.
10. R. FREUND, G. GOLUB, AND N. NACHTIGAL, Iterative solution of linear systems, Acta Numerica, 1992, pp. 57-100.
11. R. FREUND, M. GUTKNECHT, AND N. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-hermitian matrices, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 137-158.
12. R. FREUND AND N. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
13. A. FROMMER, V. HANNEMANN, B. NÖCKEL, TH. LIPPERT, AND K. SCHILLING, Accelerating Wilson fermion matrix inversions by means of the stabilized biconjugate gradient algorithm, Internat. J. Modern Phys. C, 5 (1994), pp. 1073-1088.
14. A. FROMMER, B. NÖCKEL, S. GÜSKEN, TH. LIPPERT, AND K. SCHILLING, Many masses on one stroke: Economic computation of quark propagators, Internat. J. Modern Phys. C, 6 (1995), pp. 627-638.
15. E. GALLOPOULOS AND Y. SAAD, Efficient parallel solution of parabolic equations: implicit methods on the Cedar multicluster, in Proc. Fourth SIAM Conf. Parallel Processing for Scientific Computing, J. Dongarra, P. Messina, D. C. Sorensen, and R. G. Voigt, eds., SIAM, Philadelphia, PA, 1990, pp. 251-256.
16. U. GLÄSSNER, S. GÜSKEN, TH. LIPPERT, G. RITZENHÖFER, K. SCHILLING, AND A. FROMMER, How to compute Green's functions for entire mass trajectories within Krylov solvers, Internat. J. Modern Phys. C, 7 (1996), pp. 635-644.
17. G. GOLUB AND C. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1990.
18. A. LAUB, Numerical linear algebra aspects of control design computations, IEEE Trans. Automat. Control, AC-30 (1985), pp. 97-108.
19. G. RITZENHÖFER, private communication, 1995.
20. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, MA, 1996.
21. Y. SAAD AND M. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
22. V. SIMONCINI AND E. GALLOPOULOS, A hybrid GMRES method for nonsymmetric systems with multiple right-hand sides, J. Comput. Appl. Math., 66 (1996), pp. 457-469.
23. R. SWEET, A parallel and vector variant of the cyclic reduction algorithm, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 89-105.
24. K. WILSON, Quarks and strings on a lattice, in New Phenomena in Subnuclear Physics, A. Zichichi, ed., Plenum, New York, 1975, pp. 69-142.
25. D. YOUNG, The search for 'high-level' parallelism for iterative sparse linear system solvers, in Parallel Supercomputing: Methods, Algorithms and Applications, G. Carey, ed., John Wiley, Chichester, 1989, pp. 89-105.
26. D. YOUNG AND B. VONA, On the use of rational iterative methods for solving large sparse linear systems, Appl. Numer. Math., 10 (1992), pp. 261-278.