Fast Algorithms for Spherical Harmonic Expansions
From MaRDI portal
Publication:5470397
Recommendations
- Fast algorithms for spherical harmonic expansions. II.
- Computing Fourier transforms and convolutions on the 2-sphere
- A fast algorithm for expansion over spherical harmonics
- A fast transform for spherical harmonics
- Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere
Cited in
(44)- Hermitian compact interpolation on the cubed-sphere grid
- On the evaluation of prolate spheroidal wave functions and associated quadrature rules
- Noisy dynamic simulations in the presence of symmetry: data alignment and model reduction
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Fast evaluation of quadrature formulae on the sphere
- An algorithm for the rapid evaluation of special function transforms
- A fast algorithm for nonequispaced Fourier transforms on the rotation group
- Efficient and accurate rotation of finite spherical harmonics expansions
- A spectral method for nonlocal diffusion operators on the sphere
- A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
- Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere
- Fast algorithms for spherical harmonic expansions. III
- Fast global optimization on the torus, the sphere, and the rotation group
- Computation of the magnetic potential induced by a collection of spherical particles using series expansions
- A fast algorithm for spherical grid rotations and its application to singular quadrature
- Computing Fourier transforms and convolutions on the 2-sphere
- Accurate calculation of spherical and vector spherical harmonic expansions via spectral element grids
- FFTs for the 2-sphere-improvements and variations
- Fourth-order time-stepping for stiff PDEs on the sphere
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- Tight framelets and fast framelet filter bank transforms on manifolds
- Fast memory efficient evaluation of spherical polynomials at scattered points
- A fast multipole method for Fredholm integral equations of the second kind with general kernel \(K(x,y)=K(x-y)\)
- Dual framelets transform on manifolds and graphs
- FFTs on the rotation group
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
- Fast algorithms for spherical harmonic expansions. II.
- Computational Science – ICCS 2005
- Rapid application of the spherical harmonic transform via interpolative decomposition butterfly factorization
- Hermitian approximation of the spherical divergence on the cubed-sphere
- Fast structured Jacobi-Jacobi transforms
- Fast algorithms using orthogonal polynomials
- Fast and efficient incremental algorithms for circular and spherical propagation in integer space
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
- Computation of spherical harmonic expansion coefficients via FFT's
- Fast summation of radial functions on the sphere
- Recurrence relations and fast algorithms
- A fast spherical harmonics transform algorithm
- A fast algorithm for expansion over spherical harmonics
- Algorithm 1018: FaVeST -- fast vector spherical harmonic transforms
- Error and symmetry analysis of Misner's algorithm for spherical harmonic decomposition on a cubic grid
- Interpolative butterfly factorization
- Fast Fourier-Galerkin methods for solving singular boundary integral equations: Numerical integration and precondition
This page was built for publication: Fast Algorithms for Spherical Harmonic Expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470397)
