Convergence speed in distributed consensus and averaging
Name
136922315-MIT.pdf
Description
Full printable version
Size
2.77 MB
Format
Adobe PDF
Checksum (MD5)
5c900135d2d236b7b89f0a8368a4faef
Author(s)
Olshevsky, Alexander
Advisor(s)
John N. Tsitsiklis.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the worst-case convergence time.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (leaves 71-75).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
