On the complexity of the robust stability problem for linear parameter varying systems (Q1129709)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of the robust stability problem for linear parameter varying systems |
scientific article; zbMATH DE number 1192934
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the robust stability problem for linear parameter varying systems |
scientific article; zbMATH DE number 1192934 |
Statements
On the complexity of the robust stability problem for linear parameter varying systems (English)
0 references
20 August 1998
0 references
The author considers linear parameter varying systems \[ x(k+ 1)= \Biggl(A_0+ \sum^n_{i=1} r_i(k)A_i\Biggr) x(k), \] where \(\{r_i(k)\}\) is a sequence such that \(\| r_i(k)\|_\infty\leq 1\) for each \(i= 1,\dots, n\). The system is said to be stable if for each choice of the sequences \(\{r_i(k)\}\) and each initial condition the solution is bounded. The main result is that the problem of checking stability for such a system is NP-hard.
0 references
discrete systems
0 references
input/output stability
0 references
computational complexity
0 references
linear parameter varying systems
0 references
NP-hard
0 references
