arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.07955eess.SYcs.SY
收藏

一个分布式算法用于在随机网络上求解线性代数方程

A Distributed Algorithm for Solving Linear Algebraic Equations Over Random Networks

Iowa State University(爱荷华州立大学);University of Minnesota(明尼苏达大学)

S. Sh. Alaviani, N. Elia

AI总结:

本文研究了在随机通信拓扑下,多智能体通过局部信息求解线性方程$Ax=b$的问题,提出了一种无需依赖随机互联图分布的分布式算法,该算法在任意矩阵$A$和$b$及初始状态下均能收敛,并通过两个数值例子展示了算法收敛速度无法保证。

摘要:

本文考虑了在随机通信拓扑下,多智能体通过局部信息求解线性方程$Ax=b$的问题。方程由$m$个智能体共同求解,每个智能体仅知道划分矩阵$[A,b]$的一部分行。我们提出的问题 formulation 不需要随机互联图的分布,因此该框架包括异步更新或不可靠通信协议,而无需B连通性假设。我们应用了随机Krasnoselskii-Mann迭代算法,该算法几乎 surely 和在均方意义上收敛到问题的解,对于任意矩阵$A$和$b$以及任意智能体状态的初始条件。我们证明,智能体状态收敛到的极限点由凸优化问题的唯一解决定,无论随机通信图的分布如何。最终,我们通过两个数值例子展示了该算法的收敛速率无法保证。

英文摘要:

In this paper, we consider the problem of solving linear algebraic equations of the form $Ax=b$ among multi agents which seek a solution by using local information in presence of random communication topologies. The equation is solved by $m$ agents where each agent only knows a subset of rows of the partitioned matrix $[A,b]$. We formulate the problem such that this formulation does not need the distribution of random interconnection graphs. Therefore, this framework includes asynchronous updates or unreliable communication protocols without B-connectivity assumption. We apply the random Krasnoselskii-Mann iterative algorithm which converges almost surely and in mean square to a solution of the problem for any matrices $A$ and $b$ and any initial conditions of agents' states. We demonestrate that the limit point to which the agents' states converge is determined by the unique solution of a convex optimization problem regardless of the distribution of random communication graphs. Eventually, we show by two numerical examples that the rate of convergence of the algorithm cannot be guaranteed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑