О теореме Кенига для целых функций конечного порядка

It is shown that Koenig's theorem on zeros of analytic functions applied to the logarithmic derivative of an integer function of finite order leads to an algorithm of finding zeros whose convergence domains are the Voronoi polygons of the zeros to be found. Since the Voronoi diagram of a sequence of zeros is a set of measure zero, this algorithm is globally convergent. The rate of convergence is estimated. For higher-order iterations that are constructed using Koenig's theorem, the effect of root multiplicity on the convergence domain is considered and the convergence rate is estimated for this case.