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

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 singular systems is explored. First, a convergence result for the general class of Krylov-subspace methods applied to singular systems is presented. Then, it is shown that QMR and TFQMR both converge for consistent singular linear systems with coefficient matrices of index 1. Singular systems of this type arise in Markov chain modeling. For this particular application, numerical experiments are reported.

[1]  C. D. Meyer,et al.  Generalized inverses of linear transformations , 1979 .

[2]  R. Freund.  Quasi-Kernel Polynomials and Convergence Results for Quasi-Minimal Residual Iterations , 1992 .

[3]  I. Marek,et al.  On the solution of singular linear systems of algebraic equations by semiiterative methods , 1988 .

[4]  G. Golub,et al.  Iterative solution of linear systems , 1991, Acta Numerica.

[5]  V. A. Barker.  Numerical solution of sparse singular systems of equations arising from ergodic markov chains , 1989 .

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  Yousef Saad,et al.  Numerical Methods in Markov Chain Modelling , 1996 .

[8]  Y. Saad.  Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices , 1980 .

[9]  Roland W. Freund,et al.  An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices , 1993, SIAM J. Sci. Comput..

[10]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[11]  Anne Greenbaum,et al.  Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations , 2015, SIAM J. Matrix Anal. Appl..

[12]  P. Sonneveld.  CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems , 1989 .

[13]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[14]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[15]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[16]  Youcef Saad,et al.  A Basic Tool Kit for Sparse Matrix Computations , 1990 .

[17]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[18]  R. Freund,et al.  QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .

[19]  Owe Axelsson,et al.  A survey of preconditioned iterative methods for linear systems of algebraic equations , 1985 .

[20]  Zhishun A. Liu,et al.  A Look Ahead Lanczos Algorithm for Unsymmetric Matrices , 1985 .