Displaying similar documents to “On searching for roots of a polynomial in a circular annulus”

Finding the roots of polynomial equations: an algorithm with linear command.

Bernard Beauzamy (2000)

Revista Matemática Complutense

Similarity:

We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.

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

The complexity of the travelling repairman problem

Foto Afrati, Stavros Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou (1986)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity: