Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
- 1 August 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 24 (4) , 952-966
- https://doi.org/10.1137/0724062
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Iterative aggregation for solving undiscounted semi-markovian reward processesCommunications in Statistics. Stochastic Models, 1986
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chainsJournal of the ACM, 1985
- Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward ProcessesOperations Research, 1985
- Aggregation with an error of O (ε 2 )Journal of the ACM, 1985
- Perturbation bounds for the stationary probabilities of a finite Markov chainAdvances in Applied Probability, 1984
- On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matricesLinear Algebra and its Applications, 1984
- Aggregation/Disaggregation for Eigenvalue ProblemsSIAM Journal on Numerical Analysis, 1984
- Computable Error Bounds for Aggregated Markov ChainsJournal of the ACM, 1983
- Acceleration by aggregation of successive approximation methodsLinear Algebra and its Applications, 1982
- Aggregation of Variables in Dynamic SystemsEconometrica, 1961