๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A local convergence proof for the iterative aggregation method

โœ Scribed by Jan Mandel; Bohuslav Sekerka

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
477 KB
Volume
51
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Necessary and sufficient local convergen
Necessary and sufficient local convergence condition of one class of iterative aggregationโ€“disaggregation methods
โœ Ivana Pultarovรก ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 123 KB

## 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

Convergence analysis of an iterative agg
Convergence analysis of an iterative aggregation/disaggregation method for computing stationary probability vectors of stochastic matrices
โœ Ivo Marek; Petr Mayer ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 104 KB ๐Ÿ‘ 2 views

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