✦ LIBER ✦

Necessary and sufficient local convergence condition of one class of iterative aggregation–disaggregation methods

✍ Scribed by Ivana Pultarová

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 123 KB
Volume: 15
Category: Article
ISSN: 1070-5325
DOI: 10.1002/nla.569

No coin nor oath required. For personal study only.

✦ Synopsis

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 determined only by the sparsity pattern of the matrix and by the choice of the aggregation groups. We introduce the asymptotic convergence rates of the normalized components of approximations corresponding to particular aggregation groups and we also specify an upper bound on the rates. Copyright © 2008 John Wiley & Sons, Ltd.

📜 SIMILAR VOLUMES

On a class of Besicovitch functions to h

On a class of Besicovitch functions to have exact box dimension: A necessary and sufficient condition

✍ S. P. Zhou; G. L. He 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract Let 1 < __s__ < 2, __λ~k~__ > 0 with __λ~k~__ → ∞ satisfy __λ__~__k__+1~/__λ~k~__ ≥ __λ__ > 1. For a class of Besicovich functions __B__(__t__) = $ \sum ^{\infty} \_{k=1} \, \lambda ^{s-2} \_{k} $ sin __λ~k~t__, the present paper investigates the intrinsic relationship between box dimen