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
(Redirected from Publication:3433761)
Recommendations
- On the probability distribution of data at points in real complete intersection varieties
- A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- scientific article; zbMATH DE number 421657
Cites work
- A condition number theorem for underdetermined polynomial systems
- Accuracy and Stability of Numerical Algorithms
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Complexity of Bezout's Theorem I: Geometric Aspects
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Definability and fast quantifier elimination in algebraically closed fields
- Estimates on the distribution of the condition number of singular matrices
- Estimations for the separation number of a polynomial system
- Fixed points, zeros and Newton's method
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 3897078 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3554399 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 3280855 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Newton's method and some complexity aspects of the zero-finding problem
- Numerical inverting of matrices of high order
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- On location and approximation of clusters of zeros: Case of embedding dimension one
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- The best bounds in Gautschi's inequality
- The Probability That a Numerical Analysis Problem is Difficult
- Topological complexity of a root finding algorithm
- Upper bounds on the distribution of the condition number of singular matrices
Cited in
(5)- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- Condition of intersecting a projective variety with a varying linear subspace
- Estimates on the distribution of the condition number of singular matrices
- On the probability distribution of data at points in real complete intersection varieties
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3433761)
