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)
To my parents ii ACKNOWLEDGEMENTS Heartfelt thanks go to my scientific adviser, Prof. Alkiviadis Akritas for making me familiar with computer algebra systems and root isolation methods, for his patient support and his indefatigable interest in my thesis and for his friendship. I am deeply indebted to Adam Strzebo´nski and Prof. Doru S ¸tef˘ anescu for their(More)
In this talk we first mention some key facts of Obreschkoff's life and work and then delve into the influence of Obreschkoff's book Verteilung und Berechnung der Nullstellen reeller Polynome, VEB Deutscher Verlag der Wissenschaften, Berlin, 1963, on the real root isolation problem. Obreschkoff is one of only two authors in the literature (Uspensky being the(More)
  • 1