In this paper, we propose a fast algorithm for computing the DGFT (Discrete Generalized Fourier Transforms) on hexagon domains [6], based on the geometric properties of the domain. Our fast algorithm (FDGFT) reduces t...
详细信息
In this paper, we propose a fast algorithm for computing the DGFT (Discrete Generalized Fourier Transforms) on hexagon domains [6], based on the geometric properties of the domain. Our fast algorithm (FDGFT) reduces the computation complexity of DGFT from O(N4) to O(N2 log N). In particulary, for N =2^P23^P34^P45^P56^P6, the floating point computation working amount equals to(17/2P2 + 16p3 + 135/8p4 + 2424/25p5 + 201/2P6)3N^2. Numerical examples are given to access our analysis.
In this paper, we propose a new set of orthogonal basis functions in the arbitrarytriangular domain. At first, we generalize the 1-D Sturm-Liouville equation tothe arbitrary triangular domain on a barycentric coordina...
详细信息
In this paper, we propose a new set of orthogonal basis functions in the arbitrarytriangular domain. At first, we generalize the 1-D Sturm-Liouville equation tothe arbitrary triangular domain on a barycentric coordinate, and derive a set ofcomplete orthogonal basis functions on this domain. Secondly, we analyze thesymmetry and periodicity property of these functions and classify them into fourclasses. At last, we show some of the visualization results of these basis functions.
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 computati...
详细信息
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.
用户如何方便有效地使用网格是网格界面和使用模式研究的一个关键问题,用户3A使用网格,即Anytime,Any place,and on Any device,体现了用户对网格使用的基本需求.本文给出了用户3A使用模式的形式定义,并利用ASM(Abstract State Machine...
详细信息
用户如何方便有效地使用网格是网格界面和使用模式研究的一个关键问题,用户3A使用网格,即Anytime,Any place,and on Any device,体现了用户对网格使用的基本需求.本文给出了用户3A使用模式的形式定义,并利用ASM(Abstract State Machine)对用户和服务网格(USG)进行了形式化建模,最后证明了用户和服务网格系统在满足用户合法性s、ession连通性和服务连续性的情况下,用户可以3A使用服务网格.
暂无评论