A unified contact algorithm based on the territory concept
暂无分享,去创建一个
Abstract A unified contact algorithm based on the territory concept is described. This contact algorithm treats general contact interfaces in explicit finite element analysis. Systematic formulation of the problem is given. Contact segments from all potential contact boundaries are treated as a single set. The concept of hierarchy territory and contact territory are used to facilitate efficient searching procedures. To reduce the frequency of global searching, the hierarchy territory is expanded. A three-dimensional bucket sort algorithm is used to find test pairs efficiently. Pre-contact and post-contact searchign procedures are distinguished. The calculation of contact forces is performed with the defence node algorithm, which is based on the Lagrange multiplier method. Thus, it does not demand any algorithmic parameter, nor affects the numerical stability of the explicit solution procedure. Numerical results show that this contact algorithm is reliable and efficient.
[1] R. Taylor,et al. Lagrange constraints for transient finite element surface contact , 1991 .
[2] Z. Zhong. Finite Element Procedures for Contact-Impact Problems , 1993 .
[3] L. Nilsson,et al. A contact searching algorithm for general 3-D contact-impact problems , 1990 .
[4] Larsgunnar Nilsson,et al. Analysis of shell structures subjected to contact-impact , 1989 .
[5] Ted Belytschko,et al. The splitting pinball method for contact-impact problems , 1993 .