Loading [a11y]/accessibility-menu.js
Designing linear distributed algorithms with memory for fast convergence | IEEE Conference Publication | IEEE Xplore

Designing linear distributed algorithms with memory for fast convergence


Abstract:

Motivated by both distributed-computation and decentralized-control applications, we study distributed linear iterative algorithms with memory. Specifically, we show that...Show More

Abstract:

Motivated by both distributed-computation and decentralized-control applications, we study distributed linear iterative algorithms with memory. Specifically, we show that the system of linear equations Gx = b can be solved through a distributed linear iteration for arbitrary invertible G, using only a single memory element at each processor. Further, we demonstrate that the memoried distributed algorithm can be designed to achieve much faster convergence than a memoryless distributed algorithm. A small simulation example is included to illustrate the results.
Date of Conference: 15-18 December 2009
Date Added to IEEE Xplore: 29 January 2010
ISBN Information:

ISSN Information:

Conference Location: Shanghai, China

Contact IEEE to Subscribe

References

References is not available for this document.