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

一个分布式算法用于求解线性代数方程

A Distributed Algorithm for Solving a Linear Algebraic Equation

MIT(麻省理工学院);Yale University(耶鲁大学);University of Illinois, Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

Shaoshuai Mou, Ji Liu, A. Stephen Morse

AI总结:

本文提出一个分布式算法,用于在每个代理仅知道矩阵(A,b)的部分行、邻居的当前解估计值的情况下,求解线性方程Ax=b,并证明算法可使所有代理的估计值以指数速度收敛到同一解。

摘要:

本文描述了一种分布式算法,用于求解形式为Ax=b的线性代数方程,假设该方程至少有一个解。假设有m个代理同时求解该方程,每个代理仅知道矩阵(A,b)的部分行、其邻居生成的当前解的估计值以及其它信息。每个代理通过递归更新其估计值,利用每个邻居生成的当前估计值。邻居关系由一个时间依赖的有向图N(t)描述,其顶点对应于代理,其边表示邻居关系。证明对于任何具有解的矩阵A以及任何序列的“反复联合强连通图”N(t),t=1,2,…,该算法使所有代理的估计值以指数速度收敛到Ax=b的同一解。还证明,如果要保证指数收敛,则邻居图序列必须实际上是反复联合强连通的。推导了当Ax=b有唯一解时的最坏收敛速率界。证明即使A和b随时间变化,只要其变化速率足够小,通过小幅修改算法,即可跟踪Ax=b的解。还证明在无通信延迟的情况下,即使每个代理更新估计值的时间不与邻居的更新时间同步,也能以指数速度收敛到解。还概述了该算法的一种修改版本,使其能够以分布式方式获得Ax=b的最小二乘解,即使Ax=b没有解。

英文摘要:

A distributed algorithm is described for solving a linear algebraic equation of the form $Ax=b$ assuming the equation has at least one solution. The equation is simultaneously solved by $m$ agents assuming each agent knows only a subset of the rows of the partitioned matrix $(A,b)$, the current estimates of the equation's solution generated by its neighbors, and nothing more. Each agent recursively updates its estimate by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-dependent directed graph $\mathbb{N}(t)$ whose vertices correspond to agents and whose arcs depict neighbor relations. It is shown that for any matrix $A$ for which the equation has a solution and any sequence of "repeatedly jointly strongly connected graphs" $\mathbb{N}(t)$, $t=1,2,\ldots$, the algorithm causes all agents' estimates to converge exponentially fast to the same solution to $Ax=b$. It is also shown that the neighbor graph sequence must actually be repeatedly jointly strongly connected if exponential convergence is to be assured. A worst case convergence rate bound is derived for the case when $Ax=b$ has a unique solution. It is demonstrated that with minor modification, the algorithm can track the solution to $Ax = b$, even if $A$ and $b$ are changing with time, provided the rates of change of $A$ and $b$ are sufficiently small. It is also shown that in the absence of communication delays, exponential convergence to a solution occurs even if the times at which each agent updates its estimates are not synchronized with the update times of its neighbors. A modification of the algorithm is outlined which enables it to obtain a least squares solution to $Ax=b$ in a distributed manner, even if $Ax=b$ does not have a solution.

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

↑