-
FFTW
- Referenced in 351 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...
-
cuFFT
- Referenced in 19 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 real-valued data sets...
-
SAMURAI
- Referenced in 17 articles
[sw09145]
- uses a polynomial interpolation exploiting the Discrete Fourier Transform. SAMURAI can process integrands written either...
-
PERMS
- Referenced in 7 articles
[sw20247]
- elements; Characters, Littlewood-Richardson rule, plethysms; Discrete Fourier transform; Tools, concerning tensor investigations...
-
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...
-
ZKCM
- Referenced in 1 article
[sw16659]
- singular-value decomposition, and the discrete Fourier transform. For basic floating-point operations...
-
SFAPS
- Referenced in 1 article
[sw22490]
- particular protein interaction after computing the Discrete Fourier Transform for protein sequences. The informational spectrum...
-
GPB
- Referenced in 1 article
[sw18875]
- derive the probability distribution via the discrete Fourier transform of the characteristic function...
-
WignerEisenbud
- Referenced in 1 article
[sw10351]
- package WignerEisenbud, which uses the Fourier discrete cosine transform to compute the Wigner-Eisenbud functions...
-
FastAsyTransforms
- Referenced in 1 article
[sw23200]
- discrete Hankel transform of order 0 as well as evaluating Schlomilch and Fourier-Bessel expansions ... functions of large arguments, the fast Fourier transform, and the Neumann addition formula. Paper ... Townsend, A fast analysis-based discrete Hankel transform using asymptotic expansions, submitted...
-
ERWP
- Referenced in 1 article
[sw10330]
- split operator propagator in a discrete, cylindrical coordinate representation. A pseudospectral strategy is used ... Fast Fourier transforms are performed for the two Cartesian coordinates whereas a discrete Bessel transform...
-
SEMAL
- Referenced in 1 article
[sw17823]
- element discretization. The general equations in the Fourier space, and their inverse transform are described...
-
AREP
- Referenced in 9 articles
[sw13167]
- representation, we hence obtain a fast Fourier transform for G. Our algorithm is based ... automatic generation of fast algorithms for discrete linear signal transforms...
-
FIDE
- Referenced in 5 articles
[sw09196]
- EXPRESS for transforming PDES into any orthogonal coordinate system. IIMET for discretization of PDES ... difference schemes, which are needed in the Fourier stability analysis. HURWP for locating polynomial roots...
-
WATERWAVES
- Referenced in 1 article
[sw13596]
- potential term is treated using an efficient Discrete Variable Representation (DVR) being diagonal ... radial kinetic term uses a fast Fourier transform (FFT) to obtain an operator which...
-
RcppGSL
- Referenced in 2 articles
[sw10617]
- special functions, permutations, combinations, fast fourier transforms, eigensystems, random numbers, quadrature, random distributions, quasi-random ... interpolation, series acceleration, Chebyshev approximations, root-finding, discrete Hankel transforms physical constants, basis splines...
-
DWT
- Referenced in 1 article
[sw14616]
- toolbox for signal processing applications. Discrete Wavelet Transform (DWT) plays a significant role in several ... user specific decomposition level using Fast Fourier Transform (FFT) and to provide a option...
-
ANSYS
- Referenced in 489 articles
[sw00044]
- ANSYS offers a comprehensive software suite that spans...
