On the convergence of Krylov methods with low-rank truncations
Open Access
- 23 March 2021
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 88 (3) , 1383-1417
Abstract
Low-rank Krylov methods are one of the few options available in the literature to address the numerical solution of large-scale general linear matrix equations. These routines amount to well-known Krylov schemes that have been equipped with a couple of low-rank truncations to maintain a feasible storage demand in the overall solution procedure. However, such truncations may affect the convergence properties of the adopted Krylov method. In this paper we show how the truncation steps have to be performed in order to maintain the convergence of the Krylov routine. Several numerical experiments validate our theoretical findings.Keywords
All Related Versions
This publication has 63 references indexed in Scilit:
- TT-GMRES: solution to a linear system in the structured tensor formatRussian Journal of Numerical Analysis and Mathematical Modelling, 2013
- Adaptive rational Krylov subspaces for large-scale dynamical systemsSystems & Control Letters, 2011
- Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equationsNumerical Linear Algebra with Applications, 2008
- Low rank solution of data-sparse Sylvester equationsNumerical Linear Algebra with Applications, 2008
- Block-diagonal preconditioning for spectral stochastic finite-element systemsIMA Journal of Numerical Analysis, 2008
- Component‐based iterative methods for sparse linear systemsConcurrency and Computation: Practice and Experience, 2006
- Recent computational developments in Krylov subspace methods for linear systemsNumerical Linear Algebra with Applications, 2006
- Solution of stochastic partial differential equations using Galerkin finite element techniquesComputer Methods in Applied Mechanics and Engineering, 2001
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Structured Linear Algebra Problems in Digital Signal Processing1991