Abstract: An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials View the MathML source are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for n large and a small, are used depending on the parameter region. Based on tests of contiguous relations in the parameter a and the degree n satisfied by the polynomials, we claim that a relative accuracy close to or better than 10-12 can be obtained using the module LaguerrePol for computing the functions View the MathML source in the parameter range z=0, -1

Authorship

Download reference