论文信息 - Characterizing polynomials with roots in a semi-algebraic set

Characterizing polynomials with roots in a semi-algebraic set

Let p /spl epsi/ R[x] be a real-valued polynomial and S /spl sub/ C a semi-algebraic set defined by polynomial inequalities gk(z, z~)/spl ges/0 for some polynomials g/sub k/ in C[z, z~]. We provide a necessary and sufficient condition on the coefficients of p for all the zeros of p to be in S.

J. B. Lasserre

[1] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..

[2] S. Gutman,et al. A general theory for matrix root-clustering in subregions of the complex plane , 1981 .

[3] Polynomials with All Zeros Real and in a Prescribed Interval , 2002 .

[4] A. Fialkow,et al. THE TRUNCATED COMPLEX K-MOMENT PROBLEM , 2000 .

[5] A. G. Mazko. Lyapunov matrix Equations for a Certain Class of Regions Bounded by Algebraic Curves , 1980 .

[6] R. Curto,et al. The truncated complex -moment problem , 2000 .

[7] S. Gutman,et al. A symmetric matrix criterion for polynomial root clustering , 1990 .

[8] Pascal Gahinet,et al. H/sub /spl infin// design with pole placement constraints: an LMI approach , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[9] F. Gantmakher,et al. Théorie des matrices , 1990 .

[10] D. Carlson,et al. Controllability and inertia theory for functions of a matrix , 1977 .

[11] R. Kálmán. Algebraic characterization of polynomials whose zeros lie in certain algebraic domains. , 1969, Proceedings of the National Academy of Sciences of the United States of America.

[12] P. Gahinet,et al. H∞ design with pole placement constraints: an LMI approach , 1996, IEEE Trans. Autom. Control..