Počet záznamů: 1
Assessment of methods for computing the closest point projection, penetration, and gap functions in contact searching problems
- 1.
SYSNO ASEP 0451288 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název Assessment of methods for computing the closest point projection, penetration, and gap functions in contact searching problems Tvůrce(i) Kopačka, Ján (UT-L) RID, ORCID
Gabriel, Dušan (UT-L) RID, ORCID
Plešek, Jiří (UT-L) RID, ORCID, SAI
Ulbin, M. (SI)Celkový počet autorů 4 Zdroj.dok. International Journal for Numerical Methods in Engineering. - : Wiley - ISSN 0029-5981
Roč. 105, č. 11 (2016), s. 803-833Poč.str. 34 s. Forma vydání Tištěná - P Jazyk dok. eng - angličtina Země vyd. GB - Velká Británie Klíč. slova closest point projection ; local contact search ; quadratic elements ; Newtons methods ; geometric iteration methods ; simplex method Vědní obor RIV JC - Počítačový hardware a software CEP GAP101/12/2315 GA ČR - Grantová agentura ČR ME10114 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy Institucionální podpora UT-L - RVO:61388998 UT WOS 000370063500001 EID SCOPUS 84945296632 DOI 10.1002/nme.4994 Anotace 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. Pracoviště Ústav termomechaniky Kontakt Marie Kajprová, kajprova@it.cas.cz, Tel.: 266 053 154 ; Jana Lahovská, jaja@it.cas.cz, Tel.: 266 053 823 Rok sběru 2017
Počet záznamů: 1