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
From MaRDI portal
Publication:3433761
DOI10.1090/S0025-5718-07-01963-1zbMath1123.65041OpenAlexW2009124583MaRDI QIDQ3433761
Carlos Beltran, Luis Miguel Pardo
Publication date: 2 May 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-07-01963-1
algorithmscondition numberprobability distributionMoore-Penrose pseudoinversegeometric integration theoryNewton's operatorcomplete intersection varietiesunderdetermined systems of equations
Related Items
On the probability distribution of data at points in real complete intersection varieties, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological complexity of a root finding algorithm
- Definability and fast quantifier elimination in algebraically closed fields
- Fixed points, zeros and Newton's method
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Estimates on the distribution of the condition number of singular matrices
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Complexity of Bezout's theorem. V: Polynomial time
- Estimations for the separation number of a polynomial system
- Complexity of Bezout's theorem. III: Condition number and packing
- Upper bounds on the distribution of the condition number of singular matrices
- The Probability That a Numerical Analysis Problem is Difficult
- Complexity of Bezout's Theorem I: Geometric Aspects
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- The best bounds in Gautschi's inequality
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- A condition number theorem for underdetermined polynomial systems
- Accuracy and Stability of Numerical Algorithms
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
