Fast Fourier Transforms for Spherical Gauss-Laguerre Basis Functions
From MaRDI portal
Publication:4609731
DOI10.1007/978-3-319-55550-8_11zbMath1453.65467arXiv1604.05140OpenAlexW2340895730MaRDI QIDQ4609731
Christian Wülker, Jürgen Prestin
Publication date: 26 March 2018
Published in: Frames and Other Bases in Abstract and Function Spaces (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.05140
Numerical methods for discrete and fast Fourier transforms (65T50) Trigonometric series of special types (positive coefficients, monotonic coefficients, etc.) (42A32)
Related Items
Toward recursive spherical harmonics issued bi-filters. II: An associated spherical harmonics entropy for optimal modeling, Fast SGL Fourier transforms for scattered data, Approximation of Gaussians by spherical Gauss-Laguerre basis in the weighted Hilbert space, Toward recursive spherical harmonics-issued bi-filters. I: Theoretical framework, Translation matrix elements for spherical Gauss-Laguerre basis functions
Cites Work
- A fast algorithm for nonequispaced Fourier transforms on the rotation group
- Computing Fourier transforms and convolutions on the 2-sphere
- Fast spherical Fourier algorithms.
- FFTs for the 2-sphere-improvements and variations
- Convex polynomial approximation in \(\mathbb{R}^d\) with Freud weights
- FFTs on the rotation group
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- A Novel Sampling Theorem on the Sphere
- Exact Wavelets on the Ball
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Engineering Applications of Noncommutative Harmonic Analysis
- [https://portal.mardi4nfdi.de/wiki/Publication:5578526 Gaussian Quadratures for the Integrals � ∞ 0 exp(-x 2 )f(x)dx and � b 0 exp(-x 2 )f(x)dx]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
