Report

A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula

Abstract:

A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree $N$ polynomial in $O(N(\log N)^{2}/ \log \log N)$ operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency an...

Access Document

Files:
• (pdf, 362.2kb)

Authors

Nicholas Hale More by this author
Alex Townsend More by this author
Publication date:
2013-08-05
URN: