The fastest exact algorithms for the isolation of the real roots of a polynomial equation

This paper discusses a set of algorithms which, given a polynomial equation with integer coefficients and without any multiple roots, uses exact (infinite precision) integer arithmetic and the Vincent-Uspensky-Akritas theorem to compute intervals containing the real roots of the polynomial equation. Theoretical computing time bounds are developed for these algorithms which are proven to be the fastest existing; this fact is also verified by the empirical results which are included in this article.ZusammenfassungEs werden einige Algorithmen diskutiert, die unter Verwendung exakter ganzzahliger Arithmetik und des Vincent-Uspensky-Akritas-Theorems für ein gegebenes Polynom mit ganzzahligen Koeffizienten und ohne mehrfache Wurzeln Intervalle berechnen, die die reellen Nullstellen des Polynoms enthalten. Für diese Algorithmen werden theoretische Rechenzeitschranken entwickelt, und es wird bewiesen und durch empirische Resultate belegt, daß diese Algorithmen die schnellsten unter den bisher existierenden sind.

[1]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[2]  L. Zoretti.  Sur la résolution des équations numériques , 1909 .

[3]  Alkiviadis G. Akritas,et al.  Exact algorithms for the implementation of cauchy's rule , 1981 .

[4]  Alkiviadis G. Akritas,et al.  On the forgotten theorem of Mr. Vincent , 1978 .

[5]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  T. A. Brown,et al.  Theory of Equations. , 1950, The Mathematical Gazette.

[8]  N. Obreshkov.  Verteilung und Berechnung der Nullstellen reeller Polynome , 1963 .

[9]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[10]  Cyrenus Matthew Rubald.  Algorithms for polynomials over a real algebraic number field. , 1973 .

[11]  Lee E. Heindel,et al.  Integer arithmetic algorithms for polynomial real zero determination , 1971, SYMSAC '71.

[12]  Alkiviadis G. Akritas,et al.  On the complexity of algorithms for the translation of polynomials , 1980, Computing.

[13]  Alkiviadis G. Akritas.  A new method for polynomial real root isolation , 1978, ACM-SE 16.

[14]  Alkiviadis G. Akritas.  A Correction on a Theorem By Uspensky , 1978 .

[15]  K. Mahler.  An inequality for the discriminant of a polynomial. , 1964 .

[16]  J. Wrench.  Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .