Highly effective stable evaluation of bandlimited functions on the sphere
DOI10.1007/s11075-015-0011-9zbMath1350.65151OpenAlexW935713995MaRDI QIDQ261861
Pencho P. Petrushev, Kamen G. Ivanov
Publication date: 24 March 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-0011-9
algorithmfast Fourier transformspherical harmonicsLagrange interpolationfast computationevaluation at scattered pointsfast spherical Fourier transformneedlets
Trigonometric approximation (42A10) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Spherical harmonics (33C55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of spaces of distributions induced by tensor product bases
- Irregular sampling of band-limited functions on the sphere
- Sub-exponentially localized kernels and frames induced by orthogonal expansions
- Fast algorithms for spherical harmonic expansions. III
- Computing Fourier transforms and convolutions on the 2-sphere
- Fast spherical Fourier algorithms.
- FFTs for the 2-sphere-improvements and variations
- Fast decreasing polynomials
- Non-equispaced fast Fourier transforms with applications to tomography
- On the fast Fourier transform of functions with singularities
- Fast memory efficient evaluation of spherical polynomials at scattered points
- Fast algorithms for spherical harmonic expansions. II.
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Sur Les Polynomes a Coefficients Unimodulaires
- Error Analysis for Fourier Series Evaluation
- Fast Fourier Transforms for Nonequispaced Data
- Fast evaluation of quadrature formulae on the sphere
