On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems

DOI10.1080/00207169608804542zbMath0878.65022OpenAlexW2051029760MaRDI QIDQ4332457

Zhi-Hao Cao, David J. Evans

Publication date: 21 November 1997

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804542

zbMATH Keywords

numerical examplesiterative algorithmsnonsymmetric linear systemsquasi-minimal residual approach

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems ⋮ A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\) ⋮ A note on convergence of quasi-minimal residual smoothing

Cites Work

• A breakdown-free Lanczos type algorithm for solving linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Avoiding breakdown in the CGS algorithm
• Avoiding breakdown in variants of the BI-CGSTAB algorithm
• Polynômes orthogonaux formels - applications
• 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
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• Variants of BICGSTAB for Matrices with Complex Spectrum
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• A Family of Quasi-Minimal Residual Methods for Nonsymmetric Linear Systems
• 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