msolve: A Library for Solving Polynomial Systems

04/08/2021
by   Jérémy Berthomieu, et al.
0

We present a new open source C library dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of relies on Gr'́obner bases and linear algebra based algorithms for polynomial system solving. It relies on Gr'́obner basis computation w.r.t. the degree reverse lexicographical order, Gr'́obner conversion to a lexicographical Gr'́obner basis and real solving of univariate polynomials. We explain in detail how these three main steps of the solving process are implemented, how we exploit instruction processors and the more general implementation ideas we put into practice to better exploit the computational capabilities of this algorithmic framework. We compare the practical performances of with leading computer algebra systems such as Magma, Maple, Singular on a wide range of systems with finitely many complex solutions, showing that can tackle systems which were out of reach by the computer algebra software state-of-the-art.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2019

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems

Gröbner bases is one the most powerful tools in algorithmic non-linear a...
research
12/06/2017

Rings: an efficient Java/Scala library for polynomial rings

In this paper we briefly discuss Rings --- an efficient lightweight libr...
research
06/21/2021

Certifying a probabilistic parallel modular algorithm for rational univariate representation

This paper is about solving polynomial systems. It first recalls how to ...
research
05/10/2019

Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants

Complexity bounds for many problems on matrices with univariate polynomi...
research
08/04/2023

Algorithmic computation of multivector inverses and characteristic polynomials in non-degenerate Clifford algebras

The power of Clifford or, geometric, algebra lies in its ability to repr...
research
07/07/2016

Rigorous Multiple-Precision Evaluation of D-Finite Functions in SageMath

We present a new open source implementation in the SageMath computer alg...
research
09/22/2017

Roaring Bitmaps: Implementation of an Optimized Software Library

Compressed bitmap indexes are used in systems such as Git or Oracle to a...

Please sign up or login with your details

Forgot password? Click here to reset