Back to Search
Start Over
On the convergence of Krylov methods with low-rank truncations.
- Source :
-
Numerical Algorithms . Nov2021, Vol. 88 Issue 3, p1383-1417. 35p. - Publication Year :
- 2021
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LINEAR equations
*KRYLOV subspace
Subjects
Details
- Language :
- English
- ISSN :
- 10171398
- Volume :
- 88
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Numerical Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 152899624
- Full Text :
- https://doi.org/10.1007/s11075-021-01080-2