Abstract
Block Krylov subspace methods are efficient iterative methods for solving linearsystems with multiple right-hand sides. The Block BiCGGR method is one of the Block Krylov subspace methods, and can generate highly accurate approximatesolutions. However, when the number of right-hand sides is large, this method becomes numerically unstable. In this paper, the Block BiCGGR2 method is proposed. This method is a numerically stable and highly accurate method than the Block BiCGGR method and the Block BiCGSTAB method. Numerical results illustrate the robustness and the accuracy of the approximate solutions of the Block BiCGGR2 method.
Similar content being viewed by others
References
Aoki, S., Ishikawa, K.-I., Ishizuka, N., Kadoh, D., Kanaya, K., Kuramashi, Y., Namekawa, Y., Okawa, M., Taniguchi, Y., Ukawa, A., Ukita, N., Yoshie, T.: \(2+1\) flavor lattice QCD toward the physical point. Phys. Rev. D 79, 034503 (2009)
CCS Matrix Forum. http://ccsmf.ccs.tsukuba.ac.jp
Dubrulle, A.A.: Retooling the method of block conjugate gradients. Electron. Trans. Numer. Anal. 12, 216–233 (2001)
Freund, R.W., Malhotra, M.: A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides. Lin. Alg. Appl. 254, 119–157 (1997)
El Guennouni, A., Jbilou, K., Sadok, H.: A block version of BiCGSTAB for linear systems with multiple right-hand sides. Electron. Trans. Numer. Anal 16, 129–142 (2003)
Gutknecht, M.H., Schmelzer, T.: The block grade of a block Krylov space. Lin. Alg. Appl. 430, 174–185 (2009)
Ikegami, T., Sakurai, T., Nagashima, U.: A filter diagonalization for generalized eigenvalue problems based on the Sakurai–Sugiura projection method. J. Comput. Appl. Math. 233, 1927–1936 (2010)
Jbilou, K., Messaoudi, A., Sadok, H.: Global FOM and GMRES algorithms for matrix equations. Appl. Numer. Math. 31, 49–63 (1999)
Jbilou, K., Sadok, H., Tinzefte, A.: Oblique projection methods for linear systems with multiple right-hand sides. Electron. Trans. Numer. Anal. 20, 119–138 (2005)
O’Leary, D.P.: The block conjugate gradient algorithm and related methods. Linear Algebra Appl. 29, 293–322 (1980)
Stathopoulos, A., Wu, K.: A block orthogonalization procedure with constant synchronization requirements. SIAM J. Sci. Comput. 23, 2165–2182 (2002)
SuiteSparse Matrix Collection. https://sparse.tamu.edu
Tadano, H., Saito, S., Imakura, A.: Accuracy improvement of the shifted Block BiCGGR method for linear systems with multiple shifts and multiple right-hand sides. In: Sakurai, T. (eds.) Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing (EPASA2015). Lecture Notes in Computational Science and Engineering, Vol. 117, pp. 171–185 (2017)
Tadano, H., Sakurai, T., Kuramashi, Y.: Block BiCGGR: a new block krylov subspace method for computing high accuracy solutions. JSIAM Lett. 1, 44–47 (2009)
Vital, B.: Etude de quelques méthodes de résolution de problèmes linéaires de grande taille sur multiprocesseur. Ph.D. thesis, Université de Rennes I, Rennes, France (1990)
Zhang, J., Dai, H., Zhao, J.: A new family of global methods for linear systems with multiple right-hand sides. J. Comput. Appl. Math. 236, 1562–1575 (2011)
Zhang, S.-L.: GPBi-CG: generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. SIAM J. Sci. Comput. 18, 537–551 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Tadano, H. Development of the Block BiCGGR2 method for linear systems with multiple right-hand sides. Japan J. Indust. Appl. Math. 36, 563–577 (2019). https://doi.org/10.1007/s13160-019-00354-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-019-00354-6