z-logo
Premium
A semi‐implicit time‐stepping model for frictional compliant contact problems
Author(s) -
Song Peng,
Pang JongShi,
Kumar Vijay
Publication year - 2004
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1049
Subject(s) - linear complementarity problem , time stepping , unilateral contact , viscoelasticity , contact force , stiffness , contact dynamics , computer science , mathematics , finite element method , discretization , mathematical optimization , mathematical analysis , classical mechanics , nonlinear system , engineering , structural engineering , physics , quantum mechanics , thermodynamics
In this paper, we formulate a semi‐implicit time‐stepping model for multibody mechanical systems with frictional, distributed compliant contacts. Employing a polyhedral pyramid model for the friction law and a distributed, linear, viscoelastic model for the contact, we obtain mixed linear complementarity formulations for the discrete‐time, compliant contact problem. We establish the existence and finite multiplicity of solutions, demonstrating that such solutions can be computed by Lemke's algorithm. In addition, we obtain limiting results of the model as the contact stiffness tends to infinity. The limit analysis elucidates the convergence of the dynamic models with compliance to the corresponding dynamic models with rigid contacts within the computational time‐stepping framework. Finally, we report numerical simulation results with an example of a planar mechanical system with a frictional contact that is modelled using a distributed, linear viscoelastic model and Coulomb's frictional law, verifying empirically that the solution trajectories converge to those obtained by the more traditional rigid‐body dynamic model. Copyright © 2004 John Wiley Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here