摘要
In this paper, we propose a fast algorithm for computing the Discrete Generalized Fourier Transforms on parallel dodecahedron domains with 3 dimensions and 4 directions. Our fast algorithm (HFFT) reduces the computation complexity of DGFT from O(N^6) to O(N^3log N). A parallel implementation is given and it has been run on a Linux Cluster up to 32 CPUs.
In this paper, we propose a fast algorithm for computing the Discrete Generalized Fourier Transforms on parallel dodecahedron domains with 3 dimensions and 4 directions. Our fast algorithm (HFFT) reduces the computation complexity of DGFT from O(N6) to O(N3 log N). A parallel implementation is given and it has been run on a Linux Cluster up to 32 CPUs.
出处
《数值计算与计算机应用》
CSCD
北大核心
2004年第4期303-314,共12页
Journal on Numerical Methods and Computer Applications
基金
国家基金委项目(60173021)中科院"超级计算环境建设与应用"项目(INF105-SCE-02-05)资助.
