Improving Root Separation Bounds

Aaron Herman 1 Hoon Hong 1 Elias Tsigaridas 2
2 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria de Paris
Abstract : Let f be a polynomial (or polynomial system) with all simple roots. The root separation of f is the minimum of the pair-wise distances between the complex roots. A root separation bound is a lower bound on the root separation. Finding a root separation bound is a fundamental problem, arising in numerous disciplines. We present two new root separation bounds: one univariate bound, and one multivariate bound. The new bounds improve on the old bounds in two ways: (1) The new bounds are usually significantly bigger (hence better) than the previous bounds. (2) The new bounds scale correctly, unlike the previous bounds. Crucially, the new bounds are not harder to compute than the previous bounds.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01456686
Contributor : Elias Tsigaridas <>
Submitted on : Sunday, February 5, 2017 - 7:42:39 PM
Last modification on : Friday, May 24, 2019 - 5:30:29 PM
Long-term archiving on : Saturday, May 6, 2017 - 1:02:17 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01456686, version 1

Citation

Aaron Herman, Hoon Hong, Elias Tsigaridas. Improving Root Separation Bounds. Journal of Symbolic Computation, Elsevier, 2017. ⟨hal-01456686⟩

Share

Metrics

Record views

547

Files downloads

218