Fast spherical Fourier algorithms.
From MaRDI portal
Publication:1412818
DOI10.1016/S0377-0427(03)00546-6zbMath1033.65123MaRDI QIDQ1412818
Publication date: 25 November 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
computational complexity; fast algorithms; Fast Fourier transform; Spherical harmonics; Associated Legendre functions; Fast discrete transforms; nonequispaced knots; Spherical Fourier transform
65T50: Numerical methods for discrete and fast Fourier transforms
65Y20: Complexity and performance of numerical algorithms
Related Items
A Nonuniform Fast Fourier Transform Based on Low Rank Approximation, Fast Fourier Transforms for Spherical Gauss-Laguerre Basis Functions, Structural Variability from Noisy Tomographic Projections, Computation of the magnetic potential induced by a collection of spherical particles using series expansions, Fast evaluation of quadrature formulae on the sphere, Highly effective stable evaluation of bandlimited functions on the sphere, Reconstructing a function on the sphere from its means along vertical slices, 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, Fast cross-validation in harmonic approximation, On the computation of nonnegative quadrature weights on the sphere, A fast algorithm for nonequispaced Fourier transforms on the rotation group, A new theoretical derivation of NFFT and its implementation on GPU, Orientational order on surfaces: the coupling of topology, geometry, and dynamics, Fast memory efficient evaluation of spherical polynomials at scattered points, Fast SGL Fourier transforms for scattered data, Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series, Hydrodynamic flows on curved surfaces: spectral numerical methods for radial manifold shapes, Fast algorithms for spherical harmonic expansions. II., Fast summation of radial functions on the sphere, An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials, Fast Global Optimization on the Torus, the Sphere, and the Rotation Group, Recovering an electromagnetic obstacle by a few phaseless backscattering measurements, A pseudospectral quadrature method for Navier-Stokes equations on rotating spheres
Uses Software
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
