fft
所属分类:数值算法/人工智能
开发工具:C/C++
文件大小:4KB
下载次数:28
上传日期:2008-06-11 21:08:12
上 传 者:
shmily7901
说明: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一,1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn),推进了FFT更深层、更广法的研究与应用。
这是一个傅氏变换的MPI程序,用C语言实现。
(Discrete Fourier Transform of the 20th century 60 s computational complexity is a major milestone in one study, in 1965 Cooley and Tukey studied the calculation of discrete Fourier transform (Discrete Fourier Test) fast Fourier transform (FFT) calculation increased from О (n2) dropped to О (nlogn), the FFT to promote deeper, broader research and application of law. This is a Fourier transform of the MPI process, with C language.)
文件列表:
22-1\dataIn.txt (24, 2003-07-14)
22-1\fft.c (10722, 2003-07-14)
22-1 (0, 2008-05-21)
1. compile:
mpicc fft.c -o fft -lm
2. run:
mpirun -np 4 fft
3. result:
Read from data file "dataIn.txt"
p(t) = 1.000000 + 3.000000t^1 + 3.000000t^2 + 1.000000t^3
q(t) = 1.000000t^1 + 2.000000t^2 + 1.000000t^3
After FFT r(t)=p(t)q(t)
r(t) = 1.000000t^1 + 5.000000t^2 + 10.000000t^3 + 10.000000t^4 + 5.000000t^5 + 1.000000t^6
Use prossor size = 4
Total running time = 0.016373(s)
Distribute data time = 0.006959(s)
Parallel compute time = 0.009414(s)
近期下载者:
相关文件:
收藏者: