Numerically validating the completeness of the real solution set of a system of polynomial equations
arXiv:1602.00700
Abstract
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares programming to test whether a given set is "complete" with respect to the real solution set. Specifically, we test whether the Zariski closure of that given set is indeed equal to the solution set of the real radical of the ideal generated by the given polynomials. Examples with finitely and infinitely many real solutions are provided, along with an example having polynomial inequalities.
References in corpus (7)
- Saddle Points and Dynamics of Lennard-Jones Clusters, Solids and Supercooled Liquids
- Semidefinite Characterization and Computation of Real Radical Ideals
- Energy landscape analysis of the two-dimensional nearest-neighbor ϕ^4 model
- Topological aspects of geometrical signatures of phase transitions
- Communication: Newton homotopies for sampling stationary points of potential energy landscapes
- Sampling algebraic varieties for sum of squares programs
- On the Computation of Matrices of Traces and Radicals of Ideals