scientific article; zbMATH DE number 749848
From MaRDI portal
Publication:4764031
discrete Fourier transformfast Fourier transforminverse Fourier transformsinverse Laplace transformsnumerical examplesPoisson summation formulaspline interpolation
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Laplace transform (44A10) Numerical methods for integral transforms (65R10) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical methods for discrete and fast Fourier transforms (65T50)
Recommendations
- A ``multigrid extension of the \(FFT\) for the numerical inversion of Fourier and Laplace transforms
- The FFT as a Multigrid Algorithm
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- The fast fourier transform in a problem with multiple grid-points
- Fast Fourier transform on multipoles (FFTM) algorithm for Laplace equation with direct and indirect boundary element method
- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- A note on fast Fourier transforms for nonequispaced grids
- scientific article; zbMATH DE number 1061890
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- Fast discrete Fourier transform on generalized sparse grids
Cited in
(6)- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- On summation formulas due to Plana, Lindelöf and Abel, and related Gauss-Christoffel rules. I
- A flexible inverse Laplace transform algorithm and its application
- A ``multigrid extension of the \(FFT\) for the numerical inversion of Fourier and Laplace transforms
- The FFT as a Multigrid Algorithm
- Numerical inversion of 2-D Laplace transforms by fast Hartley transform computations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764031)
