English

Asymptotic computation of classical orthogonal polynomials

Classical Analysis and ODEs 2020-04-13 v1

Abstract

The classical orthogonal polynomials (Hermite, Laguerre and Jacobi) are involved in a vast number of applications in physics and engineering. When large degrees nn are needed, the use of recursion to compute the polynomials is not a good strategy for computation and a more efficient approach, such as the use of asymptotic expansions,is recommended. In this paper, we give an overview of the asymptotic expansions considered in [8] for computing Laguerre polynomials Ln(α)(x)L^{(\alpha)}_n(x) for bounded values of the parameter α\alpha. Additionally, we show examples of the computational performance of an asymptotic expansion for Ln(α)(x)L^{(\alpha)}_n(x) valid for large values of α\alpha and nn. This expansion was used in [6] as starting point for obtaining asymptotic approximations to the zeros. Finally, we analyze the expansions considered in [9], [10] and [11] to compute the Jacobi polynomials for large degrees nn.

Keywords

Cite

@article{arxiv.2004.05038,
  title  = {Asymptotic computation of classical orthogonal polynomials},
  author = {A. Gil and J. Segura and N. M. Temme},
  journal= {arXiv preprint arXiv:2004.05038},
  year   = {2020}
}

Comments

Contribution to EIBPOA2018

R2 v1 2026-06-23T14:46:54.434Z