A Contact Searching Algorithm Utilizing Integration Points

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...

Full description

Saved in:
Bibliographic Details
Published in:WIT Transactions on Engineering Sciences 1997-01, Vol.14
Main Authors: Gabriel, Dusan, Plesek, Jiri, Dobias, Jin
Format: Article
Language:English
Subjects:
Finite element method
Nodes
Search algorithms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1746-4471
1743-3533
DOI:10.2495/CON970181