Complexity issues in robust stability of linear delay-differential systems (Q1356632): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:27, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity issues in robust stability of linear delay-differential systems |
scientific article |
Statements
Complexity issues in robust stability of linear delay-differential systems (English)
0 references
5 January 1998
0 references
This paper discusses the linear differential systems with delays: \(\dot x(t)= A_0 x(t) +\sum^p_{k=1} A_k x(t-h_k)\), where \(A_0, \dots, A_p\) are \(n\times n\) constant matrices. Two stability problems concerning the systems, which are: i) asymptotic stability independent of delay; ii) robust asymptotic stability, are shown to be NP-hard. The main idea used in the proofs of the results is to show that the robust stability problems i) and ii) can be formulated as a combinatorial problem \((T\)-knapsack problem), which is known to be NP-hard. Also, another side result of the paper is that checking robust nonsingularity, robust Hurwitz stability, robust Schur stability of a disk matrix are NP-hard problems.
0 references
linear delay-differential systems
0 references
computational complexity
0 references
complex programming
0 references
robust stability
0 references
NP-hard
0 references