A Numerical Algorithm for Zero Counting. III: Randomization and Condition

Details A Numerical Algorithm for Zero Counting. III: Randomization and Condition A Numerical Algorithm for Zero Counting. III: Randomization and Condition

2010-07-09

arxiv.org/abs/1007.1597v2

Mathematics

Numerical Analysis

Scientific paper

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)).

Affiliated with

Also associated with

No associations

Rating

A Numerical Algorithm for Zero Counting. III: Randomization and Condition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Numerical Algorithm for Zero Counting. III: Randomization and Condition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Numerical Algorithm for Zero Counting. III: Randomization and Condition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645313