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

Abstract : How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input size)}^{1+o(1)}$. This improves upon the previously known $\text{(input size)}^{\frac32 +o(1)}$ bound. The new algorithm relies on numerical continuation along rigid continuation paths. The central idea is to consider rigid motions of the equations rather than line segments in the linear space of all polynomial systems. This leads to a better average condition number and allows for bigger steps. We show that on the average, we can compute one approximate root of a random Gaussian polynomial system of~$n$ equations of degree at most $D$ in $n+1$ homogeneous variables with $O(n^5 D^2)$ continuation steps. This is a decisive improvement over previous bounds that prove no better than $\sqrt{2}^{\min(n, D)}$ continuation steps on the average.
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal.inria.fr/hal-01631778
Contributor : Pierre Lairez <>
Submitted on : Tuesday, September 10, 2019 - 11:30:17 AM
Last modification on : Thursday, September 12, 2019 - 1:15:21 AM

File

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

Identifiers

  • HAL Id : hal-01631778, version 2

Collections

Citation

Pierre Lairez. Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems. Journal of the American Mathematical Society, American Mathematical Society, In press. ⟨hal-01631778v2⟩

Share

Metrics

Record views

27

Files downloads

137