Deflation and augmentation techniques in Krylov subspace methods for the solution of linear systems
classification
🧮 math.NA
keywords
linearsystemsaugmentationdeflationkrylovmethodssolutionsubspace
read the original abstract
In this paper we present deflation and augmentation techniques that have been designed to accelerate the convergence of Krylov subspace methods for the solution of linear systems of equations. We review numerical approaches both for linear systems with a non-Hermitian coefficient matrix, mainly within the Arnoldi framework, and for Hermitian positive definite problems with the conjugate gradient method.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Adaptive LSQR Preconditioning from One Small Sketch
APLICUR uses one modest sketch to adaptively update a CUR preconditioner interleaved with LSQR iterations, delivering convergence guarantees independent of sketch size for general large-scale least-squares problems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.