• FFTW

• Referenced in 504 articles [sw04126]
• subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions...

• Chebfun

• Referenced in 364 articles [sw05897]
• combines tools of Chebyshev expansions, fast Fourier transform, barycentric interpolation, recursive zerofinding, and automatic differentiation...

• MKL

• Referenced in 130 articles [sw06975]
• vectorized and threaded Linear Algebra, Fast Fourier Transforms (FFT), Vector Math and Statistics functions. Through...

• NFFT

• Referenced in 70 articles [sw07610]
• Software Library for Various Nonequispaced Fast Fourier Transforms NFFT 3 is a software library that ... implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example ... nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides...

• e1071

• Referenced in 103 articles [sw07985]
• latent class analysis, short time Fourier transform, fuzzy clustering, support vector machines, shortest path computation...

• NFFT3

• Referenced in 58 articles [sw12736]
• software library for various nonequispaced fast Fourier transforms. NFFT 3 is a software library that ... implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example ... nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides...

• ShearLab

• Referenced in 53 articles [sw06721]
• polar grids and the pseudo-polar Fourier transform for digital implementations of parabolic scaling algorithms ... derive an isometric pseudo-polar Fourier transform by careful weighting of the pseudo-polar grid...

• ForWaRD

• Referenced in 54 articles [sw12296]
• domains. The Fourier shrinkage exploits the Fourier transform’s economical representation of the colored noise ... optimal balance between the amount of Fourier and wavelet regularization by optimizing an approximate mean...

• SPIRAL

• Referenced in 46 articles [sw00903]
• transform algorithms such as the fast Fourier transform. SPIRAL is capable of generating optimized implementations...

• SWIFFT

• Referenced in 46 articles [sw11588]
• novel use of the Fast Fourier Transform (FFT) to achieve “diffusion,” together with a linear...

• Clenshaw-Curtis

• Referenced in 41 articles [sw07876]
• modification of the fast Fourier transform algorithm. This first part discusses the strategy and various...

• P3DFFT

• Referenced in 26 articles [sw06503]
• framework for parallel computations of Fourier transforms in three dimensions. Fourier and related transforms ... package called P3DFFT which implements fast Fourier transforms (FFTs) in three dimensions in a highly ... computational cores. Library features include Fourier and Chebyshev transforms, Fortran and C interfaces...

• GESPAR

• Referenced in 28 articles [sw25722]
• signal from the magnitude of its Fourier transform, or of any other linear transform ... sparse signal from measurements of its Fourier transform (or other linear transform) magnitude which...

• FFTPACK

• Referenced in 38 articles [sw11526]
• Fortran subprograms for the fast Fourier transform of periodic and other symmetric sequences. It includes...

• cuFFT

• Referenced in 24 articles [sw11258]
• describes cuFFT, the NVIDIA® CUDA™ Fast Fourier Transform (FFT) product. It consists of two separate ... conquer algorithm for efficiently computing discrete Fourier transforms of complex or real-valued data sets...

• Quipper

• Referenced in 27 articles [sw09894]
• computation, including quantum teleportation, the quantum Fourier transform, and a quantum circuit for addition...

• SAMURAI

• Referenced in 27 articles [sw09145]
• polynomial interpolation exploiting the Discrete Fourier Transform. SAMURAI can process integrands written either as numerator...

• k-Wave

• Referenced in 27 articles [sw07387]
• detector geometry based on the fast Fourier transform (FFT) is also included. The architecture...

• SPHEREPACK

• Referenced in 26 articles [sw04874]
• Gauss points and weights, multiple fast Fourier transforms, and for converting scalar and vector fields...

• decon

• Referenced in 19 articles [sw11088]
• adapt the ”Fast Fourier Transform” (FFT) algorithm for density estimation with error-free data...