Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00793004
Contributor : Roc Pretdoc <>
Submitted on : Thursday, February 21, 2013 - 2:25:23 PM
Last modification on : Wednesday, April 15, 2020 - 9:56:11 AM

Links full text

Identifiers

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⟩

Share

Metrics