On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling

  title={On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling},
  author={Roland W. Freund and Marlis Hochbruck},
  journal={Numerical Lin. Alg. with Applic.},
Recently, Freund and Nachtigal proposed the quasi-minimal residual algorithm (QMR) for solving general nonsingular non-Hermitian linear systems. The method is based on the Lanczos process, and thus it involves matrix-vector products with both the coefficient matrix of the linear system and its transpose. Freund developed a variant of QMR, the transpose-free QMR algorithm (TFQMR), that only requires products with the coefficient matrix. In this paper, the use of QMR and TFQMR for solving… CONTINUE READING
40 Citations
11 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 11 references

QMR : a quasiminimal residual method for nonHermitian linear systems

  • N. M. Nachtigal
  • Numer . Math .
  • 1993

Predicting the behavior of finite precision Lanczos and conjugate gradient computations

  • Z. Strakos
  • SIAM J . Matrix Anal . Appl .
  • 1991

Variations of Arnoldi ’ s method for computing eigenelements of large unsymmetric matrices

  • Y. Saad.
  • Linear Algebra Appl .
  • 1990

Numerical solution of sparse singular systems of equations arising from ergodic Markov chains

  • V. A. Barker
  • Comm. Statist. Stochastic Models,
  • 1989
2 Excerpts

A lookahead Lanczos algorithm for unsymmetric matrices

  • W. J. Stewart
  • Math . Comp .
  • 1985

A survey of preconditioned iterative methods for linear systems of algebraic equations

  • 0. Axelsson
  • BIT,
  • 1985
1 Excerpt

On the solution of singular linear systems of algebraic equations by semiiterative methods

  • W. Niethammer.
  • Generalized Inverses of Linear Transformations
  • 1979

Similar Papers

Loading similar papers…