A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy

Details A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy

2007-10-24

arxiv.org/abs/0710.4508v2

Journal of Complexity 24 Issues 5-6, pp 582-605 (Oct-Dec 2008)

Computer Science

Computational Complexity

We made minor but necessary improvements in the presentation

Scientific paper

10.1016/j.jco.2008.03.001

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D is a bound on the polynomials' degree, and kappa(f) is a condition number for the system. Each iteration uses an exponential number of operations. The algorithm uses finite-precision arithmetic and a polynomial bound for the precision required to ensure the returned output is correct is exhibited. This bound is a major feature of our algorithm since it is in contrast with the exponential precision required by the existing (symbolic) algorithms for counting real zeros. The algorithm parallelizes well in the sense that each iteration can be computed in parallel polynomial time with an exponential number of processors.

Affiliated with

Also associated with

No associations

Rating

A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy 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. I: Complexity and Accuracy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-655502