@inproceedings{058afbcf54e342f0a1c7d38e18a2abbd,
title = "Algorithms for sparse stable systems",
abstract = "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.",
author = "Belabbas, {M. A.}",
year = "2013",
doi = "10.1109/CDC.2013.6760413",
language = "English (US)",
isbn = "9781467357173",
series = "Proceedings of the IEEE Conference on Decision and Control",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "3457--3462",
booktitle = "2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013",
address = "United States",
note = "52nd IEEE Conference on Decision and Control, CDC 2013 ; Conference date: 10-12-2013 Through 13-12-2013",
}