From Exponential to Polynomial Complexity in the Lyapunov Stability Test

被引:0
|
作者
Egorov, Alexey [1 ]
机构
[1] St Petersburg State Univ, Dept Control Theory, St Petersburg, Russia
来源
IFAC PAPERSONLINE | 2024年 / 58卷 / 27期
基金
俄罗斯科学基金会;
关键词
time-delay systems; Lyapunov matrix; complete type functional; Lyapunov Stability Test;
D O I
10.1016/j.ifacol.2024.10.328
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
By the Lyapunov Stability Test, we refer to a previously developed criterion for the exponential stability of linear time-invariant delay systems. This criterion requires the validation of a special matrix, expressed in terms of a discrete set of values of the delay Lyapunov matrix, for positive definiteness. The dimension of this matrix is determined by the system parameters and deduced from some conservative estimates. In this paper, we have significantly reduced the conservatism. As a result, we obtained a dimension that depends cubically on the delay value, whereas previously this dependence was exponential. Copyright (c) 2024 The Authors.
引用
收藏
页码:225 / 230
页数:6
相关论文
共 50 条