Skip to main content
SpringerLink
Log in

Three problems on the decidability and complexity of stability

  • Chapter
Open Problems in Mathematical Systems and Control Theory

Part of the book series: Communications and Control Engineering ((CCE))

Abstract

We describe three simply-stated problems that deal with the notion of stability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  MathSciNet  MATH  Google Scholar 

  2. Blondel, V. D. and J. N. Tsitsiklis (1997). NP-hardness of some linear control design problems, SIAM J. Control and Optimization, 35, 2118–2127.

    Article  MathSciNet  MATH  Google Scholar 

  3. 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.

    Google Scholar 

  4. Blondel, V. D. and J. N. Tsitsiklis (1998). Survey of complexity results for systems and control problems, (in preparation).

    Google Scholar 

  5. I. Daubechies and J. C. Lagarias (1992), Sets of matrices all infinite products of which converge, Linear Algebra Appl., 162 227–263.

    Article  MathSciNet  Google Scholar 

  6. L. Gurvits (1995), Stability of discrete linear inclusion, Linear Algebra Appl., 231 47–85.

    Article  MathSciNet  MATH  Google Scholar 

  7. Hopcroft and Ullman, 1969] Hopcroft, J. E. and J. D. Ullman (1969). Formal languages and their relation to automata, Addison-Wesley.

    Google Scholar 

  8. Koiran, P. (1996). A family of universal recurrent networks, Theor. Comp. Science, 168, 473–480.

    Article  MathSciNet  MATH  Google Scholar 

  9. 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.

    Article  MathSciNet  MATH  Google Scholar 

  10. Papadimitriou, C. H. (1994). Computational complexity, Addison-Wesley, Reading.

    MATH  Google Scholar 

  11. Siegelmann, H. and E. Sontag (1991). Turing computability with neural nets, Appl. Math. Letters, 4, 77–80.

    Article  MathSciNet  MATH  Google Scholar 

  12. Siegelmann, H. and E. Sontag (1995). On the computational power of neural nets, J. Comp. Syst. Sci., 132–150.

    Google Scholar 

  13. Schrijver, A. (1986). Theory of linear and integer programming, Wiley.

    MATH  Google Scholar 

  14. Sontag, E. (1995). From linear to nonlinear: some complexity comparisons, Proc. IEEE Conference Decision and Control, New Orleans, 2916–2920.

    Google Scholar 

  15. Tsitsiklis, J. N (1987). The stability of the products of a finite set of matrices, in Open problems in communication and computation, Springer-Verlag.

    Google Scholar 

  16. 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.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Liège, Sart Tilman B37, 4000, Liège, Belgium

    Vincent D. Blondel

  2. Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    John N. Tsitsiklis

Authors
  1. Vincent D. Blondel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John N. Tsitsiklis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, University of Leige, Sart Tilman B37, B-4000, Liege, Belgium

    Vincent Blondel (PhD) (PhD)

  2. Department of Mathematics, Rutgers University, Hill Center 724, 08903, New Brunswick, USA

    Eduardo D. Sontag (PhD) (PhD)

  3. Centre for Arificial Intelligence and Robotics, Raj Bhavan Cirlce - High Grounds, 560001, Bangalore, India

    Mathukumalli Vidyasagar (PhD) (PhD)

  4. Institute of Mathematics, Rijksuniversiteit te Groningen, Postbus 800, 9700, Av Groningen, The Netherlands

    Jan C. Willems (PhD) (PhD)

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation