A numerical algorithm for zero counting. III: Randomization and condition

dc.creatorCucker, Felipe
dc.creatorKrick, Teresa Elena Genoveva
dc.creatorMalajovich, Gregorio
dc.creatorWschebor, Mario
dc.date.accessioned2017-07-10T17:48:03Z
dc.date.accessioned2018-11-06T11:59:32Z
dc.date.available2017-07-10T17:48:03Z
dc.date.available2018-11-06T11:59:32Z
dc.date.created2017-07-10T17:48:03Z
dc.date.issued2012-01
dc.identifierCucker, 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
dc.identifier0196-8858
dc.identifierhttp://hdl.handle.net/11336/19996
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1861968
dc.description.abstractIn 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)).
dc.languageeng
dc.publisherElsevier
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.aam.2011.07.001
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0196885811000728
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1007.1597
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectZero-counting
dc.subjectFinite-precision
dc.subjectCondition numbers
dc.subjectAverage-case analysis
dc.titleA numerical algorithm for zero counting. III: Randomization and condition
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución