13 citations · 30 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.NA2026
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…
math.NA2026
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 (…