Pages that link to "Item:Q4683735"
From MaRDI portal
The following pages link to A fast FFT-based discrete Legendre transform (Q4683735):
Displaying 15 items.
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- A fast and simple algorithm for the computation of Legendre coefficients (Q629903) (← links)
- On fast algorithms for the evaluation of Legendre coefficients (Q691739) (← links)
- Faster than the fast Legendre transform, the linear-time Legendre transform (Q1385149) (← links)
- Stable extrapolation of analytic functions (Q1740572) (← links)
- On the computation of discrete Legendre polynomial coefficients (Q1801481) (← links)
- A pseudo-spectral Strang splitting method for linear dispersive problems with transparent boundary conditions (Q2068360) (← links)
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation (Q2113655) (← links)
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation (Q2515072) (← links)
- Orthogonal polynomials on planar cubic curves (Q2684460) (← links)
- On the efficient parallel computation of Legendre transforms (Q2719280) (← links)
- On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
- An algorithm for the convolution of Legendre series (Q2878950) (← links)
- On the use of Hahn’s asymptotic formula and stabilized recurrence for a fast, simple and stable Chebyshev–Jacobi transform (Q4555931) (← links)
- Fast polynomial transforms based on Toeplitz and Hankel matrices (Q4637582) (← links)
