next up previous contents
Next: Computing your first transform Up: NFFT 3.0 - Tutorial Previous: Inversion and solver module   Contents


Examples

The library was tested on a AMD Athlon(tm) XP 2700+, 1GB memory, SuSe-Linux, kernel 2.4.20-4GB-athlon, gcc version 3.3. In all tests with random input the nodes $ \ensuremath{\boldsymbol{x}}_j$ and the Fourier coefficients $ \hat f_{\ensuremath{\boldsymbol{k}}}$ are chosen pseudo randomly with $ \ensuremath{\boldsymbol{x}}_j \in
[-0.5,0.5]^d$ and $ \hat f_{\ensuremath{\boldsymbol{k}}} \in [0,1] \times [0,1]{\rm i}$ .



Subsections

Jens Keiner 2006-11-20