A convergence analysis of the iterative aggregation method with one parameter
โ Scribed by Jan Mandel
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 604 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An aggregation/disaggregation iterative algorithm for computing stationary probability vectors of stochastic matrices is analysed. Two convergence results are presented. First, it is shown that fast, global convergence can be achieved provided that a sufficiently high number of relaxations is perfor
## Abstract This paper concludes one part of the local convergence analysis of a certain class of iterative aggregationโdisaggregation methods for computing a stationary probability distribution vector of an irreducible stochastic matrix __B__. We show that the local convergence of the algorithm is