GMRES convergence bounds that depend on the right-hand-side vector

DOI10.1093/IMANUM/DRT025zbMath1302.65083OpenAlexW2018627399MaRDI QIDQ5416812

David Titley-Peloquin, Jennifer Pestana, Andrew J. Wathen

Publication date: 15 May 2014

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:682cdddf-e26c-4540-bb82-37ab23d09648

zbMATH Keywords

convergencenumerical experimentsiterative methodsleast squares problemKrylov subspace methodsgeneralized minimial residual algorithm (GMRES)

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (11)

Design and evaluation of homotopies for efficient and robust continuation ⋮ GMRES convergence bounds for eigenvalue problems ⋮ Enabling off-design linearised aerodynamics analysis using Krylov subspace recycling technique ⋮ Applying GMRES to the Helmholtz equation with strong trapping: how does the number of iterations depend on the frequency? ⋮ GMRES algorithms over 35 years ⋮ Properties of Worst-Case GMRES ⋮ Motivations and realizations of Krylov subspace methods for large sparse linear systems ⋮ Inexact block SSOR-like preconditioners for non-Hermitian positive definite linear systems of strong Hermitian parts ⋮ Wavelet preconditioned Newton-Krylov method for elastohydrodynamic lubrication of line contact problems ⋮ The role eigenvalues play in forming GMRES residual norms with non-normal matrices ⋮ A Fast Block $\alpha$-Circulant Preconditoner for All-at-Once Systems From Wave Equations

Uses Software

• SDPT3
• SparseMatrix

This page was built for publication: GMRES convergence bounds that depend on the right-hand-side vector