ASCL Code Record
[ascl:2407.014]
PFFT: Parallel fast Fourier transforms
PFFT computes massively parallel, fast Fourier transformations on distributed memory architectures. PFFT can be understood as a generalization of FFTW-MPI (ascl:1201.015) to multidimensional data decomposition; in fact, using PFFT is very similar to FFTW. The library is written in C and MPI; a Fortran interface is also available.
- Code site:
- https://github.com/mpip/pfft
- Used in:
- https://ui.adsabs.harvard.edu/abs/2021A%2526C....3700505M
- Described in:
- https://ui.adsabs.harvard.edu/abs/2013SJSC...35C.213P
- Bibcode:
- 2024ascl.soft07014P
Preferred citation method:
Views: 405
