Fast Computation of Multidimensional Fourier Integrals
From MaRDI portal
numerical integrationalgorithmFFTfast Fourier transformquadrature ruleFourier integralasymmetric integration rangesintegrands with endpoint singularities
Complexity and performance of numerical algorithms (65Y20) Numerical methods for trigonometric approximation and interpolation (65T40) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Numerical methods for discrete and fast Fourier transforms (65T50)
Recommendations
- Fast Computation of Fourier Integral Operators
- Fast computation of multidimensional DFT
- Fast Multipole Method for Multivariable Integrals
- Methods for fast computation of integral transforms
- Fast computation of partial Fourier transforms
- Fast and approximate computation of Laplace and Fourier transforms
- Fast wave computation via Fourier integral operators
- On a fast and accurate method for computing Fourier transforms
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- Fast computation of Toeplitz forms and some multidimensional integrals
Cited in
(7)- Bivariate kernel deconvolution with panel data
- A scheme for automatic computation of Fock-type integrals
- Speedy numerical algorithms and architecture for additive spectral analysis
- Atmospheric turbulence profiling with unknown power spectral density
- Fast computation of Toeplitz forms and some multidimensional integrals
- Identification and validation of periodic autoregressive model with additive noise: finite-variance case
- Methods for fast computation of integral transforms
This page was built for publication: Fast Computation of Multidimensional Fourier Integrals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785939)
