论文信息 - Real polynomials: Nonnegativity and positivity

Real polynomials: Nonnegativity and positivity

A procedure for resolution of the positivity and the nonnegativity of a real polynomial in n real variables is described. The procedure is based upon an augmented theory of resultants. The sufficiency condition, when invoked using exact arithmetic, gives an unambiguous (absolutely certain) result. Several examples are provided and comments on the attributes of this and other (alternative) procedures are given.

Theodore A. Bickart | Eliahu I. Jury | E. Jury | T. Bickart

[1] E. Jury,et al. Inner algorithm to test for positive definiteness of arbitrary binary forms , 1975 .

[2] V. V. Krishnan,et al. Inners and Stability of Dynamic Systems , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] G. E. Collins. Infallible Calculation of Polynomial Zeros to Specified Precision , 1977 .

[5] B. Anderson,et al. Output feedback stabilization—Solution by algebraic geometry methods , 1977, Proceedings of the IEEE.

[6] N. Bose. Test for Lyapunov stability by rational operations , 1975 .

[7] N. Bose,et al. General procedure for multivariable polynomial positivity test with control applications , 1976 .

[8] N.K. Bose,et al. A multivariable polynomial nonnegativity test , 1976, Proceedings of the IEEE.

[9] N. Bose,et al. On nonglobal positivity and domains of positivity of multivariable polynomials , 1977, Proceedings of the IEEE.