Open AccessStability analysis of systems with time‐varying delay: a quadratic‐partitioning method
Author(s) -
Chen Jun,
Park Ju H.,
Xu Shengyuan
Publication year - 2019
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2018.5048
Subject(s) - stability (learning theory) , quadratic equation , regular polygon , property (philosophy) , quadratic function , mathematics , control theory (sociology) , function (biology) , mathematical optimization , conservatism , polynomial , computer science , control (management) , mathematical analysis , geometry , machine learning , artificial intelligence , philosophy , epistemology , evolutionary biology , politics , political science , law , biology
During the course of analysing the stability of systems with time‐varying delay, stability criteria are often shown in the form of the first‐ or second‐order polynomial functions with respect to the time‐varying delay. Therefore, the convex/concave property plays an important role in reducing the conservatism of stability criteria. In this note, the quadratic‐partitioning method is proposed to take full advantage of the convex/concave property of a quadratic function, which can further reduce the conservatism of some of existing results. Two well‐known numerical examples are given to illustrate the effectiveness of the proposed method.