TY - GEN
T1 - Decentralized computation for robust stability analysis of large state-space systems using Polya's theorem
AU - Kamyar, Reza
AU - Peet, Matthew M.
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84869402105&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84869402105&partnerID=8YFLogxK
U2 - 10.1109/acc.2012.6315268
DO - 10.1109/acc.2012.6315268
M3 - Conference contribution
AN - SCOPUS:84869402105
SN - 9781457710957
T3 - Proceedings of the American Control Conference
SP - 5948
EP - 5954
BT - 2012 American Control Conference, ACC 2012
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2012 American Control Conference, ACC 2012
Y2 - 27 June 2012 through 29 June 2012
ER -