Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
From MaRDI portal
Publication:2330929
DOI10.1016/j.acha.2017.11.001zbMath1495.33006arXiv1705.05448OpenAlexW2962716964MaRDI QIDQ2330929
Publication date: 23 October 2019
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.05448
spherical harmonicsconnection coefficientssemiseparable matriceshierarchical matricesinterpolative decompositionbutterfly factorization
Spherical harmonics (33C55) Numerical linear algebra (65F99) Computer aspects of numerical algorithms (65Y99)
Related Items (13)
Numerical methods for nonlocal and fractional models ⋮ Fast algorithms using orthogonal polynomials ⋮ Computing equilibrium measures with power law kernels ⋮ A double Fourier sphere method for \(d\)-dimensional manifolds ⋮ Fourth-Order Time-Stepping For Stiff PDEs On The Sphere ⋮ Orthogonal polynomials in and on a quadratic surface of revolution ⋮ Computing with Functions in the Ball ⋮ A Sparse Spectral Method for Volterra Integral Equations Using Orthogonal Polynomials on the Triangle ⋮ Rapid Application of the Spherical Harmonic Transform via Interpolative Decomposition Butterfly Factorization ⋮ A spectral method for nonlocal diffusion operators on the sphere ⋮ A Sparse Spectral Method on Triangles ⋮ A fast sparse spectral method for nonlinear integro-differential Volterra equations with general kernels ⋮ A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast and well-conditioned spectral method for singular integral equations
- Exponential time differencing for stiff systems
- The automatic solution of partial differential equations using a global spectral method
- Fast algorithms for spherical harmonic expansions. III
- A fast transform for spherical harmonics
- Computing Fourier transforms and convolutions on the 2-sphere
- Implicit-explicit Runge-Kutta methods for time-dependent partial differential equations
- Fast spherical Fourier algorithms.
- FFTs for the 2-sphere-improvements and variations
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- Tensor calculus in polar coordinates using Jacobi polynomials
- Global spherical harmonic computation by two-dimensional Fourier methods
- An algorithm for the rapid evaluation of special function transforms
- Fast algorithms for spherical harmonic expansions. II.
- A uniform asymptotic expansion for Jacobi polynomials via uniform treatment of Darboux's method
- A fast spherical harmonics transform algorithm
- $\mathcal{O}(1)$ Computation of Legendre Polynomials and Gauss--Legendre Nodes and Weights for Parallel Computing
- Randomized algorithms for the low-rank approximation of matrices
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Computing with Expansions in Gegenbauer Polynomials
- A Uniform Asymptotic Expansion of the Jacobi Polynomials with Error Bounds
- Fast Fourier Transforms for Nonequispaced Data
- Fast Summation at Nonequispaced Knots by NFFT
- Accelerating the Nonuniform Fast Fourier Transform
- Barycentric Lagrange Interpolation
- The numerical stability of barycentric Lagrange interpolation
- Accuracy and Stability of Numerical Algorithms
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix
- Butterfly Factorization
- On the Compression of Low Rank Matrices
- A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
- A Parallel Butterfly Algorithm
- Fast Algorithms for Spherical Harmonic Expansions
- Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty-III: The Dimension of the Space of Essentially Time- and Band-Limited Signals
- A recurrence scheme for converting from one orthogonal expansion into another
- Computing with Functions in Spherical and Polar Geometries I. The Sphere
- A fast algorithm for particle simulations
This page was built for publication: Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
