【摘要】：接觸搜索是接觸-碰撞問題有限元模擬中最為耗時(shí)的部分,高效的接觸搜索算法是提高數(shù)值分析效率的關(guān)鍵。以面心坐標(biāo)和特征長(zhǎng)度表征接觸主片,并引入樹包圍盒和從節(jié)點(diǎn)包圍盒的概念,基于八叉樹算法發(fā)展了一種高效的全局接觸搜索方法,計(jì)算復(fù)雜度為O(Nlog8M),其中N為從節(jié)點(diǎn)數(shù),M為接觸主片數(shù)。程序?qū)崿F(xiàn)時(shí),通過引入接觸預(yù)搜索和相鄰搜索方式加速搜索速度。本文算法基于PANDA-Impact軟件實(shí)現(xiàn),并進(jìn)行了算例驗(yàn)證分析。結(jié)果表明,本文算法具有很好的接觸搜索效率與適用性,與桶排序算法相比,當(dāng)接觸復(fù)雜且規(guī)模較大時(shí),本文算法表現(xiàn)出較大的優(yōu)勢(shì)。
[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.
【作者單位】： 中國(guó)工程物理研究院總體工程研究所;中國(guó)工程物理研究院高性能數(shù)值模擬軟件中心;
【基金】：國(guó)防基礎(chǔ)科研計(jì)劃(C1520110002) 科技部高性能計(jì)算重大專項(xiàng)(2016YFB0201004)資助項(xiàng)目
【分類號(hào)】：TB115

【相似文獻(xiàn)】

相關(guān)期刊論文 前4條

1 吳沛鋒;高立群;周翔;趙冬力;;自適應(yīng)和聲搜索算法在結(jié)構(gòu)工程設(shè)計(jì)中的應(yīng)用[J];儀器儀表學(xué)報(bào);2012年07期

2 李亮;遲世春;林皋;;混沌和聲搜索算法及其在土坡局部安全系數(shù)法中的應(yīng)用[J];巖石力學(xué)與工程學(xué)報(bào);2006年S1期

3 王愛明,李艾華;超聲波壓力檢測(cè)中回波搜索算法[J];機(jī)床與液壓;2003年05期

4 ;[J];;年期

相關(guān)碩士學(xué)位論文 前2條

1 朱航;基于改進(jìn)和聲搜索算法的車間作業(yè)調(diào)度問題研究[D];南京理工大學(xué);2015年

2 耿慶東;公共面搜索算法改進(jìn)及三維顆粒體生成算法[D];大連理工大學(xué);2009年

，

本文編號(hào)：2380537