By how much can residual minimization accelerate the convergence of orthogonal residual methods?

DOI10.1023/A:1011889705659zbMath0987.65032MaRDI QIDQ5948215

Miroslav Rozložnik, Martin H. Gutknecht

Publication date: 31 October 2001

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

GMRESresidual smoothingArnoldi methodconjugate gradientconjugate residualminimal residualorthogonal residual

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

Improved CRI iteration methods for a class of complex symmetric linear systems ⋮ Lanczos-type variants of the COCR method for complex nonsymmetric linear systems ⋮ A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß ⋮ Minimum residual modified HSS iteration method for a class of complex symmetric linear systems ⋮ Cross-Interactive Residual Smoothing for Global and Block Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides ⋮ Minimum residual Hermitian and skew-Hermitian splitting iteration method for non-Hermitian positive definite linear systems ⋮ Variants of residual smoothing with a small residual gap ⋮ Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG

This page was built for publication: By how much can residual minimization accelerate the convergence of orthogonal residual methods?