Numerical methods in Markov chain modeling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1989

Numerical methods in Markov chain modeling


This paper describes and compares several methods for computing stationary probability distributions of Markov chains. The main linear algebra problem consists of computing an eigenvector of a sparse, usually non-symmetric, matrix associated with a known eigenvalue. It can be also be cast as a problem of solving a homogeneous, singular linear system. We present several methods based on combinations of Krylov subspace techniques, single vector power iteration and relaxation procedures, and acceleration techniques. We compare the performance of these methods on some realistic problems.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1115.pdf (2.32 Mo) Télécharger le fichier

Dates and versions

inria-00075444 , version 1 (24-05-2006)


  • HAL Id : inria-00075444 , version 1


Bernard Philippe, Yousef Saad, William J. Stewart. Numerical methods in Markov chain modeling. [Research Report] RR-1115, INRIA. 1989. ⟨inria-00075444⟩
286 View
39235 Download


Gmail Facebook Twitter LinkedIn More