The probability that a slightly perturbed numerical analysis problem is difficult
From MaRDI portal
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 epsilon-tubular neighborhoods around a real algebraic subvariety of a sphere, intersected with a disk of radius sigma. Besides epsilon and sigma, this bound depends only the dimension of the sphere and on the degree of the defining equations.
Recommendations
Cites work
- A note on level-2 condition numbers
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Complexity of Bezout's Theorem I: Geometric Aspects
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's theorem. V: Polynomial time
- Estimates on the distribution of the condition number of singular matrices
- General formulas for the smoothed analysis of condition numbers
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3686283 (Why is no real title available?)
- scientific article; zbMATH DE number 44375 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 176033 (Why is no real title available?)
- scientific article; zbMATH DE number 3512931 (Why is no real title available?)
- scientific article; zbMATH DE number 3533716 (Why is no real title available?)
- scientific article; zbMATH DE number 3627912 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 503393 (Why is no real title available?)
- scientific article; zbMATH DE number 1069617 (Why is no real title available?)
- scientific article; zbMATH DE number 1962932 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 3229359 (Why is no real title available?)
- scientific article; zbMATH DE number 3062447 (Why is no real title available?)
- Note on matrices with a very ill-conditioned eigenproblem
- Numerical inverting of matrices of high order
- On condition numbers and the distance to the nearest ill-posed problem
- On the Betti Numbers of Real Varieties
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- On the Volume of Tubes
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Smoothed analysis of \(\kappa(A)\)
- Smoothed analysis of algorithms
- Smoothed analysis of algorithms and heuristics: progress and open questions
- Smoothed analysis of complex conic condition numbers
- Smoothed analysis of some condition numbers
- Smoothed analysis of termination of linear programming algorithms
- The fundamental theorem of algebra and complexity theory
- The kinematic formula in Riemannian homogeneous spaces
- The Probability That a Numerical Analysis Problem is Difficult
- Volumes of tubular neighbourhoods of real algebraic varieties
Cited in
(21)- Generalizations of the Kolmogorov-Barzdin embedding estimates
- On the complexity of the Plantinga-Vegter algorithm
- Computing the homology of semialgebraic sets. I: Lax formulas
- On local analysis
- Probabilistic analysis of the Grassmann condition number
- Average-case complexity without the black swans
- General formulas for the smoothed analysis of condition numbers
- Smooth analysis of the condition number and the least singular value
- Smoothed analysis of local search algorithms
- The Probability That a Numerical Analysis Problem is Difficult
- On the volume of tubular neighborhoods of real algebraic varieties
- Probabilistic analyses of condition numbers
- A formal proof of the expressiveness of deep learning
- A formal proof of the expressiveness of deep learning
- Hausdorff approximations and volume of tubes of singular algebraic sets
- A numerical algorithm for zero counting. III: Randomization and condition
- On a problem posed by Steve Smale
- Robust smoothed analysis of a condition number for linear programming
- On the computation of the homology of semialgebraic sets
- From Steiner formulas for cones to concentration of intrinsic volumes
- Adversarial smoothed analysis
This page was built for publication: The probability that a slightly perturbed numerical analysis problem is difficult
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577011)