Deciding Nonnegativity of Polynomials by MAPLE
Abstract
There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple's library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassfication, one can prove and discover polynomial inequalities. This paper is more or less a user guide on using RealRootClassfication to prove the nonnegativity of polynomials. We show by examples how to use this powerful tool to prove a polynomial is nonnegative under some polynomial inequality and/or equation constraints. Some tricks for using the tool are also provided.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2013
- arXiv:
- arXiv:1306.4059
- Bibcode:
- 2013arXiv1306.4059Y
- Keywords:
-
- Computer Science - Symbolic Computation
- E-Print:
- A user guide on using RealRootClassfication to prove the nonnegativity of polynomials with 10 examples