Abstract

It is well known that one of the most relevant applications of the reverse Bessel polynomials θ n ( z ) is filter design. In particular, the poles of the transfer function of a Bessel filter are basically the zeros of θ n ( z ) . In this article we discuss an algorithm to compute the zeros of reverse generalized Bessel polynomials θ n ( z ; a ) . A key ingredient in the algorithm will be a method to compute the polynomials. For this purpose, we analyze the use of recurrence relations and asymptotic expansions in terms of elementary functions to obtain accurate approximations to the polynomials. The performance of all the numerical approximations will be illustrated with examples.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call