Fast Gauss transforms with complex parameters using NFFTs

DOI10.1515/156939506779874626MaRDI QIDQ5756846zbMATH OpenOpenAlexFDO

Authors Stefan Kunis, Daniel Potts, Gabriele Steidl

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

chirped Gaussianfast algorithmsfast Fourier transformGauss transformnumerical experimentsunequally spaced Fourier transforms

Mathematics Subject Classification ID

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

Recommendations

• The fast Gauss transform with complex parameters
• A new version of the fast Gauss transform
• The Fast Gauss Transform
• The fast generalized Gauss transform
• A remark on the fast Gauss transform
• The Fast Gauss Transform with Variable Scales
• Fast Numerical Nonlinear Fourier Transforms
• Fast generalized Fourier transforms
• Fast approximation of the discrete Gauss transform in higher dimensions
• Publication:4893175

Cites work

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

Cited in

(8)

• Fast Fourier transforms of piecewise polynomials
• Automated parameter tuning based on RMS errors for nonequispaced FFTs
• The Fast Gauss Transform with Variable Scales
• Fast Summation at Nonequispaced Knots by NFFT
• Fast NFFT based summation of radial functions
• Fast kernel summation in high dimensions via slicing and Fourier transforms
• Efficient nonlocal linear image denoising: bilevel optimization with nonequispaced fast Fourier transform and matrix-free preconditioning
• The fast Gauss transform with complex parameters

Describes a project that uses

Uses Software

• NFFT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756846)