2004
DOI: 10.1016/j.cam.2003.06.002
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for the numerical realization of 3D contact problems with Coulomb friction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0
1

Year Published

2004
2004
2021
2021

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 39 publications
(32 citation statements)
references
References 9 publications
0
31
0
1
Order By: Relevance
“…Finally we introduce full rank matrices N and T 1 , T 2 ∈ R mc×3nc projecting displacements at contact nodes to normal and tangential directions, respectively, and we denote B = B d , B g , N , T 1 , T 2 ∈ R m d +mg +3mc×3nc . For more details about this model problem, we refer to [5].…”
Section: Model Contact Problem With Coulomb Frictionmentioning
confidence: 99%
“…Finally we introduce full rank matrices N and T 1 , T 2 ∈ R mc×3nc projecting displacements at contact nodes to normal and tangential directions, respectively, and we denote B = B d , B g , N , T 1 , T 2 ∈ R m d +mg +3mc×3nc . For more details about this model problem, we refer to [5].…”
Section: Model Contact Problem With Coulomb Frictionmentioning
confidence: 99%
“…we formally obtain the same situation as in 2D contact problems. The discretized version of (6.3) together with the augmented Lagrangian formulation has been used in (see [15]) for the numerical realization of 3D contact problems with friction, including Coulomb's model of friction. The previous numerical method has a drawback, too, namely the number of variables is now equal to N × q, where N is the number of squares and q = dim L H .…”
Section: Numerical Realizationmentioning
confidence: 99%
“…If a given friction (Tresca's model) has to be considered, a non-differentiable term appears in the inequality, making the approximate solution more complicated. A remedy can be a mixed variational formulation of the problem which employs Lagrange multipliers ( [8], [9], [10], [11], [12], [17], [2]). …”
Section: Introductionmentioning
confidence: 99%