scientific article
From MaRDI portal
Publication:3135179
zbMath0851.65031MaRDI QIDQ3135179
Publication date: 17 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
condition numberHermitian structurevolume estimatesBezout numbersystems of homogeneous polynomial equations
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)
Related Items
Rigid continuation paths II. structured polynomial systems, Limit cycle enumeration in random vector fields, Expected multivolumes of random amoebas, On generalized Newton algorithms: Quadratic convergence, path-following and error analysis, Complexity of Bezout's theorem. V: Polynomial time, Nonnegative forms with sublevel sets of minimal volume, Equidistribution of the conormal cycle of random nodal sets, A reverse Thomson problem on the unit circle, The Kostlan-Shub-Smale random polynomials in the case of growing number of variables, On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant, Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems, Lower bounds for diophantine approximations, Polar varieties, real equation solving, and data structures: the hypersurface case, Smoothed analysis of complex conic condition numbers, Expected number and distribution of critical points of real Lefschetz pencils, High probability analysis of the condition number of sparse polynomial systems, Deformation techniques to solve generalised Pham systems, Optimal and nearly optimal algorithms for approximating polynomial zeros, Random systems of polynomial equations. The expected number of roots under smooth analysis, A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time, RANDOM REAL BRANCHED COVERINGS OF THE PROJECTIVE LINE, Real zeros of mixed random fewnomial systems, Smale's fundamental theorem of algebra reconsidered, A continuation method to solve polynomial systems and its complexity, How many zeros of a random polynomial are real?, Unnamed Item, 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, Computing monodromy via continuation methods on random Riemann surfaces, Around the circular law, On the expected number of real roots of polynomials and exponential sums, Geometry of polynomials and root-finding via path-lifting, Low-degree approximation of random polynomials, The average condition number of most tensor rank decomposition problems is infinite, Robust certified numerical homotopy tracking, On the expected number of zeros of nonlinear equations, An arithmetic Poisson formula for the multi-variate resultant, Mathematics of gravitational lensing: Multiple imaging and magnification, Approximation to uniform distribution in \(\mathrm{SO}(3)\), A numerical algorithm for zero counting. III: Randomization and condition, Mean conservation of nodal volume and connectivity measures for Gaussian ensembles, Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric, On a problem posed by Steve Smale, On the probability distribution of singular varieties of given corank, Deformation techniques for efficient polynomial equation solving., Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., A sequence of polynomials with optimal condition number, Computing the homology of real projective sets, $p$-Adic Integral Geometry, Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials, The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms, Convergence of random zeros on complex manifolds, How Many Eigenvalues of a Random Matrix are Real?, Average Euler characteristic of random real algebraic varieties, Fast computation of zeros of polynomial systems with bounded degree under finite-precision, On the probability distribution of data at points in real complete intersection varieties, Condition length and complexity for the solution of polynomial systems, Foreword. What is numerical algebraic geometry?, A fast and stable algorithm for splitting polynomials, Percolation of random nodal lines, Grid methods in computational real algebraic (and semialgebraic) geometry, The probability that a slightly perturbed numerical analysis problem is difficult, Numerical computation of the genus of an irreducible curve within an algebraic set, On the number of minima of a random polynomial, Counting complex points of surfaces in \(\mathbb C^2\), Multidimensional residues and polynomial equations, Kronecker's and Newton's approaches to solving: a first comparison, On random surface area, A note about the average number of real roots of a Bernstein polynomial system, On the geometry of Graeffe iteration, On a condition number of general random polynomial systems, Decomposition of the Kostlan–Shub–Smale model for random polynomials, On the geometry of the set of symmetric matrices with repeated eigenvalues, Asymptotic variance of the number of real roots of random polynomial systems, Multihomogeneous Newton methods, Newton's method for overdetermined systems of equations, Unnamed Item, Asymptotic variance and CLT for the number of zeros of Kostlan Shub Smale random polynomials, Computing the homology of semialgebraic sets. I: Lax formulas, On the Number of Real Zeros of Random Fewnomials, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions, Smale 17th Problem: Advances and Open Directions, Probabilistic Schubert calculus, Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems, Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric, Complexity of Bezout's theorem. VII: Distance estimates in the condition metric, The real polynomial eigenvalue problem is well conditioned on the average, Real lines on random cubic surfaces, Random fields and the enumerative geometry of lines on real and complex hypersurfaces, Phase singularities in complex arithmetic random waves, Correlation between zeros of a random polynomial, Variance of the volume of random real algebraic submanifolds, Random matrices and the average topology of the intersection of two quadrics, On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots, 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, Real computations with fake numbers, On the topology of random real complete intersections, Expected volume and Euler characteristic of random submanifolds, Mysteries of mathematics and computation, Kac-Rice formula for transverse intersections, Systems of rational polynomial equations have polynomial size approximate zeros on the average, On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
