Master-slave elimination scheme for arbitrary smooth nonlinear multi-point constraints
| dc.date.accessioned | 2024-11-22T13:16:20Z | |
| dc.date.issued | 2024-05-25 | |
| dc.description.sponsorship | Gefördert im Rahmen des Projekts DEAL | |
| dc.identifier | doi:10.17170/kobra-2024112210707 | |
| dc.identifier.doi | doi:10.1007/s00466-024-02463-7 | |
| dc.identifier.uri | https://kobra.uni-kassel.de/handle/123456789/201810225678 | |
| dc.language.iso | eng | |
| dc.publisher | Universität Kassel | |
| dc.publisher.place | Kassel | |
| dc.relation.doi | doi:10.1007/s00466-024-02463-7 | |
| dc.rights | Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Nonlinear multi-point constraints | eng |
| dc.subject | Master-slave elimination | eng |
| dc.subject | Penalty method | eng |
| dc.subject | Lagrange multiplier | eng |
| dc.subject | Benchmark examples | eng |
| dc.subject.ddc | 620 | |
| dc.subject.swd | Penalty-Methode | ger |
| dc.subject.swd | Lagrange-Multiplikator | ger |
| dc.subject.swd | Benchmark | ger |
| dc.title | Master-slave elimination scheme for arbitrary smooth nonlinear multi-point constraints | |
| dc.type | Aufsatz | |
| dc.type.version | publishedVersion | |
| dcterms.abstract | Nonlinear multi-point constraints are essential in modeling various engineering problems, for example in the context of (a) linking individual degrees of freedom of multiple nodes to model nonlinear joints, (b) coupling different element types in finite element analysis, (c) enforcing various types of rigidity in parts of the mesh and (d) considering deformation-dependent Dirichlet boundary conditions. One method for addressing constraints is the master–slave elimination, which offers the benefit of reducing the problem dimension as opposed to Lagrange multipliers and the penalty method. However, the existingmaster-slave elimination method is limited to linear constraints. In this paper, we introduce a new master–slave elimination method for handling arbitrary smooth nonlinear multi-point constraints in the system of equations of the discretized system. We present a rigorous mathematical derivation of the method. Within this method, new constraints can be easily considered as an item of a “constraint library”; i.e. no case-by-case-programming is required. In addition to the theoretical aspects, we also provide helpful remarks on the efficient implementation. Among others, we show that the new method results in a reduced computational complexity compared to the existing methods. The study also places emphasis on comparing the new approach with existing methods via numerical examples. We have developed innovative benchmarks which encompass all relevant computational properties, and provide analytical and reference solutions. Our findings demonstrate that our new method is as accurate, robust and flexible as the Lagrange multipliers, and more efficient due to the reduction of the total number of degrees of freedom, which is particularly advantageous when a large number of constraints have to be considered. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Boungard, Jonas | |
| dcterms.creator | Wackerfuß, Jens | |
| dcterms.source.identifier | eissn:1432-0924 | |
| dcterms.source.issue | Issue 5 | |
| dcterms.source.journal | Computational Mechanics | |
| dcterms.source.pageinfo | 955-992 | |
| dcterms.source.volume | Volume 74 |