Certifying a probabilistic parallel modular algorithm for rational univariate representation
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QHHBW6K3record.jsonopen to challenge →
read the original abstract
This paper is about solving polynomial systems. It first recalls how to do that efficiently with a very high probability of correctness by reconstructing a rational univariate representation (rur) using Groebner revlex computation, Berlekamp-Massey algorithm and Hankel linear system solving modulo several primes in parallel. Then it introduces a new method (theorem \ref{prop:check}) for rur certification that is effective for most polynomial systems.These algorithms are implemented in https://www-fourier.univ-grenoble-alpes.fr/~parisse/giac.html since version 1.7.0-13 or 1.7.0-17 for certification, it has (July 2021) leading performances on multiple CPU, at least for an open-source software.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Fast Rational Univariate Representation via Gaussian Elimination
A Julia package using dense Gaussian elimination computes certified rational univariate representations of polynomial systems with thousands of solutions in seconds, outperforming msolve on several benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.