Difference between revisions of "BFFFT"
(updates) |
(No version changes) |
||
Line 3: | Line 3: | ||
|Short description=Fortran 90 2D Vectorized Fast Fourier Transform | |Short description=Fortran 90 2D Vectorized Fast Fourier Transform | ||
|Full description=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. | |Full description=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. | ||
+ | |Homepage URL=http://romo661.free.fr/bffft.html | ||
|User level=none | |User level=none | ||
− | |||
− | |||
− | |||
− | |||
|Computer languages=Fortran 90 | |Computer languages=Fortran 90 | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
|Keywords=mathematics,fft,Fourier,Transform | |Keywords=mathematics,fft,Fourier,Transform | ||
− | | | + | |Version identifier=1.0 |
− | |Last review by= | + | |Version status=stable |
− | |Last review date= | + | |Version download=http://romo661.free.fr/bffft.f90 |
+ | |Version comment=NO_VERSION_DATE_FOUND | ||
+ | |Last review by=Alejandroindependiente | ||
+ | |Last review date=2017/03/07 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
− | | | + | |Status= |
− | | | + | |Is GNU=No |
− | | | + | |License verified date=2006-08-23 |
− | | | + | }} |
+ | {{Project license | ||
+ | |License=GPLv2orlater | ||
+ | |License verified by=Ted Teah | ||
|License verified date=2006-08-23 | |License verified date=2006-08-23 | ||
− | |||
}} | }} | ||
{{Person | {{Person | ||
+ | |Real name=Nicolas Riesz | ||
|Role=Maintainer | |Role=Maintainer | ||
− | |||
|Email=cacou661@free.fr | |Email=cacou661@free.fr | ||
|Resource URL= | |Resource URL= | ||
}} | }} | ||
{{Person | {{Person | ||
+ | |Real name=Paul Swarztrauber | ||
|Role=Contributor | |Role=Contributor | ||
− | |||
− | |||
|Resource URL= | |Resource URL= | ||
}} | }} | ||
Line 49: | Line 44: | ||
|Software-development=programming-language | |Software-development=programming-language | ||
|Use=software-development | |Use=software-development | ||
− | |||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Software prerequisite | {{Software prerequisite | ||
Line 59: | Line 49: | ||
|Prerequisite description=OFFT | |Prerequisite description=OFFT | ||
}} | }} | ||
+ | {{Featured}} |
Latest revision as of 13:15, 7 March 2017
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
Leaders and contributors
Contact(s) | Role |
---|---|
Nicolas Riesz | Maintainer |
Paul Swarztrauber | Contributor |
Resources and communication
Audience | Resource type | URI |
---|---|---|
Bug Tracking,Developer,Help,Support | mailto:cacou661@free.fr |
Software prerequisites
Kind | Description |
---|---|
Required to use | OFFT |
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.