On the probability distribution of data at points in real complete intersection varieties
From MaRDI portal
Publication:945919
DOI10.1016/J.JCO.2008.01.001zbMath1152.65056OpenAlexW2129736913MaRDI QIDQ945919
Cruz E. Borges, Luis Miguel Pardo
Publication date: 19 September 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2008.01.001
Related Items (5)
On the geometry and topology of the solution variety for polynomial system solving ⋮ Fast linear homotopy to find approximate zeros of polynomial systems ⋮ Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian ⋮ An arithmetic Poisson formula for the multi-variate resultant ⋮ A numerical algorithm for zero counting. III: Randomization and condition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High probability analysis of the condition number of sparse polynomial systems
- Some remarks on the condition number of a real random square matrix
- Fixed points, zeros and Newton's method
- Smoothed analysis of complex conic condition numbers
- Estimates on the distribution of the condition number of singular matrices
- On Smale's 17th problem: a probabilistic positive solution
- A numerical algorithm for zero counting. I: Complexity and accuracy
- 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
- Complexity of Bezout's theorem. III: Condition number and packing
- On the number of minima of a random polynomial
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- On the efficiency of algorithms of analysis
- The Probability That a Numerical Analysis Problem is Difficult
- Eigenvalues and Condition Numbers of Random Matrices
- On the Distribution of a Scaled Condition Number
- Complexity of Bezout's Theorem I: Geometric Aspects
- The kinematic formula in Riemannian homogeneous spaces
- The best bounds in Gautschi's inequality
- A condition number theorem for underdetermined polynomial systems
- Upper and Lower Bounds for the Tails of the Distribution of the Condition Number of a Gaussian Matrix
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Condition Numbers of Gaussian Random Matrices
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
This page was built for publication: On the probability distribution of data at points in real complete intersection varieties
