
FFTW
 Referenced in 410 articles
[sw04126]
 subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions ... well as of even/odd data, i.e. the discrete cosine/sine transforms or DCT/DST). We believe that...

SAMURAI
 Referenced in 26 articles
[sw09145]
 uses a polynomial interpolation exploiting the Discrete Fourier Transform. SAMURAI can process integrands written either...

cuFFT
 Referenced in 21 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 realvalued data sets...

PERMS
 Referenced in 7 articles
[sw20247]
 elements; Characters, LittlewoodRichardson rule, plethysms; Discrete Fourier transform; Tools, concerning tensor investigations...

AS 83
 Referenced in 4 articles
[sw03890]
 Algorithm AS 83. Complex discrete fast Fourier transform...

AS 97
 Referenced in 4 articles
[sw03891]
 Algorithm AS 97. Real discrete fast Fourier transform...

nuSpectral
 Referenced in 2 articles
[sw26228]
 show the equivalence to the discrete Fourier transform applied onto uniformly sampled data...

ZKCM
 Referenced in 2 articles
[sw16659]
 singularvalue decomposition, and the discrete Fourier transform. For basic floatingpoint operations...

SFAPS
 Referenced in 2 articles
[sw22490]
 particular protein interaction after computing the Discrete Fourier Transform for protein sequences. The informational spectrum...

GPB
 Referenced in 2 articles
[sw18875]
 derive the probability distribution via the discrete Fourier transform of the characteristic function...

JTransforms
 Referenced in 1 article
[sw20195]
 four types of transforms are available: Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Discrete...

DFTI
 Referenced in 1 article
[sw00201]
 Transform (FFT) algorithm that calculates the Discrete Fourier Transform (DFT) is one of the major...

FFTE
 Referenced in 1 article
[sw30388]
 Transform Package. A package to compute Discrete Fourier Transforms of 1, 2 and 3 dimensional...

AS 186
 Referenced in 2 articles
[sw27936]
 algorithm of data permutation in discrete fast Fourier transform...

SFFT
 Referenced in 1 article
[sw25343]
 linear time algorithms for computing the discrete Fourier transform of a time domain signal which...

AS 117
 Referenced in 1 article
[sw03892]
 Algorithm AS 117. The Chirp discrete Fourier transform of general length...

NFFT.jl
 Referenced in 1 article
[sw30131]
 implementation of the Nonequidistant Fast Fourier Transform (NFFT). For a detailed introduction into ... fast implementation of the Nonequidistant Discrete Fourier Transform (NDFT) that is basically...

WignerEisenbud
 Referenced in 1 article
[sw10351]
 package WignerEisenbud, which uses the Fourier discrete cosine transform to compute the WignerEisenbud functions...

RcppGSL
 Referenced in 7 articles
[sw10617]
 special functions, permutations, combinations, fast fourier transforms, eigensystems, random numbers, quadrature, random distributions, quasirandom ... interpolation, series acceleration, Chebyshev approximations, rootfinding, discrete Hankel transforms physical constants, basis splines...

FastAsyTransforms
 Referenced in 1 article
[sw23200]
 discrete Hankel transform of order 0 as well as evaluating Schlomilch and FourierBessel expansions ... functions of large arguments, the fast Fourier transform, and the Neumann addition formula. Paper ... Townsend, A fast analysisbased discrete Hankel transform using asymptotic expansions, submitted...