摘要
提出了一种基于网格生成递归法的并行区域划分算法，该算法依据网格生成代价的估算分析，采用迭代分解法对区域进行并行划分．在曙光１０００Ａ系统上的运行结果表明。
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.
出处
《华中理工大学学报》
CSCD
北大核心
1999年第7期6-8,共3页
Journal of Huazhong University of Science and Technology
基金
国家高性能计算基金
关键词
有限元网络
区域划分算法
网格生成代价
finite element
parallel domain splitting algorithm
grid generation
expense
iterative decomposition algorithm
