Abstract
We consider the task of computing solutions of linear systems that only differ by a shift with the identity matrix as well as linear systems with several different right-hand sides. In the past, Krylov subspace methods have been developed which exploit either the need for solutions to multiple right-hand sides (e.g. deflation type methods and block methods) or multiple shifts (e.g. shifted CG) with some success. In this paper we present a block Krylov subspace method which, based on a block Lanczos process, exploits both features—shifts and multiple right-hand sides—at once. Such situations arise, for example, in lattice quantum chromodynamics (QCD) simulations within the Rational Hybrid Monte Carlo (RHMC) algorithm. We present numerical evidence that our method is superior compared to applying other iterative methods to each of the systems individually as well as, in typical situations, to shifted or block Krylov subspace methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdel-Rehim, A., Morgan, R.B., Wilcox, W.: Seed methods for linear equations in lattice QCD problems with multiple right-hand sides. PoS LAT2008, 38 (2008)
Aliaga, J.I., Boley, D.L., Freund, R., Hernández, V.: A Lanczos-type method for multiple starting vectors. Math. Comp. 69(232), 1577–1601 (2000)
Barbella, G., Perotti, F., Simoncini, V.: Block Krylov subspace methods for the computation of structural response to turbulent wind. Comput. Methods Appl. Mech. Eng. 200(23–24), 2067–2082 (2011)
Darnell, D., Morgan, R.B., Wilcox, W.: Deflated GMRES for systems with multiple shifts and multiple right-hand sides. Linear Algebra Appl. 429(10), 2415–2434 (2008). Special issue in honor of Richard S. Varga
Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1–1:25 (2011)
Debbio, L.D., Giusti, L., Lüscher, M., Petronzio, R., Tantalo, N.: QCD with light Wilson quarks on fine lattices (i): First experiences and physics results. JHEP 702, 56,2007 (2007)
Debbio, L.D., Giusti, L., Lüscher, M., Petronzio, R., Tantalo, N.: QCD with light Wilson quarks on fine lattices (ii): DD-HMC simulations and data analysis. JHEP 702, 82,2007 (2007)
Dubrulle, A.A.: Retooling the method of block conjugate gradients. Electron. Trans. Numer. Anal. 12, 216–233 (electronic) (2001)
Erhel, J., Guyomarc’H, F.: An augmented conjugate gradient method for solving consecutive symmetric positive definite linear systems. SIAM J. Matrix Anal. Appl. 21(4), 1279–1299 (2000)
Fiebach, P., Frommer, A., Freund, R.: Variants of the Block-QMR method and applications in quantum chromodynamics. In: 15th IMACS World Congress on Scientific Computation, Modelling and Applied Mathematics, vol. 3, pp. 491–496 (1997)
Freund, R., Malhotra, M.: A block QMR algorithm for non-hermitian linear systems with multiple right-hand sides. Linear Algebra Appl. 254, 119–157 (1997)
Frommer A., Maass, P.: Fast CG-based methods for Tikhonov-Phillips regularization. SIAM J. Sci. Comput. 20(5), 1831–1850 (1999) (electronic)
Guennebaud, G., Jacob, B., et al.: Eigen v3. http://eigen.tuxfamily.org (2010)
Gutknecht, M.H.: Block Krylov space methods for linear systems with multiple right-hand sides: an introduction. In: Siddiqi, A., Duff, I., Christensen, O. (eds.) Modern Mathematical Models, Methods and Algorithms for Real World Systems, pp. 420–447. Anamaya Publishers, New Delhi (2007)
Higham, N.J.: Functions of Matrices: Theory and Computation. Society for Industrial and Applied Mathematics, Philadelphia (2008)
Kennedy, A.D.: Algorithms for dynamical fermions. Technical report, School of Physics, University of Edinburgh, arXiv:hep-lat/0607038v1 (2006)
Morgan, R.B.: Restarted block-GMRES with deflation of eigenvalues. Appl. Numer. Math. 54(2), 222–236 (2005)
Nikishin, A.A., Yeremin, A.Y.: 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(4), 1135–1153 (1995)
Nikishin, A.A., Yeremin, A.Y.: An automatic procedure for updating the block size in the block conjugate gradient method for solving linear systems. J. Math. Sci. 114, 1844–1853 (2003). doi:10.1023/A:1022462.721147
O’Leary, D.P.: The block conjugate gradient algorithm and related methods. Linear Algebra Appl. 29, 293–322 (1980)
Paige, C.C., Parlett, B.N., van der Vorst, H.A.: Approximate solutions and eigenvalue bounds from Krylov subspaces. Numer. Linear Algebra Appl. 2(2), 115–133 (1995)
Saad, Y.: On the Lanczos method for solving symmetric linear systems with several right-hand sides. Math. Comput. 48(178), 651–662 (1987)
Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)
Soodhalter, K.: Mathematics and implementation details of a block MINRES algorithm. In: Review by Journal (2013)
Stathopoulos, A., Orginos, K.: Computing and deflating eigenvalues while solving multiple right-hand side linear systems with an application to quantum chromodynamics. SIAM J. Sci. Comput. 32(1), 439–462 (2010)
Tadano, H., Sakurai, T., Kuramashi, Y.: Block BiCGGR: A new block Krylov subspace method for computing high accuracy solutions. JSIAM Lett. 1, 44 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Deutsche Forschungsgemeinschaft through the Collaborative Research Centre SFB-TRR 55 “Hadron Physics from Lattice QCD”
Rights and permissions
About this article
Cite this article
Birk, S., Frommer, A. A deflated conjugate gradient method for multiple right hand sides and multiple shifts. Numer Algor 67, 507–529 (2014). https://doi.org/10.1007/s11075-013-9805-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-013-9805-9