Fast algorithms for spherical harmonic expansions. III
From MaRDI portal
Publication:995237
DOI10.1016/J.JCP.2010.05.004zbMATH Open1201.65037OpenAlexW4233363368MaRDI QIDQ995237FDOQ995237
Publication date: 13 September 2010
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2010.05.004
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
- Title not available (Why is that?)
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Incomplete cross approximation in the mosaic-skeleton method
- The maximal-volume concept in approximation by low-rank matrices
- Fast algorithms for spherical harmonic expansions. II.
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Sparse Fourier Transform via Butterfly Algorithm
- A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators
- On the Compression of Low Rank Matrices
- On interpolation and integration in finite-dimensional spaces of bounded functions
- An algorithm for the rapid evaluation of special function transforms
- Generalized discrete spherical harmonic transforms
Cited In (26)
- A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization?
- Highly effective stable evaluation of bandlimited functions on the sphere
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Tensor calculus in spherical coordinates using Jacobi polynomials. I: Mathematical analysis and derivations
- A spectral method for nonlocal diffusion operators on the sphere
- Rapid Application of the Spherical Harmonic Transform via Interpolative Decomposition Butterfly Factorization
- A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
- Computation at a coordinate singularity
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations
- The solution of the scalar wave equation in the exterior of a sphere
- Extension of the Lorenz-Mie-Debye method for electromagnetic scattering to the time-domain
- Fast memory efficient evaluation of spherical polynomials at scattered points
- Structural Variability from Noisy Tomographic Projections
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations
- Butterfly Factorization
- Multidimensional butterfly factorization
- Fast algorithms using orthogonal polynomials
- Interpolative Butterfly Factorization
- Fast wave computation via Fourier integral operators
- Fast and efficient incremental algorithms for circular and spherical propagation in integer space
- Fourth-Order Time-Stepping For Stiff PDEs On The Sphere
- A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources
- Increasing horizontal resolution in numerical weather prediction and climate simulations: illusion or panacea?
- An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order
- Interpolative Decomposition Butterfly Factorization
- Butterfly Factorization Via Randomized Matrix-Vector Multiplications
Uses Software
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)
