On the efficient parallel computation of Legendre transforms

DOI10.1137/S1064827599355864MaRDI QIDQ2719280zbMATH OpenOpenAlexFDO

Authors Márcia A. Inda, R. H. Bisseling, David K. Maslen

Publication date 21 June 2001

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

Full work available at URL https://doi.org/10.1137/s1064827599355864

zbMATH Keywords

divide-and-conquer strategyLegendre polynomialsnumerical examplesparallel computationChebyshev polynomialorthogonal polynomialsrecurrence relationfast cosine transformcomputational harmonic analysisBSPfast Chebyshev transform

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) General harmonic expansions, frames (42C15) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• A fast FFT-based discrete Legendre transform
• \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
• Fast algorithms for discrete polynomial transforms
• A fast and simple algorithm for the computation of Legendre coefficients
• A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula

Cited in

(6)

• A fast Legendre transform algorithm and applications to the adhesion model
• Minimizing Communication in the Multidimensional FFT
• \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
• A fast FFT-based discrete Legendre transform
• A faster multipole Legendre-Chebyshev transform
• A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula

Describes a project that uses

Uses Software

• BSPlib

This page was built for publication: On the efficient parallel computation of Legendre transforms

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