.png){kind=icon}
返回
Designing linear distributed algorithms with memory for fast convergence
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.1778.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
distributed algorithms
large-scale networks
decentralized control theory
numerical algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容