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

DOI10.1080/00207169608804542MaRDI QIDQ4332457zbMATH OpenOpenAlexFDO

Authors Zhi-Hao Cao, D. 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

iterative algorithmsnonsymmetric linear systemsnumerical examplesquasi-minimal residual approach

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• scientific article; zbMATH DE number 740107

Cites work

• A breakdown-free Lanczos type algorithm for solving linear systems
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• 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
• Avoiding breakdown in the CGS algorithm
• Avoiding breakdown in variants of the BI-CGSTAB algorithm
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Polynômes orthogonaux formels - applications
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Variants of BICGSTAB for Matrices with Complex Spectrum

Cited in

(17)

• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• A note on convergence of quasi-minimal residual smoothing
• On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
• 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\)
• On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
• Analysis of a Minimum Perturbation Algorithm for Nonsymmetric Linear Systems
• A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
• On Deriving the Quasi-Minimal Residual Method
• A Family of Quasi-Minimal Residual Methods for Nonsymmetric Linear Systems
• A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
• scientific article; zbMATH DE number 740107 (Why is no real title available?)
• scientific article; zbMATH DE number 1735425 (Why is no real title available?)
• scientific article; zbMATH DE number 2016596 (Why is no real title available?)
• On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling
• Improvement of the minimal residual method for solving nonsymmetric linear systems
• Conjugate residual squared method and its improvement for non-symmetric linear systems

This page was built for publication: On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332457)