Learn More
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 3 , or any of its(More)
The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until now Cauchy's method was the only one widely used in this process. S ¸tef˘ anescu's recently published theorem offers an alternative, but unfortunately is of limited applicability as it(More)
  • 1