An algorithm for the convolution of Legendre series
From MaRDI portal
Publication:2878950
Recommendations
- A fast and simple algorithm for the computation of Legendre coefficients
- A Fast Algorithm for the Evaluation of Legendre Expansions
- A fast FFT-based discrete Legendre transform
- A fast algorithm for the convolution of functions with compact support using Fourier extensions
- On fast algorithms for the evaluation of Legendre coefficients
Cited in
(8)- Pricing European-type, early-exercise and discrete barrier options using an algorithm for the convolution of Legendre series
- Spectral approximation of convolution operators
- A fast algorithm for the convolution of functions with compact support using Fourier extensions
- \(C^\infty\) compactly supported and positive definite radial kernels
- Algorithmic approach for formal Fourier series
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
This page was built for publication: An algorithm for the convolution of Legendre series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878950)