Abstract
We describe three simply-stated problems that deal with the notion of stability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson B. D. O., N. K. Bose and E. I. Jury (1975). Output feedback stabilization and related problem — solutions via decision methods, IEEE Trans. Autom. Control, 20, 53–66.
Blondel, V. D. and J. N. Tsitsiklis (1997). NP-hardness of some linear control design problems, SIAM J. Control and Optimization, 35, 2118–2127.
Blondel V. D. and J. N. Tsitsiklis (1997). Complexity of stability and controllability of elementary hybrid systems. Report LIDS-P 2388, LIDS, Massachusetts Institute of Technology, Cambridge, MA, 1997. To appear in Automatica.
Blondel, V. D. and J. N. Tsitsiklis (1998). Survey of complexity results for systems and control problems, (in preparation).
I. Daubechies and J. C. Lagarias (1992), Sets of matrices all infinite products of which converge, Linear Algebra Appl., 162 227–263.
L. Gurvits (1995), Stability of discrete linear inclusion, Linear Algebra Appl., 231 47–85.
Hopcroft and Ullman, 1969] Hopcroft, J. E. and J. D. Ullman (1969). Formal languages and their relation to automata, Addison-Wesley.
Koiran, P. (1996). A family of universal recurrent networks, Theor. Comp. Science, 168, 473–480.
J. C. Lagarias and Y. Wang (1995), The finiteness conjecture for the generalized spectral radius of a set of matrices, Linear Algebra Appl., 214 17–42.
Papadimitriou, C. H. (1994). Computational complexity, Addison-Wesley, Reading.
Siegelmann, H. and E. Sontag (1991). Turing computability with neural nets, Appl. Math. Letters, 4, 77–80.
Siegelmann, H. and E. Sontag (1995). On the computational power of neural nets, J. Comp. Syst. Sci., 132–150.
Schrijver, A. (1986). Theory of linear and integer programming, Wiley.
Sontag, E. (1995). From linear to nonlinear: some complexity comparisons, Proc. IEEE Conference Decision and Control, New Orleans, 2916–2920.
Tsitsiklis, J. N (1987). The stability of the products of a finite set of matrices, in Open problems in communication and computation, Springer-Verlag.
Tsitsiklis, J. N. and V. D. Blondel (1997). Spectral quantities associated with pairs of matrices are hard — when not impossible — to compute and to approximate, Mathematics of Control, Signals, and Systems, 10, 31–40.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London Limited
About this chapter
Cite this chapter
Blondel, V.D., Tsitsiklis, J.N. (1999). Three problems on the decidability and complexity of stability. In: Blondel, V., Sontag, E.D., Vidyasagar, M., Willems, J.C. (eds) Open Problems in Mathematical Systems and Control Theory. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-1-4471-0807-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0807-8_11
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1207-5
Online ISBN: 978-1-4471-0807-8
eBook Packages: Springer Book Archive