• FFTW

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

  • Referenced in 148 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 48 articles [sw08304]
  • accurate; for alignment of <∼200 sequences), FFT-NS-2 (fast; for alignment...
  • k-Wave

  • Referenced in 34 articles [sw07387]
  • geometry based on the fast Fourier transform (FFT) is also included. The architecture ... points. Second, by comparison with one-step, FFT-based 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 divide-and-conquer 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 31 articles [sw06503]
  • known scalability bottleneck of three-dimensional (3D) FFT implementations by using two-dimensional domain decomposition...
  • na12

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

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

  • Referenced in 25 articles [sw12729]
  • 2DECOMP&FFT library is a software framework in Fortran to build large-scale parallel applications...
  • decon

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

  • Referenced in 14 articles [sw18067]
  • with high-order compact schemes, and a FFT based constant-coefficient spectral solver is employed ... numerical implementation takes advantage of the 2DECOMP & FFT libraries developed by [1], which are based...
  • Dirac++

  • Referenced in 18 articles [sw37208]
  • FFT-split-operator 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 FFT-based preconditioner. This paper presents ... novel aspect is the definition of the “FFT-based 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...
  • CHEBINT

  • Referenced in 15 articles [sw06927]
  • Chebyshev approximations. It features highly efficient, fast FFT-based, 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 precorrected-FFT (pFFT)-style algorithms or the multipole-style 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...
  • CaNS

  • Referenced in 10 articles [sw35262]
  • FFT-based finite-difference solver for massively-parallel direct numerical simulations of turbulent flows ... expansions. This approach allows for very efficient FFT-based solvers in problems with different combinations...
  • FDE12

  • Referenced in 14 articles [sw22502]
  • convolutions are evaluated by means of the FFT algorithm described in [4] allowing to keep...