论文信息 - Necessary and Sufficient Conditions for Robust Positivity of Polynomic Functions Via Sign Decomposition

Necessary and Sufficient Conditions for Robust Positivity of Polynomic Functions Via Sign Decomposition

Abstract The robust positivity of multivariable polynomic functions, is considered in this paper. A solution with necessary and sufficient conditions is proposed. The problem is solved by the application of sign decomposition, which is a new mathematical tool. The basic idea is to separate the parts of the function depending on its sign. The robust positivity is concluded by the analysis of a finite number of points (vertices) of its domain. The analysis can be done in graphical way or using an algorithm which converge to the result in all the cases, this represents an advantage over other algorithms.

C. Elizondo-Gonzalez

[1] B. T. Polyak,et al. Robustness Analysis for Multilinear Perturbations , 1992 .

[2] When is the multiaffine image of a cube a convex polygon , 1993 .

[3] I. Petersen,et al. A class of multilinear uncertain polynomials to which the Edge theorem is applicable , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[4] J. Ackermann,et al. Does it suffice to check a subset of multilinear parameters in robustness analysis? , 1992, IEEE Transactions on Automatic Control.

[5] Brian D. O. Anderson,et al. Easily testable sufficient conditions for the robust stability of systems with multilinear parameter dependence , 1995, Autom..