Decentralized gradient algorithm for solution of a linear equation

From MaRDI portal
Publication:330302

DOI10.3934/NACO.2016014zbMATH Open1346.93159arXiv1509.04538OpenAlexW2964255343MaRDI QIDQ330302FDOQ330302


Authors: Shaoshuai Mou, Brian D. O. Anderson, A. Stephen Morse, Uwe Helmke Edit this on Wikidata


Publication date: 25 October 2016

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Abstract: The paper develops a technique for solving a linear equation Ax=b with a square and nonsingular matrix A, using a decentralized gradient algorithm. In the language of control theory, there are n agents, each storing at time t an n-vector, call it xi(t), and a graphical structure associating with each agent a vertex of a fixed, undirected and connected but otherwise arbitrary graph mathcalG with vertex set and edge set mathcalV and mathcalE respectively. We provide differential equation update laws for the xi with the property that each xi converges to the solution of the linear equation exponentially fast. The equation for xi includes additive terms weighting those xj for which vertices in mathcalG corresponding to the i-th and j-th agents are adjacent. The results are extended to the case where A is not square but has full row rank, and bounds are given on the convergence rate.


Full work available at URL: https://arxiv.org/abs/1509.04538




Recommendations




Cites Work


Cited In (18)





This page was built for publication: Decentralized gradient algorithm for solution of a linear equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330302)