The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
P3DFFT: A Framework for Parallel Computations of Fourier Transforms in Three Dimensions
Open accessAbstract
Fourier and related transforms are a family of algorithms widely employed in diverse areas of computational science, notoriously difficult to scale on high-performance parallel computers with a large number of processing elements (cores). This paper introduces a popular software package called P3DFFT which implements fast Fourier transforms (FFTs) in three dimensions in a highly efficient and scalable way. It overcomes a well-known scalability bottleneck of three-dimensional (3D) FFT implementations by using two-dimensional domain decomposition. Designed for portable performance, P3DFFT achieves excellent timings for a number of systems and problem sizes. On a Cray XT5 system P3DFFT attains 45% efficiency in weak scaling from 128 to 65,536 computational cores. Library features include Fourier and Chebyshev transforms, Fortran and C interfaces, in- and out-of-place transforms, uneven data grids, and single and double precision. P3DFFT is available as open source at http://code.google.com/p/p3dfft/. This paper discusses P3DFFT implementation and performance in a way that helps guide the user in making optimal choices for parameters of their runs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
A hybrid MPI–OpenMP scheme for scalable parallel pseudospectral computations for fluid turbulence
Mininni, P. D., Rosenberg, D., Reddy, R., & Pouquet, A. G. (2011) · Parallel Computing · doi:10.1016/j.parco.2011.05.004 · Cited by 252
Bridging from Eulerian to Lagrangian statistics in 3D hydro- and magnetohydrodynamic turbulent flows
Homann, H., Kamps, O., Friedrich, R., & Grauer, R. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/7/073020 · Cited by 37
Chandy, A. J., & Frankel, S. H. (2009) · Journal of Turbulence · doi:10.1080/14685240902998215 · Cited by 22
Cited by
A review of predictive nonlinear theories for multiscale modeling of heterogeneous materials
Matouš, K., Geers, M. G. D., Kouznetsova, V. G., & Gillman, A. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.10.070 · Cited by 493
Metadata
- Authors
- Pekurovsky, D.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2012-01
- Volume
- 34
- Issue
- 4
- Pages
- C192-C209
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1979796968
- Cited by
- 255
- References
- 5
- FWCI
- 26.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: P3DFFT: A Framework for Parallel Computations of Fourier Transforms in Three Dimensions. https://app.cochat.ai/papers/10.1137/11082748x
- The paper
- Pekurovsky, D. (2012). P3DFFT: A Framework for Parallel Computations of Fourier Transforms in Three Dimensions. SIAM Journal on Scientific Computing. https://doi.org/10.1137/11082748x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.