DeepAI AI Chat
Log In Sign Up

Numerically validating the completeness of the real solution set of a system of polynomial equations

by   Daniel A. Brake, et al.

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.


page 1

page 2

page 3

page 4


A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System

Polynomial system solving arises in many application areas to model non-...

Polynomial-delay Enumeration Algorithms in Set Systems

We consider a set system (V, 𝒞⊆ 2^V) on a finite set V of elements, wher...

Noetherian operators and primary decomposition

Noetherian operators are differential operators that encode primary comp...

Regression for sets of polynomial equations

We propose a method called ideal regression for approximating an arbitra...

Sparse trace tests

We establish how the coefficients of a sparse polynomial system influenc...

Local solution clustering for a triangular system of polynomials

This report is about finding clusters of complex solutions of triangular...

Complete Hierarchy of Relaxation for Constrained Signomial Positivity

In this article, we prove that the Sums-of-AM/GM Exponential (SAGE) rela...