计算物理 ›› 2011, Vol. 28 ›› Issue (3): 341-346.

• 研究论文 • 上一篇    下一篇

显式有限元中的一种并行接触算法

白小勇1, 何颖波2, 陈成军1   

  1. 1. 中国工程物理研究院总体工程所, 四川 绵阳 621900;
    2. 中国工程物理研究院机关, 四川 绵阳 621900
  • 收稿日期:2010-03-08 修回日期:2010-11-02 出版日期:2011-05-25 发布日期:2011-05-25
  • 作者简介:白小勇(1985-),男,湖北洪湖,硕士生,主要从事有限元并行算法及程序开发的研究,四川省绵阳市919信箱401分箱621900,E-mail:baixiaoyong@gmail.com
  • 基金资助:
    中物院2007预先研究重大项目(ZDXM-03)资助项目

A Parallel Contact Detection Algorithm for Explicit Finite Element Analysis

BAI Xiaoyong1, HE Yingbo2, CHEN Chengjun1   

  1. 1. Institute of Structural Mechanics, China Academy of Engineering Physics, Mianyang 621900, China;
    2. China Academy of Engineering Physics, Mianyang 621900, China
  • Received:2010-03-08 Revised:2010-11-02 Online:2011-05-25 Published:2011-05-25

摘要: 开发一种显式非线性有限元分析中的并行接触算法.基于区域分割技术将桶排序全局搜索方法并行化,各处理器通过桶编号向量检测相互交叠及潜在的点-面接触对.根据数据通信的特点将接触对分为三类,对各类接触对分别设计通信策略.数值算例表明,并行算法具有较高的加速比、并行效率及良好的可扩展性.

关键词: 显式有限元, 区域分割, 并行接触, 桶排序

Abstract: A parallel contact detection algorithm for explicit finite element analysis is introduced.A parallel bucket sort algorithm is developed with domain decomposition and message passing.Contacts can occur between surfaces that own by two arbitrary computational nodes.Potential contact pairs are sorted into three categories according to communication requirements.It is shown that the parallel algorithm achieves high speedup and efficiency.

Key words: parallel contact detection, domain decomposition, explicit finite element, bucket sort

中图分类号: