Journal
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING
Volume 105, Issue 11, Pages 803-833Publisher
WILEY
DOI: 10.1002/nme.4994
Keywords
closest point projection; local contact search; quadratic elements; Newtons methods; geometric iteration methods; simplex method
Funding
- GACR [GAP101/12/2315]
- MEYS [ME10114]
Ask authors/readers for more resources
In computational contact mechanics problems, local searching requires calculation of the closest point projection of a contactor point onto a given target segment. It is generally supposed that the contact boundary is locally described by a convex region. However, because this assumption is not valid for a general curved segment of a three-dimensional quadratic serendipity element, an iterative numerical procedure may not converge to the nearest local minimum. To this end, several unconstrained optimization methods are tested: the Newton-Raphson method, the least square projection, the sphere and torus approximation method, the steepest descent method, the Broyden method, the Broyden-Fletcher-Goldfarb-Shanno method, and the simplex method. The effectiveness and robustness of these methods are tested by means of a proposed benchmark problem. It is concluded that the Newton-Raphson method in conjunction with the simplex method significantly increases the robustness of the local contact search procedure of pure penalty contact methods, whereas the torus approximation method can be recommended for contact searching algorithms, which employ the Lagrange method or the augmented Lagrangian method. Copyright (c) 2015 John Wiley & Sons, Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available