A probabilistic parallel modular algorithm for rational univariate representation
Résumé
This article does not introduce new mathematical ideas, it is more a state of the art June 2021 picture about solving polynomial systems efficiently by reconstructing a rational univariate representation with a very high probability of correctness using Groebner revlex computation, Berlekamp-Massey algorithm and Hankel linear system solving modulo several primes in parallel. This algorithm is implemented in Giac/Xcas since version 1.7.0-13, it has (June 2021) leading performances on multiple CPU, at least for an open-source software.
Domaines
Calcul formel [cs.SC]
Origine : Fichiers produits par l'(les) auteur(s)