Stability testing of matrix polytopes

2007 European Control Conference, ECC 2007

Volumn , Issue , 2007, Pages 3919-3925

  Gurvits, Leonid ^a   Olshevsky, Alex ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CONTINUOUS TIME SYSTEMS; DYNAMICAL SYSTEMS; LINEAR CONTROL SYSTEMS; LINEAR SYSTEMS; POLYNOMIAL APPROXIMATION; ROBUST CONTROL;

A-STABILITY; CONTINUOUS-TIME; EXTREME POINTS; LINEAR DYNAMICAL SYSTEMS; POLYNOMIAL-TIME; PROBLEM CHECKING; STABILITY TESTING; SWITCHED LINEAR SYSTEM;

MATRIX ALGEBRA;

EID: 84927725937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/ecc.2007.7068465     Document Type: Conference Paper

References (26)

1. S. Bialas, "A Necessary and Sufficient Condition for the Stability of Convex Combinations of Polynomials and Matrices," Bulletin of the Polish Academy of Sciences. Technical Sciences. vol 33, pp. 473-480, 1985.
2. P. Burgisser, M. Clausen, M. Amin Shokrollahi, Algebraic Complexity Theory, Springer, 1997.
3. S. Basu, R. Pollack, M.-F. Roy, "On the combinatorial and algebraic complexity of quantifier elimination," Journal of the ACM, vol. 43, p. 1002, 1996.
4. V. D. Blondel and J. N. Tsitsiklis, "A Survey of Computational Complexity Results in Systems and Control", Automatica, Vol. 36, No. 9, pp. 1249-1274, September 2000.
5. R. B. Barmish, M. Fu, S. Saleh, "Stability of a polytope of matrices: counterexamples," IEEE Transactions on Automatic Control, vol. 33, No. 6, pp. 569-572, 1988.
6. A. Bjorck, V. Pereyra, "Solution of Vandermonde System of Equations," Mathematics of Computation, vol. 12, No. 12, pp. 893-903, October 1970.
7. N. Cohen, I. Lewkowicz, "A Necessary and Sufficient Criterion for Stability of Convex Sets of Matrices," IEEE Transactions on Automatic Control, vol. 38, No. 4, pp. 611-615, April 1993.
8. D. Coppersmith, S. Winograd, "Matrix Multiplication via Arithmetic Progressions," Journal of Symbolic Computation, no. 9, pp. 251-289, 1990.
9. M. Fu, R. Barmish, "Maximal unidirectional perturbation bounds for the stability of polynomials and matrices," Systems and Control Letters, vol. 11, pp. 173-179, 1988.
10. F. Gantmacher, Matrix Theory, Vol II (sometimes titled Applications of the Theory of Matrices), Chelsea Publishing, New York, 1959.
11. L. Gurvits, "Stabilities and Controllabilities of Switched Systems (with Applications to the Quantum Systems)," Proceeding of the 15th International Symposium on the Mathematical Theory of Networks and Systems (MTNS '02), 2002.
12. L. Gurvits, "What is the finiteness conjecture for linear continuous time inclusions" Proceedings of 42nd IEEE Conference on Decision and Control (CDC '03), 2003.
13. L. Gurvits, R. Shorten, O. Mason, "Preliminary Results on the Stability of Switched Positive Linear Systems," Proceedings of the 16th International Sympoisium on the Mathematical Theory of Networks and Systems (MTNS '04), 2004.
14. L. Gurvits, Classical deterministic complexity of Edmonds' problem and Quantum entanglement, Proc. of 35 annual ACM symposium on theory of computing, San Diego, 2003.
15. L. Gurvits, "Classical complexity and Quantum Entanglement," Journal of Computer and System Sciences, 69 (2004) 448-484.
16. C. Hermite, "Extrait d'une lettre de Mr. Ch. Hermite de Paris a Mr. Borchardt de Berlin, sur le nombre des racines d'une equation algebrique comprises entre des limits donees," J. Reine Agnew. Math, 52 pp. 39-51, 1856
17. V. Kabanets, R. Impagliazzo, "Derandomizing polynomial identity tests means proving circuit lower bounds," Proc. of the 35th Annual ACM Symposium on Theory of Computing, San Diego, 2003.
18. R. M. Karp, "Reducibility among Combinatorial Problems," In Complexity in Computer Computations, Ed. R. E. Miller, J. W. Thatcher, pp. 85-103, Plenum Press, 1972.
19. M. G. Krein, M. A. Naimark, "The Method of Symmetric and Hermitian Forms in the Theory of Separation of the Roots of Algebraic Equations," Linear and Multinear Algebra, 10, pp. 265-308, 1981
20. H. Lev-Ari, Y. Bistritz, T. Kailath, "Generalized Bezoutians and Families of Efficient Zero-Location Procedures," IEEE Transactions on Circuits and Systems, Vol. 38, February 1991.
21. V. Monov, "On the Spectrum of Convex Sets of Matrices," IEEE Transactions on Automatic Control, vol 44, No. 5, pp. 1009-1012, May 1999
22. T. S. Motzkin, E. G. Straus, "Maxima for graphs and a new proof of a theorem of Turan," Canadian Journal of Mathematics, Vol. 17, 533-540, 1965.
23. A. Nemirovskii, "Several NP-hard problems arising in robust stability analysis," Mathematics of Control, Signals, and Systems, vol. 6, No. 2, pp. 99-105, 1993.
24. C. B. Soh, "Schur stability of convex combinations of matrices," Linear Algebra and Its Applications, vol. 128, pp. 159-168, 1990.
25. A. Schrijver, Theory of Linear and Integer Programming, John Wiley, 1986.
26. Q. G. Wang, "Necessary and sufficient conditions for stability of a matrix politope with normal vertex matrices," Automatica, vol. 27, No. 5, pp. 887-888, 1991.