23 March     2009  11:38:29.877 AM      
 
FFT
  FORTRAN77 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    Error         Time              MFLOPS
 
             2    0.7859E-16    0.1139E-05     8.780    
             4    0.1210E-15    0.2378E-05     16.82    
             8    0.6821E-16    0.3848E-05     31.18    
            16    0.1031E-15    0.6854E-05     46.69    
            32    0.1497E-15    0.8687E-05     92.10    
            64    0.1803E-15    0.1891E-04     101.5    
           128    0.1845E-15    0.3598E-04     124.5    
           256    0.1994E-15    0.8210E-04     124.7    
           512    0.1989E-15    0.1631E-03     141.3    
          1024    0.2426E-15    0.3752E-03     136.5    
          2048    0.2533E-15    0.7623E-03     147.8    
          4096    0.2646E-15    0.1719E-02     142.9    
          8192    0.2633E-15    0.3468E-02     153.5    
         16384    0.2802E-15    0.8289E-02     138.4    
         32768    0.3017E-15    0.1859E-01     132.2    
         65536    0.2909E-15    0.4145E-01     126.5    
        131072    0.3160E-15    0.8584E-01     129.8    
 
FFT:
  Normal end of execution.
 
23 March     2009  11:38:33.275 AM