A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis

DOI10.1007/s11784-009-0127-4zbMath1215.65218arXiv0909.4101WikidataQ57733132 ScholiaQ57733132MaRDI QIDQ2431382

Mario Wschebor, Felipe Cucker, Gregorio Malajovich, Teresa Krick

Publication date: 13 April 2011

Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.4101

zbMATH Keywords

polynomial systems; condition numbers; zero counting; smoothed analysis

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

65Y20: Complexity and performance of numerical algorithms

Related Items

Smoothed analysis for the condition number of structured real polynomial systems, Functional norms, condition numbers and numerical algorithms in algebraic geometry, A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, A numerical algorithm for zero counting. III: Randomization and condition, Computing the homology of real projective sets, 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, On the expected number of zeros of nonlinear equations, On a condition number of general random polynomial systems