Skip to main content
Log in

Accurate computation of the zeros of the generalized Bessel polynomials

  • Original article
  • Published:
Numerische Mathematik Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received July 25, 1997 / Revised version received May 19, 1999 / Published online June 8, 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002110000166