Rapid ``algebraic Fourier transforms on uniformly distributed meshes
From MaRDI portal
Publication:2629436
Recommendations
- A note on fast Fourier transforms for nonequispaced grids
- Fast discrete Fourier transform on generalized sparse grids
- Fast algorithms for discrete polynomial transforms on arbitrary grids
- scientific article; zbMATH DE number 1373505
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions
- Fast and stable algorithms for discrete spherical Fourier transforms
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- On a fast algorithm for computing the Fourier transform
- Algorithms for unequally spaced fast Laplace transforms
- Fast and approximate computation of Laplace and Fourier transforms
Cites work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Application of divisor theory to the construction of tables of optimal coefficients for quadrature formulas
- APPLICATION OF DIVISOR THEORY TO THE NUMERICAL INTEGRATION OF PERIODIC FUNCTIONS OF SEVERAL VARIABLES
- Fast Fourier transform and convolution algorithms
- General algorithm for the numerical integration of functions of several variables
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 3987367 (Why is no real title available?)
- scientific article; zbMATH DE number 4041131 (Why is no real title available?)
- scientific article; zbMATH DE number 4079558 (Why is no real title available?)
Cited in
(2)
This page was built for publication: Rapid ``algebraic Fourier transforms on uniformly distributed meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629436)