基于八叉树的全局接触搜索算法研究
发布时间：2018-12-15 11:13
【摘要】：接触搜索是接触-碰撞问题有限元模拟中最为耗时的部分,高效的接触搜索算法是提高数值分析效率的关键。以面心坐标和特征长度表征接触主片,并引入树包围盒和从节点包围盒的概念,基于八叉树算法发展了一种高效的全局接触搜索方法,计算复杂度为O(Nlog8M),其中N为从节点数,M为接触主片数。程序实现时,通过引入接触预搜索和相邻搜索方式加速搜索速度。本文算法基于PANDA-Impact软件实现,并进行了算例验证分析。结果表明,本文算法具有很好的接触搜索效率与适用性,与桶排序算法相比,当接触复杂且规模较大时,本文算法表现出较大的优势。
[Abstract]:Contact search is the most time-consuming part in the finite element simulation of contact-collision problem, and an efficient contact search algorithm is the key to improve the efficiency of numerical analysis. Based on the concept of tree bounding box and slave node bounding box, an efficient global contact search method based on octree algorithm is developed. The computational complexity is O (Nlog8M). Where N is the number of slave nodes and M is the number of main contact plates. When the program is implemented, contact pre-search and adjacent search are introduced to speed up the search speed. The algorithm is implemented based on PANDA-Impact software, and an example is given to verify the algorithm. The results show that the proposed algorithm has good contact search efficiency and applicability. Compared with bucket sorting algorithm, when the contact is complex and the scale is large, the proposed algorithm has a great advantage.
【作者单位】： 中国工程物理研究院总体工程研究所;中国工程物理研究院高性能数值模拟软件中心;
【基金】：国防基础科研计划(C1520110002) 科技部高性能计算重大专项(2016YFB0201004)资助项目
【分类号】：TB115
本文编号：2380537
[Abstract]:Contact search is the most time-consuming part in the finite element simulation of contact-collision problem, and an efficient contact search algorithm is the key to improve the efficiency of numerical analysis. Based on the concept of tree bounding box and slave node bounding box, an efficient global contact search method based on octree algorithm is developed. The computational complexity is O (Nlog8M). Where N is the number of slave nodes and M is the number of main contact plates. When the program is implemented, contact pre-search and adjacent search are introduced to speed up the search speed. The algorithm is implemented based on PANDA-Impact software, and an example is given to verify the algorithm. The results show that the proposed algorithm has good contact search efficiency and applicability. Compared with bucket sorting algorithm, when the contact is complex and the scale is large, the proposed algorithm has a great advantage.
【作者单位】： 中国工程物理研究院总体工程研究所;中国工程物理研究院高性能数值模拟软件中心;
【基金】：国防基础科研计划(C1520110002) 科技部高性能计算重大专项(2016YFB0201004)资助项目
【分类号】：TB115
【相似文献】
相关期刊论文 前4条
1 吴沛锋;高立群;周翔;赵冬力;;自适应和声搜索算法在结构工程设计中的应用[J];仪器仪表学报;2012年07期
2 李亮;迟世春;林皋;;混沌和声搜索算法及其在土坡局部安全系数法中的应用[J];岩石力学与工程学报;2006年S1期
3 王爱明,李艾华;超声波压力检测中回波搜索算法[J];机床与液压;2003年05期
4 ;[J];;年期
相关硕士学位论文 前2条
1 朱航;基于改进和声搜索算法的车间作业调度问题研究[D];南京理工大学;2015年
2 耿庆东;公共面搜索算法改进及三维颗粒体生成算法[D];大连理工大学;2009年
，本文编号：2380537
本文链接：https://www.wllwen.com/guanlilunwen/gongchengguanli/2380537.html
