does anyone ever used rlft3 code in NR?# Computation - 科学计算
f*d
1 楼
I am trying to do a multidimensional Fourier transform using the code rlft3
in Numerical Recipes. The code runs.
However, the explanation in the book is very confusing,
I could not figure out how the components are stored in the multi-dim case.
If someone has used this code before, could you help me?
In particular, for the simple test case of a constant function, I expect the
fourier transform has only one non-vanishing term, i.e. in 2d, i=1, j=1 which
corresponds to kx=ky=0 should be finite, ot
in Numerical Recipes. The code runs.
However, the explanation in the book is very confusing,
I could not figure out how the components are stored in the multi-dim case.
If someone has used this code before, could you help me?
In particular, for the simple test case of a constant function, I expect the
fourier transform has only one non-vanishing term, i.e. in 2d, i=1, j=1 which
corresponds to kx=ky=0 should be finite, ot