The Dual Domain Decomposition Parallel Contact Algorithm in CHAP3D Code

Abstract eng:
CHAP3D code is a three-dimensional Lagrangian program developed by IAPCM. The parallel contact algorithm used in this program for the Clusters of Multi-Processors computers is introduced in this paper. The dual domain decomposition method is applied and two methods of the contact surfaces decomposition are provided in this parallel contact algorithm. One is to distribute a whole contact surface to a processor and the other is to divide the master surface into each processor. In each processor, the contact search methods are adopted to determine whether and where the nodes are contact with a surface segment, and the distributed parameter method and penalty method are optional to calculate the contact constrains. The numerical example illustrates that CHAP3D has the ability to simulate the different types of contact problems such as contact with sliding only interfaces, sliding with closure and separation interfaces, contact with tied interfaces and self-contact. THE

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket