Skip to content

Module: fourier

Description Usage
tools for performing a 2D fast fourier transform of a function on a grid
Authors: Edoardo Baldi and Gareth Tribello used in 0 tutorialsused in 1 eggs

Details

The action in this module takes a function on a two-dimensional grid as input and computes a fourier transform upon the input function using FFTW. Currently, this actions performs a complex fourier transition even if the input data is real. The functionality here was developed and used in the paper cited below.

Actions

The following actions are part of this module

Name Description Tags
FOURIER_TRANSFORM Compute the Discrete Fourier Transform (DFT) by means of FFTW of data stored on a 2D grid. GRIDANALYSIS

References

More information about this module is available in the following articles: