Fast algorithms for spherical harmonic expansions. III
From MaRDI portal
(Redirected from Publication:995237)
Recommendations
- Fast Algorithms for Spherical Harmonic Expansions
- Fast algorithms for spherical harmonic expansions. II.
- Rapid application of the spherical harmonic transform via interpolative decomposition butterfly factorization
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- A fast spherical harmonics transform algorithm
Cites work
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A fast butterfly algorithm for the computation of Fourier integral operators
- An algorithm for the rapid evaluation of special function transforms
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast algorithms for spherical harmonic expansions. II.
- Generalized discrete spherical harmonic transforms
- Incomplete cross approximation in the mosaic-skeleton method
- On interpolation and integration in finite-dimensional spaces of bounded functions
- On the Compression of Low Rank Matrices
- Sparse Fourier Transform via Butterfly Algorithm
- The maximal-volume concept in approximation by low-rank matrices
Cited in
(29)- Increasing horizontal resolution in numerical weather prediction and climate simulations: illusion or panacea?
- Computation at a coordinate singularity
- Fourth-order time-stepping for stiff PDEs on the sphere
- Fast algorithms using orthogonal polynomials
- Interpolative Decomposition Butterfly Factorization
- A spectral method for nonlocal diffusion operators on the sphere
- Butterfly factorization
- Butterfly factorization via randomized matrix-vector multiplications
- A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization?
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Fast and efficient incremental algorithms for circular and spherical propagation in integer space
- Fast wave computation via Fourier integral operators
- Rapid application of the spherical harmonic transform via interpolative decomposition butterfly factorization
- Tensor calculus in spherical coordinates using Jacobi polynomials. I: Mathematical analysis and derivations
- Interpolative butterfly factorization
- Multidimensional butterfly factorization
- Sparse approximate multifrontal factorization with butterfly compression for high-frequency wave equations
- An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order
- The solution of the scalar wave equation in the exterior of a sphere
- Fast memory efficient evaluation of spherical polynomials at scattered points
- Extension of the Lorenz-Mie-Debye method for electromagnetic scattering to the time-domain
- Algorithm 1018: FaVeST -- fast vector spherical harmonic transforms
- Structural variability from noisy tomographic projections
- A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources
- A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
- A parallel butterfly algorithm
- Highly effective stable evaluation of bandlimited functions on the sphere
- Sparse approximate multifrontal factorization with butterfly compression for high-frequency wave equations
- An analysis of a butterfly algorithm
This page was built for publication: Fast algorithms for spherical harmonic expansions. III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995237)
