A new delay-dependent stability criterion for linear neutral systems with norm-bounded uncertainties in all system matrices. (English) Zbl 1093.34037

The paper investigates the problem of robust stability of linear neutral-type systems with delay where all matrices of the system contain both known and unknown blocks. It is assumed that the unknown submatrices have a fixed structure and are norm-bounded. The main goal of the paper is to obtain a new delay-dependent stability criterion. A standard procedure is used for substantiation of the criterion. Namely, a Lyapunov-Krasovskii functional is constructed, and it is shown that under the specified conditions the derivative of this functional along the trajectories is negative.


34K20 Stability theory of functional-differential equations
34K35 Control problems for functional-differential equations
93D21 Adaptive or robust stabilization
34K40 Neutral functional-differential equations
93D09 Robust stability
Full Text: DOI


[1] DOI: 10.1137/1.9781611970777 · Zbl 0816.93004
[2] DOI: 10.1049/ip-cta:20010772
[3] DOI: 10.1016/S0167-6911(01)00114-1 · Zbl 0974.93028
[4] DOI: 10.1109/9.983353 · Zbl 1364.93209
[5] DOI: 10.1109/9.847747 · Zbl 0986.34066
[6] DOI: 10.1109/9.911431 · Zbl 1056.93511
[7] DOI: 10.1016/S0005-1098(01)00250-3 · Zbl 1020.93016
[8] DOI: 10.1093/imamci/20.4.371 · Zbl 1046.93039
[9] DOI: 10.1016/j.automatica.2004.05.002 · Zbl 1075.93032
[10] DOI: 10.1016/S0167-6911(03)00207-X · Zbl 1157.93467
[11] Kolmanovskii V., Applied Theory of Functional Differential Equations (1992)
[12] DOI: 10.1115/1.1540995
[13] DOI: 10.1006/jmaa.2000.6716 · Zbl 0973.34066
[14] DOI: 10.1080/00207170110067116 · Zbl 1023.93055
[15] DOI: 10.1109/9.754838 · Zbl 0957.34069
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.