A note on convergence of quasi-minimal residual smoothing
From MaRDI portal
Publication:1294408
DOI10.1016/S0096-3003(97)10074-1zbMath0944.65030MaRDI QIDQ1294408
Publication date: 14 May 2000
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
- Avoiding breakdown in variants of the BI-CGSTAB algorithm
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Variants of BICGSTAB for Matrices with Complex Spectrum
- Residual Smoothing Techniques for Iterative Methods
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
This page was built for publication: A note on convergence of quasi-minimal residual smoothing