Calculating Fourier Transforms of Long-Tailed Functions

DOI10.1137/0908081MaRDI QIDQ3801036zbMATH OpenOpenAlexFDO

Authors Tasso J. Kaper, James N. Lyness

Publication date 1987

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

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

zbMATH Keywords

fast Fourier transformFourier transform functionslong-tailed functionsMöbius inversionnonlinear series accelerationPoisson summation formulatrapezoidal quadrature rule

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Extrapolation to the limit, deferred corrections (65B05) Acceleration of convergence in numerical analysis (65B99) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• On the computation of Fourier transforms of singular functions
• A double exponential formula for the Fourier transforms
• A new technique for calculating fourier integrals based on the poisson summation formula
• The Fourier-series method for inverting transforms of probability distributions
• A ``multigrid extension of the \(FFT\) for the numerical inversion of Fourier and Laplace transforms

Cited in

(3)

• Numerical calculation of Fourier transforms based on hyperfunction theory
• A new technique for calculating fourier integrals based on the poisson summation formula
• Finite Fourier transforms computed by a modified Filon-Euler-Maclaurin method

This page was built for publication: Calculating Fourier Transforms of Long-Tailed Functions

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