Convergence issues in the theory and practice of iterative aggregation/disaggregation methods (Q964104)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5692967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence issues in the theory and practice of iterative aggregation/disaggregation methods |
scientific article; zbMATH DE number 5692967 |
Statements
Convergence issues in the theory and practice of iterative aggregation/disaggregation methods (English)
0 references
14 April 2010
0 references
Iterative aggregation/disaggregation (IAD) methods for the computation of stationary probability vectors of large scale Markov chains form efficient practical analysis tools. In this paper, some new concepts are studied as well as their behavior and dependence on the parameters involved in aggregation algorithms, and establish some necessary and/or sufficient conditions for convergence. The theory developed offers a proof of convergence of IAD algorithms independent of whether the governing iteration matrix is primitive or cyclic of two IAD processes.
0 references
stationary probability vector of Markov chain
0 references
iterative aggregation/disaggregation
0 references
convergence
0 references
0.9416857361793518
0 references
0.9117084741592408
0 references
0.9045383334159852
0 references
0.8928077220916748
0 references
