Algebraic certification of numerical algorithms computing Lagrange resolvents

DOI10.1142/S021949881850007XMaRDI QIDQ4599698zbMATH OpenFDO

Authors Ines Abdeljaoued-Tej, Faïçal Bouazizi, Annick Valibouze

Publication date 4 January 2018

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S021949881850007X

zbMATH Keywords

Galois groupGaloisian idealminimal polynomialtriangular ideal

Mathematics Subject Classification ID

Galois theory (11R32) Ideals and multiplicative ideal theory in commutative rings (13A15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10)

Recommendations

• A parallel multi-modular algorithm for computing Lagrange resolvents
• Parallel computation of resolvents by multimodular techniques and decomposition formula
• Algebraic computation of resolvents without extraneous powers
• Algorithm 921: alphaCertified: certifying solutions to polynomial systems
• On the theory of resolvents and its applications.

Cites work

• Calculs d'invariants primitifs de groupes finis
• Double classes, Galois ideals and resolvents
• Study of algebraic relations between the roots of a univariate polynomial
• The Determination of Galois Groups
• Using Galois ideals for computing relative resolvents

Cited in

(2)

• A parallel multi-modular algorithm for computing Lagrange resolvents
• scientific article; zbMATH DE number 5679820 (Why is no real title available?)

This page was built for publication: Algebraic certification of numerical algorithms computing Lagrange resolvents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599698)