一个分布式算法用于解决具有成员动态的网络上的正定线性方程
A Distributed Algorithm for Solving Positive Definite Linear Equations over Networks with Membership Dynamics
AI总结:
本文提出SE算法,用于解决具有任意异步交互和成员动态的网络上的正定线性方程组,证明了其有界性、渐近收敛性和指数收敛性,并通过模拟验证其在动态网络中的有效性。
摘要:
本文考虑了在具有任意异步交互和成员动态的网络中求解对称正定线性方程组的问题。后者意味着每个代理可以随时加入和离开网络,无限次地,并在离开时丢失所有记忆。我们开发了Subset Equalizing (SE),一种用于解决此类问题的分布式异步算法。为了设计和分析SE,我们引入了一个新的时间变化Lyapunov-like函数,定义在具有变化维度的状态空间上,并引入了一种广义的网络连通性概念,能够处理此类交互和成员动态。基于这些,我们建立了SE的有界性、渐近收敛性和指数收敛性,以及收敛速率的界。最后,通过广泛的模拟,我们证明SE在动态代理网络中是有效的,并且SE的一个特例,称为Groupwise Equalizing,比多跳无线网络中现有的两种算法在带宽/能耗效率上显著更高。
英文摘要:
This paper considers the problem of solving a symmetric positive definite system of linear equations over a network of agents with arbitrary asynchronous interactions and membership dynamics. The latter implies that each agent is allowed to join and leave the network at any time, for infinitely many times, and lose all its memory upon leaving. We develop Subset Equalizing (SE), a distributed asynchronous algorithm for solving such a problem. To design and analyze SE, we introduce a novel time-varying Lyapunov-like function, defined on a state space with changing dimension, and a generalized concept of network connectivity, capable of handling such interactions and membership dynamics. Based on them, we establish the boundedness, asymptotic convergence, and exponential convergence of SE, along with a bound on its convergence rate. Finally, through extensive simulation, we show that SE is effective in a volatile agent network and that a special case of SE, termed Groupwise Equalizing, is significantly more bandwidth/energy efficient than two existing algorithms in multi-hop wireless networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。