BFFFT

From Free Software Directory
 
Jump to: navigation, search

[edit]

BFFFT

http://romo661.free.fr/bffft.html
Fortran 90 2D Vectorized Fast Fourier Transform

Using a simple array as input, a 2-dimensional Fast Fourier Transform consists of two one-dimensional FFTs performed (for instance) on each line first, and on each column next. An important limitation in FFT computer applications dealing with large arrays is the fact that the algorithm is not well suited to parallelization, due to the huge amount of data that has to be transfered between computers. Since the transfers are proportional to the number of operations, network time soon becomes prominent when the number of processors is high. This program uses vectorization as an alternative to parallelization methods.





Licensing

License

Verified by

Verified on

Notes

Verified by

Ted Teah

Verified on

23 August 2006




Leaders and contributors

Contact(s)Role
Nicolas Riesz Maintainer
Paul Swarztrauber Contributor


Resources and communication

AudienceResource typeURI
Bug Tracking,Developer,Help,SupportE-mailmailto:cacou661@free.fr


Software prerequisites

KindDescription
Required to useOFFT

This entry (in part or in whole) was last reviewed on 7 March 2017.



Entry





























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.