TL;DR
This paper introduces a fast, parameter-independent algorithm for numerically evaluating normalized associated Legendre functions across a wide range of degrees and orders, using precomputed logarithmic solutions and Chebyshev expansions.
Contribution
The authors develop a novel method that precomputes logarithms of solutions to the Legendre differential equation, enabling rapid evaluation independent of degree and order.
Findings
Algorithm runs in time independent of degree and order
Precomputed Chebyshev expansions enable fast evaluations
Code is publicly available for practical use
Abstract
We describe a method for the numerical evaluation of normalized versions of the associated Legendre functions and of degrees and orders on the interval . Our algorithm, which runs in time independent of and , 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
