Efficient computation of Laguerre polynomials

Abstract

An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials $L_n^{(\alpha )}(z)$ are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for $n$ large and $\alpha$ small, are used depending on the parameter region. Based on tests of contiguous relations in the parameter $\alpha$ and the degree $n$ satisfied by the polynomials, we claim that a relative accuracy close or better than $10^{-12}$ can be obtained using the module LaguerrePol for computing the functions $L_n^{(\alpha )}(z)$ in the parameter range $z\ge 0$, $-1<\alpha \le 5$, $n\ge 0$.

arXiv commentTo appear in Computer Physics Communications

Cited by in corpus (6)

• Construction and implementation of asymptotic expansions for Laguerre-type orthogonal polynomials
• Construction and implementation of asymptotic expansions for Jacobi--type orthogonal polynomials
• The stabilization of high-order multistep schemes for the Laguerre one-way wave equation solver
• Asymptotic approximations to the nodes and weights of Gauss-Hermite and Gauss-Laguerre quadratures
• Non-iterative computation of Gauss-Jacobi quadrature
• Generating Laguerre expansion coefficients by solving a one-dimensional transport equation