Improving Root Separation Bounds - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2017

Improving Root Separation Bounds

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.
Fichier principal
Vignette du fichier
paper.pdf (407.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01456686 , version 1 (05-02-2017)

Identifiers

  • HAL Id : hal-01456686 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More