Displaying similar documents to “FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials”

On the Various Bisection Methods Derived from Vincent’s Theorem

Akritas, Alkiviadis, Strzeboński, Adam, Vigklas, Panagiotis (2008)

Serdica Journal of Computing

Similarity:

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...

Inequalities on polynomial heights.

Panaitopol, Laurenţiu, Ştefănescu, Doru (2001)

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Similarity: