Fast algorithms for spherical harmonic expansions. III
From MaRDI portal
Publication:995237
DOI10.1016/j.jcp.2010.05.004zbMath1201.65037OpenAlexW4233363368MaRDI QIDQ995237
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
Related Items (24)
Fast algorithms using orthogonal polynomials ⋮ Fast wave computation via Fourier integral operators ⋮ Computation at a coordinate singularity ⋮ An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order ⋮ Increasing horizontal resolution in numerical weather prediction and climate simulations: illusion or panacea? ⋮ A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources ⋮ Tensor calculus in spherical coordinates using Jacobi polynomials. I: Mathematical analysis and derivations ⋮ Interpolative Decomposition Butterfly Factorization ⋮ Fourth-Order Time-Stepping For Stiff PDEs On The Sphere ⋮ A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? ⋮ Multidimensional butterfly factorization ⋮ Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations ⋮ Rapid Application of the Spherical Harmonic Transform via Interpolative Decomposition Butterfly Factorization ⋮ A spectral method for nonlocal diffusion operators on the sphere ⋮ Interpolative Butterfly Factorization ⋮ Fast memory efficient evaluation of spherical polynomials at scattered points ⋮ Structural Variability from Noisy Tomographic Projections ⋮ 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 ⋮ Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations ⋮ Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series ⋮ Butterfly Factorization Via Randomized Matrix-Vector Multiplications ⋮ Butterfly Factorization ⋮ Highly effective stable evaluation of bandlimited functions on the sphere
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On interpolation and integration in finite-dimensional spaces of bounded functions
- Incomplete cross approximation in the mosaic-skeleton method
- Generalized discrete spherical harmonic transforms
- An algorithm for the rapid evaluation of special function transforms
- Fast algorithms for spherical harmonic expansions. II.
- Sparse Fourier Transform via Butterfly Algorithm
- A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- On the Compression of Low Rank Matrices
This page was built for publication: Fast algorithms for spherical harmonic expansions. III
