Fast Approximate Fourier Transforms for Irregularly Spaced Data

DOI10.1137/S003614459731533XzbMath0917.65122OpenAlexW2087772495MaRDI QIDQ4229430

Antony Ware

Publication date: 22 February 1999

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s003614459731533x

zbMATH Keywords

numerical resultsfast Fourier transformscomplex exponentialscubic spline interpolationirregularly spaced datamultipole methodLagrange polynomial interpolationlocal Taylor expansionBoyd's Euler sumlocal Chebyshev approximation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)

Related Items (22)

Approximate factorizations of Fourier matrices with nonequispaced knots ⋮ Fast algorithms for discrete polynomial transforms on arbitrary grids ⋮ An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions ⋮ A penalty method for American options with jump diffusion processes ⋮ Automated parameter tuning based on RMS errors for nonequispaced FFTs ⋮ Fast and accurate polar Fourier transform ⋮ A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing ⋮ On the computation of the polar FFT ⋮ NFFT based Ewald summation for electrostatic systems with charges and dipoles ⋮ A new theoretical derivation of NFFT and its implementation on GPU ⋮ NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform ⋮ Efficient calculations of 3-D FFTs on spiral contours ⋮ A Nonuniform Fast Fourier Transform Based on Low Rank Approximation ⋮ Fast spherical Fourier algorithms. ⋮ Numerical solution of two asset jump diffusion models for option valuation ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Direct operatorial tau method for pantograph-type equations ⋮ Fast evaluation of quadrature formulae on the sphere ⋮ Fast evaluation of trigonometric polynomials from hyperbolic crosses ⋮ Fast ewald summation based on NFFT with mixed periodicity ⋮ Direct Inversion of the Three-Dimensional Pseudo-polar Fourier Transform ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel

This page was built for publication: Fast Approximate Fourier Transforms for Irregularly Spaced Data