
FFTW
 Referenced in 540 articles
[sw04126]
 which is free software, should become the FFT library of choice for most applications...

MKL
 Referenced in 145 articles
[sw06975]
 threaded Linear Algebra, Fast Fourier Transforms (FFT), Vector Math and Statistics functions. Through a single...

SWIFFT
 Referenced in 48 articles
[sw11588]
 SWIFFT: A modest proposal for FFT hashing. We propose SWIFFT, a collection of compression functions ... novel use of the Fast Fourier Transform (FFT) to achieve “diffusion,” together with a linear ... that exploits the inherent parallelism of the FFT algorithm. The throughput of our implementation...

MAFFT
 Referenced in 46 articles
[sw08304]
 accurate; for alignment of <∼200 sequences), FFTNS2 (fast; for alignment...

kWave
 Referenced in 30 articles
[sw07387]
 geometry based on the fast Fourier transform (FFT) is also included. The architecture ... points. Second, by comparison with onestep, FFTbased reconstruction, time reversal is shown...

cuFFT
 Referenced in 24 articles
[sw11258]
 cuFFT, the NVIDIA® CUDA™ Fast Fourier Transform (FFT) product. It consists of two separate libraries ... with a minimum amount of effort. The FFT is a divideandconquer algorithm ... highly optimized and tested FFT library. The cuFFT product supports a wide range ... FFT inputs and options efficiently on NVIDIA GPUs. This version of the cuFFT library supports...

P3DFFT
 Referenced in 29 articles
[sw06503]
 known scalability bottleneck of threedimensional (3D) FFT implementations by using twodimensional domain decomposition...

na12
 Referenced in 28 articles
[sw11490]
 devise an algorithm based on FFT having a lower computational cost and a higher numerical...

PFFT
 Referenced in 18 articles
[sw07582]
 interface standard (MPI). Similar to established transpose FFT algorithms, we propose a parallel FFT framework...

2DECOMP
 Referenced in 23 articles
[sw12729]
 2DECOMP&FFT library is a software framework in Fortran to build largescale parallel applications...

decon
 Referenced in 20 articles
[sw11088]
 adapt the ”Fast Fourier Transform” (FFT) algorithm for density estimation with errorfree data...

Dirac++
 Referenced in 17 articles
[sw37208]
 FFTsplitoperator code for solving the Dirac equation in (2+1) dimensions. The main...

BCCG+FAI
 Referenced in 10 articles
[sw12124]
 problem using conjugate gradients, deflation, and an FFTbased preconditioner. This paper presents ... novel aspect is the definition of the “FFTbased Approximate Inverse” preconditioner. The underlying idea ... form, which can be computed using the FFT of the original matrix elements. This preconditioner...

SolitaryGravityWave
 Referenced in 16 articles
[sw32079]
 demanding operations can be performed using a FFT algorithm. Moreover, when this algorithm is combined...

CaNS
 Referenced in 11 articles
[sw35262]
 FFTbased finitedifference solver for massivelyparallel direct numerical simulations of turbulent flows ... expansions. This approach allows for very efficient FFTbased solvers in problems with different combinations...

CHEBINT
 Referenced in 15 articles
[sw06927]
 Chebyshev approximations. It features highly efficient, fast FFTbased, algorithms to determine the approximation...

FFTSVD
 Referenced in 10 articles
[sw08886]
 each length scale are computed using the FFT. Computational results illustrate that the FFTSVD algorithm ... performs better than precorrectedFFT (pFFT)style algorithms or the multipolestyle algorithms in FastCap...

NUFFT
 Referenced in 10 articles
[sw14889]
 NUFFT  nonuniform FFT toolbox for Matlab. NUFFT Matlab toolbox that performs fast and accurate nonuniform ... FFT computations...

DOST
 Referenced in 9 articles
[sw13155]
 same category as the FFT. The algorithm is based on a simple decomposition ... akin to the conjugate symmetry of the FFT of a realvalued signal. Our fast...

HOLOMAC
 Referenced in 9 articles
[sw18067]
 with highorder compact schemes, and a FFT based constantcoefficient spectral solver is employed ... numerical implementation takes advantage of the 2DECOMP & FFT libraries developed by [1], which are based...