
Chebfun
 Referenced in 353 articles
[sw05897]
 system combines tools of Chebyshev expansions, fast Fourier transform, barycentric interpolation, recursive zerofinding, and automatic...

MKL
 Referenced in 126 articles
[sw06975]
 highly vectorized and threaded Linear Algebra, Fast Fourier Transforms (FFT), Vector Math and Statistics functions...

NFFT
 Referenced in 70 articles
[sw07610]
 Software Library for Various Nonequispaced Fast Fourier Transforms NFFT 3 is a software library that ... implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example ... nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides...

NFFT3
 Referenced in 57 articles
[sw12736]
 software library for various nonequispaced fast Fourier transforms. NFFT 3 is a software library that ... implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example ... nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides...

SPIRAL
 Referenced in 46 articles
[sw00903]
 fast transform algorithms such as the fast Fourier transform. SPIRAL is capable of generating optimized ... implementations and uses intelligent search to find fast implementations. This talk provides an overview...

SWIFFT
 Referenced in 45 articles
[sw11588]
 novel use of the Fast Fourier Transform (FFT) to achieve “diffusion,” together with a linear...

ClenshawCurtis
 Referenced in 41 articles
[sw07876]
 transformation by a modification of the fast Fourier transform algorithm. This first part discusses...

FFTPACK
 Referenced in 38 articles
[sw11526]
 package of Fortran subprograms for the fast Fourier transform of periodic and other symmetric sequences...

SPHEREPACK
 Referenced in 26 articles
[sw04874]
 functions, Gauss points and weights, multiple fast Fourier transforms, and for converting scalar and vector...

P3DFFT
 Referenced in 24 articles
[sw06503]
 Fourier transforms in three dimensions. Fourier and related transforms are a family of algorithms widely ... software package called P3DFFT which implements fast Fourier transforms (FFTs) in three dimensions...

cuFFT
 Referenced in 24 articles
[sw11258]
 document describes cuFFT, the NVIDIA® CUDA™ Fast Fourier Transform (FFT) product. It consists...

kWave
 Referenced in 23 articles
[sw07387]
 planar detector geometry based on the fast Fourier transform (FFT) is also included. The architecture...

decon
 Referenced in 18 articles
[sw11088]
 efficient in R, we adapt the ”Fast Fourier Transform” (FFT) algorithm for density estimation with...

AS 176
 Referenced in 16 articles
[sw27946]
 Kernel density estimation using the fast Fourier transform...

PFFT
 Referenced in 16 articles
[sw07582]
 based software library for computing fast Fourier transforms (FFTs) on massively parallel, distributed memory architectures...

PNFFT
 Referenced in 9 articles
[sw07583]
 Parallel threedimensional nonequispaced fast Fourier transforms and their application to particle simulation. Starting from ... parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures ... parallel distributed memory algorithm for the fast computation of fully Coulomb interactions in a charged ... adjustment of the underlying parallel nonequispaced fast Fourier transform circumvents severe load imbalance...

ALGLIB
 Referenced in 14 articles
[sw04806]
 EVD/SVD), direct and iterative linear solvers, Fast Fourier Transform and many other algorithms (numerical integration...

Lava
 Referenced in 13 articles
[sw28643]
 traditional hardware description languages. Two Fast Fourier Transform circuit examples illustrate this...

MuST
 Referenced in 10 articles
[sw12955]
 MuST: the multilevel sinc transform. A fast multilevel algorithm (MuST) for evaluating an nsample ... evaluation accuracy. MuST is faster than fast Fourier transform and fast multiple methodbased evaluations...

AREP
 Referenced in 9 articles
[sw13167]
 regular representation, we hence obtain a fast Fourier transform for G. Our algorithm is based ... algorithm is the automatic generation of fast algorithms for discrete linear signal transforms...