On the complexity of computing real radicals of polynomial systems

Abstract : Let f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal degree D and V⊂ Cn be the algebraic set defined by f and r be its dimension. The real radical re < f > associated to f is the largest ideal which defines the real trace of V . When V is smooth, we show that re < f >, has a finite set of generators with degrees bounded by V. Moreover, we present a probabilistic algorithm of complexity (snDn )O(1) to compute the minimal primes of re < f >. When V is not smooth, we give a probabilistic algorithm of complexity sO(1) (nD)O(nr2r) to compute rational parametrizations for all irreducible components of the real algebraic set V ∩ Rn. Experiments are given to show the efficiency of our approaches.
Document type :
Conference papers
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal.inria.fr/hal-01956596
Contributor : Mohab Safey El Din <>
Submitted on : Sunday, December 16, 2018 - 6:52:26 AM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM
Long-term archiving on : Sunday, March 17, 2019 - 12:34:31 PM

File

SaYaZhi18.pdf
Files produced by the author(s)

Identifiers

Citation

Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi. On the complexity of computing real radicals of polynomial systems. ISSAC '18 - The 2018 ACM on International Symposium on Symbolic and Algebraic Computation, Jul 2018, New-York, United States. pp.351-358, ⟨10.1145/3208976.3209002⟩. ⟨hal-01956596⟩

Share

Metrics

Record views

45

Files downloads

276