Robust Stability Analysis of Sparsely Interconnected Uncertain Systems

Abstract

In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equivalent to the classical formulation of the robustness analysis problem and hence does not introduce any additional conservativeness. The sparse formulation of the analysis problem allows us to apply methods that rely on efficient sparse factorization techniques, and our numerical results illustrate the effectiveness of this approach compared to methods that are based on the standard formulation of the analysis problem.

Provisionally accepted to appear in IEEE Transactions on Automatic Control

References in corpus (1)

• Power-law distributions in empirical data

Cited by in corpus (11)

• Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization
• Controllability of Directed Heterogeneous Networked MIMO Systems
• Distributed Design for Decentralized Control using Chordal Decomposition and ADMM
• Sum-of-squares chordal decomposition of polynomial matrix inequalities
• A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics
• Decomposition and Completion of Sum-of-Squares Matrices
• Distributed Semidefinite Programming with Application to Large-scale System Analysis
• Scalable analysis of linear networked systems via chordal decomposition
• Sparse solution of the Lyapunov equation for large-scale interconnected systems
• A preconditioned Forward-Backward method for partially separable SemiDefinite Programs
• Automated Model Generation for Analysis of Large-scale Interconnected Uncertain Systems