Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fast SGL Fourier transforms for scattered data (1809.10786v2)

Published 27 Sep 2018 in math.NA and cs.NA

Abstract: Spherical Gauss-Laguerre (SGL) basis functions, i. e., normalized functions of the type $L_{n-l-1}{(l + 1/2)}(r2) rl Y_{lm}(\vartheta,\varphi)$, $|m| \leq l < n \in \mathbb{N}$, $L_{n-l-1}{(l + 1/2)}$ being a generalized Laguerre polynomial, $Y_{lm}$ a spherical harmonic, constitute an orthonormal polynomial basis of the space $L2$ on $\mathbb{R}3$ with radial Gaussian (multivariate Hermite) weight $\exp(-r2)$. We have recently described fast Fourier transforms for the SGL basis functions based on an exact quadrature formula with certain grid points in $\mathbb{R}3$. In this paper, we present fast SGL Fourier transforms for scattered data. The idea is to employ well-known basal fast algorithms to determine a three-dimensional trigonometric polynomial that coincides with the bandlimited function of interest where the latter is to be evaluated. This trigonometric polynomial can then be evaluated efficiently using the well-known non-equispaced FFT (NFFT). We proof an error estimate for our algorithms and validate their practical suitability in extensive numerical experiments.

Citations (1)

Summary

We haven't generated a summary for this paper yet.