Block-Krylov techniques in the context of sparse-FGLM algorithms - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année :

## Block-Krylov techniques in the context of sparse-FGLM algorithms

Seung Gyu Hyun
• Fonction : Auteur
Vincent Neiger
• Fonction : Auteur
Hamid Rahkooy
Éric Schost
• Fonction : Auteur

#### Résumé

Consider a zero-dimensional ideal $I$ in $\mathbb{K}[X_1,\dots,X_n]$. Inspired by Faugère and Mou's Sparse FGLM algorithm, we use Krylov sequences based on multiplication matrices of $I$ in order to compute a description of its zero set by means of univariate polynomials. Steel recently showed how to use Coppersmith's block-Wiedemann algorithm in this context; he describes an algorithm that can be easily parallelized, but only computes parts of the output in this manner. Using generating series expressions going back to work of Bostan, Salvy, and Schost, we show how to compute the entire output for a small overhead, without making any assumption on the ideal I other than it having dimension zero. We then propose a refinement of this idea that partially avoids the introduction of a generic linear form. We comment on experimental results obtained by an implementation based on the C++ libraries LinBox, Eigen and NTL.

#### Domaines

Informatique [cs] Calcul formel [cs.SC]

### Dates et versions

hal-01661690 , version 1 (12-12-2017)
hal-01661690 , version 2 (15-01-2019)

### Identifiants

• HAL Id : hal-01661690 , version 2

### Citer

Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost. Block-Krylov techniques in the context of sparse-FGLM algorithms. 2019. ⟨hal-01661690v2⟩

### Exporter

BibTeX TEI Dublin Core DC Terms EndNote Datacite

### Collections

262 Consultations
483 Téléchargements