High probability analysis of the condition number of sparse polynomial systems

DOI10.1016/j.tcs.2004.01.006zbMath1067.65053arXivmath/0212179OpenAlexW2146491975MaRDI QIDQ598221

Gregorio Malajovich, J. Maurice Rojas

Publication date: 6 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0212179

zbMATH Keywords

condition numbermixed volumeNewton polytopesKähler geometryreal rootsrandom polynomial system

Mathematics Subject Classification ID

Related Items (22)

On the solution of the polynomial systems arising in the discretization of certain ODEs ⋮ Approximation of the solution of certain nonlinear ODEs with linear complexity ⋮ High probability analysis of the condition number of sparse polynomial systems ⋮ Random systems of polynomial equations. The expected number of roots under smooth analysis ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ Computing mixed volume and all mixed cells in quermassintegral time ⋮ A polyhedral homotopy algorithm for real zeros ⋮ Real zeros of mixed random fewnomial systems ⋮ Expected multivolumes of random amoebas ⋮ Polyhedral homotopies in Cox coordinates ⋮ On the expected number of real roots of polynomials and exponential sums ⋮ Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption ⋮ On the expected number of zeros of nonlinear equations ⋮ Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric ⋮ Statistics of stationary points of random finite polynomial potentials ⋮ Average Euler characteristic of random real algebraic varieties ⋮ On the probability distribution of data at points in real complete intersection varieties ⋮ On the number of minima of a random polynomial ⋮ On solving univariate sparse polynomials in logarithmic time ⋮ On the Number of Real Zeros of Random Fewnomials ⋮ Deformation techniques for sparse systems ⋮ On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• High probability analysis of the condition number of sparse polynomial systems
• Convexity properties of the moment mapping
• The number of roots of a system of equations
• Complexity of Bezout's theorem. V: Polynomial time
• Moment maps and combinatorial invariants of Hamiltonian \(T^ n\)-spaces
• Amoebas, Monge-Ampère measures, and triangulations of the Newton polytope
• Complexity of Bezout's theorem. III: Condition number and packing
• Topology and mechanics. I
• The expected number of real roots of a multihomogeneous system of polynomial equations
• Angular momentum, convex Polyhedra and Algebraic Geometry
• Hamiltoniens périodiques et images convexes de l'application moment
• Convexity and Commuting Hamiltonians
• Complexity of Bezout's Theorem I: Geometric Aspects
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• How many zeros of a random polynomial are real?
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Finding mixed cells in the mixed volume computation
• On the geometry of Graeffe iteration
• Tangent Graeffe iteration

This page was built for publication: High probability analysis of the condition number of sparse polynomial systems