On a fast and accurate method for computing Fourier transforms
DOI10.1007/BF01955868zbMATH Open0821.65094MaRDI QIDQ1334992FDOQ1334992
Authors: P. C. Chakravarti, Mauricio A. Barrientos
Publication date: 27 September 1995
Published in: BIT (Search for Journal in Brave)
Recommendations
numerical examplesfast Fourier transformFourier integralscorrection termEuler-Maclaurin formulatrapezoidal sum
Numerical methods for trigonometric approximation and interpolation (65T40) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Euler-Maclaurin formula in numerical analysis (65B15)
Cites Work
Cited In (26)
- A fast computational method for minimum square error transform
- Error control of a numerical formula for the Fourier transform by Ooura's continuous Euler transform and fractional FFT
- Fast Computation of Multidimensional Fourier Integrals
- Accuracy-optimal evaluation of the Fourier transform for \(C_{L,N,\varepsilon}\) functions
- A fast and accurate numerical method for symmetric Lévy processes based on the Fourier transform and sinc-Gauss sampling formula
- High-accuracy formula for discrete calculation of Fourier transforms
- A Fast Method for the Numerical Evaluation of Continuous Fourier and Laplace Transforms
- Efficient Fourier transforms for transverse momentum dependent distributions
- Accuracy analysis of some fast Fourier transform algorithms for estimation of correlation functions
- Numerical integration formulas based on iterated cubic splines. II
- A new fast Fourier method for evaluating Fourier spectra at arbitrary frequencies
- Title not available (Why is that?)
- Methods for fast computation of integral transforms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite Fourier transforms computed by a modified Filon-Euler-Maclaurin method
- Title not available (Why is that?)
- Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast and approximate computation of Laplace and Fourier transforms
- Fast approximation to Poisson integral based on trigonometric periodic multiresolution analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rapid Computation of the Discrete Fourier Transform
This page was built for publication: On a fast and accurate method for computing Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334992)