New \(\text{GMRES}(k)\)-type algorithms with excplicit restarts and the analysis of their convergence properties based on matrix relations in QR form

DOI10.1023/A:1022470922964zbMath1029.65030OpenAlexW292856917MaRDI QIDQ1405657

A. Yu. Yeremin, S. A. Kharchenko

Publication date: 1 September 2003

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022470922964

zbMATH Keywords

convergencenumerical resultspreconditioningfilteringGMRES algorithmrestartinggeneralized minimal residual type algorithmiterations of Arnoldi typenonsingular, unsymmetric, and indefinite matricesQR form

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

This page was built for publication: New \(\text{GMRES}(k)\)-type algorithms with excplicit restarts and the analysis of their convergence properties based on matrix relations in QR form