Pré-Publication, Document De Travail Année : 2016

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

Résumé

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 (387.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

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

Licence

Identifiants

Citer

Mohab Safey El Din, Eric Schost. Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. 2016. ⟨hal-01319729v1⟩
594 Consultations
1204 Téléchargements

Altmetric

Partager

  • More