A method for enclosing all solutions to a system of polynomial equations inside a given box is presented. This method relies on the expansion of a multivariate polynomial into Bernstein polynomials and is a domain-splitting approach. After a pruning step a collection of subboxes remain which undergo an existence test provided by Miranda's Theorem
This paper describes an algorithm to enforce hyper-arc consistency of polynomial constraints defined...
International audienceThis article reviews the properties of Tensorial Bernstein Basis (TBB) and its...
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, giv...
This paper discusses an algorithm to solve polynomial constraints over finite domains, namely constr...
This paper describes an algorithm that can be used to effectively solve polynomial constraints over ...
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an ...
We solve the problem of finding an enclosure for the range of a multivariate polynomial over a recta...
AbstractAn algorithm for approximating solutions to differential equations in a modified new Bernste...
This work is about theory of systems of polynomial equations. Its main purpose is to prove the Elimi...
Abstract We present a method for solving arbitrary systems of N nonlinear polynomials in n variables...
Several mathematical frameworks for static analysis of programs have been developed in the past dec...
Many real-world and scientific problems encountered in, e.g., graph theory, signal and image process...
Many problems in applied mathematics can be formulated as a system of nonlinear equa-tions or inequa...
AbstractA method to generate accurate approximations to the singular solutions of a system of (compl...
Bounding the range of a sum of rational functions is an important task if, e.g., the global polynomi...
This paper describes an algorithm to enforce hyper-arc consistency of polynomial constraints defined...
International audienceThis article reviews the properties of Tensorial Bernstein Basis (TBB) and its...
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, giv...
This paper discusses an algorithm to solve polynomial constraints over finite domains, namely constr...
This paper describes an algorithm that can be used to effectively solve polynomial constraints over ...
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an ...
We solve the problem of finding an enclosure for the range of a multivariate polynomial over a recta...
AbstractAn algorithm for approximating solutions to differential equations in a modified new Bernste...
This work is about theory of systems of polynomial equations. Its main purpose is to prove the Elimi...
Abstract We present a method for solving arbitrary systems of N nonlinear polynomials in n variables...
Several mathematical frameworks for static analysis of programs have been developed in the past dec...
Many real-world and scientific problems encountered in, e.g., graph theory, signal and image process...
Many problems in applied mathematics can be formulated as a system of nonlinear equa-tions or inequa...
AbstractA method to generate accurate approximations to the singular solutions of a system of (compl...
Bounding the range of a sum of rational functions is an important task if, e.g., the global polynomi...
This paper describes an algorithm to enforce hyper-arc consistency of polynomial constraints defined...
International audienceThis article reviews the properties of Tensorial Bernstein Basis (TBB) and its...
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, giv...