# ContactLink3D

(→Initialisation of Contact Partners) |
(→Algorithmic Formulation) |
||

Line 55: | Line 55: | ||

*inner search: for every master facet belonging to this node now a closest point projection is done | *inner search: for every master facet belonging to this node now a closest point projection is done | ||

=== Initialisation of Contact Partners === | === Initialisation of Contact Partners === | ||

− | If a closest point has been found the slave surface and the master surface are stored as a ContactLink3D, e.g. one of the contact pairs where the constraints has to be fulfilled. | + | If a closest point has been found the slave surface and the master surface are stored as a ContactLink3D, e.g. one of the contact pairs where the constraints has to be fulfilled. Where now all the computations to compute the RHS and LHS are done in the ContactLink3D. The Constructor of the ContactLink3D gets the following informations to set up the pair of contact points: |

+ | * NewId: pGeometry, pProperties: The Id of the contact link | ||

+ | * pGeometry: The contact link does not have a special geometry | ||

+ | * pProperties: The model part properties | ||

+ | * Master: A pointer on the master facet | ||

+ | * Slave: A pointer on the slave facet | ||

+ | * MasterContactLocalPoint: The local coordinates of the point on the master surface that is a closest point projection | ||

+ | * SlaveContactLocalPoint: The local coordinates of the quadrature point on the slave surface | ||

+ | * SlaveIntegrationPointIndex: The integration point index of the quadrature point on the slave surface | ||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

=== Uzawa loop === | === Uzawa loop === | ||

=== Inner loop === | === Inner loop === | ||

+ | |||

== Element Formulation == | == Element Formulation == | ||

==References== | ==References== |

## Revision as of 14:45, 2 May 2008

## Contents |

## General description of the condition

This conditions represents the main part of the algorithm to solve contact problems. The algorithm is based on a surface to surface augmented lagrange/updated penalty formulation using a master and a slave contact surface. It is formulated to solve frictional contact problems in structural mechanics, the algorithm is formulated in a finite deformation context.

This condition and the underlying algorithm for contact problems has not been tested by means of a broader range of benchmark examples so far. It seem tio work quite fine for a number of different examples, but I do not give a guarantee that it is free of errors in its formulation or its implementation. |
---|

## Theoretical background of the used formulation

### Formulation without friction

The contact of two (or more) bodies in three dimension is a constrained continuum mechanical problem. The surface of the contacting continua Ω_{1} and Ω_{2} are constructed by the Neumann boundary Γ^{σ}, the Dirichlet
boundary Γ^{u} and the contact boundary Γ^{c}. For the treated area Ω the following assumptions hold:

- and ,

- having the boundaries and , ,

The problem is constrained by the prescription of a penetration of the two bodies, e.g. of the penetration of the master surface Γ^{2} by the slave surface Γ^{1}. This constrained is expressed by the gap function defined as the scalar projection of the distance vector between the point on the slave surface and its closest point projection onto the slave surface and the normal vector ν on the master surface:

The constrained that defines the contact problem is now stated as:

Within the finite element formulation the problem is now solved by use of an updated penalty treatment of the contact constrained. To solve the problem the Energie of the system must be minimised by fulfilling the penetration constraint. After having introduced a contact stress

*t*_{N}= < λ_{N}+ ε_{N}*g*>

that acts on the surfaces if they are in contact the constraint can be rewritten in form of Kuhn-Tucker constraints:

Whereas the contact stress *t*_{N} consists of an (outer) Lagrange value λ_{N}, which is constant during the Newton iteration, and an inner penaltization of the gap ε_{N}*g*.
The updated penalty method now penalizes violation of the constraint, leading to the following potential:

The minimization of the potential is now been done by its variation:

Together with the minimisation of the system energy

the minimisation of the system energie with fulfillment of the penetration constraint can be written as

- δ
*W*= δ*W*^{int,ext}+ δ*W*^{c}= 0

This equation states a initial boundary value problem and can be solved by normal discretization methods in time and space. The algorithm for the solution of the contact problem now consists of an inner iteration (Newton) and an outer iteration (Uzawa):

- start simulation with λ = 0
- Uzawa loop
- Solve by using Newtons loop
- update the Lagrange Multiplier
- next Uzawa iteration

The use of an updated penalty formulation allows to solve the problem exact even by using a (small) penalty value. It therefore combines the strength of the penalty method regarding simplicity with the accuracy of the Lagrange method. Nevertheless to increase the accuracy the penalized problem has to be solved a couple of times.

### Formulation with friction

If now friction does occur between the contacting surfaces a constrained to for the used friction law has to be considered. In case of Coulomb friction this friction law is stated as: . This constrained is now treated in a similar way like it is described above.

## Algorithmic Formulation

### Contact Search

Before the start of the contact simulation a set of possible contact partners is initialised. Therefore for every quadrature point on the slave surface a partner on the master surface is search, e.g. the point on the master surface which is the closest to the slave quadrature point:

- where ν is the normal on the master surface

this search is performed by an outer and an inner search

- outer search: search the node that is closest to the slave quadrature point
- inner search: for every master facet belonging to this node now a closest point projection is done

### Initialisation of Contact Partners

If a closest point has been found the slave surface and the master surface are stored as a ContactLink3D, e.g. one of the contact pairs where the constraints has to be fulfilled. Where now all the computations to compute the RHS and LHS are done in the ContactLink3D. The Constructor of the ContactLink3D gets the following informations to set up the pair of contact points:

- NewId: pGeometry, pProperties: The Id of the contact link
- pGeometry: The contact link does not have a special geometry
- pProperties: The model part properties
- Master: A pointer on the master facet
- Slave: A pointer on the slave facet
- MasterContactLocalPoint: The local coordinates of the point on the master surface that is a closest point projection
- SlaveContactLocalPoint: The local coordinates of the quadrature point on the slave surface
- SlaveIntegrationPointIndex: The integration point index of the quadrature point on the slave surface

### Uzawa loop

### Inner loop

## Element Formulation

## References

- T.A. Laursen
*Computational Contact and Impact Mechanics*, Springer, 2002