Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Rigid continuation paths II. Structured polynomial systems

Abstract : 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.
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02974062
Contributor : Pierre Lairez Connect in order to contact the contributor
Submitted on : Wednesday, October 21, 2020 - 3:17:50 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM
Long-term archiving on: : Friday, January 22, 2021 - 6:49:27 PM

File

rigid-paths-2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02974062, version 1

Collections

Citation

Peter Bürgisser, Felipe Cucker, Pierre Lairez. Rigid continuation paths II. Structured polynomial systems. 2020. ⟨hal-02974062⟩

Share

Metrics

Record views

34

Files downloads

37