Advances on the continued fractions method using better estimations of positive root bounds

Authors:
Alkiviadis G. Akritas;Adam W. Strzeboński;Panagiotis S. Vigklas
Affiliations:
University of Thessaly, Department of Computer and Communication Engineering, Volos, Greece;Wolfram Research, Inc., Champaign, IL;University of Thessaly, Department of Computer and Communication Engineering, Volos, Greece
Venue:
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Year:
2007

Citing 6
Cited 1

Bounds for positive roots of polynomials

Journal of Computational and Applied Mathematics
Elements of computer algebra with applications

Elements of computer algebra with applications
Polynomial real root isolation using Descarte's rule of signs

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials

Computing
Univariate polynomial real root isolation: continued fractions revisited

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

On the computing time of the continued fractions method

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an implementation of the Continued Fractions (CF) real root isolation method using a recently developed upper bound on the positive values of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method always faster than the Vincent-Collins-Akritas bisection method, or any of its variants.