The boundedness of all products of a pair of matrices is undecidable

Systems and Control Letters

Volumn 41, Issue 2, 2000, Pages 135-140

  Blondel, Vincent D ^a   Tsitsiklis, John N ^b  

^a Catholic University of Louvain   (Belgium)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computability; Decidability; Finiteness conjecture; Generalised spectral radius; Joint spectral radius; Linear time varying systems; Matrix semigroup; Robust stability analysis

Indexed keywords

EID: 0009944648     PISSN: 01676911     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6911(00)00049-9     Document Type: Article

References (24)

1. M. Berger, Y. Wang, Bounded semigroups of matrices, Linear Algebra Appl. 166 (1992) 21-27.
2. V.D. Blondel, J.N. Tsitsiklis, When is a pair of matrices mortal? Informat. Process. Lett. 63 (1997) 283-286.
3. V.D. Blondel, J.N. Tsitsiklis, Complexity of stability and controllability of elementary hybrid systems, Automatica 35 (1999) 479-489.
4. V.D. Blondel, J.N. Tsitsiklis, A survey of computational complexity results in systems and control, Automatica 36(9) (2000) 1249-1274
5. R. Braatz, P. Young, J. Doyle, M. Morari, Computational complexity of μ calculation, IEEE Trans. Automat. Control 39 (1994) 1000-1002.
6. A. Condon, R.J. Lipton, On the complexity of space bounded interactive proofs, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 462-467.
7. A. Condon, R.J. Lipton, On the complexity of space bounded interactive proofs, unpublished Technical Report, 1989.
8. I. Daubechies, J.C. Lagarias, Sets of matrices all infinite products of which converge, Linear Algebra Appl. 162 (1992) 227-263.
9. L. Gurvits, Stability of discrete linear inclusions, Linear Algebra Appl. 231 (1995) 47-85.
10. L. Gurvits, Stability of linear inclusions - Part 2, Technical Report TR 96-173, NEC Research, 1996.
11. G. Jacob, An algorithm for calculating the cardinal, finite or infinite, of the semigroups of matrices, Theoret. Comput. Sci. 5 (1977) 183-204.
12. V.S. Kozyakin, Algebraic unsolvability of problem of absolute stability of desynchronized systems, Automat. Remote Control 51 (1990) 754-759.
13. J.C. Lagarias, Y. Wang, The finiteness conjecture for the generalized spectral radius of a set of matrices, Linear Algebra Appl. 214 (1995) 17-42.
14. O. Madani, On the computability of infinite-horizon partially observable Markov decision processes, AAAI98 Fall Symposium on Planning with POMDPs, Orlando, FL, 1998.
15. O. Madani, S. Hanks, A. Condon, On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems, Proceedings of the Sixteenth National Conference on Artificial Intelligence, Orlando, FL, July 1999.
16. A. Nemirovskii, Several NP-Hard problems arising in robust stability analysis, Math. Control Signals Systems 63 (1993) 99-105.
17. A. Paz, Introduction to Probabilistic Automata, Academic Press, New York, 1971.
18. S. Poljak, J. Rohn, Checking robust nonsingularity is NP-hard, Math. Control Signals Systems 6 (1993) 1-9.
19. G.-C. Rota, G. Strang, A note on the joint spectral radius, Nederl. Akad. Wetensch. Indagationes Math. 22 (1960) 379-381.
20. O. Toker, On the complexity of the robust stability problem for linear parameter varying systems, Automatica 33 (1997) 2015-2017.
21. O. Toker, H. Ozbay, On the complexity of purely complex μ computation and related problems in multidimensional systems, IEEE Trans. Automat. Control 43 (1998) 409-414.
22. J.N. Tsitsiklis, On the stability of asynchronous iterative processes, Math. Systems Theory 20 (1987) 137-153.
23. J.N. Tsitsiklis, The Stability of the Products of a Finite Set of Matrices, in: T.M. Cover, B. Gopinath (Eds.), Open Problems in Communication and Computation, Springer, New York, 1987, pp. 161-163.
24. J.N. Tsitsiklis, V.D. Blondel, The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate, Math. Control Signals Systems 10 (1997) 31-40.