On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems

DOI10.1002/NLA.1680010502MaRDI QIDQ4868091zbMATH OpenOpenAlexFDO

Authors Wayne D. Joubert

Publication date 3 June 1996

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.1680010502

zbMATH Keywords

algorithmconjugate gradient type iterative methodsconvergencegeneralized minimal residual methodGMRESnonsymmetric systemsnumerical experimentsrestarting

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• \(\text{GMRES}(m)\) algorithm with changing the restart cycle adaptively
• GMRES algorithms over 35 years
• On the convergence of restarted Krylov subspace methods
• scientific article; zbMATH DE number 2232796

Cites work

• Methods of conjugate gradients for solving linear systems

Cited in

(28)

• Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method
• A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
• Restarted GMRES preconditioned by deflation
• On fast computation of directed graph Laplacian pseudo-inverse
• Synthesis of fast and superfast solvers of large systems of linear algebraic equations using control theory methods
• A simple strategy for varying the restart parameter in GMRES\((m)\)
• A new implementation of the CMRH method for solving dense linear systems
• The analysis of restart DGMRES for solving singular linear systems
• Convergence properties of block GMRES and matrix polynomials
• Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
• GMRES algorithms over 35 years
• Discussion on convergence conditions for restarted GMRES
• On the convergence of restarted Krylov subspace methods
• \(\text{GMRES}(m)\) algorithm with changing the restart cycle adaptively
• Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices.
• Convergence conditions for a restarted GMRES method augmented with eigenspaces
• Sparse approximate inverse preconditioning of deflated block-GMRES algorithm for the fast monostatic RCS calculation
• scientific article; zbMATH DE number 1279787 (Why is no real title available?)
• scientific article; zbMATH DE number 1500186 (Why is no real title available?)
• scientific article; zbMATH DE number 1533197 (Why is no real title available?)
• scientific article; zbMATH DE number 1406971 (Why is no real title available?)
• A Technique for Accelerating the Convergence of Restarted GMRES
• Weighted Inner Products for GMRES and GMRES-DR
• Adaptive GMRES(m) for the Electromagnetic Scattering Problem
• Friedrichs Learning: Weak Solutions of Partial Differential Equations via Deep Learning
• Data-driven geometric parameter optimization for PD-GMRES
• Anderson acceleration of the proximal point method: the exact adaptive minimax, a spectral phase transition, and optimal safeguarding
• New conditions for non-stagnation of minimal residual methods

This page was built for publication: On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems

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