07 March 2020 08:08:04 AM

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.002764     1.382e-07       72.3589
             4     10000   1.20984e-16      0.003123    1.5615e-07       256.164
             8     10000    6.8208e-17       0.00551     2.755e-07       435.572
            16     10000   1.43867e-16      0.012327    6.1635e-07       519.186
            32      1000   1.33121e-16      0.002256     1.128e-06        709.22
            64      1000   1.77654e-16      0.005219    2.6095e-06       735.773
           128      1000   1.92904e-16      0.011391    5.6955e-06       786.586
           256      1000   2.09232e-16       0.02583    1.2915e-05       792.877
           512       100   1.92749e-16      0.005163    2.5815e-05       892.504
          1024       100   2.30861e-16      0.012034     6.017e-05       850.922
          2048       100   2.44762e-16      0.025221   0.000126105       893.224
          4096       100   2.47978e-16      0.058419   0.000292095        841.37
          8192        10   2.57809e-16      0.012124     0.0006062        878.39
         16384        10   2.73399e-16      0.026973    0.00134865       850.391
         32768        10   2.92301e-16      0.055687    0.00278435       882.648
         65536        10   2.82993e-16      0.122496     0.0061248       856.008
        131072         1   3.14967e-16      0.024934      0.012467       893.649
        262144         1    3.2186e-16      0.056033     0.0280165       842.109
        524288         1   3.28137e-16       0.12065      0.060325        825.65
       1048576         1    3.2859e-16      0.247993      0.123997        845.65

FFT_SERIAL:
  Normal end of execution.

07 March 2020 08:08:06 AM