A Comparative Study of Two Real Root Isolation Methods

A. G. Akritas, A. W. Strzebonski
2005 Nonlinear Analysis: Modelling and Control  
Recent progress in polynomial elimination has rendered the computation of the real roots of ill-conditioned polynomials of high degree (over 1000) with huge coefficients (several thousand digits) a critical operation in computer algebra. To rise to the occasion, the only method-candidate that has been considered by various authors for modification and improvement has been the Collins-Akritas bisection method [1], which is a based on a variation of Vincent's theorem [2]. The most recent example
more » ... ost recent example is the paper by Rouillier and Zimmermann [3], where the authors present "... a new algorithm, which is optimal in terms of memory usage and as fast as both Collins and Akritas' algorithm and Krandick variant ..." [3] In this paper we compare our own continued fractions method CF [4] (which is directly based on Vincent's theorem) with the best bisection method REL described in [3]. Experimentation with the data presented in [3] showed that, with respect to time, our continued fractions method CF is by far superior to REL, whereas the two are about equal with respect to space.
doi:10.15388/na.2005.10.4.15110 fatcat:b2npwsohefes3pufdlpylwudpm