Complexity of Bezout's theorem III: condition number and packing
Journal of Complexity - Festschrift for Joseph F. Traub, Part 1
Complexity of Bezout's theorem V: polynomial time
Selected papers of the workshop on Continuous algorithms and complexity
Homotopies exploiting Newton polytopes for solving sparse polynomial systems
SIAM Journal on Numerical Analysis
A polyhedral method for solving sparse polynomial systems
Mathematics of Computation
Complexity of Bezout's theorem IV: probability of success; extensions
SIAM Journal on Numerical Analysis
Applied numerical linear algebra
Applied numerical linear algebra
Complexity and real computation
Complexity and real computation
On the geometry of Graeffe Iteration
Journal of Complexity
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the number of minima of a random polynomial
Journal of Complexity
Approximation of the solution of certain nonlinear ODEs with linear complexity
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
Let f := (f1 ..... fn) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/ε. The bound depends on an integral of a differential form on a toric manifold and admits a simple explicit upper bound when the Newton polytopes (and underlying variances) are all identical.We also consider polynomials with real coefficients and give bounds for the expected number of real roots and (restricted) condition number. Using a Kähler geometric framework throughout, we also express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form, thus recovering the classical mixed volume when U = (C*)n.