A Comparison Study of Some Computational Methods for Locating the Zeros of Entire Functions

Abstract

The zero description of entire functions of exponential type is reviewed. Serial and parallel methods of zero location from sampled data are introduced, and the results of applying these methods to simulated data are given. One method is also suitable for locating the zeros of finite-degree polynomials, and is thus particularly useful for use with the zz transform of an input sequence. The relationship between the algorithms is discussed, and a recommendation of the most reliable method is given.