Improving root separation bounds

DOI10.1016/J.JSC.2017.03.001zbMATH Open1415.26005DBLPjournals/jsc/HermanHT18OpenAlexW2595539135WikidataQ47036992 ScholiaQ47036992MaRDI QIDQ2399862FDOQ2399862

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 rootspolynomial systemsroot separation bounds

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

This page was built for publication: Improving root separation bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399862)