a macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients
In recent years semideffinite programming (SDP) has become the standard technique for computing sum of squares (SOS) decompositions of nonnegative polynomials. Due to the nature of the underlying methods, the solutions are computed numerically, and thus are never exact. In this paper we present a software package for Macaulay 2, which aims at computing an exact SOS decomposition from a numerical solution.
sum of squares semideffinite programming symbolic/numerical methods algebraic geometry