A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy
arXiv:0710.4508 · doi:10.1016/j.jco.2008.03.001
Abstract
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.
We made minor but necessary improvements in the presentation
Cited by in corpus (16)
- A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis
- Computing the homology of basic semialgebraic sets in weak exponential time
- Computing the Homology of Semialgebraic Sets. II: General formulas
- Computing the Homology of Semialgebraic Sets I: Lax Formulas
- Probabilistic Condition Number Estimates For Real Polynomial Systems I: A Broader Family Of Distributions
- A Numerical Algorithm for Zero Counting. III: Randomization and Condition
- Plantinga-Vegter algorithm takes average polynomial time
- On the expected number of zeros of nonlinear equations
- On the Complexity of the Plantinga-Vegter Algorithm
- Functional norms, condition numbers and numerical algorithms in algebraic geometry
- Smoothed Analysis for the Condition Number of Structured Real Polynomial Systems
- Solving sparse polynomial systems using Groebner bases and resultants
- Gaussianity of normal vectors in random non-Hermitian matrices
- On a condition number of random polynomial systems
- Fast Computation of Zeros of Polynomial Systems with Bounded Degree under Finite-precision
- Counting Real Roots in Polynomial-Time for Systems Supported on Circuits