We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains.
- Authors
Mattingly, R. Bruce
- Abstract
This paper presents a new algorithm which uses stochastic complementation to compute the stationary distribution vector of a nearly completely decomposable (NCD) Markov chain. NCD problems are ill-conditioned, and many methods suffer from loss of accuracy. A formal error analysis and test results from a series of NCD problems are presented which show that the new algorithm computes accurate solutions to this type of problem. Operation counts and timings from experiments are presented which highlight the efficiency of the new algorithm.
- Subjects
ALGORITHMS; STOCHASTIC processes; MARKOV processes
- Publication
ORSA Journal on Computing, 1995, Vol 7, Issue 2, p117
- ISSN
0899-1499
- Publication type
Article
- DOI
10.1287/ijoc.7.2.117