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

DOI10.1023/A:1022470922964MaRDI QIDQ1405657zbMATH OpenOpenAlexFDO

Authors S. A. Kharchenko, A. Yu. Yeremin

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

convergencefilteringgeneralized minimal residual type algorithmGMRES algorithmiterations of Arnoldi typenonsingular, unsymmetric, and indefinite matricesnumerical resultspreconditioningQR formrestarting

Mathematics Subject Classification ID

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

Recommendations

• Adaptively Preconditioned GMRES Algorithms
• A new variant of restarted GMRES
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• A Restarted GMRES Method Augmented with Eigenvectors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405657)