Mathematical foundation of the master-slave elimination for arbitrary nonlinear multi-point constraints

Nonlinear multi-point constraints are essential in modeling various engineering problems, for example, joints undergoing large rotations or coupling of different element types in finite element analysis. They can be handled using Lagrange multipliers, the penalty method, or master-slave elimination. The latter satisfies the constraints exactly and reduces the dimension of the resulting system of equations, which is particularly advantageous when a large number of constraints have to be considered. However, the existing schemes in literature are limited to linear constraints. Therefore, the authors introduced an extension of the method to arbitrary nonlinear constraints. A mathematically rigorous derivation of this new method is presented. The starting point is the optimization problem with constraints. It is transformed into a modified optimization problem without constraints using the implicit function theorem. For this, an appropriate selection of slave degrees of freedom (dofs) is crucial, ensuring that the Jacobian constraints meets specific conditions. This implies the consideration of three aspects: The handling of redundant constraints, the automatic selection of slave dofs, and the change of slave dofs in the context of large deformations. Additionally, it allows for the combination of the new method with existing constraint methods.

Publication Details

Journal
Universitätsbibliothek Kassel
Published
2024-11-14
DOI
https://doi.org/10.17170/kobra-2025011010802
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mathematical foundation of the master-slave elimination for arbitrary nonlinear multi-point constraints

Universitätsbibliothek Kassel
Advanced Optimization Algorithms Research
article

Mathematical foundation of the master-slave elimination for arbitrary nonlinear multi-point constraints

article en

Abstract

Nonlinear multi-point constraints are essential in modeling various engineering problems, for example, joints undergoing large rotations or coupling of different element types in finite element analysis. They can be handled using Lagrange multipliers, the penalty method, or master-slave elimination. The latter satisfies the constraints exactly and reduces the dimension of the resulting system of equations, which is particularly advantageous when a large number of constraints have to be considered. However, the existing schemes in literature are limited to linear constraints. Therefore, the authors introduced an extension of the method to arbitrary nonlinear constraints. A mathematically rigorous derivation of this new method is presented. The starting point is the optimization problem with constraints. It is transformed into a modified optimization problem without constraints using the implicit function theorem. For this, an appropriate selection of slave degrees of freedom (dofs) is crucial, ensuring that the Jacobian constraints meets specific conditions. This implies the consideration of three aspects: The handling of redundant constraints, the automatic selection of slave dofs, and the change of slave dofs in the context of large deformations. Additionally, it allows for the combination of the new method with existing constraint methods.

Universitätsbibliothek Kassel
Peace, Justice and strong institutions
Openalex Percentile: Top 53%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.