Block Krylov subspace recycling for shifted systems with unrelated right-hand sides
Kirk M. Soodhalter

TL;DR
This paper introduces a novel approach to solve multiple shifted linear systems with unrelated right-hand sides simultaneously by interpreting them as a Sylvester equation, enabling compatibility with subspace recycling and high-performance computing techniques.
Contribution
It proposes a recycled GMRES method based on Sylvester equations that efficiently solves shifted systems with unrelated right-hand sides, overcoming previous limitations.
Findings
Methods are compatible with subspace recycling.
Numerical experiments show improved efficiency.
Block Krylov methods leverage high-performance computing.
Abstract
Many Krylov subspace methods for shifted linear systems take advantage of the invariance of the Krylov subspace under a shift of the matrix. However, exploiting this fact in the non-Hermitian case introduces restrictions; e.g., initial residuals must be collinear and this collinearity must be maintained at restart. Thus we cannot simultaneously solve shifted systems with unrelated right-hand sides using this strategy, and all shifted residuals cannot be simultaneously minimized over a Krylov subspace such that collinearity is maintained. It has been shown that this renders them generally incompatible with techniques of subspace recycling [Soodhalter et al. APNUM '14]. This problem, however, can be overcome. By interpreting a family of shifted systems as one Sylvester equation, we can take advantage of the known "shift invariance" of the Krylov subspace generated by the Sylvester…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
