A Subdivision Solver for Systems of Large Dense Polynomials

03/25/2016
by   Rémi Imbach, et al.
0

We describe here the package subdivision _solver for the mathematical software SageMath. It provides a solver on real numbers for square systems of large dense polynomials. By large polynomials we mean multivariate polynomials with large degrees, which coefficients have large bit-size. While staying robust, symbolic approaches to solve systems of polynomials see their performances dramatically affected by high degree and bit-size of input polynomials.Available numeric approaches suffer from the cost of the evaluation of large polynomials and their derivatives.Our solver is based on interval analysis and bisections of an initial compact domain of ^n where solutions are sought. Evaluations on intervals with Horner scheme is performed by the package fast _polynomial for SageMath.The non-existence of a solution within a box is certified by an evaluation scheme that uses a Taylor expansion at order 2, and existence and uniqueness of a solution within a box is certified with krawczyk operator.The precision of the working arithmetic is adapted on the fly during the subdivision process and we present a new heuristic criterion to decide if the arithmetic precision has to be increased.

READ FULL TEXT
research
10/28/2022

Fast multivariate polynomials in R: the mvp package

In this short article I introduce the mvp package, which provides some f...
research
11/09/2016

Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic

Arb is a C library for arbitrary-precision interval arithmetic using the...
research
07/26/2020

multivar_horner: a python package for computing Horner factorisations of multivariate polynomials

Many applications in the sciences require numerically stable and computa...
research
10/20/2022

Fast Evaluation of Real and Complex Polynomials

We propose an algorithm for quickly evaluating polynomials. It pre-condi...
research
03/30/2018

Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform

We show a new algorithm and its implementation for multiplying bit-polyn...
research
12/14/2016

Reverse Engineering of Irreducible Polynomials in GF(2^m) Arithmetic

Current techniques for formally verifying circuits implemented in Galois...
research
04/11/2022

PolyARBerNN: A Neural Network Guided Solver and Optimizer for Bounded Polynomial Inequalities

Constraints solvers play a significant role in the analysis, synthesis, ...

Please sign up or login with your details

Forgot password? Click here to reset