Fast spherical Fourier algorithms.

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

Daniel Potts, Stefan Kunis

Publication date: 25 November 2003

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

Full work available at URL: https://doi.org/10.1016/s0377-0427(03)00546-6

zbMATH Keywords

computational complexityfast algorithmsFast Fourier transformSpherical harmonicsAssociated Legendre functionsFast discrete transformsnonequispaced knotsSpherical Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (32)

Fast algorithms using orthogonal polynomials ⋮ Approximation properties of the double Fourier sphere method ⋮ Reconstructing a function on the sphere from its means along vertical slices ⋮ A double Fourier sphere method for \(d\)-dimensional manifolds ⋮ Sliced optimal transport on the sphere ⋮ Fast Global Optimization on the Torus, the Sphere, and the Rotation Group ⋮ A new theoretical derivation of NFFT and its implementation on GPU ⋮ Left-invariant diffusions on the space of positions and orientations and their application to crossing-preserving smoothing of HARDI images ⋮ Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold ⋮ Hydrodynamic flows on curved surfaces: spectral numerical methods for radial manifold shapes ⋮ On the reconstruction of functions from values at subsampled quadrature points ⋮ Spherical Framelets from Spherical Designs ⋮ Fast algorithms for spherical harmonic expansions. II. ⋮ Fast SGL Fourier transforms for scattered data ⋮ A Nonuniform Fast Fourier Transform Based on Low Rank Approximation ⋮ Orientational order on surfaces: the coupling of topology, geometry, and dynamics ⋮ Computation of the magnetic potential induced by a collection of spherical particles using series expansions ⋮ Fast Fourier Transforms for Spherical Gauss-Laguerre Basis Functions ⋮ Recovering an electromagnetic obstacle by a few phaseless backscattering measurements ⋮ On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms ⋮ A pseudospectral quadrature method for Navier-Stokes equations on rotating spheres ⋮ Fast evaluation of quadrature formulae on the sphere ⋮ Fast memory efficient evaluation of spherical polynomials at scattered points ⋮ Fast summation of radial functions on the sphere ⋮ Structural Variability from Noisy Tomographic Projections ⋮ An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials ⋮ 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 cross-validation in harmonic approximation ⋮ Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series ⋮ Highly effective stable evaluation of bandlimited functions on the sphere

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

This page was built for publication: Fast spherical Fourier algorithms.