有限元网格自动生成的并行区域划分算法  

A Domain Splitting Algorithm for Parallel Grid Generation

作　　者：呙嘉妮[1] 胡久乡[1] 卢正鼎[1] 

机构地区：[1]华中理工大学计算机科学与技术学院

出　　处：《华中理工大学学报》1999年第7期6-8,共3页Journal of Huazhong University of Science and Technology

基　　金：国家高性能计算基金

摘　　要：提出了一种基于网格生成递归法的并行区域划分算法，该算法依据网格生成代价的估算分析，采用迭代分解法对区域进行并行划分．在曙光１０００Ａ系统上的运行结果表明。Based on recursive grid generation methods, a domain splitting algorithm for parallel grid generation is proposed. With this algorithm, the domain is decomposed iteratively according to continuous evaluation and analysis of the grid generation expense within the sub domains. The experimental results obtained show that the parallel algorithm has much shorter runtime than the corresponding serial algorithm.

关 键 词：有限元网络 区域划分算法 网格生成代价 

分 类 号：O242.21[理学—计算数学]