Pages From 30.fundamentals of Finite Element Analysis-5
Pages From 30.fundamentals of Finite Element Analysis-5
remains that each independent variable must be of equal “strength” in the poly-
nomial. For example, the 3-D quadratic polynomial
P (x , y, z) = a0 + a1 x + a2 y + a3 z + a4 x 2 + a5 y 2 + a6 z 2
+ a7 x y + a8 x z + a9 yz (6.29)
is complete and could be applied to an element having 10 nodes. Similarly, an
incomplete, symmetric form such as
P (x , y, z) = a0 + a1 x + a2 y + a3 z + a4 x 2 + a5 y 2 + a6 z 2 (6.30)
or
P (x , y, z) = a0 + a1 x + a2 y + a3 z + a4 x y + a5 x z + a6 yz (6.31)
could be used for elements having seven nodal degrees of freedom (an unlikely
case, however).
Geometric isotropy is not an absolute requirement for field variable
repesentation [1], hence, interpolation functions. As demonstrated by many
researchers, incomplete representations are quite often used and solution conver-
gence attained. However, in terms of h-refinement, use of geometrically isotropic
representations guarantees satisfaction of the compatibility and completeness
requirements. For the p-refinement method, the reader is reminded that the inter-
polation functions in any finite element analysis solution are approximations to
the power series expansion of the problem solution. As we increase the number
of element nodes, the order of the interpolation functions increases and, in the
limit, as the number of nodes approaches infinity, the polynomial expression of
the field variable approaches the power series expansion of the solution.
3 (x3, y3)
y
2 (x2, y2)
x 1 (x1, y1)
1
a1 = [1 ( y2 − y3 ) + 2 ( y3 − y1 ) + 3 ( y1 − y2 )]
2A
(6.35)
1
a2 = [1 (x 3 − x 2 ) + 2 (x 1 − x 3 ) + 3 (x 2 − x 1 )]
2A
Substituting the values into Equation 6.32 and collecting coefficients of the nodal
variables, we obtain
[(x2 y3 − x3 y2 ) + ( y2 − y3 )x + (x3 − x2 ) y]1
1
(x, y) = + [(x3 y1 − x1 y3 ) + ( y3 − y1 )x + (x1 − x3 ) y]2 (6.36)
2A
+ [(x1 y2 − x2 y1 ) + ( y1 − y2 )x + (x2 − x1 ) y]3
Given the form of Equation 6.36, the interpolation functions are observed to be
1
N 1 (x , y) = [(x 2 y3 − x 3 y2 ) + ( y2 − y3 )x + (x 3 − x 2 ) y]
2A
1
N 2 (x , y) = [(x 3 y1 − x 1 y3 ) + ( y3 − y1 )x + (x 1 − x 3 ) y] (6.37)
2A
1
N 3 (x , y) = [(x 1 y2 − x 2 y1 ) + ( y1 − y2 )x + (x 2 − x 1 ) y]
2A
where A is the area of the triangular element. Given the coordinates of the three
vertices of a triangle, it can be shown that the area is given by
1 1 x1 y1
A= 1 x2 y2 (6.38)
2 1 x3 y3
3 (x3, y3)
A2 A1
A3
2
Figure 6.10 Areas used to define area
1 coordinates for a triangular element.
L1 ⫽ 0
3 3
1
L1 ⫽
2
P⬘
L1 ⫽ 1
P
2 2
1 1
(a) (b)
Figure 6.11
(a) Area A1 associated with either P or P is constant.
(b) Lines of the constant area coordinate L1.
where A is the total area of the triangle. Clearly, the area coordinates are not
independent, since
L1 + L2 + L3 = 1 (6.41)
The dependency is to be expected, since Equation 6.40 expresses the location of
a point in two-dimensions using three coordinates.
The important properties of area coordinates for application to triangular
finite elements are now examined with reference to Figure 6.11. In Figure 6.11a,
a dashed line parallel to the side defined by nodes 2 and 3 is indicated. For any
two points P and P on this line, the areas of the triangles formed by nodes 2 and
3 and either P or P are identical. This is because the base and height of any tri-
angle so formed are constants. Further, as the dashed line is moved closer to node
1, area A 1 increases linearly and has value A 1 = A , when evaluated at node 1.
Therefore, area coordinate L 1 is constant on any line parallel to the side of the tri-
angle opposite node 1 and varies linearly from a value of unity at node 1 to value
of zero along the side defined by nodes 2 and 3, as depicted in Figure 6.11b. Sim-
ilar arguments can be made for the behavior of L 2 and L 3 . These observations
Hutton: Fundamentals of 6. Interpolation Functions Text © The McGraw−Hill
Finite Element Analysis for General Element Companies, 2004
Formulation
can be used to write the following conditions satisfied by the area coordinates
when evaluated at the nodes:
Node 1: L 1 = 1 L2 = L3 = 0
Node 2: L 2 = 1 L1 = L3 = 0 (6.42)
Node 3: L 3 = 1 L1 = L2 = 0
The conditions expressed by Equation 6.42 are exactly the conditions that
must be satisfied by interpolation functions at the nodes of the triangular ele-
ment. So, we express the field variable as
(x , y) = L 1 1 + L 2 2 + L 3 3 (6.43)
in terms of area coordinates. Is this different from the field variable representa-
tion of Equation 6.36? If the area coordinates are expressed explicitly in terms
of the nodal coordinates, the two field variable representations are shown to be
identical. The true advantages of area coordinates are seen more readily in
developing interpolation functions for higher-order elements and performing
integration of various forms of the interpolation functions.
L1 ⫽ 0 L2 ⫽ 0
3
3 L3 ⫽ 1
1
1 L2 ⫽
L1 ⫽ 2
2
1
5 L3 ⫽
6 6 5 2
L2 ⫽ 1
L1 ⫽ 1
L3 ⫽ 0
2 2
1 4 1 4
(a) (b)
As usual, each interpolation function must be such that its value is unity when
evaluated at its associated node and zero when evaluated at any of the other five
nodes. Further, each interpolation is a quadratic function, since the field variable
representation is quadratic.
Figure 6.12b shows the six-node element with lines of constant values of the
area coordinates passing through the nodes. Using this figure and a bit of logic,
the interpolation functions are easily “constructed” in area coordinates. For
example, interpolation function N 1 (x , y) = N 1 ( L 1 , L 2 , L 3 ) must have value of
zero at nodes 2, 3, 4, 5, and 6. Noting that L 1 = 1/2 at nodes 4 and 6, inclusion
of the term L 1 − 1/2 ensures a zero value at those two nodes. Similarly, L 1 = 0
at nodes 2, 3, 4, so the term L 1 satisfies the conditions at those three nodes.
Therefore, we propose
1
N1 = L 1 L 1 − (6.46)
2
However, evaluation of Equation 6.46 at node 1, where L 1 = 1 , results in
N 1 = 1/2 . As N 1 must be unity at node 1, Equation 6.46 is modified to
1
N 1 = 2L 1 L 1 − = L 1 (2L 1 − 1) (6.47a)
2
which satisfies the required conditions at each of the six nodes and is a quadratic
function, since L 1 is a linear function of x and y.
Applying the required nodal conditions to the remaining five interpolation
functions in turn, we obtain
N 2 = L 2 (2L 2 − 1) (6.47b)
N 3 = L 3 (2L 3 − 1) (6.47c)
N 4 = 4L 1 L 2 (6.47d)
N 5 = 4L 2 L 3 (6.47e)
N 6 = 4L 1 L 3 (6.47f)
Using a similarly straightforward procedure, interpolation functions for addi-
tional higher-order triangular elements can be constructed. The 10-node cubic
element is left as an exercise.
has been shown [7] to be valid for all exponents a, b, c that are positive integers
(recall 0! = 1 ). Therefore, integration in area coordinates is quite straight-
forward.
EXAMPLE 6.2
As will be shown in Chapter 7, the convection terms of the stiffness matrix for a 2-D heat
transfer element are of the form
ki j = h Ni N j d A
A
where h is the convection coefficient and A is element area. Use the interpolation func-
tions for a six-node triangular element given by Equation 6.47 to compute k 24 .
■ Solution
Using Equation 6.47b and 6.47d, we have
N 2 = L 2 (2L 2 − 1)
N 4 = 4L 1 L 2
so (assuming h is a constant)
k 24 = h L 2 (2L 2 − 1)4L 1 L 2 d A = h 8L 1 L 32 − 4L 1 L 22 d A
A A
Therefore,
2h A 2h A
k 24 = − =0
15 15