Meng Liu, Yong He, Lin Jiang

A Sufficient Condition on Polynomial Inequalities and its Application to Interval Time-Varying Delay Systems

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Human-Computer Interaction

This article examines the stability problem of systems with interval time-varying delays. In the derivation of Lyapunov–Krasovskii functional (LKF), non-convex higher-degree polynomials may arise with respect to interval time-varying delays, making it difficult to determine the negative definiteness of LKF’s derivative. This study was conducted to obtain stability conditions that can be described as linear matrix inequalities (LMIs). By considering the idea of matrix transition and introducing the delay-dependent augmented vector, a novel higher-degree polynomial inequality is proposed under the condition that the lower bound of the polynomial function variable is non-zero, which encompasses the existing lemmas as its special cases. Then, benefiting from this inequality, a stability criterion is derived in terms of LMIs. Finally, several typical examples are presented to verify the availability and strength of the stability condition.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive