Approximate zeros and condition numbers
From MaRDI portal
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)
Recommendations
Cites work
Cited in
(9)- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Grid methods in computational real algebraic (and semialgebraic) geometry
- On the complexity of the Plantinga-Vegter algorithm
- Computing the homology of semialgebraic sets. I: Lax formulas
- Smoothed analysis for the condition number of structured real polynomial systems
- Condition number based complexity estimate for solving polynomial systems
- Computing the homology of real projective sets
- On the computation of the homology of semialgebraic sets
- A numerical algorithm for zero counting. I: Complexity and accuracy
This page was built for publication: Approximate zeros and condition numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974565)