Fast and stable algorithms for discrete spherical Fourier transforms

DOI10.1016/S0024-3795(97)10013-1zbMath0935.65147MaRDI QIDQ1307221

Daniel Potts, Manfred Tasche, Gabriele Drauschke

Publication date: 9 May 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmspherical harmonicssampling theoremChebyshev nodesfast cosine transformspherical Fourier transformcascade summationfast Legendre function transform

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Spherical harmonics (33C55)

Related Items

Fast algorithms using orthogonal polynomials ⋮ Fast Global Optimization on the Torus, the Sphere, and the Rotation Group ⋮ Fast spherical Fourier algorithms. ⋮ On the stability of unevenly spaced samples for interpolation and quadrature ⋮ Fast evaluation of quadrature formulae on the sphere ⋮ A fast spherical harmonics transform algorithm ⋮ Fast summation of radial functions on the sphere ⋮ A fast algorithm for nonequispaced Fourier transforms on the rotation group ⋮ Computational harmonic analysis for tensor fields on the two-sphere

Cites Work

• Unnamed Item
• Unnamed Item
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• Fast radix-\(p\) discrete cosine transform
• Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
• Computing Fourier transforms and convolutions on the 2-sphere
• On the associated orthogonal polynomials
• A Fast Algorithm for the Evaluation of Legendre Expansions
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms