Algebraic certification of numerical algorithms computing Lagrange resolvents

DOI10.1142/S021949881850007XzbMATH Open1401.13009MaRDI QIDQ4599698FDOQ4599698

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)

zbMATH Keywords

minimal polynomialGalois groupGaloisian idealtriangular ideal

Mathematics Subject Classification ID

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

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
• Title not available (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)