A fast transform for spherical harmonics
type: Item
instance of: scholarly article
title: A fast transform for spherical harmonics
zbMATH Open document ID: 0935.65148
DOI: 10.1007/BF01261607
author: Martin J. Mohlenkamp
published in: The Journal of Fourier Analysis and Applications
publication date: 1999-09-19T00:00:00Z
full work available at URL: https://eudml.org/doc/59602
review text: The author develops the first numerically stable fast algorithm for the computation of the discrete spherical transform (and its inverse) \[ f(\varphi_j,\theta_k)= \sum^{N- 1}_{n=0} \sum^n_{m=- n}\alpha^m_n P^m_n(\cos\varphi_j) e^{im\theta_k}/\sqrt{2\pi} \] (\(j= 0,\dots, N-1\); \(k=0,\dots, 2N-1\)), where \(\varphi_j:= \arccos g^N_j\) (\(g^N_j\) Gaussian nodes) and \(\theta_k:= {2\pi k\over 2N}\). Note that the algorithm of \textit{J. R. Driscoll} and \textit{D. M. Healy, jun.} [Adv. Appl. Math. 15, No. 2, 202-250 (1994; Zbl 0801.65141)] for the fast spherical transform is not stable and that certain stabilization techniques of \textit{D. Potts}, \textit{G. Steidl} and \textit{M. Tasche} [Linear Algebra Appl. 275-276, 433-450 (1998; reviewed above)] cannot ensure the arithmetical complexity of \(O(N^2\log^2N)\). The authors presents algorithms with computational complexity \(O(N^2\log^2 N)\) and \(O(N^{{5\over 2}}\log N)\) based on local cosine bases. The essential insight is that although the transform matrices are dense and oscillatory, locally they can be represented efficiently in trigonometric series.
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 33C55
Mathematics Subject Classification ID: 42C10
zbMATH DE Number: 1310351
zbMATH Keywords: fast Fourier transform on the sphere
zbMATH Keywords: spherical harmonics
zbMATH Keywords: local cosine bases
zbMATH Keywords: local expansions of functions
zbMATH Keywords: fast algorithm
zbMATH Keywords: discrete spherical transform
zbMATH Keywords: computational complexity
Wikidata QID: Q54087152
reviewed by: Gabriele Steidl
MaRDI profile type: MaRDI publication profile
cites work: A Fast Algorithm for the Evaluation of Legendre Expansions
cites work: Q5558293
cites work: Fast numerical computations of oscillatory integrals related to acoustic scattering. I
cites work: Fast wavelet transforms and numerical algorithms I
cites work: Q3971134
cites work: A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
cites work: Computing Fourier transforms and convolutions on the 2-sphere
cites work: Computation of spherical harmonic expansion coefficients via FFT's
cites work: Q5827353
cites work: Q4481373
cites work: Optimized local trigonometric bases
cites work: Q3757242
cites work: Q4061445
cites work: A fast algorithm for adapted time-frequency tilings
cites work: Q4320129
OpenAlex ID: W1993358632
Recommended article: A fast spherical harmonics transform algorithm
Recommended article: Fast and stable algorithms for discrete spherical Fourier transforms
Recommended article: Fast Algorithms for Spherical Harmonic Expansions
Recommended article: Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere
Recommended article: Fast spherical Fourier algorithms.
description: scientific article; zbMATH DE number 1310351