FFTΒΆ
| Type: | section |
|---|---|
| Appearance: | optional |
The fast Fourier transform (FFT) is a very fast and efficient algorithm for the computation of discrete Fourier transforms. In presence of a FFT section JCMsuite switches to this algorithm for the computation of the FourierTransform. Although possibly faster, it might not be more efficient in computing the discrete Fourier modes as a number NUpSamplings could be required to reach sufficiently accurate results compared to the default implementation.
Note
This parameter is ignored for aperiodic problems.