Improving a method of search for solving polynomial equations

This paper is related to the Lehmer-Schur methods in numerical mathematics in the complex plane. It is shown that by a slight modification of the “optimized” Lehmer-Schur method of Galántai, the “speed” quotient 0.6094 can be reduced to 0.5758. The crucial idea is based on a discrete geometrical observation