Generalization of Gershgorin's theorem. Analysis and design of control laws
The application of the Gershgorin circle theorem and some of its derivatives to estimate the eigenvalues of a matrix is considered. The obtained results are developed to obtain the localization region of the eigenvalues of a matrix with interval-indefinite constant or non-stationary elements. The concept of e-circles is introduced to obtain more accurate estimates of these regions than when using Gershgorin circles. The obtained results are applied to the stability analysis of network systems, where it is shown that the proposed methods allow one to analyze a network with a much larger number of agents than when using the CVX, Yalmip, eig and lyap methods (functions in MatLab). It is further shown that if the obtained results are applied not to the system itself, but to the result obtained using the Lyapunov function method, then one can study systems with matrices without diagonal dominance. This made it possible to consider a modification of the Demidovich condition for systems with non-stationary parameters and design of a control law for non-stationary systems with matrices without diagonal dominance. All obtained results are illustrated by numerical modeling.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Gershgorin Disc-based Voltage Stability Regions for DER Siting and Control in Distribution Grids
As a consequence of the transition to distributed and renewable energy systems, some distribution system operators are increasingly concerned about power quality, including steady-state voltage volatility. In this paper,…
Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment
A basic premise in graph signal processing (GSP) is that a graph encoding pairwise (anti-)correlations of the targeted signal as edge weights is exploited for graph filtering. However, existing fast graph sampling scheme…
Graph SamplingSigned Graph Metric Learning via Gershgorin Disc Perfect Alignment
Given a convex and differentiable objective $Q(\M)$ for a real symmetric matrix $\M$ in the positive definite (PD) cone -- used to compute Mahalanobis distances -- we propose a fast general metric learning framework that…
Binary ClassificationMetric LearningGraph Unfolding and Sampling for Transitory Video Summarization via Gershgorin Disc Alignment
User-generated videos (UGVs) uploaded from mobile phones to social media sites like YouTube and TikTok are short and non-repetitive. We summarize a transitory UGV into several keyframes in linear time via fast graph samp…
Efficient Directed Graph Sampling via Gershgorin Disc Alignment
Graph sampling is the problem of choosing a node subset via sampling matrix $\mathbf{H} \in \{0,1\}^{K \times N}$ to collect samples $\mathbf{y} = \mathbf{H} \mathbf{x} \in \mathbb{R}^K$, $K < N$, so that the target sign…
Graph Sampling