A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems

Biconjugate gradient method
DOI: 10.1137/0915023 Publication Date: 2005-03-01T03:42:10Z
ABSTRACT
Motivated by a recent method of Freund [SIAM J. Sci. Comput., 14 (1993), pp. 470–482], who introduced quasi-minimal residual (QMR) version the conjugate gradients squared (CGS) algorithm, QMR variant biconjugate gradient stabilized (Bi-CGSTAB) algorithm van der Vorst that is called QMRCGSTAB, proposed for solving nonsymmetric linear systems. The motivation both variants to obtain smoother convergence behavior underlying method. authors illustrate this numerical experiments also show problems on which Bi-CGSTAB performs better than CGS, same advantage carries over QMRCGSTAB.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (12)
CITATIONS (80)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....