On the probability distribution of data at points in real complete intersection varieties
The authors are interested in the design and analysis of efficient algorithms for real solving of multi-variate real polynomial equations using probability algorithms. Basic approach stems from the ideas of a series of seminal papers by \textit{M. Shub} and \textit{S. Smale} [J. Am. Math. Soc. 6, No. 2, 459-501 (1993; Zbl 0821.65035); in: Computational algebraic geometry. Prog. Math. 109, 267--285 (1993; Zbl 0851.65031); J. Complexity 9, No. 1, 4--14 (1993; Zbl 0846.65018); SIAM J. Numer. Anal. 33, No. 1, 128--148 (1996; Zbl 0843.65035); Theor. Comput. Sci. 133, No.1, 141-164 (1994; Zbl 0846.65022)]. Thus, this paper is (using the words of the authors) a modest attempt to re-initialize this study from the most elementary aspects, i.e. study of the probability distribution of three data at points in real complete intersection varieties. (1) Norms of real affine zeros of real complete intersections. (2) Condition number at real zeros of real system of multivariate polynomial equations. (3) Convergence radius of Newton's operator at zeros of complete intersection real algebraic varieties.
- 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
- Explicit estimates for polynomial systems defining irreducible smooth complete intersections
- On the probability distribution of singular varieties of given corank
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- The probability that the number of points on a complete intersection is squarefree
- A condition number theorem for underdetermined polynomial systems
- A numerical algorithm for zero counting. I: Complexity and accuracy
- 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
- Condition Numbers of Gaussian Random Matrices
- Eigenvalues and Condition Numbers of Random Matrices
- Estimates on the distribution of the condition number of singular matrices
- Fixed points, zeros and Newton's method
- High probability analysis of the condition number of sparse polynomial systems
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 503393 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 953017 (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?)
- It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
- Numerical inverting of matrices of high order
- On Smale's 17th problem: a probabilistic positive solution
- On the Distribution of a Scaled Condition Number
- On the efficiency of algorithms of analysis
- 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
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Smoothed analysis of complex conic condition numbers
- Some remarks on the condition number of a real random square matrix
- The best bounds in Gautschi's inequality
- The kinematic formula in Riemannian homogeneous spaces
- The Probability That a Numerical Analysis Problem is Difficult
- Upper and Lower Bounds for the Tails of the Distribution of the Condition Number of a Gaussian Matrix
- On the geometry and topology of the solution variety for polynomial system solving
- An arithmetic Poisson formula for the multi-variate resultant
- On the probability distribution of singular varieties of given corank
- 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
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- Fast linear homotopy to find approximate zeros of polynomial systems
- A numerical algorithm for zero counting. III: Randomization and condition
This page was built for publication: On the probability distribution of data at points in real complete intersection varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945919)
