Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Control and Optimization Year : 2009

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.

Dates and versions

hal-00793004 , version 1 (21-02-2013)

Identifiers

Cite

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

Collections

INRIA INRIA2
169 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More