Artículos de revistas
A numerical algorithm for zero counting. III: Randomization and condition
Fecha
2012-01Registro en:
Cucker, Felipe; Krick, Teresa Elena Genoveva; Malajovich, Gregorio; Wschebor, Mario; A numerical algorithm for zero counting. III: Randomization and condition; Elsevier; Advances In Applied Mathematics; 48; 1; 1-2012; 215-248
0196-8858
CONICET Digital
CONICET
Autor
Cucker, Felipe
Krick, Teresa Elena Genoveva
Malajovich, Gregorio
Wschebor, Mario
Resumen
In a recent paper [7] we analyzed a numerical algorithm for computing the number of real zeros of a polynomial system. The analysis relied on a condition number κ(f) for the input system f. In this paper we look at κ(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{κ(f) > a} and the expected value E(log κ(f)).