.png){kind=icon}
.png){kind=icon}
Return
A Distributed Algorithm for Least Squares Solutions
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2019.2894588.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this technical note, a distributed algorithm is proposed for multiagent networks to achieve a least squares solution of a system of linear equations, in which each agent only knows part of the overall equations and communicates only with its nearby neighbors. The proposed algorithm is discrete time but does not involve small or time-varying step sizes. Given that the network is fixed, connected, and undirected, the proposed algorithm enables all agents in the network to achieve exponentially fast the same least squares solution; this is validated by simulations.
Keywords:
Distributed algorithms
least squares solutions
linear equations
multiagent networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
