Premium
An exact LMI condition for the strong delay‐independent stability analysis of neutral delay systems
Author(s) -
Souza Fernando O.
Publication year - 2018
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4324
Subject(s) - mathematics , linear matrix inequality , lemma (botany) , stability (learning theory) , control theory (sociology) , kronecker delta , transcendental equation , linear system , regular polygon , mathematical optimization , computer science , mathematical analysis , numerical analysis , control (management) , ecology , physics , poaceae , quantum mechanics , machine learning , artificial intelligence , biology , geometry
Summary This paper concentrates on strong delay‐independent stability of neutral linear time‐invariant delay systems with multiple commensurate time delays. The stability analysis of linear neutral systems is complicated by the need to locate the roots of a transcendental characteristic equation and to take into account the global hyperbolicity of an associated difference system. In this paper, we propose a convex necessary and sufficient condition for testing strong delay‐independent stability. This result mainly follows from Kronecker sum properties and the Kalman‐Yakubovich‐Popov lemma, which allows us to present the main result in terms of a single linear matrix inequality feasibility test. The paper is closed by showing numerical examples that illustrate the applicability and effectiveness of the proposed method.