ML p(r)ior | Numerically validating the completeness of the real solution set of a system of polynomial equations

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

2016-02-01
1602.00700 | math.NA
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.

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

# Related Articles

2017-10-23
1710.08350 | cs.LO

We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode… show more

Highlights - Most important sentences from the article

2019-02-13
1902.04882 | cs.SC

We consider a problem from biological network analysis of determining regions in a parameter space o… show more

Highlights - Most important sentences from the article

2018-10-12
1810.05620 | cs.SC

We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which… show more

Highlights - Most important sentences from the article

2018-10-12
1810.05440 | cs.LG

Shuffled linear regression is the problem of performing a linear regression fit to a dataset for whi… show more

Highlights - Most important sentences from the article

2019-04-26
1904.11705 | cs.SC

Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multiva… show more

Highlights - Most important sentences from the article

2016-10-10
1610.03034 | math.AG

We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows fo… show more

Highlights - Most important sentences from the article

2018-03-21
1803.07974 | math.AG

We consider the problem of finding the isolated common roots of a set of polynomial functions defini… show more

Highlights - Most important sentences from the article

2017-07-24
1707.07650 | q-bio.QM

In this paper we investigate the complexity of model selection and model testing for dynamical syste… show more

Highlights - Most important sentences from the article

2018-10-17
1810.07716 | stat.ML

By using the viewpoint of modern computational algebraic geometry, we explore properties of the opti… show more

Highlights - Most important sentences from the article

2014-04-17
1404.5525 | cs.NA

In this paper, we study iterative methods on the coefficients of the rational univariate representat… show more

Highlights - Most important sentences from the article

2018-07-01
1807.03140 | math.NA

We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic… show more

Highlights - Most important sentences from the article

2018-04-11
1804.03807 | cs.MS

A numerical irreducible decomposition for a polynomial system provides representations for the irred… show more

Highlights - Most important sentences from the article

2014-12-10
1412.3290 | cs.CG

Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. … show more

Highlights - Most important sentences from the article

2012-01-27
1201.5810 | cs.SC

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in… show more

Highlights - Most important sentences from the article

2017-12-15
1712.05487 | cs.SC

We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system with… show more

Highlights - Most important sentences from the article

2018-04-25
1804.09705 | cs.SC

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial co… show more

Highlights - Most important sentences from the article