Fast spherical Fourier algorithms.

DOI10.1016/S0377-0427(03)00546-6zbMath1033.65123MaRDI QIDQ1412818

Daniel Potts, Stefan Kunis

Publication date: 25 November 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational complexity; fast algorithms; Fast Fourier transform; Spherical harmonics; Associated Legendre functions; Fast discrete transforms; nonequispaced knots; Spherical Fourier transform

Mathematics Subject Classification ID

65T50: Numerical methods for discrete and fast Fourier transforms

65Y20: Complexity and performance of numerical algorithms

Related Items

Fast evaluation of quadrature formulae on the sphere, Left-invariant diffusions on the space of positions and orientations and their application to crossing-preserving smoothing of HARDI images, On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms, Irregular sampling of band-limited functions on the sphere, On the computation of nonnegative quadrature weights on the sphere, A fast algorithm for nonequispaced Fourier transforms on the rotation group, Fast algorithms for spherical harmonic expansions. II., Fast summation of radial functions on the sphere, A pseudospectral quadrature method for Navier-Stokes equations on rotating spheres

Uses Software

• NFFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• Fast radix-\(p\) discrete cosine transform
• A fast transform for spherical harmonics
• Fast and stable algorithms for discrete spherical Fourier transforms
• Computing Fourier transforms and convolutions on the 2-sphere
• FFTs for the 2-sphere-improvements and variations
• Approximate factorizations of Fourier matrices with nonequispaced knots
• On the fast Fourier transform of functions with singularities
• A fast spherical harmonics transform algorithm
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Fast algorithms for discrete polynomial transforms
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Fourier Transforms for Nonequispaced Data
• Orthogonal Polynomials and Hypergroups II--The Symmetric Case
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• A Multiresolution Approach to Regularization of Singular Operators and Fast Summation
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• Nonuniform fast fourier transforms using min-max interpolation
• A fast algorithm for particle simulations