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.
@article{urn:eudml:doc:44480,
title = {Finding the roots of polynomial equations: an algorithm with linear command.},
journal = {Revista Matem\'atica de la Universidad Complutense de Madrid},
volume = {13},
year = {2000},
pages = {305-323},
zbl = {0976.05007},
mrnumber = {MR1822115},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:44480}
}
Beauzamy, Bernard. Finding the roots of polynomial equations: an algorithm with linear command.. Revista Matemática de la Universidad Complutense de Madrid, Tome 13 (2000) pp. 305-323. http://gdmltest.u-ga.fr/item/urn:eudml:doc:44480/