有限元并行计算中网格自动区域划分的研究
ON AUTOMATIC MESH GENERATION IN PARALLEL FINITE ELEMENT ANALYSIS
-
摘要: 本文针对集群系统下大规模并行有限元分析,设计了简单实用的网格自动区域划分算法,以使并行计算时减少由于负载不均衡所引起的效率下降,并应用于“汽车碰撞模拟”项目中的车架模型的分割。重点讨论并改进了贪婪算法和ANP算法,并比较了两种算法各自的特点及其适用性。通过数值算例证明,对于不同类型的有限元网格都得到了满意的结果,本文的算法具有广泛的适用性。且对该算法稍加改进,则可应用于各类动态并行计算问题所提出的动态负载均衡要求。Abstract: This paper presents an automatic mesh generation method for large-scale parallel finite element analysis in the cluster system. The method is used to prevent parallel efficiency from decreasing caused by imbalance of different subdomains in parallel computation. It has been applied to the partition of a car frame model. The Greedy algorithm and ANP algorithm are discussed and compared around respective character and performance. And also detailed flowchart for algorithms are given. Numerical examples show that this method can give satisfactory results for different elements and therefore has extensive applicability. Without much modification, this method can be used in the dynamic load balancing resulting from various dynamic parallel computing problems.