Improving root separation bounds

DOI10.1016/j.jsc.2017.03.001zbMath1415.26005OpenAlexW2595539135WikidataQ47036992 ScholiaQ47036992MaRDI QIDQ2399862

Aaron Herman, Hoon Hong, Elias P. Tsigaridas

Publication date: 24 August 2017

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

Full work available at URL: https://hal.inria.fr/hal-01456686/file/paper.pdf

zbMATH Keywords

polynomial systemspolynomial rootsroot separation bounds

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10)

Related Items (4)

On the distance between two algebraic numbers ⋮ Algebraic integers close to the unit circle ⋮ Exact algorithms for semidefinite programs with degenerate feasible set ⋮ An adaptive subdivision method for root finding of univariate polynomials

Cites Work

• Unnamed Item
• Quality of positive root bounds
• Faster algorithms for computing Hong's bound on absolute positiveness
• Recent progress in exact geometric computation
• Simultaneous elimination by using several tools from real algebraic geometry
• On the distance between the roots of a polynomial
• On the complexity of real root isolation using continued fractions
• An inequality for the discriminant of a polynomial
• The DMM bound
• An Inequality About Factors of Polynomials
• Polynomial Minimum Root Separation
• The Minimum Root Separation of a Polynomial
• Using Algebraic Geometry
• ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
• A Poisson formula for the sparse resultant
• Algorithms – ESA 2004

This page was built for publication: Improving root separation bounds