基于Akhras-Dhatt算法的区域剖分法  

Research of Domain Decomposition Method Based on Akhras-Dhatt Algorithm

作　　者：王如云[1] 于音弦 臧振涛 曹迪[1] 陈林[2] 

机构地区：[1]河海大学港口海岸与近海工程学院,江苏南京210098 [2]河海大学力学与材料学院,江苏南京210098

出　　处：《江南大学学报（自然科学版）》2015年第2期202-208,共7页Joural of Jiangnan University (Natural Science Edition)　

基　　金：中央高校基本科研业务费专项项目(2014B06314)

摘　　要：研究确定了网格单元邻接矩阵带宽与并行计算效率间的关系,得到了可以通过减小单元邻接矩阵的带宽,以减小外部通信量,从而达到提高并行计算效率的目的。为了提高并行计算效率,基于Akhras-Dhatt(AD)算法思想,通过引进类似节点商的单元商对单元编号进行优化,使得矩阵带宽减小,从而设计了一种减小单元邻接矩阵带宽的AD算法。进一步基于减小矩阵带宽的AD算法,提出一种区域剖分算法。利用此区域剖分算法,对全球海域无结构网格中的部分区域进行区域剖分研究,结果表明该算法能得到很好的加速比与并行效率,计算耗时相对较短,证实利用该方法对大规模网格区域进行分裂具有可行性与有效性。The relationship between the grid cell connectivity matrix bandwidth and the efficiency of parallel computing is confirmed, when the bandwidth is reduced, the external communication is reduced and the parallel efficiency is improved. In order to improve the parallel efficiency, based on the AD algorithm, an algorithm is developed for reducing the connectivity matrix bandwidth. This algorithm uses cell ponderation to optimize cell nodes. A domain decomposition method is developed based on this new algorithm. Parts of global ocean unstructured grid are researched based on this method, according to a series of researches, the speedup and efficiency are given. The feasibility and efficacy of the model for large-scale grid domain decomposition are shown.

关 键 词：区域剖分 并行计算 AD算法 无结构网格 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]