By Topic

Reducing the Complexity of the Sum-of-Squares Test for Stability of Delayed Linear Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yashun Zhang ; Sch. of Autom., Nanjing Univ. of Sci. & Technol., Nanjing, China ; Peet, M. ; Keqin Gu

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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 1 )