Note on functional iteration technique for type Markov chains
โ Scribed by Noah H. Rhee
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 133 KB
- Volume
- 432
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
A thorough theoretical explanation of the numerical behaviour of functional iteration methods for the computation of the minimal nonnegative solution G of the matrix equation X = โ i=0 X i A i , arising in the numerical solution of M/G/1 type Markov chains, is given in Meini (1997) [2]. In this note we add some more results. In particular, we show that an upper bound of the mean asymptotic convergence rate of the best functional iteration method is given in terms of the second largest modulus eigenvalue of G.
๐ SIMILAR VOLUMES
O'Cinneide presented an entrywise perturbation theorem for Markov chains. The error bound he obtained is nearly best possible. We give the best possible error bound.
Many stochastic models in queueing, inventory, communications, and dam theories, etc., result in the problem of numerically determining the minimal nonnegative solutions for a class of nonlinear matrix equations. Various iterative methods have been proposed to determine the matrices of interest. We
It is well known that successive overrelaxation (SOR) can be used to compute the stationary distribution of a homogeneous Markov chain. In a long paper Kontovasalis et al. (K. Kontovasalis, R.J. Plemmons, W.J. Stewart, Linear Algebra Appl. 154-156 (1991) showed together with other results that for p