An algorithm for the computation of zeros of a special class of entire functions

摘要

A two-stage algorithm is presented for computing the zeros of a special class of entire functions. The first stage, which has linear convergence, produces two-sided bounds for the zeros; these are then used as data for the second stage which employs a cubically convergent iterative process, with monotonic convergence to the zeros, from below and above. Appropriate modifications to the algorithm in order that it be applicable to certain real polynomials are also included.