A fast spherical harmonics transform algorithm
From MaRDI portal
The authors propose a new stable algorithm for the spherical harmonics transform, which runs in time \(O(N^2\log N)\) for cut-off frequency \(N\). The algorithm is based on the linear time polynomial interpolation accelerated by the fast multipole method. Split Legendre functions are introduced, which enables the numerically stable divide-and-conquer approach. Experimental results show that this algorithm is faster than the direct computation for \(N\geq 511\).
Recommendations
- A fast transform for spherical harmonics
- A fast algorithm for expansion over spherical harmonics
- Rapid application of the spherical harmonic transform via interpolative decomposition butterfly factorization
- Fast Algorithms for Spherical Harmonic Expansions
- Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere
Cites work
- A fast algorithm for particle simulations
- A Fast Algorithm for the Evaluation of Legendre Expansions
- A fast spherical filter with uniform resolution
- A fast transform for spherical harmonics
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- Fast and stable algorithms for discrete spherical Fourier transforms
- Fast wavelet transforms and numerical algorithms I
- FFTs for the 2-sphere-improvements and variations
- Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform
Cited in
(29)- A fast algorithm for nonequispaced Fourier transforms on the rotation group
- A fast transform for spherical harmonics
- A fast algorithm for filtering and wavelet decomposition on the sphere
- Fast spherical Fourier algorithms.
- FFTs for the 2-sphere-improvements and variations
- Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere
- Orientational order on surfaces: the coupling of topology, geometry, and dynamics
- Toward recursive spherical harmonics-issued bi-filters. I: Theoretical framework
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Fast algorithms for spherical harmonic expansions. II.
- Fast spin \(\pm \)2 spherical harmonics transforms and application in cosmology
- Spectral radial basis functions for full sphere computations
- An analytical solution of the Laplace equation with Robin conditions by applying Legendre transform
- Recursive computation of spherical harmonic rotation coefficients of large degree
- Error and symmetry analysis of Misner's algorithm for spherical harmonic decomposition on a cubic grid
- Fast Directional Continuous Spherical Wavelet Transform Algorithms
- Fast structured Jacobi-Jacobi transforms
- Algorithm 1018: FaVeST -- fast vector spherical harmonic transforms
- Rapid application of the spherical harmonic transform via interpolative decomposition butterfly factorization
- A fast algorithm for spherical grid rotations and its application to singular quadrature
- Fast evaluation of quadrature formulae on the sphere
- Computational Science – ICCS 2005
- Fast algorithms using orthogonal polynomials
- Another preprocessing algorithm for generalized one-dimensional fast multipole method
- Accurate calculation of spherical and vector spherical harmonic expansions via spectral element grids
- A cubed sphere fast multipole method
- Toward an efficient triangle-based spherical harmonics representation of 3D objects
- A stable, high-order method for three-dimensional, bounded-obstacle, acoustic scattering
- Fast algorithms for spherical harmonic expansions. III
This page was built for publication: A fast spherical harmonics transform algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781218)
