Smoothed analysis of complex conic condition numbers

DOI10.1016/j.matpur.2006.06.001zbMath1113.65044arXivmath/0605635OpenAlexW2087831729WikidataQ57733188 ScholiaQ57733188MaRDI QIDQ864180

Martin Lotz, Felipe Cucker, Peter Bürgisser

Publication date: 13 February 2007

Published in: Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)

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

zbMATH Keywords

integral geometryvolume of tubes

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) General theory of numerical analysis in abstract spaces (65J05) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of matrix norms, conditioning, scaling (65F35) Integral geometry (53C65) Other complex differential geometry (53C56) Conditioning of matrices (15A12)

Related Items

Smooth analysis of the condition number and the least singular value, Some new results on the eigenvalues of complex non-central Wishart matrices with a rank-1 mean, Smoothed Analysis of Local Search Algorithms, On the complexity of the Plantinga-Vegter algorithm, Condition of Intersecting a Projective Variety with a Varying Linear Subspace, Hausdorff approximations and volume of tubes of singular algebraic sets, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, On a problem posed by Steve Smale, Robust smoothed analysis of a condition number for linear programming, On the probability distribution of data at points in real complete intersection varieties, The probability that a slightly perturbed numerical analysis problem is difficult, Stochastic perturbations and smooth condition numbers, Probabilistic analyses of condition numbers, General formulas for the smoothed analysis of condition numbers

Cites Work

• A note on level-2 condition numbers
• Probabilistic analysis of condition numbers for linear programming
• On condition numbers and the distance to the nearest ill-posed problem
• Global analysis and economics. V: Pareto theory with constraints
• It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
• Complexity of Bezout's theorem. V: Polynomial time
• On the expected condition number of linear programming problems
• Smoothed analysis of termination of linear programming algorithms
• Generalized inverses. Theory and applications.
• Smoothed analysis of \(\kappa(A)\)
• Complexity of Bezout's theorem. III: Condition number and packing
• Upper bounds on the distribution of the condition number of singular matrices
• Note on matrices with a very ill-conditioned eigenproblem
• Smoothed analysis of some condition numbers
• Smoothed analysis of algorithms
• The Probability That a Numerical Analysis Problem is Difficult
• Eigenvalues and Condition Numbers of Random Matrices
• The fundamental theorem of algebra and complexity theory
• Complexity of Bezout's Theorem I: Geometric Aspects
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Numerical inverting of matrices of high order
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item