A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
From MaRDI portal
Publication:2431382
DOI10.1007/s11784-009-0127-4zbMath1215.65218arXiv0909.4101OpenAlexW2129635337WikidataQ57733132 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
Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)
Related Items
Functional norms, condition numbers and numerical algorithms in algebraic geometry, On the complexity of the Plantinga-Vegter algorithm, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, On the expected number of zeros of nonlinear equations, A numerical algorithm for zero counting. III: Randomization and condition, Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions, Computing the homology of real projective sets, Grid methods in computational real algebraic (and semialgebraic) geometry, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF, On a condition number of general random polynomial systems, Computing the homology of semialgebraic sets. I: Lax formulas, Smoothed analysis for the condition number of structured real polynomial systems
