Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
DOI10.1137/0608020zbMath0625.65150OpenAlexW2082472686MaRDI QIDQ3028309
Publication date: 1987
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0608020
Gaussian eliminationdirect methodsergodic statesblock- tridiagonal matricessparsity schemesstationary distribution of an irreducible Markov chain
Continuous-time Markov processes on general state spaces (60J25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probabilistic methods, stochastic differential equations (65C99) Software, source code, etc. for problems pertaining to probability theory (60-04)
Related Items (8)
Cites Work
- Unnamed Item
- Matrix Methods for Queuing Problems
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- Computation of the stationary distribution of a markov chain
This page was built for publication: Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains