A multi-level solution algorithm for steady-state Markov chains

  • Authors:
  • Graham Horton;Scott T. Leutenegger

  • Affiliations:
  • Univ. Erlangen-Nu¨rnberg, Erlangen, Germany;NASA Langley Research Center, Hampton, VA

  • Venue:
  • SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. It is shown how the well-known iterative aggregation-disaggregation algorithm of Takahashi can be interpreted as a special case of the new method.