The partial fast Fourier transform

DOI10.1007/s10915-018-0675-0zbMath1397.65326MaRDI QIDQ1785504

Zayd Ghoggali, John C. Bowman

Publication date: 28 September 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-018-0675-0

zbMATH Keywords

convolution; FFT; fast Fourier transform; discrete Fourier transform; partial Fourier transform; implicit dealiasing; fractional-phase Fourier transform

Mathematics Subject Classification ID

65T50: Numerical methods for discrete and fast Fourier transforms

Uses Software

• FFTW
• FFTW++

Cites Work

• Unnamed Item
• Unnamed Item
• Gauss and the history of the fast Fourier transform
• Fast Fourier transform and convolution algorithms
• Multithreaded implicitly dealiased convolutions
• Mastering the discrete Fourier transform in one, two or several dimensions. Pitfalls and artifacts
• An algorithm for the rapid evaluation of special function transforms
• Efficient Dealiased Convolutions without Padding
• The Fractional Fourier Transform and Applications
• Fast Computation of Partial Fourier Transforms
• Sparse Fourier Transform via Butterfly Algorithm
• Fast Numerical Solution of Nonlinear Volterra Convolution Equations
• Fast Convolution for Nonreflecting Boundary Conditions
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Nearly optimal sparse fourier transform