
Chebfun
 Referenced in 162 articles
[sw05897]
 system combines tools of Chebyshev expansions, fast Fourier transform, barycentric interpolation, recursive zerofinding, and automatic...

NFFT
 Referenced in 47 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...

NFFT3
 Referenced in 38 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...

MKL
 Referenced in 45 articles
[sw06975]
 highly vectorized and threaded Linear Algebra, Fast Fourier Transforms (FFT), Vector Math and Statistics functions...

SPIRAL
 Referenced in 37 articles
[sw00903]
 fast transform algorithms such as the fast Fourier transform. SPIRAL is capable of generating optimized ... implementations and uses intelligent search to find fast implementations. This talk provides an overview...

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

ClenshawCurtis
 Referenced in 28 articles
[sw07876]
 transformation by a modification of the fast Fourier transform algorithm. This first part discusses...

FFTPACK
 Referenced in 27 articles
[sw11526]
 package of Fortran subprograms for the fast Fourier transform of periodic and other symmetric sequences...

SPHEREPACK
 Referenced in 21 articles
[sw04874]
 functions, Gauss points and weights, multiple fast Fourier transforms, and for converting scalar and vector...

cuFFT
 Referenced in 17 articles
[sw11258]
 document describes cuFFT, the NVIDIA® CUDA™ Fast Fourier Transform (FFT) product. It consists...

AREP
 Referenced in 9 articles
[sw13167]
 regular representation, we hence obtain a fast Fourier transform for G. Our algorithm is based ... algorithm is the automatic generation of fast algorithms for discrete linear signal transforms...

PNFFT
 Referenced in 5 articles
[sw07583]
 Parallel threedimensional nonequispaced fast Fourier transforms and their application to particle simulation Starting from ... parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures ... parallel distributed memory algorithm for the fast computation of fully Coulomb interactions in a charged ... adjustment of the underlying parallel nonequispaced fast Fourier transform circumvents severe load imbalance...

ALGLIB
 Referenced in 8 articles
[sw04806]
 EVD/SVD), direct and iterative linear solvers, Fast Fourier Transform and many other algorithms (numerical integration...

PFFT
 Referenced in 8 articles
[sw07582]
 based software library for computing fast Fourier transforms (FFTs) on massively parallel, distributed memory architectures...

P3DFFT
 Referenced in 7 articles
[sw06503]
 Fourier transforms in three dimensions Fourier and related transforms are a family of algorithms widely ... software package called P3DFFT which implements fast Fourier transforms (FFTs) in three dimensions...

decon
 Referenced in 7 articles
[sw11088]
 efficient in R, we adapt the ”Fast Fourier Transform” (FFT) algorithm for density estimation with...

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

LSFBTR
 Referenced in 6 articles
[sw13181]
 carried out as two successive Fourier transforms that are calculated numerically using the trapezoidal rule ... calculated very efficiently using the fast Fourier transform method...

UHFFT
 Referenced in 6 articles
[sw03128]
 adaptive and portable software library for fast Fourier transforms...

POMULT
 Referenced in 5 articles
[sw00725]
 method. It provides routines for computing fast Fourier transform of trajectories, Poincaré surfaces of sections...