Numerical computation of the Fourier transform using Laguerre functions and the fast Fourier transform
DOI10.1007/BF01396758zbMath0437.65109MaRDI QIDQ1141474
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132697
algorithmnumerical resultsFourier transformsfast Fourier transformconvergence and stabilitybilateral expansion with respect to Laguerre functions
Trigonometric interpolation (42A15) Numerical methods for integral transforms (65R10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Laguerre transformation as a tool for the numerical solution of integral equations of convolution type
- A new method for numerical evaluation of the Fourier transform
- A method for numerical calculation of Fourier integrals
- Numerical approximation of Fourier-transforms
- Fast Fourier Methods in Computational Complex Analysis
- Numerical inversion of a class of characteristic functions
- Some Eigenfunction Methods for Computing a Numerical Fourier Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Numerical Calculation of Integrals with Strongly Oscillating Integrand
- On computing the fast Fourier transform
- Numerical calculation of fourier integrals with cubic splines
- The Calculation of Fourier Integrals
This page was built for publication: Numerical computation of the Fourier transform using Laguerre functions and the fast Fourier transform