A Contact Searching Algorithm Utilizing Integration Points
Price
Free (open access)
Transaction
Volume
14
Pages
9
Published
1997
Size
686 kb
Paper DOI
10.2495/CON970181
Copyright
WIT Press
Author(s)
Dusan Gabriel, Jiri Plesek, Jin Dobias
Abstract
The essential part of the solution in the context of the finite element method is to locate possible contact areas reliably and efficiently. Most contact searching algorithms are based on the definition of a master and a slave contact surface. The searching process consists in checking contact nodes on the slave boundary against contact segments on the target boundary. The contact effects are accounted at discrete nodes. The unknown nodal forces are usually taken as primary unknowns. The main drawback of this undeniably simple and robust conception is the necessity of paying special attention to situations in which the nodes are near edges but don't lie within the contact territory of any segment. A new contact searching scheme is proposed in which the conta
Keywords