Convergence speed in distributed consensus and averaging
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove...
Main Authors: | Olshevsky, Alexander (Author), Tsitsiklis, John N. (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial & Applied Mathematics (SIAM),
2020-04-22T16:26:13Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2010) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander
Published: (2007) -
A lower bound for distributed averaging algorithms on the line graph
by: Tsitsiklis, John N., et al.
Published: (2012) -
On Distributed Averaging Algorithms and Quantization Effects
by: Tsitsiklis, John N., et al.
Published: (2010) -
Degree fluctuations and the convergence time of consensus algorithms
by: Tsitsiklis, John N.
Published: (2012)