The boundedness of all products of a pair of matrices is undecidable
- 9 October 2000
- journal article
- research article
- Published by Elsevier in Systems & Control Letters
- Vol. 41 (2), 135-140
- https://doi.org/10.1016/s0167-6911(00)00049-9
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A survey of computational complexity results in systems and controlAutomatica, 2000
- Complexity of stability and controllability of elementary hybrid systemsAutomatica, 1999
- On the complexity of purely complex μ computation and related problems in multidimensional systemsIEEE Transactions on Automatic Control, 1998
- On the complexity of the robust stability problem for linear parameter varying systemsAutomatica, 1997
- When is a pair of matrices mortal?Information Processing Letters, 1997
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximateMathematics of Control, Signals, and Systems, 1997
- Computational complexity of μ calculationIEEE Transactions on Automatic Control, 1994
- Several NP-hard problems arising in robust stability analysisMathematics of Control, Signals, and Systems, 1993
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- On the stability of asynchronous iterative processesTheory of Computing Systems, 1987