Rigid continuation paths II. Structured polynomial systems
Preprint
Abstract
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with high probability, an approximate zero of a polynomial system given only as black-box evaluation program. Secondly, we introduce a universal model of random polynomial systems with prescribed evaluation complexity L. Combining both, we show that we can compute an approximate zero of a random structured polynomial system with n equations of degree at most {\delta} in n variables with only poly(n, {\delta}) L operations with high probability. This exceeds the expectations implicit in Smale's 17th problem.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Mixed precision path tracking for polynomial homotopy continuationAdvances in Computational Mathematics, 2021
- A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average TimeFoundations of Computational Mathematics, 2016
- Condition Length and Complexity for the Solution of Polynomial SystemsFoundations of Computational Mathematics, 2016
- Robust Certified Numerical Homotopy TrackingFoundations of Computational Mathematics, 2013
- A continuation method to solve polynomial systems and its complexityNumerische Mathematik, 2010
- Complexity of Bezout’s Theorem VII: Distance Estimates in the Condition MetricFoundations of Computational Mathematics, 2007
- Complexity of Bezout’s Theorem VI: Geodesics in the Condition (Number) MetricFoundations of Computational Mathematics, 2007
- On Smale's 17th Problem: A Probabilistic Positive SolutionFoundations of Computational Mathematics, 2007
- Complexity of Bezout’s Theorem II Volumes and Probabilities1993
- On condition numbers and the distance to the nearest ill-posed problemNumerische Mathematik, 1987