๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Stability analysis of neutral systems with mixed delays

โœ Scribed by Xu-Guang Li; Xin-Jian Zhu; Arben Cela; Abdellatif Reama


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
963 KB
Volume
44
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

โœฆ Synopsis


The stability of neutral systems with mixed delays is studied in this paper. A new discretized Lyapunov functional method is proposed. The method in this paper is less conservative than the existing ones and the results are very close to the analytical results. In addition, this method allows the coefficient matrix of the neutral term to have time-varying uncertainties.


๐Ÿ“œ SIMILAR VOLUMES


Delay-dependent robust stability criteri
โœ Yong He; Min Wu; Jin-Hua She; Guo-Ping Liu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

This paper concerns the problem of the delay-dependent robust stability of neutral systems with mixed delays and time-varying structured uncertainties. A new method based on linear matrix inequalities is presented that makes it easy to calculate both the upper stability bounds on the delays and the

Stability of neutral differential differ
โœ Wanbiao Ma; Yasuhiro Takeuchi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1005 KB

It is well known that UCg is an admissible space and BC can be continuously embedded in UCg (see, for example, ). We use the same symbol I[" II to denote the norms in R" and BC, but no confusion will occur. An n ร— n real constant matrix C = (cu)nร— . with c o <\_ 0 (i ~ j; i,j --1, 2 ..... n) is sai

Stability analysis for neutral delay-dif
โœ Ju H. Park; S. Won ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

In this paper, the problem of the stability analysis for neutral delay-di!erential systems is investigated. Using Lyapunov method, we present new su$cient conditions for the stability of the systems in terms of linear matrix inequality (LMI) which can be easily solved by various convex optimization