Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization

Mohab Safey El Din 1 Éric Schost 2
1 PolSys - Polynomial Systems
Inria de Paris, LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input system under some genericity assumptions. The assumptions essentially imply that the Jacobian matrix of the system under study has maximal rank at the solution set and that this solution set if finite. The algorithm is probabilistic and a probability analysis is provided. Next, we apply these results to the problem of optimizing a linear map on the real trace of an algebraic set. Under some genericity assumptions, we provide bit complexity estimates for solving this polynomial minimization problem.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [47 references]  Display  Hide  Download

https://hal.inria.fr/hal-01319729
Contributor : Mohab Safey El Din <>
Submitted on : Saturday, December 9, 2017 - 12:57:41 PM
Last modification on : Wednesday, March 27, 2019 - 1:35:16 AM
Document(s) archivé(s) le : Saturday, March 10, 2018 - 12:24:25 PM

Files

bit-multi-homo.pdf
Files produced by the author(s)

Identifiers

Citation

Mohab Safey El Din, Éric Schost. Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. Journal of Symbolic Computation, Elsevier, In press, 87, pp.176-206. ⟨10.1016/j.jsc.2017.08.001⟩. ⟨hal-01319729v2⟩

Share

Metrics

Record views

264

Files downloads

291