Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Symbolic Computation Year : 2018

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

Mohab Safey El Din

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.
Fichier principal
Vignette du fichier
bit-multi-homo.pdf (514.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01319729 , version 1 (22-05-2016)
hal-01319729 , version 2 (09-12-2017)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More