A Numerical Algorithm for Zero Counting. III: Randomization and Condition
arXiv:1007.1597 · doi:10.1016/j.aam.2011.07.001
Abstract
In a recent paper (Cucker, Krick, Malajovich and Wschebor, A Numerical Algorithm for Zero Counting. I: Complexity and accuracy, J. Compl.,24:582-605, 2008) we analyzed a numerical algorithm for computing the number of real zeros of a polynomial system. The analysis relied on a condition number kappa(f) for the input system f. In this paper, we look at kappa(f) as a random variable derived from imposing a probability measure on the space of polynomial systems and give bounds for both the tail P{kappa(f) > a} and the expected value E(log kappa(f)).
References in corpus (1)
Cited by in corpus (7)
- Real roots of random polynomials: expectation and repulsion
- Computing the Homology of Semialgebraic Sets I: Lax Formulas
- Probabilistic Condition Number Estimates For Real Polynomial Systems I: A Broader Family Of Distributions
- Plantinga-Vegter algorithm takes average polynomial time
- Rice Formula for processes with jumps and applications
- On the expected number of zeros of nonlinear equations
- On the Complexity of the Plantinga-Vegter Algorithm