2005
DOI: 10.1109/jproc.2004.840301
|View full text |Cite
|
Sign up to set email alerts
|

The Design and Implementation of FFTW3

Abstract: FFTW is an implementation of the discrete

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
2,491
1
14

Year Published

2005
2005
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 4,085 publications
(2,510 citation statements)
references
References 58 publications
4
2,491
1
14
Order By: Relevance
“…We tried different 3D FFT subprograms and our final choice was a FFT routine provided by the FFTW library. 59,60 All computations were performed on the shared-memory system IBM eServer pSeries 690 Regatta based on 64-bit IBM Power4 (1.1 GHz) processors running IBM AIX OS. Solving Poisson's equation to double precision on a single processor required 0.0049 s, 0.043 s, and 0.58 s for 32 3 , 64 3 and 128 3 grids, correspondingly.…”
Section: Appendix 2 Three-dimensional Poisson Solvermentioning
confidence: 99%
See 1 more Smart Citation
“…We tried different 3D FFT subprograms and our final choice was a FFT routine provided by the FFTW library. 59,60 All computations were performed on the shared-memory system IBM eServer pSeries 690 Regatta based on 64-bit IBM Power4 (1.1 GHz) processors running IBM AIX OS. Solving Poisson's equation to double precision on a single processor required 0.0049 s, 0.043 s, and 0.58 s for 32 3 , 64 3 and 128 3 grids, correspondingly.…”
Section: Appendix 2 Three-dimensional Poisson Solvermentioning
confidence: 99%
“…We prefer an open-source library named FFTW being developed by Frigo and Johnson. 59,60 FFTW employs O(NlogN) algorithms for all sizes, including prime numbers. The current version, FFTW 3.1.2, includes parallel (multi-threaded) transforms for shared-memory systems (including OpenMP parallelism 61 ).…”
Section: Efficiency Of the Numerical Solutionmentioning
confidence: 99%
“…The operators B and D (ov) are thus both block-diagonal, the first in position space and the latter in momentum space. In our approach we use a Fast Fourier Transform (FFT) [28] to switch between the position and momentum representations, such that all operator applications can be trivially performed due to their actual block-diagonal structure. This is particularly advantageous for the overlap operator, since the usual construction of this operator would be based on very demanding approximations, e.g.…”
Section: Jhep10(2007)001mentioning
confidence: 99%
“…2. To calculate the direct and inverse Fourier transforms we are using Python wrapper for FFTW3 library [23,24]. User can specify output frequency band, in this case all coefficients, corresponding to frequencies lower than user-selected lower bound are filled with zeroes, frequencies higher than upper-bound are truncated.…”
Section: Inverse Problem Solutionmentioning
confidence: 99%