On the complexity of the robust stability problem for linear parameter varying systems

Automatica

Volumn 33, Issue 11, 1997, Pages 2015-2017

  Toker, Onur ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computational complexity; Linear parameter varying systems; Robust stability

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; FREQUENCY DOMAIN ANALYSIS; OPTIMIZATION; POLYNOMIALS; ROBUSTNESS (CONTROL SYSTEMS); SYSTEM STABILITY;

JOINT SPECTRAL RADIUS (JSR) COMPUTATION PROBLEM; LINEAR PARAMETER VARYING (LPV) SYSTEMS;

LINEAR CONTROL SYSTEMS;

EID: 0031273426     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(97)00129-5     Document Type: Article

References (19)

1. Berger, M. A. and Y. Wang (1992). Bounded semigroups of matrices. Linear Algebra Appl., 166, 21-27.
2. Braatz, R. D., P. M. Young, J. C. Doyle and M. Morari (1994). Computational complexity of μ calculation. IEEE Trans. Automat. Control, 39, 1000-1002.
3. Brayton, R. K. and C. H. Tong (1979). Stability of dynamical systems. IEEE Trans. Circuits Systems, 26, 224-234.
4. Brayton, R. K. and C. H. Tong (1980). Constructive stability and asymptotic stability of dynamical systems. IEEE Trans. Circuits Systems, 27, 1121-1130.
5. Dogruel, M. (1995). Personal communication.
6. Garey, M. and D. Johnson (1979). Computers and Intractability: A Guide to the Theory of script N sign ℘-completeness. W. H. Freeman, San Francisco.
7. Gurvits, L. (1995). Stability of discrete linear inclusion. Linear Algebra Appl., to appear.
8. Heil, C. and D. Colella (1993). Dilation equations and the smoothness of compactly supported wavelets. In Wavelets: Mathematics and Applications, Benedetto, J. and M. Frazier, eds, pp. 161-200. CRC Press, Boca Raton, FL.
9. Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of Computer Computations, R. Miller and J. Thatcher, eds, pp. 85-104. Plenum Press, New York.
10. Kozyakin, V. S. (1990). Algebraic unsolvability of absolute stability of desynchronized systems. Automation and Remote Control, 51, 754-759.
11. Lagarias, J. C. and Y. Wang (1995). The Finiteness conjecture for the generalized spectral radius of set of matrices. Linear Algebra Appl., 214, 17-42.
12. Nemirovskii, A. (1993). Several script N sign ℘-hard problems arising in robust stability analysis. Math. Control Signals Systems, 6, 99-105.
13. Poljak, S. and J. Rohn (1993). Checking robust nonsingularity is script N sign ℘-hard. Math. Control Signals Systems, 6, 1-9.
14. Poolla, K. and A. Tikku (1995). Robust performance against time-varying structured perturbations. IEEE Trans. Automat. Control, 40, 1589-1602.
15. Shamma, J. (1994). Robust stability with time varying structured uncertainty. IEEE Trans Automatic Control, 39, 714-724.
16. Tarski, A. (1951). A decision method for elementary algebra and geometry. Berkeley note.
17. Toker, O. (1995). Complexity issues in system theory and solution procedures for certain robust control problems. PhD Thesis, Ohio State University.
18. Toker, O. and H. Özbay (1995). On the script N sign ℘-hardness of the purely complex μ computation, analysis/synthesis, and some related problems in multidimensional systems. Proc. 1995 American Control Conf., pp. 447-451.
19. Tsitsiklis, J. and V. Blondel (1996). Spectral quantities associated to pairs of matrices are hard-when not impossible-to compute and to approximate. Submitted for publication.