(sol,mult) = sosInIdeal(h,D)
sol = sosInIdeal(R,D)
This methods finds sumsofsquares polynomials in ideals. It accepts two types of inputs that are useful for different purposes. The first invocation is to give a one row matrix with polynomial entries and a degree bound. The method then tries to find a sum of squares in the generated ideal. More precisely, given equations $h_1(x),...,h_m(x)$, the method looks for polynomial multipliers $h_i(x)$ such that $\sum_i l_i(x) h_i(x)$ is a sum of squares.





The second invocation is on a quotient ring, also with a degree bound. This tries to decompose the zero of the quotient ring as a sum of squares.




This implementation only works with the solvers "CSDP" and "MOSEK".
The object sosInIdeal is a method function with options.