25 citations · 45 across the 9 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.NA2023
Optimal density compensation factors for the reconstruction of the Fourier transform of bandlimited functions
Melanie Kircheis, Daniel Potts
An inverse nonequispaced fast Fourier transform (iNFFT) is a fast algorithm to compute the Fourier coefficients of a trigonometric polynomial from nonequispaced sampling data. Howe…
math.NA2023★ 6 cited
On numerical realizations of Shannon's sampling theorem
Melanie Kircheis, Daniel Potts, Manfred Tasche
In this paper, we discuss some numerical realizations of Shannon's sampling theorem. First we show the poor convergence of classical Shannon sampling sums by presenting sharp upper…
math.NA2023★ 3 cited
Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
Melanie Kircheis, Daniel Potts
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as non…