A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction

Authors:
S. Hüeber;G. Stadler;B. I. Wohlmuth
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2008

Citing 0
Cited 6

Uzawa block relaxation method for the unilateral contact problem

Journal of Computational and Applied Mathematics
Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints

Computational Optimization and Applications
Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction

Journal of Computational and Applied Mathematics
Directional Sparsity in Optimal Control of Partial Differential Equations

SIAM Journal on Control and Optimization
An abstract framework for a priori estimates for contact problems in 3D with quadratic finite elements

Computational Mechanics
A domain decomposition method for two-body contact problems with Tresca friction

Advances in Computational Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, efficient algorithms for contact problems with Tresca and Coulomb friction in three dimensions are presented and analyzed. The numerical approximation is based on mortar methods for nonconforming meshes with dual Lagrange multipliers. Using a nonsmooth complementarity function for the three-dimensional friction conditions, a primal-dual active set algorithm is derived. The method determines active contact and friction nodes and, at the same time, resolves the additional nonlinearity originating from sliding nodes. No regularization and no penalization are applied, and superlinear convergence can be observed locally. In combination with a multigrid method, it defines a robust and fast strategy for contact problems with Tresca or Coulomb friction. The efficiency and flexibility of the method is illustrated by several numerical examples.