Fast Gauss transforms with complex parameters using NFFTs

DOI10.1515/156939506779874626zbMath1132.65119OpenAlexW2015856650MaRDI QIDQ5756846

Stefan Kunis, Daniel Potts, Gabriele Drauschke

Publication date: 5 September 2007

Published in: Journal of Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939506779874626

zbMATH Keywords

numerical experimentsfast algorithmsfast Fourier transformGauss transformchirped Gaussianunequally spaced Fourier transforms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (2)

Automated parameter tuning based on RMS errors for nonequispaced FFTs ⋮ Fast Fourier transforms of piecewise polynomials

Uses Software

• NFFT

Cites Work

• The fast Gauss transform with complex parameters
• A note on fast Fourier transforms for nonequispaced grids
• On generalized Gaussian quadratures for exponentials and their applications
• Fast convolution with radial kernels at nonequispaced knots
• On the fast Fourier transform of functions with singularities
• On approximation of functions by exponential sums
• The Fast Gauss Transform with Variable Scales
• Fast Fourier Transforms for Nonequispaced Data
• Fast Summation at Nonequispaced Knots by NFFT
• The Fast Gauss Transform

This page was built for publication: Fast Gauss transforms with complex parameters using NFFTs