15 April 2020 07:37:38 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.002708     1.354e-07       73.8552
             4     10000   1.20984e-16      0.003014     1.507e-07       265.428
             8     10000    6.8208e-17      0.005518     2.759e-07        434.94
            16     10000   1.43867e-16      0.012435    6.2175e-07       514.676
            32      1000   1.33121e-16       0.00229     1.145e-06        698.69
            64      1000   1.77654e-16      0.005438     2.719e-06       706.142
           128      1000   1.92904e-16      0.010687    5.3435e-06       838.402
           256      1000   2.09232e-16       0.02498     1.249e-05       819.856
           512       100   1.92749e-16      0.005126     2.563e-05       898.947
          1024       100   2.30861e-16      0.011939    5.9695e-05       857.693
          2048       100   2.44762e-16      0.025357   0.000126785       888.433
          4096       100   2.47978e-16      0.057716    0.00028858       851.618
          8192        10   2.57809e-16      0.012118     0.0006059       878.825
         16384        10   2.73399e-16      0.026909    0.00134545       852.414
         32768        10   2.92301e-16      0.055794     0.0027897       880.955
         65536        10   2.82993e-16      0.122601    0.00613005       855.275
        131072         1   3.14967e-16      0.025385     0.0126925       877.772
        262144         1    3.2186e-16      0.057018      0.028509       827.562
        524288         1   3.28137e-16      0.117082      0.058541       850.812
       1048576         1    3.2859e-16      0.252697      0.126348       829.908

FFT_SERIAL:
  Normal end of execution.

15 April 2020 07:37:40 PM