Regenerative Analysis and Steady State Distributions for Markov Chains
暂无分享,去创建一个
We apply regenerative theory to derive certain relations between steady state probabilities of a Markov chain. These relations are then used to develop a numerical algorithm to find these probabilities. The algorithm is a modification of the Gauss-Jordan method, in which all elements used in numerical computations are nonnegative; as a consequence, the algorithm is numerically stable.
[1] John G. Kemeny,et al. Finite Markov Chains. , 1960 .
[2] Marcel F. Neuts,et al. Matrix-Geometric Solutions in Stochastic Models , 1981 .
[3] M. L. Chaudhry,et al. A new method to solve steady state queueing equations , 1982 .
[4] Leonard Kleinrock,et al. Theory, Volume 1, Queueing Systems , 1975 .
[5] H. Keller,et al. Analysis of Numerical Methods , 1969 .