The computational solution of problems can be restricted by the availability of solution
methods for linear (ized) systems of equations. In conjunction with iterative methods …

This paper is about GMRES algorithms for the solution of nonsingular linear systems. We
first consider basic algorithms and study their convergence. We then focus on acceleration …

This survey concerns subspace recycling methods, a popular class of iterative methods that
enable effective reuse of subspace information in order to speed up convergence and find …

We consider deflation and augmentation techniques for accelerating the convergence of
Krylov subspace methods for the solution of nonsingular linear algebraic systems. Despite …

Solving systems of algebraic linear equations is among the most frequent problems in
scientific computing. It appears in many areas like physics, engineering, chemistry, biology …

A Journey through the History of Numerical Linear Algebra: Back Matter Page 1 Bibliography
[1] A. Abdelfattah, H. Anzt, A. Bouteiller, A. Danalis, JJ Dongarra, M. Gates, A. Haidar, J. Kurzak …

In this paper, we address the solution of three‐dimensional heterogeneous Helmholtz
problems discretized with second‐order finite difference methods with application to …

We consider the solution of large linear systems with multiple right-hand sides using a block
GMRES approach. We introduce a new algorithm that effectively handles the situation of …

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 …

Advanced Krylov subspace methods are investigated for the solution of large sparse linear
systems arising from stiff adjoint-based aerodynamic shape optimization problems. A special …