The biconjugate gradient (BCG) method is the "natural" generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. In this paper, we present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported. © 1991 Springer-Verlag.
CITATION STYLE
Freund, R. W., & Nachtigal, N. M. (1991). QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik, 60(1), 315–339. https://doi.org/10.1007/BF01385726
Mendeley helps you to discover research relevant for your work.