Complexity and real computation
Complexity and real computation
High probability analysis of the condition number of sparse polynomial systems
Theoretical Computer Science - Algebraic and numerical algorithm
On the number of minima of a random polynomial
Journal of Complexity
Hi-index | 0.00 |
We consider a random polynomial system with m equations and m real unknowns. Assume all equations have the same degree d and the law on the coefficients satisfies the Kostlan-Shub-Smale hypotheses. It is known that E(NX) = dm/2 where NX denotes the number of roots of the system. Under the condition that d does not grow very fast, we prove that lim supm→+∞ Var(NX/dm/2) ≤ 1. Moreover, if d ≥ 3 then Var(NX/dm/2) → 0 as m → +∞, which implies NX/dm/2 → 1 in probability.