Decentralized computation for robust stability analysis of large state-space systems using Polya's theorem

Reza Kamyar, Matthew M. Peet

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

3 Scopus citations

Abstract

In this paper, we propose a parallel algorithm to solve large robust stability problems. We apply Polya's theorem to a parameter-dependent version of the Lyapunov inequality to obtain a set of coupled linear matrix inequality conditions. We show that a common implementation of a primal-dual interior-point method for solving this LMI has a block diagonal structure which is preserved at each iteration. By exploiting this property, we create a highly scalable cluster-computing implementation of our algorithm for robust stability analysis of systems with large state-space. Numerical tests confirm the scalability of the algorithm.

Original languageEnglish (US)
Title of host publication2012 American Control Conference, ACC 2012
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5948-5954
Number of pages7
ISBN (Print)9781457710957
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 American Control Conference, ACC 2012 - Montreal, QC, Canada
Duration: Jun 27 2012Jun 29 2012

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2012 American Control Conference, ACC 2012
Country/TerritoryCanada
CityMontreal, QC
Period6/27/126/29/12

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Decentralized computation for robust stability analysis of large state-space systems using Polya's theorem'. Together they form a unique fingerprint.

Cite this