Fast Approximate Fourier Transforms for Irregularly Spaced Data
From MaRDI portal
Publication:4229430
DOI10.1137/S003614459731533XzbMath0917.65122MaRDI QIDQ4229430
Publication date: 22 February 1999
Published in: SIAM Review (Search for Journal in Brave)
numerical results; fast Fourier transforms; complex exponentials; cubic spline interpolation; irregularly spaced data; multipole method; Lagrange polynomial interpolation; local Taylor expansion; Boyd's Euler sum; local Chebyshev approximation
65T50: Numerical methods for discrete and fast Fourier transforms
42A16: Fourier coefficients, Fourier series of functions with special properties, special Fourier series
Related Items
Fast evaluation of quadrature formulae on the sphere, Efficient calculations of 3-D FFTs on spiral contours, 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, Numerical solution of two asset jump diffusion models for option valuation, Fast spherical Fourier algorithms., Approximate factorizations of Fourier matrices with nonequispaced knots, Fast algorithms for discrete polynomial transforms on arbitrary grids, A penalty method for American options with jump diffusion processes, Direct operatorial tau method for pantograph-type equations, Fast evaluation of trigonometric polynomials from hyperbolic crosses
