Scalable analysis of linear networked systems via chordal decomposition

arXiv1803.05996MaRDI QIDQ6299124FDOQ6299124

Maryam Kamgarpour, Antonis Papachristodoulou, Aivar Sootla, Yang Zheng

Publication date: 15 March 2018

Abstract: This paper introduces a chordal decomposition approach for scalable analysis of linear networked systems, including stability, $mathcal{H}_2$ and $mathcal{H}_{infty}$ performance. Our main strategy is to exploit any sparsity within these analysis problems and use chordal decomposition. We first show that Grone's and Agler's theorems can be generalized to block matrices with any partition. This facilitates networked systems analysis, allowing one to solely focus on the physical connections of networked systems to exploit scalability. Then, by choosing Lyapunov functions with appropriate sparsity patterns, we decompose large positive semidefinite constraints in all of the analysis problems into multiple smaller ones depending on the maximal cliques of the system graph. This makes the solutions more computationally efficient via a recent first-order algorithm. Numerical experiments demonstrate the efficiency and scalability of the proposed method.

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Input-output approaches in control theory (93D25)

This page was built for publication: Scalable analysis of linear networked systems via chordal decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6299124)