13 citations · 30 across the 7 of their papers we have counts for
9 papers
How well do fast discrete trigonometric transforms work for parametric numerical integration?
Gerlind Plonka, Daniel Potts, Manfred Tasche
The fast Fourier transform (FFT) and its real counterparts, the fast algorithms of the discrete cosine transform (DCT) and the discrete sine transform (DST), are frequently employe…
Computation of the Fourier transform for a continuous integrable function via NFFT
Daniel Potts, Manfred Tasche
We investigate the approximation of continuous Fourier transforms by trigonometric sampling polynomials and their efficient evaluation by the nonequispaced fast Fourier transform (…
Some remarks on regularized Shannon sampling formulas
Melanie Kircheis, Daniel Potts, Manfred Tasche
The fast reconstruction of a bandlimited function from its sample data is an essential problem in signal processing. In this paper, we consider the widely used Gaussian regularized…
Regularized Shannon sampling formulas related to the special affine Fourier transform
Frank Filbir, Manfred Tasche, Anna Veselovska
In this paper, we present new regularized Shannon sampling formulas related to the special affine Fourier transform (SAFT). These sampling formulas use localized sampling with spec…
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…
On regularized Shannon sampling formulas with localized sampling
Melanie Kircheis, Daniel Potts, Manfred Tasche
In this paper we present new regularized Shannon sampling formulas which use localized sampling with special window functions, namely Gaussian, B-spline, and sinh-type window funct…
Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
Melanie Kircheis, Daniel Potts, Manfred Tasche
In this paper we study the nonuniform fast Fourier transform with nonequispaced spatial and frequency data (NNFFT) and the fast sinc transform as its application. The computation o…
Continuous window functions for NFFT
Daniel Potts, Manfred Tasche
In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly su…
Uniform error estimates for nonequispaced fast Fourier transforms
Daniel Potts, Manfred Tasche
In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly su…