Results 1 to 20 of 457
Sort by:

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

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

  • SWIFFT
  • Referenced in 44 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...

  • cuFFT
  • Referenced in 22 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...

  • MAFFT
  • Referenced in 31 articles [sw08304]
  • accurate; for alignment of <∼200 sequences), FFT-NS-2 (fast; for alignment...

  • k-Wave
  • Referenced in 20 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...

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

  • P3DFFT
  • Referenced in 21 articles [sw06503]
  • known scalability bottleneck of three-dimensional (3D) FFT implementations by using two-dimensional domain decomposition...

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

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

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

  • 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...

  • CHEBINT
  • Referenced in 12 articles [sw06927]
  • Chebyshev approximations. It features highly efficient, fast FFT-based, algorithms to determine the approximation...

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

  • BCCG+FAI
  • Referenced in 6 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...

  • McBits
  • Referenced in 7 articles [sw14754]
  • core. These algorithms rely on an additive FFT for fast root computation, a transposed additive ... FFT for fast syndrome computation, and a sorting network to avoid cache-timing attacks...

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

  • DOST
  • Referenced in 6 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 real-valued signal. Our fast...

  • pyFFTW
  • Referenced in 6 articles [sw15538]
  • pythonic wrapper around FFTW, the speedy FFT library. The ultimate aim is to present ... almost feature equivalent to standard and real FFT functions of numpy.fft (indeed, it supports...