Separation bounds for polynomial systems

DOI10.1016/j.jsc.2019.07.001zbMath1446.68202OpenAlexW2245029098WikidataQ127596096 ScholiaQ127596096MaRDI QIDQ2188979

Ioannis Z. Emiris, Mourrain, Bernard, Elias P. Tsigaridas

Publication date: 15 June 2020

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01105276v5/file/emt-dmm-j.pdf

zbMATH Keywords

positive polynomialsparse resultantseparation boundarithmetic NullstellensätzeDMMheight of the resultant

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of roots of polynomial equations (65H04) Solving polynomial systems; resultants (13P15)

Related Items (5)

Efficient sampling in spectrahedra and volume approximation ⋮ Efficient Predicate Evaluation Using Randomized Degeneracy Detection ⋮ On Isolating Roots in a Multiple Field Extension ⋮ Certified Hermite matrices from approximate roots ⋮ Multilinear polynomial systems: root isolation and bit complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalised characteristic polynomials
• The number of roots of a system of equations
• Sharp estimates for the arithmetic Nullstellensatz
• On the distance between the roots of a polynomial
• On the complexity of computing with planar algebraic curves
• On the minimum of a positive polynomial over the standard simplex
• On the Davenport-Mahler bound
• On the complexity of real root isolation using continued fractions
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze
• Lower bounds for zero-dimensional projections
• The DMM bound
• Almost tight recursion tree bounds for the Descartes method
• Continued fraction expansion of real roots of polynomial systems
• Polynomial Minimum Root Separation
• The height of the mixed sparse resultant
• Using Algebraic Geometry
• Complete subdivision algorithms, II
• A subdivision-based algorithm for the sparse resultant
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Algorithms in real algebraic geometry

This page was built for publication: Separation bounds for polynomial systems