Related papers: Certified Numerical Real Root Isolation of Zero-di…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
In this work, we consider multiobjective optimization problems with both bound constraints on the variables and general nonlinear constraints, where objective and constraint function values can only be obtained by querying a black box.…
Let $f$ be a polynomial system consisting of $n$ polynomials $f_1,\cdots, f_n$ in $n$ variables $x_1,\cdots, x_n$, with coefficients in $\mathbb{Q}$ and let $\langle f\rangle$ be the ideal generated by $f$. Such a polynomial system, which…
We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a deterministic black-box identity testing algorithm for…
This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspen- sky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new…
In this paper, we study the internal stabilizability and internal stabilization problems for multidimensional (nD) systems. Within the fractional representation approach, a multidimen-sional system can be studied by means of matrices with…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construc-tion uses a single linear differential form defined from the…
This paper investigates fuzzy nonlinear system equations using an optimization approach. Here, the inner-outer direct search technique is used with fuzzy coefficients and vectors to quantify the uncertain solution. The fuzzy nonlinear…
In this paper, we report on the largest labelled dataset constructed so far for solving zero-dimensional square nonlinear systems with subdivision-based methods. A brief, non-exhaustive survey with emphasis on the literature from the past…
We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for…
We present a new approach to singularity confinement which makes it an efficient and reliable discrete integrability detector. Our method is based on the full-deautonomisation procedure, which consists in analysing non-autonomous extensions…
The impressive results of modern neural networks partly come from their non linear behaviour. Unfortunately, this property makes it very difficult to apply formal verification tools, even if we restrict ourselves to networks with a…
This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…
An isolated point of degree $d$ is a closed point on an algebraic curve which does not belong to an infinite family of degree $d$ points that can be parameterized by some geometric object. We provide an algorithm to test whether a rational,…
A novel approach is introduced for deriving exact solutions to nonlinear systems of ordinary differential equations. This method consists of four parts. In the initial part, the examined nonlinear differential equation system is transformed…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for…