A faster multipole Legendre-Chebyshev transform
From MaRDI portal
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
- \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
- 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
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Sur les polynômes de Legendre.
- Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
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)
