A fast transform for spherical harmonics
DOI10.1007/BF01261607zbMath0935.65148OpenAlexW1993358632WikidataQ54087152 ScholiaQ54087152MaRDI QIDQ1293826
Publication date: 19 September 1999
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/59602
computational complexityspherical harmonicsfast algorithmdiscrete spherical transformfast Fourier transform on the spherelocal cosine baseslocal expansions of functions
Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Numerical methods for discrete and fast Fourier transforms (65T50) Spherical harmonics (33C55)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of spherical harmonic expansion coefficients via FFT's
- A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
- A fast transform for spherical harmonics
- Fast numerical computations of oscillatory integrals related to acoustic scattering. I
- Computing Fourier transforms and convolutions on the 2-sphere
- A fast algorithm for adapted time-frequency tilings
- Optimized local trigonometric bases
- Fast wavelet transforms and numerical algorithms I
- A Fast Algorithm for the Evaluation of Legendre Expansions
This page was built for publication: A fast transform for spherical harmonics