Convergence issues in the theory and practice of iterative aggregation/disaggregation methods (Q964104): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Rózsa Horváth-Bokor / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Rózsa Horváth-Bokor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:45, 5 March 2024

scientific article
Language Label Description Also known as
English
Convergence issues in the theory and practice of iterative aggregation/disaggregation methods
scientific article

    Statements

    Convergence issues in the theory and practice of iterative aggregation/disaggregation methods (English)
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references