Algorithms for sparse stable systems

We deal with the problem of designing stable sparse decentralized systems. Whether the communication structure of a decentralized system can sustain stable dynamics can be reduced to the study of whether a given vector space of sparse matrices contains stable (Hurwitz) matrices. In this paper, after...

Full description

Saved in:
Bibliographic Details
Published in52nd IEEE Conference on Decision and Control pp. 3457 - 3462
Main Author Belabbas, M.-A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2013
Subjects
Bipartite graph
Eigenvalues and eigenfunctions
Matrix decomposition
Polynomials
Sparse matrices
Vectors
Online AccessGet full text

Cover

More Information
Summary:We deal with the problem of designing stable sparse decentralized systems. Whether the communication structure of a decentralized system can sustain stable dynamics can be reduced to the study of whether a given vector space of sparse matrices contains stable (Hurwitz) matrices. In this paper, after a brief overview the main known results in the area, we derive methods to create sparse stable vector space (that is, vector spaces that contain stable matrices) recursively and in polynomial time in the dimension of the space. The approach relies on perturbation theory to prove stability and on graph theory to derive polynomial time algorithms.
ISBN:1467357146
9781467357142
ISSN:0191-2216
DOI:10.1109/CDC.2013.6760413