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

DOI Web Site Web Site 被引用文献2件

書誌事項

公開日
1994-07
権利情報
  • http://onlinelibrary.wiley.com/termsAndConditions#vor
DOI
  • 10.1002/nla.1680010406
公開者
Wiley

この論文をさがす

説明

<jats:title>Abstract</jats:title><jats:p>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.</jats:p>

収録刊行物

被引用文献 (2)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ