Abstract
In [1], given a matrix A and a vector b, a distributed algorithm was proposed for solving linear algebraic equations of the form Ax = b when there is at least one solution. The equation is simultaneously solved by a group of autonomous agents whose neighbor relations are characterized by a time-dependent directed graph. The main contribution of this paper is to provide necessary and sufficient conditions for exponential convergence of the algorithm under the most general assumption. These conditions utilize a new notion of graph connectivity which is less restrictive than strong connectivity.
Original language | English (US) |
---|---|
Article number | 7039966 |
Pages (from-to) | 3707-3712 |
Number of pages | 6 |
Journal | Unknown Journal |
Volume | 2015-February |
Issue number | February |
DOIs | |
State | Published - 2014 |
Externally published | Yes |
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization