DocumentCode
3110186
Title
Decomposition of a Polynomial as a Sum-of-Squares of Polynomials and the S-Procedure
Author
De Oliveira, Maurício
Author_Institution
University of California San Diego Department of Mechanical & Aerospace Engineering La Jolla, CA, 92093-0411 USA mauricio@ucsd.edu.
fYear
2005
fDate
12-15 Dec. 2005
Firstpage
1654
Lastpage
1659
Abstract
This paper investigates links between the problem of determining a decomposition of a polynomial as a sum-of-squares of polynomials and the S-Procedure. We first show that the S-Procedure can be used to check whether a given polynomial is non-negative. Then, using mostly linear algebra arguments, we show that this non-negativity test leads to an affirmative answer if and only if such polynomial admits a decomposition as a sum-of-squares of polynomials.
Keywords
Aerospace engineering; Control systems; Linear algebra; NP-hard problem; Polynomials; Sufficient conditions; Testing; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on
Print_ISBN
0-7803-9567-0
Type
conf
DOI
10.1109/CDC.2005.1582396
Filename
1582396
Link To Document