QMRPACK: A Package of QMR Algorithms

@article{Freund1996QMRPACKAP,
  title={QMRPACK: A Package of QMR Algorithms},
  author={Roland W. Freund and No{\"e}l M. Nachtigal},
  journal={ACM Trans. Math. Softw.},
  year={1996},
  volume={22},
  pages={46-77}
}
The quasi-minimal residual (QMR) algorithm is a Krylov-subspace method for the iterative solution of large non-Hermitian linear systems. QMR is based on the look-ahead Lanczos algorithm that, by itself, can also be used to obtain approximate eigenvalues of large non-Hermitian matrices. QMRPACK is a software package with Fortran 77 implementations of the QMR algorithm and variants thereof, and of the three-term and coupled two-term look-ahead Lanczos algorithms. In this article, we discuss some… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS

Solving large linear systems with multiple right-hand sides

VIEW 2 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

A NEW DYNAMICS KERNEL FOR THE MC2 MODEL II: FLEXIBLE GMRES ELLIPTIC SOLVER

James Thomas, R. Benoit, M. Desgagn, P. PellerinRecherche, A. V. MalevskyUniversit
  • 1997
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

The nonlinear eigenvalue problem

VIEW 1 EXCERPT
CITES METHODS

Solving Complex-Valued Linear Systems via Equivalent Real Formulations

  • SIAM J. Scientific Computing
  • 2001
VIEW 1 EXCERPT
CITES BACKGROUND