Any finite convergence curve is possible in the initial iterations of restarted FOM

zbMath1338.65086MaRDI QIDQ288640

Marcel Schweitzer

Publication date: 27 May 2016

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol45/abstract_vol45_pp133-145.html

zbMATH Keywords

linear systemsGMRES methodfull orthogonalization methodrestarted Arnoldi method for matrix functionsrestarted Krylov subspace methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (5)

New matrix function approximations and quadrature rules based on the Arnoldi process ⋮ Restarted Hessenberg method for solving shifted nonsymmetric linear systems ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES ⋮ On prescribing the convergence behavior of the conjugate gradient algorithm

This page was built for publication: Any finite convergence curve is possible in the initial iterations of restarted FOM