Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On the Various Bisection Methods Derived from Vincent’s Theorem

Akritas, AlkiviadisStrzeboński, AdamVigklas, Panagiotis — 2008

Serdica Journal of Computing

In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that...

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

Akritas, AlkiviadisArgyris, AndreasStrzeboński, Adam — 2008

Serdica Journal of Computing

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate...

Page 1

Download Results (CSV)