An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order

Abstract

We describe a method for the numerical evaluation of normalized versions of the associated Legendre functions $P_{\nu }^{-\mu }$ and $Q_{\nu }^{-\mu }$ of degrees $0\le \nu \le 1,000,000$ and orders $-\nu \le \mu \le \nu$ on the interval $(-1,1)$. Our algorithm, which runs in time independent of $\nu$ and $\mu$, is based on the fact that while the associated Legendre functions themselves are extremely expensive to represent via polynomial expansions, the logarithms of certain solutions of the differential equation defining them are not. We exploit this by numerically precomputing the logarithms of carefully chosen solutions of the associated Legendre differential equation and representing them via piecewise trivariate Chebyshev expansions. These precomputed expansions, which allow for the rapid evaluation of the associated Legendre functions over a large swath of parameter domain mentioned above, are supplemented with asymptotic and series expansions in order to cover it entirely. The results of numerical experiments demonstrating the efficacy of our approach are presented, and our code for evaluating the associated Legendre functions is publicly available.

arXiv admin note: text overlap with arXiv:1705.07820

References in corpus (1)

• Interpolative Butterfly Factorization

Cited by in corpus (5)

• Sphere and disk partition functions in Liouville and in matrix integrals
• A Unified Framework for Oscillatory Integral Transform: When to use NUFFT or Butterfly Factorization?
• On the Efficient Evaluation of the Azimuthal Fourier Components of the Green's Function for Helmholtz's Equation in Cylindrical Coordinates
• Multidimensional Phase Recovery and Interpolative Decomposition Butterfly Factorization
• Rapid Application of the Spherical Harmonic Transform via Interpolative Decomposition Butterfly Factorization