DocumentCode
1354877
Title
Reducing the Complexity of the Sum-of-Squares Test for Stability of Delayed Linear Systems
Author
Zhang, Yashun ; Peet, Matthew ; Gu, Keqin
Author_Institution
Sch. of Autom., Nanjing Univ. of Sci. & Technol., Nanjing, China
Volume
56
Issue
1
fYear
2011
Firstpage
229
Lastpage
234
Abstract
This technical note considers the problem of reducing the computational complexity associated with the Sum-of-Squares approach to stability analysis of time-delay systems. Specifically, this technical note considers systems with a large state-space but where delays affect only certain parts of the system. This yields a coefficient matrix of the delayed state with low rank-a common scenario in practice. The technical note uses the general framework of coupled differential-difference equations with delays in feedback channels. This framework includes systems of both the neutral and retarded-type. The approach is based on recent results which introduced a new Lyapunov-Krasovskii structure which was shown to be necessary and sufficient for stability of this class of systems. This technical note shows how exploiting the structure of the new functional can yield dramatic improvements in computational complexity. Numerical examples are given to illustrate this improvement.
Keywords
Lyapunov methods; computational complexity; delays; linear systems; matrix algebra; stability; Lyapunov Krasovskii structure; coefficient matrix; computational complexity; delayed linear systems; stability analysis; sum-of-squares test; time delay systems; Asymptotic stability; Complexity theory; Delay; Mathematical model; Polynomials; Stability analysis; Complexity; Lyapunov–Krasovskii functional; semi definite programming; sum-of-squares; time delay;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.2010.2088590
Filename
5605235
Link To Document