Stability of a distributed algorithm for solving linear algebraic equations

Ji Liu, A. Stephen Morse, Angelia Nedic, Tamer Basar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publication53rd IEEE Conference on Decision and Control,CDC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3707-3712
Number of pages6
EditionFebruary
ISBN (Electronic)9781479977468
DOIs
StatePublished - 2014
Event2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 - Los Angeles, United States
Duration: Dec 15 2014Dec 17 2014

Publication series

NameProceedings of the IEEE Conference on Decision and Control
NumberFebruary
Volume2015-February
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
Country/TerritoryUnited States
CityLos Angeles
Period12/15/1412/17/14

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Stability of a distributed algorithm for solving linear algebraic equations'. Together they form a unique fingerprint.

Cite this