On the expected number of zeros of nonlinear equations

DOI10.1007/s10208-013-9171-yzbMath1285.32005arXiv1106.6014OpenAlexW1978076596MaRDI QIDQ2441420

Gregorio Malajovich

Publication date: 24 March 2014

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear equationsGaussian analytic functionscomplex fewnomials

Mathematics Subject Classification ID

Zero sets of holomorphic functions of several complex variables (32A60)

Related Items

Computing mixed volume and all mixed cells in quermassintegral time, On the expected number of real roots of polynomials and exponential sums, Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric

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
• Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory
• High probability analysis of the condition number of sparse polynomial systems
• A numerical algorithm for zero counting. III: Randomization and condition
• Newton polyhedra and zeros of systems of exponential sums
• Complexity of Bezout's theorem. V: Polynomial time
• Zeros of Gaussian analytic functions
• Random complex zeroes. I: Asymptotic normality
• Brunn-Minkowski inequality for multiplicities
• A note about the average number of real roots of a Bernstein polynomial system
• Complexity of Bezout's theorem. III: Condition number and packing
• A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
• On the number of minima of a random polynomial
• Zeros of the i.i.d. Gaussian power series: a conformally invariant determinantal process
• Condition
• Random Complex Zeroes and Random Nodal Lines
• Level Sets and Extrema of Random Processes and Fields
• Complexity of Bezout's Theorem I: Geometric Aspects
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Random polynomials with prescribed Newton polytope
• “Newton polyhedra” of distributions
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Mixed volume and an extension of intersection theory of divisors
• On the Average Number of Real Roots of a Random Algebraic Equation (II)
• Theory of Reproducing Kernels
• On the Distribution of the Zeros and α-Values of a Random Integral Function (I)
• On the average number of real roots of a random algebraic equation