A faster multipole Legendre-Chebyshev transform

DOI10.1137/24M1659352MaRDI QIDQ6654574zbMATH OpenFDO

Authors Mikael Mortensen

Publication date 20 December 2024

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

transformLegendreChebyshev

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20)

Recommendations

• A fast FFT-based discrete Legendre transform
• A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
• On the efficient parallel computation of Legendre transforms
• A Fast Algorithm for the Evaluation of Legendre Expansions
• A fast and simple algorithm for the computation of Legendre coefficients

Cites work

• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• A Fast Algorithm for the Evaluation of Legendre Expansions
• A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
• Chebyshev series expansion of inverse polynomials
• Computing with expansions in Gegenbauer polynomials
• Fast algorithms using orthogonal polynomials
• Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
• Fast polynomial transforms based on Toeplitz and Hankel matrices
• Fast structured Jacobi-Jacobi transforms
• Sur les polynômes de Legendre.
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing

This page was built for publication: A faster multipole Legendre-Chebyshev transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654574)