 ### Docu update.

parent 2c142a3d
 ... ... @@ -9,18 +9,19 @@ @BeginDescription The fourier operator performs the fourier transformation or the inverse fourier transformation of all input fields. If the number of grid cells is a power of 2 then the algorithm of the Fast Fourier Transformation (FFT) is used. If the number of timesteps is a power of 2 then the algorithm of the Fast Fourier Transformation (FFT) is used. It is @IfMan @EndifMan @IfDoc It is @BeginDisplayMath o(t,x) = \frac{1}{\sqrt{n}} \sum\limits_{j=0}^{n-1} i(t,x) e^{\epsilon 2 \pi i j} @EndDisplayMath where a user given @math{epsilon=-1} leads to the forward transformation and a user given @math{epsilon = 1} leads to the backward transformation. @EndifDoc If the input stream @file{infile} consists only of complex fields, then the fields of @file{outfile}, computed by @BeginVerbatim cdo -f ext fourier,1 -fourier,-1 infile outfile ... ...
 ... ... @@ -4472,9 +4472,9 @@ static const std::vector FourierHelp = { "", "DESCRIPTION", " The fourier operator performs the fourier transformation or the inverse fourier transformation of all input fields.", " If the number of grid cells is a power of 2 then the algorithm of the Fast Fourier Transformation (FFT) is used.", " If the number of timesteps is a power of 2 then the algorithm of the Fast Fourier Transformation (FFT) is used.", " ", " ", " It is", " If the input stream infile consists only of complex fields, then the fields of outfile, computed by", " cdo -f ext fourier,1 -fourier,-1 infile outfile", " are the same than that of infile. For real input files see function retocomplex.", ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!