On the p-adic stability of the FGLM algorithm - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

On the p-adic stability of the FGLM algorithm

Guénaël Renault
Tristan Vaccon
  • Fonction : Auteur
  • PersonId : 975861

Résumé

Nowadays, many strategies to solve polynomial systems use the computation of a Gröbner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gröbner basis for the lexicographical ordering. The change of ordering algorithm is crucial for these strategies. We study the p-adic stability of the main change of ordering algorithm, FGLM. We show that FGLM is stable and give explicit upper bound on the loss of precision occuring in its execution. The variant of FGLM designed to pass from the grevlex ordering to a Gröbner basis in shape position is also stable. Our study relies on the application of Smith Normal Form computations for linear algebra.
Fichier principal
Vignette du fichier
fglmp.pdf (271.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01266071 , version 1 (02-02-2016)

Identifiants

Citer

Guénaël Renault, Tristan Vaccon. On the p-adic stability of the FGLM algorithm. 2016. ⟨hal-01266071⟩
126 Consultations
85 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More