) in front, but to view the archive contents, to browse the individual archive members, to accelerate the download by using higher compressing formats or to study the doxygen generated source code documentation click on the archive filename itself!
) in front, but to view the archive contents, to browse the individual archive members, to accelerate the download by using higher compressing formats or to study the doxygen generated source code documentation click on the archive filename itself!
 | 3.3.6-pl1_vs_3.3.6-pl2 (26 Mar 2017, directory) FFTW is a collection of fast C routines for computing the discrete Fourier transform (DFT) in one or more dimensions. It includes complex, real, symmetric, and parallel transforms, and can handle arbitrary array sizes efficiently. Source code changes report. |
| 3.3.6-pl2_vs_3.3.7 (29 Oct 2017, directory) FFTW is a collection of fast C routines for computing the discrete Fourier transform (DFT) in one or more dimensions. It includes complex, real, symmetric, and parallel transforms, and can handle arbitrary array sizes efficiently. Source code changes report. |
| 3.3.6_vs_3.3.6-pl1 (16 Jan 2017, directory) FFTW is a collection of fast C routines for computing the discrete Fourier transform (DFT) in one or more dimensions. It includes complex, real, symmetric, and parallel transforms, and can handle arbitrary array sizes efficiently. Source code changes report. |
| 3.3.7_vs_3.3.8 (28 May 2018, directory) FFTW is a collection of fast C routines for computing the discrete Fourier transform (DFT) in one or more dimensions. It includes complex, real, symmetric, and parallel transforms, and can handle arbitrary array sizes efficiently. Source code changes report. |
| 3.3.8_vs_3.3.9 (13 Dec 20:16, directory) FFTW is a collection of fast C routines for computing the discrete Fourier transform (DFT) in one or more dimensions. It includes complex, real, symmetric, and parallel transforms, and can handle arbitrary array sizes efficiently. Source code changes report. |