Requirements
Requirements
(A) Interpolation condition. Takes a unit value at node i , and is zero at all other nodes.
Requirements
(B) Local support condition. Vanishes over any element boundary (a side in 2D, a face in 3D) that does not include node i . (C) Interelement compatibility condition. Satisfies C0 continuity between adjacent elements over any element boundary that includes node i . (D) Completeness condition. The interpolation is able to represent exactly any displacement field which is a linear polynomial in x and y; in particular, a constant value. If (C) and (D) are considered together,this case can be called CONSISTENCY.
Requirements
What are the minimum requirements that the finite element shape functions must show so that convergence is assured. Two have been accepted for a long time:
Completeness
In the finite element method, or for that matter,in any approximate method, we are trying to replace an unknown function (x), which is the exact solution to a boundary value problem over a domain enclosed by a boundary by an approximate function (x ) which is constituted from a set of shape or basis functions.
( ) = 1 + 2
1 1 1 1 = 2 1 1 2 1 1 1 1 1 = 2 2 1 1 2
( ) =
1 + 2
2
1 + 2 + 2
1 1+ ( ) = 1 + 2 2 2
1 1+ ( ) = 1 + 2 2 2
( ) = N (1) ( )1 + N (2) ( ) 2
1 N ( ) = , 2
(1)
1+ N ( ) = 2
(2)
(1) = 1 (2) = 1
1+ (n) N ( ) = , 2
(n)
n = 1,2
QuadrilateralElements
HigherOrderRectangularElements Morenodes;still2translationald.o.f.pernode. Higherorder higherdegreeofcompletepolynomial containedindisplacementapproximations. Twogeneralfamilies ofsuchelements:
Serendipity
Lagrangian
QuadrilateralElements
Lagrangian Elements:
Ordern elementhas(n+1)2 nodesarrangedinsquare symmetricpattern requiresinternalnodes.
QuadrilateralElements
Lagrangian ShapeFunctions:
Usesaprocedurethatautomatically satisfiesthe Kronecker deltapropertyforshapefunctions.
Consider1Dexampleof6points;wantfunction=1at and 3 = 0.3 function=0atotherdesignatedpoints:
0 = 1; 1 = .75; 2 = .2; 3 = .3; 4 = .6; 5 = 1.
L(5) ( ) = 3
QuadrilateralElements
Lagrangian ShapeFunctions:
Canperformthisforany numberofpointsatany designatedlocations.
L
(m) k
( 0 ) ( 1 )L ( k 1 )( k +1 )L ( m ) = m ( i ) . ( ) = ( k 0 )( k 1 )L ( k k 1 )( k k +1 )L ( k m ) ( k i ) i =0
ik
No -k term!
QuadrilateralElements
NotesonLagrangian Elements: Onceshapefunctionshavebeenidentified,thereareno proceduraldifferencesintheformulationofhigherorder quadrilateralelementsandthebilinearquad. PascalstrianglefortheLagrangian quadrilateralelements:
3x3
nxn
QuadrilateralElements
SerendipityElements:
Ingeneral,onlyboundarynodes avoidsinternalones.
QuadrilateralElements
SerendipityShapeFunctions:
Shapefunctionsformidsidenodes areproductsofan nthorderpolynomialparallel tosideandalinearfunction perpendicular totheside.
E.g.,quadraticserendipityelement:
N6 =
1 2
(1 + ) (1 2 ) ; N 7 = 1 (1 2 ) (1 + ) . 2
QuadrilateralElements
Shapefunctionsforcornernodes aremodifications ofthe shapefunctionsofthebilinearquad.
Step#1:startwithappropriatebilinearquadshapefunction,N.1 Step#2:subtractoutmidsideshapefunctionN5withappropriate weight N1 ( node #5 ) = 1 2 Step#3:repeatStep#2usingmidsideshapefunctionN8 andweight( node #8 ) = N1
1 2
Nk =
1 4
(1 + k )(1 + k )( k + k 1) ; k = 1, 2,3, 4.
QuadrilateralElements
NotesonSerendipityElements:
Onceshapefunctionshavebeenidentified,thereareno proceduraldifferencesintheformulationofhigherorder quadrilateralelementsandthebilinearquad. Pascalstrianglefortheserendipityquadrilateralelements:
3x3
mxm
1D Shape Function
( ,) = 1 + 2 + 3 + 4 ( ) = 1 + 2
( ,) = 1 + 2 + 3 + 4
1 1 1 2 = 1 3 4 1 1 1 1 1 1 1 1 2 1 1 1 3 1 1 1 4 1 1 1 2 1 3 1 4
1 1 1 1 2 1 1 1 1 = 4 1 1 1 3 1 1 1 4
( ,) = 1 + 2 + 3 + 4
1 1 1 1 1 1 2 1 1 1 1 1 2 = 4 1 1 1 1 3 3 1 1 1 1 4 4
( ,) = 1 + 2 + 3 + 4
4 1 + 2 + 3 4 1 2 + 3 + 4 1 2 + 3 4 + + + 4 4 4
1 + 1+ 1+ + + 1 + ( ,) = + + + 1 2 3 4 4 4 4 4
1 + 1+ 1+ + + 1 + ( ,) = + + + 1 2 3 4 4 4 4 4
Triangular Elements
Isoparametric Representation for Triangular Elements
Triangular Elements
From the diagram below, it is easy to see that points near nodes 2 and 3 will not move as far as points near node 1 when the triangle deforms. We will assume the deformation is linear and we will compute it with areas. The area of a triangle is;
Triangular Elements
The interior point divides the triangle into 3 regions. All 3 nodal points may move and the motion of the interior point is some combination of their displacement. Let A1, A2, and A3 be the areas of each of triangular regions and A the total area of the element. We can see from the diagram that;
Triangular Elements
The shape functions are not independent of one another because:
Knowing two of the shape functions makes it possible to compute the third. Because of this we can let
Triangular Elements
6 Node Triangle:Shape Function Plots