Zhong Yuhao, Wang Jiahui, Jing Yanfei
Based on the idea of Robbé and Sadkane's inexact breakdowns handling technology in IB-BGMRES [Linear Algebra Appl., 419 (2006), pp. 265-285], from the point of view of search subspace partition, a new version of the global GMRES method (Gl-GMRES), named as GLGMRES-S, is presented for solving nonsymmetric linear systems with multiple right-hand sides, which can be regarded as a global extension of IB-BGMRES. In Gl-GMRES, the block Krylov basis matrices generated by the global Arnoldi process must retain the same dimension, and therefore the two criteria used in IB-BGMRES to detect inexact breakdowns are no longer applicable. Instead of detecting inexact breakdowns, a subspace-splitting technique is introduced into the global Arnoldi process to implicitly realize subspace partitioning within the global GMRES framework, and the associated Arnoldi-like relations are theoretically established. Numerical experiments demonstrate that the practical implementation of our proposed GLGMRES-S can improve the convergence of Gl-GMRES. Furthermore, GLGMRES-S is competitive with the deflated global GMRES method GLGMRES-DR [Numer. Algorithms, 82 (2019), pp. 155-181], which augments the search space produced by the global Arnoldi process by adding harmonic $F$-Ritz vectors in an outer manner.