Summary.
A general method for approximating polynomial solutions of second-order linear homogeneous differential equations with polynomial coefficients is applied to the case of the families of differential equations defining the generalized Bessel polynomials, and an algorithm is derived for simultaneously finding their zeros. Then a comparison with several alternative algorithms is carried out. It shows that the computational problem of approximating the zeros of the generalized Bessel polynomials is not an easy matter at all and that the only algorithm able to give an accurate solution seems to be the one presented in this paper.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received July 25, 1997 / Revised version received May 19, 1999 / Published online June 8, 2000
Rights and permissions
About this article
Cite this article
Pasquini, L. Accurate computation of the zeros of the generalized Bessel polynomials. Numer. Math. 86, 507–538 (2000). https://doi.org/10.1007/s002110000166
Issue Date:
DOI: https://doi.org/10.1007/s002110000166