The probability that a small perturbation of a numerical analysis problem is difficult
arXiv:math/0610270 · doi:10.1090/S0025-5718-08-02060-7
Abstract
We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs. Several applications to linear and polynomial equation solving show that the estimates obtained in this way are easy to derive and quite accurate. The main theorem is based on a volume estimate of ε-tubular neighborhoods around a real algebraic subvariety of a sphere, intersected with a disk of radius σ. Besides εand σ, this bound depends only the dimension of the sphere and on the degree of the defining equations.
30 pages, 4 figures
References in corpus (1)
Cited by in corpus (7)
- From Steiner Formulas for Cones to Concentration of Intrinsic Volumes
- A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis
- Generalizations of the Kolmogorov-Barzdin embedding estimates
- Computing the Homology of Semialgebraic Sets I: Lax Formulas
- A Numerical Algorithm for Zero Counting. III: Randomization and Condition
- On the Complexity of the Plantinga-Vegter Algorithm
- Smooth analysis of the condition number and the least singular value