Approximate zeros and condition numbers

DOI10.1006/jcom.1999.0503zbMath0967.65063OpenAlexW2051610907WikidataQ57733278 ScholiaQ57733278MaRDI QIDQ1974565

Felipe Cucker

Publication date: 7 May 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1999.0503

zbMATH Keywords

systems of polynomial equationsroundoff errorcondition numberscomplexity boundsapproximate zeros

Mathematics Subject Classification ID

Related Items (8)

On the complexity of the Plantinga-Vegter algorithm ⋮ Condition number based complexity estimate for solving polynomial systems ⋮ Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions ⋮ Computing the homology of real projective sets ⋮ A numerical algorithm for zero counting. I: Complexity and accuracy ⋮ Grid methods in computational real algebraic (and semialgebraic) geometry ⋮ Computing the homology of semialgebraic sets. I: Lax formulas ⋮ Smoothed analysis for the condition number of structured real polynomial systems

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate zeros and condition numbers