SIMPLICIAL ALGORITHMS FOR COMPUTING STATIONARY PROBABILITIES OF STOCHASTIC MATRICES

The so called simplicial algorithms are put into use to compute the st ationary probability distributions of stochastic matrices. This is a t ypical example of application of simplicial algorithms to compute the fixed points of a continuous map (Brouwer's theorem). We further demon strate the variable grid refinement approach involved in the simplicia l algorithms. The variable grid refinement scheme gives good accuracy and acceptable average computational complexity. (C) 1998 Elsevier Sci ence Inc. All rights reserved.