A new computational GMRES method

DOI10.1016/j.amc.2007.10.011zbMath1143.65031OpenAlexW2144604126MaRDI QIDQ928072

H. Saberi Najafi, Hossein Zareamoghaddam

Publication date: 11 June 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.011

zbMATH Keywords

linear systemsKrylov subspaces methodweighted Arnoldi method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (6)

GMRES implementations and residual smoothing techniques for solving ill-posed linear systems ⋮ GMRES algorithms over 35 years ⋮ Weighted Inner Products for GMRES and GMRES-DR ⋮ Some observations on weighted GMRES ⋮ A new family of \((I+S)\)-type preconditioner with some applications ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations

Cites Work

• Unnamed Item
• Weighted FOM and GMRES for solving nonsymmetric linear systems
• A fast implementation for GMRES method
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems

This page was built for publication: A new computational GMRES method