Core Concepts
The article presents a generalization of Gershgorin's theorem to analyze and synthesize control systems with parametrically uncertain and time-varying matrices, including those without diagonal dominance.
Abstract
The paper focuses on investigating the localization of eigenvalues of matrices, with applications to the analysis and synthesis of control systems. It considers Gershgorin's theorem and its derivatives to obtain estimates of the eigenvalue regions for constant matrices, as well as matrices with interval-uncertain and time-varying parameters.
The key highlights and insights are:
- Lemmas 1 and 2 provide upper and lower bounds on the real parts of the eigenvalues of a constant matrix using Gershgorin's theorem and its extensions.
- Lemmas 3-5 generalize the results to matrices with interval-uncertain and time-varying elements, introducing the concept of "e-circles" to obtain tighter estimates of the eigenvalue regions.
- The proposed methods are applied to analyze the stability of large-scale networked systems, showing that they can handle significantly more agents than using CVX, Yalmip, eig, and lyap functions in MATLAB.
- The results are used to modify Demidovich's condition for the stability of linear systems with time-varying parameters and matrices without diagonal dominance.
- A synthesis problem is considered to find a control matrix for systems with non-diagonally dominant matrices using linear matrix inequalities.
The summary provides a comprehensive overview of the key contributions and their potential applications in control system analysis and design.
Stats
The system (23) contains the matrix A(t) without diagonal dominance.
The matrix ¯A(t) in (24) has diagonal dominance.
The estimate (25) bounds the solution of the system (23) in terms of the upper bound σ on the eigenvalues of ¯A(t).