.png){kind=icon}
返回
A parallel algorithm for unilateral contact problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.compstruc.2022.106862.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce a novel parallel contact algorithm designed to run efficiently in High Performance Computing based supercomputers. Particular emphasis is put on its computational implementation in a multiphysics finite element code. The algorithm is based on the method of partial Dirichlet-Neumann boundary conditions and is capable to solve numerically a nonlinear contact problem between rigid and deformable bodies in a whole parallel framework. Its distinctive characteristic is that the contact is tackled as a coupled problem, in which the contacting bodies are treated separately, in a staggered way. Then, the coupling is performed through the exchange of boundary conditions at the contact interface following a Gauss-Seidel strategy. To validate this algorithm we conducted several benchmark tests by comparing the proposed solution against theoretical and other numerical solutions. Finally, we evaluated the parallel performance of the proposed algorithm in a real impact test to show its capabilities for large-scale applications. (C) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Contact mechanics
Dirichlet-Neumann boundary conditions
Finite element method
High performance computing
Domain decomposition approach
期刊
C
IF:
4.8
论文数:
6.2K
被引数:
1.7W
机构
引用论文
Identification and SAR of selective inducible nitric oxide synthase (iNOS) dimerization inhibitors
PREAI
分享收藏Endoplasmic reticulum aminopeptidase 1 (ERAP1) polymorphisms and psoriasis susceptibility: A systematic review and meta-analysis.png)
Gene
GeneIF0
PREAI
分享收藏
分享收藏分享收藏
查看更多内容