Residual smoothing and peak/plateau behavior in Krylov subspace methods

DOI10.1016/0168-9274(95)00087-9zbMath0855.65023OpenAlexW2051270844MaRDI QIDQ1917422

Homer F. Walker

Publication date: 11 February 1997

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(95)00087-9

zbMATH Keywords

iterative methodsKrylov subspace methodsbiconjugate gradient methodminimal residual methodsminimal residual smoothing

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (12)

Minimal polynomial and reduced rank extrapolation methods are related ⋮ 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ß ⋮ Minimal residual smoothing in multi-level iterative method ⋮ Multigrid with inexact minimal residual smoothing acceleration ⋮ Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\) ⋮ Cross-Interactive Residual Smoothing for Global and Block Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides ⋮ Unnamed Item ⋮ Minimum residual Hermitian and skew-Hermitian splitting iteration method for non-Hermitian positive definite linear systems ⋮ Numerical Equivalences among Krylov Subspace Algorithms for Skew-Symmetric Matrices ⋮ VML: a class of virtual multi-level iterative methods for solving partial differential equations ⋮ On the stable implementation of the generalized minimal error method

Cites Work

• Unnamed Item
• Unnamed Item
• Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Hybrid procedures for solving linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Residual Smoothing Techniques for Iterative Methods
• A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Residual smoothing and peak/plateau behavior in Krylov subspace methods