Subroutine library for computing the Discrete Fourier Transform
C subroutine library for computing the Discrete Fourier Transform in one or more dimensions, of both real and complex data, and of arbitrary input size. The FFTW team's benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. However, FFTW appears to be the fastest program most of the time for in-order transforms, especially in the multi-dimensional and real-complex cases.
DocumentationThe doc/ directory contains the manual in texinfo, PDF, info, and HTML formats.
released on 15 January 2017
|License||Verified by||Verified on||Notes|
|License:GPLv2orlater||Genium||22 January 2017|
Leaders and contributors
|Steven G. Johnson||Maintainer|
Resources and communication
This entry (in part or in whole) was last reviewed on 13 February 2018.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.