On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems

Abstract

The problem of shifted linear systems is an important and challenging issue in a number of research applications. Krylov subspace methods are effective techniques for different kinds of this problem due to their advantages in large and sparse matrix problems. In this paper, two new block projection methods based on respectively block FOM and block GMRES are introduced for solving sequences of shifted linear systems. We first express the original problem explicitly by a sequence of Sylvester matrix equations whose coefficient matrices are obtained from the shifted linear systems. Then, we show the restarted shifted block FOM (rsh-BFOM) method and derive some of its properties. We also present a framework for the restarted shifted block GMRES (rsh-BGMRES) method. In this regard, we describe two variants of rsh-BGMRES, including: 1) rsh-BGMRES with an unshifted base system that applies a fixed unshifted base system and 2) rsh-BGMRES with a variable shifted base system in which the base block system can change after restart. Furthermore, we consider the use of deflation techniques for improving the performance of the rsh-BFOM and rsh-BGMRES methods. Finally, some numerical experiments are conducted to demonstrate the effectiveness of the proposed methods.

GMRES algorithms over 35 years

“…A block GMRES algorithm for solving (33) was described by Robbé and Sadkane [212] in 2002; see also [238,292]. It is known that a family of shifted systems can be interpreted as a Sylvester equation of the form (33) where D is a diagonal matrix; see [247,84]. GMRES has also been extended to solve least square problems [137], tensor equations [57], and quaternion linear systems [148].…”