Estamos realizando la búsqueda. Por favor, espere...


Efficient computation of Laguerre polynomials

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

 Fuente: Computer Physics Communications Volume 210, January 2017, Pages 124–131

Editorial: Elsevier

 Fecha de publicación: 01/01/2017

Nº de páginas: 8

Tipo de publicación: Artículo de Revista

 DOI: 10.1016/j.cpc.2016.09.002

ISSN: 0010-4655

Proyecto español: MTM2012-34787 ; MTM2015-67142-P.

Url de la publicación: https://doi.org/10.1016/j.cpc.2016.09.002