On a fast and accurate method for computing Fourier transforms
From MaRDI portal
Publication:1334992
Recommendations
Cites work
- scientific article; zbMATH DE number 3854294 (Why is no real title available?)
- scientific article; zbMATH DE number 3584892 (Why is no real title available?)
- scientific article; zbMATH DE number 3376602 (Why is no real title available?)
- An Algorithm for the Machine Calculation of Complex Fourier Series
Cited in
(26)- Fast and approximate computation of Laplace and Fourier transforms
- A new fast Fourier method for evaluating Fourier spectra at arbitrary frequencies
- Efficient Fourier transforms for transverse momentum dependent distributions
- scientific article; zbMATH DE number 1979263 (Why is no real title available?)
- High-accuracy formula for discrete calculation of Fourier transforms
- scientific article; zbMATH DE number 15846 (Why is no real title available?)
- Fast approximation to Poisson integral based on trigonometric periodic multiresolution analysis
- scientific article; zbMATH DE number 4164118 (Why is no real title available?)
- Fast Computation of Multidimensional Fourier Integrals
- scientific article; zbMATH DE number 3862403 (Why is no real title available?)
- Methods for fast computation of integral transforms
- Accuracy-optimal evaluation of the Fourier transform for \(C_{L,N,\varepsilon}\) functions
- Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
- Error control of a numerical formula for the Fourier transform by Ooura's continuous Euler transform and fractional FFT
- A Fast Method for the Numerical Evaluation of Continuous Fourier and Laplace Transforms
- scientific article; zbMATH DE number 3970070 (Why is no real title available?)
- Numerical integration formulas based on iterated cubic splines. II
- scientific article; zbMATH DE number 4104354 (Why is no real title available?)
- scientific article; zbMATH DE number 1960289 (Why is no real title available?)
- Rapid Computation of the Discrete Fourier Transform
- Accuracy analysis of some fast Fourier transform algorithms for estimation of correlation functions
- Finite Fourier transforms computed by a modified Filon-Euler-Maclaurin method
- A fast computational method for minimum square error transform
- A fast and accurate numerical method for symmetric Lévy processes based on the Fourier transform and sinc-Gauss sampling formula
- scientific article; zbMATH DE number 4082931 (Why is no real title available?)
- scientific article; zbMATH DE number 55187 (Why is no real title available?)
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)
