Real Algebraic Numbers: Complexity Analysis and Experimentations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Real Algebraic Numbers: Complexity Analysis and Experimentations

Ioannis Z. Emiris
Bernard Mourrain
Elias P. P. Tsigaridas


We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree $d$, with integer coefficients of bit size $\le\tau$, using Sturm (-Habicht) sequences and the Bernstein subdivision solver. In particular, we unify and simplify the analysis of both methods and we give an asymptotic complexity bound of $\sOB( d^4 \tau^2)$. This matches the best known bounds. Moreover, we generalize this to cover the non-squarefree polynomials and show that within the same complexity we can also compute the multiplicities of the roots. We also consider algorithms for sign evaluation, comparison of real algebraic numbers and simultaneous inequalities (SI) and we improve the known bounds at least by a factor of $d$. Finally, we present our C++ implementation in Synaps and experiments on various data sets.
Fichier principal
Vignette du fichier
RR-5897.pdf (696.31 Ko) Télécharger le fichier

Dates and versions

inria-00071370 , version 1 (23-05-2006)


  • HAL Id : inria-00071370 , version 1


Ioannis Z. Emiris, Bernard Mourrain, Elias P. P. Tsigaridas. Real Algebraic Numbers: Complexity Analysis and Experimentations. Reliable Implementations of Real Number Algorithms: Theory and Practice, 2008, Dagsthul, Germany. pp.57-82. ⟨inria-00071370⟩
119 View
302 Download


Gmail Facebook X LinkedIn More