RealCertify
Résumé
The Maple package RealCertify tackles the problem of deciding the non-negativity of rational polynomials over semi-algebraic domains defined by polynomial constraints with rational coefficients.
This is done by computing sum of squares certificates of non-negativity for inputs where such certificates hold over the rational numbers.
It can be applied to numerous problems coming from engineering sciences, program verification and cyber-physical systems.
It is based on hybrid symbolic-numeric algorithms and semidefinite programming.
