19 August 2018 05:19:14 PM

FFT_SERIAL
  C++ version

  Demonstrate an implementation of the Fast Fourier Transform
  of a complex data vector.

  Accuracy check:

    FFT ( FFT ( X(1:N) ) ) == N * X(1:N)

             N      NITS    Error         Time          Time/Call     MFLOPS

             2     10000   7.85908e-17      0.001438      7.19e-08       139.082
             4     10000   1.20984e-16      0.003203    1.6015e-07       249.766
             8     10000    6.8208e-17      0.006092     3.046e-07       393.959
            16     10000   1.43867e-16      0.015041    7.5205e-07       425.504
            32      1000   1.33121e-16      0.003242     1.621e-06       493.523
            64      1000   1.77654e-16      0.007447    3.7235e-06       515.644
           128      1000   1.92904e-16      0.014375    7.1875e-06       623.304
           256      1000   2.09232e-16      0.033523   1.67615e-05       610.924
           512       100   1.92749e-16       0.00717     3.585e-05       642.678
          1024       100   2.30861e-16      0.016453    8.2265e-05       622.379
          2048       100   2.44762e-16      0.034821   0.000174105       646.966
          4096       100   2.47978e-16      0.078172    0.00039086       628.767
          8192        10   2.57809e-16      0.016418     0.0008209       648.654
         16384        10   2.73399e-16        0.0362       0.00181       633.635
         32768        10   2.92301e-16      0.075436     0.0037718       651.572
         65536        10   2.82993e-16      0.164176     0.0082088        638.69
        131072         1   3.14967e-16      0.034179     0.0170895       651.928
        262144         1    3.2186e-16      0.074401     0.0372005       634.211
        524288         1   3.28137e-16      0.155412      0.077706       640.972
       1048576         1    3.2859e-16      0.331179       0.16559       633.238

FFT_SERIAL:
  Normal end of execution.

19 August 2018 05:19:16 PM