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

DOI10.1002/NLA.1680010502zbMath0838.65029OpenAlexW2121920162MaRDI QIDQ4868091

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

algorithmconvergencenumerical experimentsGMRESgeneralized minimal residual methodnonsymmetric systemsrestartingconjugate gradient type iterative methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (16)

Unnamed Item ⋮ A simple strategy for varying the restart parameter in GMRES\((m)\) ⋮ Restarted GMRES preconditioned by deflation ⋮ Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices ⋮ Friedrichs Learning: Weak Solutions of Partial Differential Equations via Deep Learning ⋮ GMRES algorithms over 35 years ⋮ Weighted Inner Products for GMRES and GMRES-DR ⋮ New conditions for non-stagnation of minimal residual methods ⋮ A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm ⋮ Adaptive GMRES(m) for the Electromagnetic Scattering Problem ⋮ A new implementation of the CMRH method for solving dense linear systems ⋮ 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 ⋮ Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method ⋮ Sparse approximate inverse preconditioning of deflated block-GMRES algorithm for the fast monostatic RCS calculation ⋮ Convergence properties of block GMRES and matrix polynomials

Cites Work

• Methods of conjugate gradients for solving linear systems

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