Rigid continuation paths II. Structured polynomial systems - Archive ouverte HAL Access content directly
Journal Articles Forum of Mathematics, Pi Year : 2023

Rigid continuation paths II. Structured polynomial systems


We design a probabilistic algorithm that, on input ε>0 and a polynomial system F given by black-box evaluation functions, outputs an approximate zero of F, in the sense of Smale, with probability at least 1-ε. When applying this algorithm to u·F, where u is uniformly random in the product of unitary groups, the algorithm performs poly(n,δ) L(F) ( Γ(F) log Γ(F) + log log 1/ε ) operations on average. Here n is the number of variables, δ the maximum degree, L(F) denotes the evaluation cost of F, and Γ(F) reflects an aspect of the numerical condition of F. Moreover, we prove that for inputs given by random Gaussian algebraic branching programs of size poly(n,δ), the algorithm runs on average in time polynomial in n an δ. Our result may be interpreted as an affirmative answer to a refined version of Smale's 17th question, concerned with systems of structured polynomial equations.
Fichier principal
Vignette du fichier
rigid-paths-2.pdf (841.05 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02974062 , version 1 (21-10-2020)



Peter Bürgisser, Felipe Cucker, Pierre Lairez. Rigid continuation paths II. Structured polynomial systems. Forum of Mathematics, Pi, 2023, 11, pp.e12. ⟨10.1017/fmp.2023.7⟩. ⟨hal-02974062⟩
74 View
42 Download



Gmail Mastodon Facebook X LinkedIn More