On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
type: Item
instance of: scholarly article
title: On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
zbMATH Open document ID: 0939.65051
DOI: 10.1016/S0168-9274(98)00004-X
published in: Applied Numerical Mathematics
publication date: 2000-07-10T00:00:00Z
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.
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 1311236
zbMATH Keywords: iterative methods
zbMATH Keywords: quasi-minimal residual algorithms
zbMATH Keywords: non-symmetric linear systems
zbMATH Keywords: three-term recurrences
zbMATH Keywords: breakdown avoiding algorithm
author: Zhi-Hao Cao
reviewed by: Florica Luban
describes a project that uses: na1
describes a project that uses: CGS
MaRDI profile type: Publication
cites work: A breakdown-free Lanczos type algorithm for solving linear systems
cites work: Avoiding breakdown and near-breakdown in Lanczos type algorithms
cites work: Avoiding breakdown in variants of the BI-CGSTAB algorithm
cites work: A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
cites work: A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: Variants of BICGSTAB for Matrices with Complex Spectrum
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: A Family of Quasi-Minimal Residual Methods for Nonsymmetric Linear Systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Residual Smoothing Techniques for Iterative Methods
full work available at URL: s0168-9274(98)00004-x
OpenAlex ID: W2021735926
description: scientific article; zbMATH DE number 1311236