Abstract
We propose a variant of the generalized minimal residual (GMRES) method for solving linear systems of equations with one or multiple right-hand sides. Our method is based on the idea of the enlarged Krylov subspace to reduce communication. It can be interpreted as a block GMRES method. Hence, we are interested in detecting inexact breakdowns. We introduce a strategy to perform the test of detection. Furthermore, we propose a technique for deflating eigenvalues that has two benefits. The first advantage is to avoid the plateau of convergence after the end of a cycle in the restarted version. The second is to have very fast convergence when solving the same system with different right-hand sides, each given at a different time (useful in the context of a constrained pressure residual preconditioner). We test our method with these deflation techniques on academic test matrices arising from solving linear elasticity and convection–diffusion problems as well as matrices arising from two real-life applications, seismic imaging and simulations of reservoirs. With the same memory cost we obtain a saving of up to $50 \%$ in the number of iterations required to reach convergence with respect to the original method.
Block Krylov Subspace Recycling for Shifted Systems with Unrelated Right-Hand Sides
