In this study, we investigate the problem of accelerating distributed algorithms for solving linear equations over multi-agent networks. While almost all distributed algorithms in the literature assume that the equations are not shared with the neighboring agents, it is shown that the assumption is not restrictive, and an algorithm has been proposed which can be used to determine the equations of the neighbors. We also present a numerical example to illustrate that the convergence rate of a distributed algorithm can be significantly improved by using the proposed algorithm. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Mengke LianZhenyuan GuoXiaoxuan WangShiping WenTingwen Huang
Peng YiJinlong LeiJie ChenYiguang HongGuodong Shi
Hongsheng QiBo LiRui-Juan JingLei WangAlexandre ProutièreGuodong Shi