.png){kind=icon}
.png){kind=icon}
Return
Designing linear distributed algorithms with memory for fast convergence
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.1778.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motivated by both distributed computation and decentralized control applications, we studied the distributed linear iterative algorithms with memory. Specifically, we showed that the system of linear equations Gx = b b can be solved through a distributed linear iteration for arbitrary invertible G using only a single memory element at each processor. Further, we demonstrated that the memoried distributed algorithm can be designed to achieve much faster convergence than a memoryless distributed algorithm. Two small simulation examples were included to illustrate the results. Copyright (c) 2011 John Wiley & Sons, Ltd.
Keywords:
distributed algorithms
large-scale networks
decentralized control theory
numerical algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.2
Papers:
6.9K
Citations:
1.4W