On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems

DOI10.1016/S0168-9274(98)00004-XMaRDI QIDQ1294470zbMATH OpenOpenAlexFDO

Authors Zhi-Hao Cao

Publication date 10 July 2000

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

Full work available at URL https://doi.org/10.1016/s0168-9274(98)00004-x

zbMATH Keywords

breakdown avoiding algorithmiterative methodsnon-symmetric linear systemsquasi-minimal residual algorithmsthree-term recurrences

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Review text

The paper is concerned with the construction of smoothly convergent variants of any iterative algorithm for solving non-symmetric linear systems. For this purpose quasi-minimal residual (QMR) algorithms, which include two- or three- or alternating two- and three-term recurrences, are proposed. It is shown that the QMR approach can also be applied to a breakdown avoiding algorithm.

Recommendations

• On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences

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 and near-breakdown in Lanczos type algorithms
• 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
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Residual Smoothing Techniques for Iterative Methods
• Variants of BICGSTAB for Matrices with Complex Spectrum

Cited in

(10)

• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• A note on convergence of quasi-minimal residual smoothing
• Variations of Zhang's Lanczos-type product method
• Fast iterative solution of stabilized Navier--Stokes systems
• Towards backward perturbation bounds for approximate dual Krylov subspaces
• A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems
• Hybrid Bi-CG methods with a Bi-CG formulation closer to the IDR approach
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• scientific article; zbMATH DE number 592769 (Why is no real title available?)
• On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems

Describes a project that uses

Uses Software

• na1
• CGS

This page was built for publication: On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems

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