7 October 2025 1:08:26.128 PM fft_openmp(): Fortran77/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. The number of processors = 8 The number of threads = 1 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 0.785908E-16 0.9892E-02 0.4946E-06 20.22 4 10000 0.120984E-15 0.1982E-01 0.9908E-06 40.37 8 10000 0.682080E-16 0.2973E-01 0.1487E-05 80.73 16 10000 0.143867E-15 0.4507E-01 0.2254E-05 142.0 32 1000 0.133121E-15 0.6545E-02 0.3272E-05 244.5 64 1000 0.177654E-15 0.1128E-01 0.5638E-05 340.5 128 1000 0.192904E-15 0.1761E-01 0.8803E-05 508.9 256 1000 0.209232E-15 0.3539E-01 0.1769E-04 578.7 512 100 0.192749E-15 0.6325E-02 0.3162E-04 728.6 1024 100 0.231209E-15 0.1418E-01 0.7091E-04 722.1 2048 100 0.244501E-15 0.2810E-01 0.1405E-03 801.6 4096 100 0.247659E-15 0.6320E-01 0.3160E-03 777.7 8192 10 0.257125E-15 0.1309E-01 0.6547E-03 813.3 16384 10 0.273630E-15 0.3023E-01 0.1511E-02 758.8 32768 10 0.292413E-15 0.5923E-01 0.2961E-02 829.9 65536 10 0.283355E-15 0.1294 0.6472E-02 810.1 131072 1 0.314231E-15 0.2689E-01 0.1345E-01 828.6 fft_openmp(): Normal end of execution. 7 October 2025 1:08:26.765 PM 7 October 2025 1:08:26.767 PM fft_openmp(): Fortran77/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. The number of processors = 8 The number of threads = 2 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 0.785908E-16 0.1632E-01 0.8162E-06 12.25 4 10000 0.120984E-15 0.3577E-01 0.1789E-05 22.36 8 10000 0.682080E-16 0.5375E-01 0.2687E-05 44.65 16 10000 0.143867E-15 0.7562E-01 0.3781E-05 84.63 32 1000 0.133121E-15 0.9851E-02 0.4926E-05 162.4 64 1000 0.177654E-15 0.1364E-01 0.6822E-05 281.4 128 1000 0.192904E-15 0.1882E-01 0.9411E-05 476.1 256 1000 0.209232E-15 0.3159E-01 0.1579E-04 648.4 512 100 0.192749E-15 0.4728E-02 0.2364E-04 974.6 1024 100 0.231209E-15 0.9713E-02 0.4857E-04 1054. 2048 100 0.244501E-15 0.1779E-01 0.8894E-04 1266. 4096 100 0.247659E-15 0.3971E-01 0.1986E-03 1238. 8192 10 0.257125E-15 0.7447E-02 0.3723E-03 1430. 16384 10 0.273630E-15 0.1710E-01 0.8551E-03 1341. 32768 10 0.292413E-15 0.3308E-01 0.1654E-02 1486. 65536 10 0.283355E-15 0.7555E-01 0.3778E-02 1388. 131072 1 0.314231E-15 0.1662E-01 0.8312E-02 1340. fft_openmp(): Normal end of execution. 7 October 2025 1:08:27.315 PM 7 October 2025 1:08:27.317 PM fft_openmp(): Fortran77/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. The number of processors = 8 The number of threads = 4 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 0.785908E-16 0.1903E-01 0.9515E-06 10.51 4 10000 0.120984E-15 0.3725E-01 0.1862E-05 21.48 8 10000 0.682080E-16 0.5838E-01 0.2919E-05 41.11 16 10000 0.143867E-15 0.8073E-01 0.4036E-05 79.28 32 1000 0.133121E-15 0.1051E-01 0.5255E-05 152.2 64 1000 0.177654E-15 0.1404E-01 0.7020E-05 273.5 128 1000 0.192904E-15 0.1814E-01 0.9069E-05 494.0 256 1000 0.209232E-15 0.2785E-01 0.1392E-04 735.5 512 100 0.192749E-15 0.3845E-02 0.1923E-04 1198. 1024 100 0.231209E-15 0.7333E-02 0.3666E-04 1396. 2048 100 0.244501E-15 0.1160E-01 0.5801E-04 1942. 4096 100 0.247659E-15 0.2658E-01 0.1329E-03 1850. 8192 10 0.257125E-15 0.4648E-02 0.2324E-03 2291. 16384 10 0.273630E-15 0.1095E-01 0.5475E-03 2095. 32768 10 0.292413E-15 0.1983E-01 0.9915E-03 2479. 65536 10 0.283355E-15 0.4676E-01 0.2338E-02 2243. 131072 1 0.314231E-15 0.8779E-02 0.4389E-02 2538. fft_openmp(): Normal end of execution. 7 October 2025 1:08:27.778 PM