Computing real radicals by moment optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Computing real radicals by moment optimization


We present a new algorithm for computing the real radical of an ideal and, more generally, the-radical of , which is based on convex moment optimization. A truncated positive generic linear functional vanishing on the generators of is computed solving a Moment Optimization Problem (MOP). We show that, for a large enough degree of truncation, the annihilator of generates the real radical of. We give an e ective, general stopping criterion on the degree to detect when the prime ideals lying over the annihilator are real and compute the real radical as the intersection of real prime ideals lying over. The method involves several ingredients, that exploit the properties of generic positive moment sequences. A new e cient algorithm is proposed to compute a graded basis of the annihilator of a truncated positive linear functional. We propose a new algorithm to check that an irreducible decomposition of an algebraic variety is real, using a generic real projection to reduce to the hypersurface case. There we apply the Sign Changing Criterion, e ectively performed with an exact MOP. Finally we illustrate our approach in some examples.
Fichier principal
Vignette du fichier
paper.pdf (253.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03145501 , version 1 (18-02-2021)
hal-03145501 , version 2 (29-09-2021)



Lorenzo Baldi, Bernard Mourrain. Computing real radicals by moment optimization. ISSAC 2021 - 46th International Symposium on Symbolic and Algebraic Computation, Jul 2021, Saint-Pétersbourg, Russia. ⟨10.1145/3452143.3465541⟩. ⟨hal-03145501v2⟩
328 View
305 Download



Gmail Facebook X LinkedIn More