On the complexity of the robust stability problem for linear parameter varying systems (Q1129709)

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.