scientific article; zbMATH DE number 176399
[For the entire collection see Zbl 0753.00017.] Except the well known conjugate gradient (CG) method for the special case that the nonsingular \(N\times N\) matrix \(A\) is Hermitian and positive definite, there has not been known any satisfactory algorithm for iterative solution of very large but sparse linear systems \(Ax = b\). In fact, an algorithm, for general non-Hermitian matrices, that is able to compete in efficiency with the above CG method was proposed by \textit{R. W. Freund} and \textit{N. M. Nachtigal} [Numer. Math. 60, No. 3, 315-339 (1991; Zbl 0754.65034)] and called the quasi-minimal residual (QMR) method. This constitutes the last step in a series of successive improvements proposed during a decade by several authors. However, the QMR method is not very suitable when the modern massively parallel machines are used. To enforce the biorthogonality condition contained in the method, the inner products of some vectors need to be computed. In the original QMR these inner products are calculated within each iteration step. As the authors state, on massively parallel machines such a sequential computation usually constitutes a bottleneck. The present paper gives a version of the QMR method that overcomes this problem. It is crucial in this version, called the \(s\)-step Lanczos algorithm with look-ahead, to keep the block size \(s\) variable and combine the process with a suitable look-ahead strategy. Such an approach has the advantage that all inner products arising in the same block can be computed in parallel. A sketch for the whole algorithm is given. The advantages of the method are illustrated by three numerical examples, all concerning the solution of partial differential equations.
- A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems
- A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems
- The derived multisplitting method for iteratively solving non-Hermitian positive definite linear systems
- An efficient iterative approach to large sparse nonlinear systems with non-Hermitian Jacobian matrices
- Left conjugate gradient method for non-Hermitian linear systems
- A non-alternating preconditioned HSS iteration method for non-Hermitian positive definite linear systems
- scientific article; zbMATH DE number 1240737
- Algorithms for calculating quark propagators on large lattices
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- scientific article; zbMATH DE number 53017 (Why is no real title available?)
- QMRPACK
- A parallel version of the quasi-minimal residual method based on coupled two-term recurrences
- scientific article; zbMATH DE number 953007 (Why is no real title available?)
- scientific article; zbMATH DE number 1424566 (Why is no real title available?)
- BiLQ: an iterative method for nonsymmetric linear systems with a quasi-minimum error property
- FQMR: A flexible quasi-minimal residual method with inexact preconditioning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035550)