Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees

Abstract : Results for estimating the convergence rate of nonstationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries). The results appear to be tight in a number of instances and are illustrated through simple as well as more sophisticated examples. The main idea is to follow propagation of information along certain spanning-trees which arise in the communication graph.
Type de document :
Article dans une revue
SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2009, 48 (1), pp.1-32. 〈10.1137/060673527〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00793004
Contributeur : Roc Pretdoc <>
Soumis le : jeudi 21 février 2013 - 14:25:23
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Lien texte intégral

Identifiants

Collections

Citation

David Angeli, Pierre-Alexandre Bliman. Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees. SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2009, 48 (1), pp.1-32. 〈10.1137/060673527〉. 〈hal-00793004〉

Partager

Métriques

Consultations de la notice

210