Numerische Mathematik

, Volume 86, Issue 3, pp 507–538

Accurate computation of the zeros of the generalized Bessel polynomials

  • L. Pasquini
Original article

DOI: 10.1007/s002110000166

Cite this article as:
Pasquini, L. Numer. Math. (2000) 86: 507. doi:10.1007/s002110000166


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.

Mathematics Subject Classification (1991): 65F15, 65F30, 65H20

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • L. Pasquini
    • 1
  1. 1.Dipartimento di Matematica “Guido Castelnuovo”, Università di Roma “La Sapienza”, P.le A. Moro, 2, 00185 Roma, Italy; e-mail: pasquini@axrma.uniromA1.itIT