The partial fast Fourier transform
From MaRDI portal
Recommendations
- Fast computation of partial Fourier transforms
- Fast and accurate polar Fourier transform
- Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation
- Fast Fourier transforms of piecewise polynomials
- A split-radix partial input/output fast Fourier transform algorithm
Cites work
- scientific article; zbMATH DE number 3623496 (Why is no real title available?)
- An Algorithm for the Machine Calculation of Complex Fourier Series
- An algorithm for the rapid evaluation of special function transforms
- Efficient dealiased convolutions without padding
- Fast Convolution for Nonreflecting Boundary Conditions
- Fast Fourier transform and convolution algorithms
- Fast Numerical Solution of Nonlinear Volterra Convolution Equations
- Fast computation of partial Fourier transforms
- Gauss and the history of the fast Fourier transform
- Mastering the discrete Fourier transform in one, two or several dimensions. Pitfalls and artifacts
- Multithreaded implicitly dealiased convolutions
- Nearly optimal sparse Fourier transform
- Seismic interferometry.
- Sparse Fourier Transform via Butterfly Algorithm
- The Fractional Fourier Transform and Applications
Cited in
(6)- Hybrid dealiasing of complex convolutions
- Parametric versions of the fast Fourier transform
- Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation
- Efficient dealiased convolutions without padding
- Partial positive scaling transform: a separability criterion
- Fast computation of partial Fourier transforms
This page was built for publication: The partial fast Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785504)
