On the Efficient Parallel Computation of Legendre Transforms

DOI10.1137/S1064827599355864zbMath0995.65149OpenAlexW2134865908MaRDI QIDQ2719280

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

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

orthogonal polynomialsnumerical examplesparallel computationrecurrence relationLegendre polynomialsChebyshev polynomialdivide-and-conquer strategyfast cosine transformcomputational harmonic analysisBSPfast Chebyshev transform

Mathematics Subject Classification ID

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

Related Items (1)

Minimizing Communication in the Multidimensional FFT

Uses Software

• BSPlib

This page was built for publication: On the Efficient Parallel Computation of Legendre Transforms