Reducing the complexity of the sum-of-squares test for stability of delayed linear systems

Yashun Zhang, Matthew Peet, Keqin Gu

Research output: Contribution to journalArticle

12 Citations (Scopus)

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 ranka 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 LyapunovKrasovskii 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.

Original languageEnglish (US)
Article number5605235
Pages (from-to)229-234
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume56
Issue number1
DOIs
StatePublished - Jan 2011
Externally publishedYes

Fingerprint

Linear systems
Computational complexity
Difference equations
Time delay
Feedback

Keywords

  • Complexity
  • LyapunovKrasovskii functional
  • semi definite programming
  • sum-of-squares
  • time delay

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications

Cite this

Reducing the complexity of the sum-of-squares test for stability of delayed linear systems. / Zhang, Yashun; Peet, Matthew; Gu, Keqin.

In: IEEE Transactions on Automatic Control, Vol. 56, No. 1, 5605235, 01.2011, p. 229-234.

Research output: Contribution to journalArticle

@article{31c91d70c6f14181811014d417411c61,
title = "Reducing the complexity of the sum-of-squares test for stability of delayed linear systems",
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 ranka 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 LyapunovKrasovskii 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 = "Complexity, LyapunovKrasovskii functional, semi definite programming, sum-of-squares, time delay",
author = "Yashun Zhang and Matthew Peet and Keqin Gu",
year = "2011",
month = "1",
doi = "10.1109/TAC.2010.2088590",
language = "English (US)",
volume = "56",
pages = "229--234",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Reducing the complexity of the sum-of-squares test for stability of delayed linear systems

AU - Zhang, Yashun

AU - Peet, Matthew

AU - Gu, Keqin

PY - 2011/1

Y1 - 2011/1

N2 - 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 ranka 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 LyapunovKrasovskii 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.

AB - 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 ranka 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 LyapunovKrasovskii 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.

KW - Complexity

KW - LyapunovKrasovskii functional

KW - semi definite programming

KW - sum-of-squares

KW - time delay

UR - http://www.scopus.com/inward/record.url?scp=78651312622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651312622&partnerID=8YFLogxK

U2 - 10.1109/TAC.2010.2088590

DO - 10.1109/TAC.2010.2088590

M3 - Article

AN - SCOPUS:78651312622

VL - 56

SP - 229

EP - 234

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 1

M1 - 5605235

ER -