Rigid continuation paths II. Structured polynomial systems

10/21/2020
by   Peter Bürgisser, et al.
0

We design a probabilistic algorithm that, given ϵ>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) + loglogϵ^-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 and δ. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2017

Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems

How many operations do we need on the average to compute an approximate ...
research
07/17/2018

Faster Algorithms via Waring Decompositions

We show that decompositions of certain polynomials as sums of powers of ...
research
04/28/2019

Efficient Black-Box Identity Testing over Free Group Algebra

Hrubeš and Wigderson [HW14] initiated the study of noncommutative arithm...
research
07/17/2018

Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits

The classical lemma of Ore-DeMillo-Lipton-Schwartz-Zippel states that an...
research
09/10/2018

Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis

We consider the sensitivity of real zeros of polynomial systems with res...
research
11/15/2021

Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications

Multipoint evaluation is the computational task of evaluating a polynomi...
research
01/28/2019

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems

Suppose F:=(f_1,…,f_n) is a system of random n-variate polynomials with ...

Please sign up or login with your details

Forgot password? Click here to reset