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

DOI10.1002/NLA.1680010502zbMATH Open0838.65029OpenAlexW2121920162MaRDI QIDQ4868091FDOQ4868091

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

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

zbMATH Keywords

convergencealgorithmnumerical experimentsgeneralized minimal residual methodGMRESnonsymmetric systemsrestartingconjugate gradient type iterative methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Methods of conjugate gradients for solving linear systems

Cited In (25)

• Title not available (Why is that?)
• Restarted GMRES preconditioned by deflation
• New conditions for non-stagnation of minimal residual methods
• A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
• On fast computation of directed graph Laplacian pseudo-inverse
• \(\text{GMRES}(m)\) algorithm with changing the restart cycle adaptively
• Title not available (Why is that?)
• Adaptive GMRES(m) for the Electromagnetic Scattering Problem
• Friedrichs Learning: Weak Solutions of Partial Differential Equations via Deep Learning
• A Technique for Accelerating the Convergence of Restarted GMRES
• Weighted Inner Products for GMRES and GMRES-DR
• A simple strategy for varying the restart parameter in GMRES\((m)\)
• The analysis of restart DGMRES for solving singular linear systems
• Synthesis of fast and superfast solvers of large systems of linear algebraic equations using control theory methods
• On the convergence of restarted Krylov subspace methods
• A new implementation of the CMRH method for solving dense linear systems
• Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices
• Convergence conditions for a restarted GMRES method augmented with eigenspaces
• Convergence properties of block GMRES and matrix polynomials
• Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
• Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method
• Title not available (Why is that?)
• Sparse approximate inverse preconditioning of deflated block-GMRES algorithm for the fast monostatic RCS calculation
• GMRES algorithms over 35 years
• Discussion on convergence conditions for restarted GMRES

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)