Numerical Experiments with Iteration and Aggregation for Markov Chains

Abstract
This paper describes an iterative aggregation/disaggregation method for computingthe stationary probability vector of a nearly completely decomposable Markovchain. The emphasis is on the implementation of the algorithm and on the resultsthat are obtained when it is applied to three modelling examples that have beenused in the analysis of computer/communication systems. Where applicable, a comparisonwith standard iterative and direct methods for solving the same problems,is made.Key...

This publication has 0 references indexed in Scilit: