Full paper in PDF:
$%B. Beauzamy, Finding the roots of polynomial equations: an algorithm with linear command, Rev. Mat. Complut. 13 (2000), no. 2, 305–323.%$

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.

1991 Mathematics Subject Classification: 05A19, 11C08.