The worst-case GMRES for normal matrices

DOI10.1023/B:BITN.0000025083.59864.bdzbMath1053.65021MaRDI QIDQ1826451

Petr Tichý, Jörg Liesen

Publication date: 6 August 2004

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

numerical experimentsGMRESgeneralized minimal residual methodnormal matricesmin-max problemideal GMRESevaluation of convergence

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items

GMRES algorithms over 35 years ⋮ Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions ⋮ On investigating GMRES convergence using unitary matrices ⋮ Necessary and sufficient conditions for GMRES complete and partial stagnation ⋮ Convergence of CG and GMRES on a tridiagonal Toeplitz linear system ⋮ Vandermonde matrices with Chebyshev nodes ⋮ On Meinardus' examples for the conjugate gradient method ⋮ Convergence analysis of Krylov subspace methods ⋮ The role eigenvalues play in forming GMRES residual norms with non-normal matrices ⋮ On the cost of iterative computations ⋮ The rate of convergence of GMRES on a tridiagonal Toeplitz linear system. II ⋮ Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems