On the complexity of real root isolation using continued fractions

We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good performance in practice. We improve the previously known bound by a factor of d, where d is the polynomial degree and bounds the coefficient bitsize, thus matching the current record complexity for real root isolation by exact methods. Namely, the complexity bound is OB(d42) using a standard bound on the expected bitsize of the integers in the continued fraction expansion. We show how to compute the multiplicities within the same complexity and extend the algorithm to non square-free polynomials. Finally, we present an efficient open-source C++ implementation in the algebraic library synaps, and illustrate its efficiency as compared to other available software. We use polynomials with coefficient bitsize up to 8000 and degree up to 1000.

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Elias P. Tsigaridas, Ioannis Z. Emiris
• Keywords: Continued Fraction Expansion, Polynomials, Real Root Isolation, TCS 2008, Theoretical Computer Science