On the NP-hardness of checking matrix polytope stability and continuous-time switching stability

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R[superscript ntimesn] are stable. In particular, we are interested whether there exist algorithms which can solve this problem in time po...

Full description

Bibliographic Details
Main Authors: Gurvits, Leonid, Olshevsky, Alexander
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2010
Online Access:http://hdl.handle.net/1721.1/52419