Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices (Q1870052)
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 1903567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices |
scientific article; zbMATH DE number 1903567 |
Statements
Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices (English)
0 references
4 May 2003
0 references
Convergence analysis of aggregation/disaggregation algorithms is presented based on fully general splittings of nonnegative type. The methods allow to compute stationary probability vectors of Markov chains containing rare events. The methodology has important applications in railway transportation systems.
0 references
Markov chain
0 references
stochastic matrix
0 references
aggregation/disaggregation procedure
0 references
stationary distribution
0 references
convergence
0 references
algorithms
0 references
splittings
0 references
railway transportation systems
0 references
0 references
0 references
0 references
0 references
0.8720431923866272
0 references
0.8696867227554321
0 references
0.8643804788589478
0 references
0.8634915351867676
0 references
