Skip to Main content Skip to Navigation
Journal articles

Parallel computation of resolvents by multimodular techniques and decomposition formula

Philippe Aubry 1 Annick Valibouze 2, 1, *
* Corresponding author
1 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper we significantly extend the limits of existing algebraic algorithms for computing Lagrange resolvents. Such algorithms are fundamental in effective Galois theory. However, they usually are of high complexity. For the case of absolute resolvents, N. Rennert has shown the value of a multimodular approach to reduce the complexity in space and time. We improve and generalize his work to the computation of any resolvent. In addition, we introduce a decomposition formula which allows us to split modular resolvents into resolvents of smaller degrees, thus both speeding computations and making it possible to efficiently parallelize them.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00694906
Contributor : Annick Valibouze <>
Submitted on : Monday, May 7, 2012 - 9:47:55 AM
Last modification on : Tuesday, May 14, 2019 - 10:31:19 AM

Identifiers

Citation

Philippe Aubry, Annick Valibouze. Parallel computation of resolvents by multimodular techniques and decomposition formula. International Journal of Algebra and Computation, World Scientific Publishing, 2012, 22 (5), pp.1-21. ⟨10.1142/S0218196712500439⟩. ⟨hal-00694906⟩

Share

Metrics

Record views

175