Efficient computation of Laguerre polynomials

From MaRDI portal




Abstract: An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials Ln(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 1012 can be obtained using the module LaguerrePol for computing the functions Ln(alpha)(z) in the parameter range zge0, 1<alphale5, nge0.





Describes a project that uses

Uses Software





This page was built for publication: Efficient computation of Laguerre polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686930)