Sliding constraint

MPC type SLIDER keeps a node on a straight line defined by two other nodes but allows the possibility of moving along the line and allows the line to change length.

See Also
In Other Guides
Using MPC Type SLIDER

ProductsAbaqus/StandardAbaqus/Explicit

The sliding constraint has a variety of uses. For example, this MPC is used in conjunction with other MPC types to constrain a shell element mesh to a solid element mesh. The MPC maintains consistency with standard shell theory by forcing initially straight lines through the thickness to remain straight despite rotation and displacement. When applied to solid element nodes on the shell-solid interface, this MPC enforces a kinematic approximation of compatibility with the shell model.

The theory of this constraint is as follows:

Let P1, Pn be the points defining the line; and let Pm be the node that must lie on this line. The direction of the line is given by

n=(xn-x1)/l,

where

l=[(xn-x1)(xn-x1)]12.

Let i,    j,    k be base vectors in the x-, y-, z-directions in the global coordinate system. Then, define a unit vector normal to the line as

t1=n×i|n×i|

unless n=i(n2=n3=0), in which case we use

t1=n×k|n×k|.

Now we can define an orthogonal normal as

t2=n×t1.

t1,t2, and n now form a set of orthonormal base vectors with t1 and t2 normal to the line joining P1 and Pn. The constraint can be imposed by the condition that the line joining the node m to node 1 be perpendicular to t1 and t2; that is,

(xm-x1)t1=0

and

(xm-x1)t2=0.

We now choose a local coordinate numbering system such that i is the global direction on which t1 has its largest projection:

|ti1|>|tj1| and |ti1||tk1|, where ji,ki.

Likewise, we choose global direction j such that ji and

|tj2|>|tk2|,  where jk.

Using this definition of i,j,k the constraint conditions can be written explicitly in terms of coordinate components of node m as

ximti1+xjmtj1+xkmtk1=x1t1

and

ximti2+xjmtj2+xkmtk2=x1t2.

These equations can be used to eliminate xim,    xjm (note that the numbering of i,j,k avoids dividing through by zero in this elimination):

xim[ti1tj2-ti2tj1]=x(t1tj2-t2tj1)-xkm(tk1tj2-tk2tj1)

and

xjm[ti1tj2-tj1ti2]=x(t2ti1-t1tj1)-xkm(tk1ti2-tk2ti1).

The above equations will enforce the desired constraint. We also need the derivatives of these constraints. These are

(dxm-dx1)t1+(xm-x1)dt1=0

and

(dxm-dx1)t2+(xm-x1)dt2=0,

where

dt1=(-t1dn)n

and

dt2=(-t2dn)n.

These equations reduce to

(dxm-dx1)t1-(xm-x1)nt1dn=0

and

(dxm-dx1)t2-(xm-x1)nt2dn=0.

dn can be obtained from the definition of n to give

dn=1l(i-nn)(dxn-dx1),

and, therefore,

t1dn=(t1/l)(dxn-dx1)

and

t2dn=(t2/l)(dxn-dx1).

The incremental constraint equations become

dxmt1-dx1t1-(xm-x1)n(t1/l)(dxn-dx1)=0

and

dxmt2-dx1t1-(xm-x1)n(t2/l)(dxn-dx1)=0.

Let P=1/l(xm-x1)n. Then, the above equations, when written out in full with the same ordering of i,j,k used above, are

dximti1+dxjmtj1+dxkmtk1-Pdxnt1-(1-P)dx1t1=0

and

dximti2+dxjmtj2+dxkmtk2-Pdxnt2-(1-P)dx1t2=0.

Solving for dxim,dxjm we obtain

dxim(ti1tj2-ti2tj1)+dxkm(tk1tj2-tk2tj1)+-Pdxn(t1tj2-t2tj1)-(1-P)dx1(t1tj2-t2tj1)=0

and

dxjm(tj2ti1-tj1ti2)+dxkm(tk2ti1-tk1ti2)+-Pdxm(t2ti1-t1ti2)-(1-P)dx1(t2ti1-t1ti2)=0.

In the two-dimensional case n lies in the xy or rz plane and t2=(0,0,-1). This implies that the second constraint equation is satisfied automatically. The remaining constraint equation is

ximti1=x1t1-xkmtk1,

and its derivative is

dximti1+dxkmtk1-Pdxnt1-(1-P)dx1t1=0.