DocumentCode
2481847
Title
Degree Bounds for Polynomial Verification of the Matrix Cube Problem
Author
Chen, Been-Der ; Lall, Sanjay
Author_Institution
Dept. of Aeronaut. & Astronaut., Stanford Univ., CA
fYear
2006
fDate
13-15 Dec. 2006
Firstpage
4405
Lastpage
4410
Abstract
In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semi-algebraic set. We propose a family of sufficient conditions using the theory of matrix Positivstellensatz refutations. When the semi-algebraic set is a hypercube, we give bounds on the degree of the required certificate polynomials
Keywords
Lyapunov matrix equations; computational complexity; polynomial matrices; stability; certificate polynomials; hypercube; matrix Positivstellensatz refutations; matrix cube problem; matrix inequality; polynomial verification; semialgebraic set; Hypercubes; Linear matrix inequalities; Matrix converters; Polynomials; Robust control; Stability; Sufficient conditions; Symmetric matrices; Testing; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2006 45th IEEE Conference on
Conference_Location
San Diego, CA
Print_ISBN
1-4244-0171-2
Type
conf
DOI
10.1109/CDC.2006.376783
Filename
4177926
Link To Document