A scalable FETI-DP algorithm for a coercive variational inequality
Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003
Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003
A mortar based contact formulation for non-linear dynamics using dual Lagrange multipliers
Finite Elements in Analysis and Design
Time-Space FE-PDAS Method for Dynamic Unilateral Contact Problem in Viscoelasticity
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface
Journal of Computational and Applied Mathematics
Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003
A scalable FETI-DP algorithm for a coercive variational inequality
Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003
A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
Journal of Computational and Applied Mathematics
A Sign Preserving Mixed Finite Element Approximation for Contact Problems
International Journal of Applied Mathematics and Computer Science - Issues in Advanced Control and Diagnosis
A scalable TFETI based algorithm for 2d and 3d frictionless contact problems
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Presentation and comparison of selected algorithms for dynamic contact based on the Newmark scheme
Applied Numerical Mathematics
A finite element method for contact using a third medium
Computational Mechanics
Hi-index | 0.00 |
Nonconforming domain decomposition techniques provide a powerful tool for the numerical approximation of partial differential equations. We use a generalized mortar method based on dual Lagrange multipliers for the discretization of a nonlinear contact problem between linear elastic bodies. In the case of unilateral contact problems, pointwise constraints occur and monotone multigrid methods yield efficient iterative solvers. Here, we generalize these techniques to nonmatching triangulations, where the constraints are realized in terms of weak integral conditions. The basic new idea is the construction of a nested sequence of nonconforming constrained spaces. We use suitable basis transformations and a multiplicative correction. In contrast to other approaches, no outer iteration scheme is required. The resulting monotone method is of optimal complexity and can be implemented as a multigrid method. Numerical results illustrate the performance of our approach in two and three dimensions.