On the Boolean complexity of real root refinement - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

On the Boolean complexity of real root refinement


We assume that a real square-free polynomial $A$ has a degree $d$, a maximum coefficient bitsize $\tau$ and a real root lying in an isolating interval and having no nonreal roots nearby (we quantify this assumption). Then, we combine the {\em Double Exponential Sieve} algorithm (also called the {\em Bisection of the Exponents}), the bisection, and Newton iteration to decrease the width of this inclusion interval by a factor of $t=2^{-L}$. The algorithm has Boolean complexity ${\widetilde{\mathcal{O}}_B}(d^2 \tau + d L )$. Our algorithms support the same complexity bound for the refinement of $r$ roots, for any $r\le d$.
Fichier principal
Vignette du fichier
pt-refine.pdf (412.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00816214 , version 1 (20-04-2013)
hal-00816214 , version 2 (21-04-2013)
hal-00816214 , version 3 (25-04-2013)



Victor Y. Pan, Elias Tsigaridas. On the Boolean complexity of real root refinement. ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. ⟨10.1145/2465506.2465938⟩. ⟨hal-00816214v3⟩
210 View
440 Download



Gmail Facebook Twitter LinkedIn More