FINITE ELEMENT METHOD

Lesson 7.
FEM FOR 2D SOLIDS
 CONTENTS

 INTRODUCTION
 LINEAR TRIANGULAR ELEMENTS
– Field variable interpolation
– Shape functions construction
– Using area coordinates
– Strain matrix
– Element matrices
 LINEAR RECTANGULAR ELEMENTS
– Shape functions construction
– Strain matrix
– Element matrices
– Gauss integration
– Evaluation of me

FINITE ELEMENT METHOD 2

 CONTENTS

 LINEAR QUADRILATERAL ELEMENTS

– Coordinate mapping
– Strain matrix
– Element matrices
– Remarks
 HIGHER ORDER ELEMENTS
 COMMENTS (GAUSS INTEGRATION)

FINITE ELEMENT METHOD 3

 INTRODUCTION

 2D solid elements are applicable for the analysis of

plane strain and plane stress problems.
 A 2D solid element can have a triangular, rectangular
or quadrilateral shape with straight or curved edges.
 A 2D solid element can deform only in the plane of
the 2D solid.
 At any point, there are two components in the x and
y directions for the displacement as well as forces.

FINITE ELEMENT METHOD 4

 INTRODUCTION

 For plane strain problems, the thickness of the

element is unit, but for plane stress problems, the
actual thickness must be used.
 In this course, it is assumed that the element has a
uniform thickness h.
 Formulating 2D elements with a given variation of
thickness is also straightforward, as the procedure
is the same as that for a uniform element.

FINITE ELEMENT METHOD 5

2D solids – plane stress and plane
strain

y fx

Plane stress Plane strain

FINITE ELEMENT METHOD 6

 LINEAR TRIANGULAR ELEMENTS

 Less accurate than quadrilateral elements

 Used by most mesh generators for complex
geometry
 A linear triangular element:

y, v 3 (x3, y3)
(u3, v3)
fsy
fsx
A
2 (x2, y2)
(u2, v2)
1 (x1, y1)
(u1, v1) x, u

FINITE ELEMENT METHOD 7

Field variable interpolation

U h ( x, y )  N( x, y )d e
 u1  
v   displacements at node 1
 1 
u  
where de   2   displacements at node 2 u(x,y), v(x,y) are independents
 v2  
u3  
   displacements at node 3
 v3  
y, v 3 (x3, y3)
(u3, v3)
 N1 0 N2 0 N3 0
N fsy
0 N1 0 N2 0 N 3  A
fsx

Node 1 Node 2 Node 3 2 (x2, y2)

(u2, v2)
(Shape functions) 1 (x1, y1)
(u1, v1) x, u

FINITE ELEMENT METHOD 8

Shape functions construction

Assume,
N1  a1  b1 x  c1 y N i  ai  bi x  ci y i= 1, 2, 3
N 2  a2  b2 x  c2 y ai 
 
or N i  1 x y  bi   pT 
N 3  a3  b3 x  c3 y c 
pT  i


FINITE ELEMENT METHOD 9

Shape functions construction

Delta function property:

N1 ( x1 , y1 )  1
1 for i  j
Ni ( x j , y j )   N1 ( x2 , y2 )  0
0 for i  j
N1 ( x3 , y3 )  0

Therefore, N1 ( x1 , y1 )  a1  b1 x1  c1 y1  1
N1 ( x2 , y2 )  a1  b1 x2  c1 y2  0
N1 ( x3 , y3 )  a1  b1 x3  c1 y3  0

x2 y3  x3 y2 y2  y3 x3  x2
Solving, a1  , b1  , c1 
2 Ae 2 Ae 2 Ae

FINITE ELEMENT METHOD 10

 Shape functions construction

1 x1 y1
1 1 1
Ae  P  1 x2 y2  [( x2 y3  x3 y2 )  ( y2  y3 ) x1  ( x3  x2 ) y1 ]
2 2 2
1 x3 y3

Area of triangle Moment matrix

Substitute a1, b1 and c1 back into N1 = a1 + b1x + c1y:

1
N1  [( y2  y3 )( x  x2 )  ( x3  x2 )( y  y2 )]
2 Ae

FINITE ELEMENT METHOD 11

Shape functions construction

Similarly,
1
N 2 ( x1 , y1 )  0 N2  [( x3 y1  x1 y3 )  ( y3  y1 ) x  ( x1  x3 ) y ]
2 Ae
N 2 ( x2 , y2 )  1
1
N 2 ( x3 , y3 )  0  [( y3  y1 )( x  x3 )  ( x1  x3 )( y  y3 )]
2 Ae

1
N 3 ( x1 , y1 )  0 N3  [( x1 y2  x1 y1 )  ( y1  y2 ) x  ( x2  x1 ) y ]
2 Ae
N 3 ( x2 , y2 )  0
1
N 3 ( x3 , y3 )  1  [( y1  y2 )( x  x1 )  ( x2  x1 )( y  y1 )]
2 Ae

FINITE ELEMENT METHOD 12

FINITE ELEMENT METHOD 13
Shape functions construction

N i  ai  bi x  ci y
1
where ai  ( x j yk  xk y j ) i= 1, 2, 3
2 Ae
1 j, k determined from cyclic
bi  ( y j  yk ) permutation
2 Ae
i = 1, 2
1 i
ci  ( xk  x j )
2 Ae
k j
k = 3, 1 j = 2, 3

FINITE ELEMENT METHOD 14

 Using area coordinates

 Alternative method of constructing shape functions

1 x y
1 1
 2-3-P: A1  1 x2 y2  [( x2 y3  x3 y2 )  ( y2  y3 ) x  ( x3  x2 ) y ]
2 2
1 x3 y3
A1
y
L1 
k, 3 Ae
A2
Similarly,  3-1-P A2 L2 
Ae
A1 A3
P  1-2-P A3 L3 
Ae
i, 1
j, 2

FINITE ELEMENT METHOD 15

Using area coordinates

Partitions of unity: L1  L2  L3  1

A2 A2 A3 A2  A2  A3
L1  L2  L3     1
Ae Ae Ae Ae

Delta function property: e.g. L1 = 0 at if P at nodes 2 or 3

Therefore, N1  L1 , N 2  L2 , N 3  L3

U h ( x, y )  N( x, y )d e

FINITE ELEMENT METHOD 16

Strain matrix

u  
 xx   0
x  x 
v  
 yy    LU where L   0 
y y 

u v 
 xy   
y x  
 y x 
  LU  LNd e  Bd e
 
 0
 x  b1 0 b2 0 b3 0 
 
B  LN   0 N  B   0 c1 0 c2 0 c3 
y   
 c1 b1 c2 b2 c3 b3 
 
  (constant strain element)
 y x 

FINITE ELEMENT METHOD 17

Element matrices

k e   B cBdV 
Ve
T
 
Ae
h

0 
dz BT cBdA   hBT cBdA
Ae

Constant matrix
 k e  hAe BT cB

h
m e   N NdV 
T
 dzNT NdA   h NT NdA
0
Ve Ae Ae

FINITE ELEMENT METHOD 18

Element matrices

For elements with uniform density and thickness,

 N1 N1 0 N1 N 2 0 N1 N 3 0 
 0 N1 N1 0 N1 N 2 0 N1 N 3 

 N 2 N1 0 N2 N2 0 N 2 N3 0 
me  h    dA
Ae  0 N 2 N1 0 N2 N2 0 N 2 N3 
 N 3 N1 0 N3 N 2 0 N3 N3 0 
 
 0 N 3 N1 0 N3 N 2 0 N 3 N 3 

Eisenberg and Malvern (1973):

m !n ! p !
 A
L1m Ln2 L3p dA 
(m  n  p  2)!
2A

FINITE ELEMENT METHOD 19

Element matrices

2 0 1 0 1 0 3 (x3, y3)
 2 0 1 0 1  y, v
(u3, v3)
  fsy
 hA  2 0 1 0 fsx
me    A
12  2 0 1 2 (x2, y2)
 sy. 2 0
(u2, v2)
  1 (x1, y1)
(u1, v1)
 2 x, u

 f sx 
0
f e   N f b dV   N f S d S =  N
T T T
  dl
2 3 0
 f sy 
Ve Se l
 
1  f sx 
Uniform distributed load: fe  l23  
2  f sy 
 f sx 
 
 f sy 
FINITE ELEMENT METHOD 20
 LINEAR RECTANGULAR ELEMENTS

 Non-constant strain matrix

 More accurate representation of stress and strain
 Regular shape makes formulation easy

FINITE ELEMENT METHOD 21

Shape functions construction

Consider a rectangular element

y, v
 u1   
v   displacements at node 1 4 (x4, y4) 3 (x3, y3)
 1 
(u4, v4) (u3, v3)
u2  
   displacements at node 2  fsy
u   2b
de   2  fsx
u3  
u3   displacements at node 3 2a
  
u4  1 (x1, y1) 2 (x2, y2)

u   displacements at node 4 (u1, v1) (u2, v2)
 4 

x, u

FINITE ELEMENT METHOD 22

Shape functions construction

4 (1, +1) 3 (1, +1)

y, v (u4, v4) (u3, v3)

4 (x4, y4) 3 (x3, y3)
(u4, v4) (u3, v3) 
 fsy
2b fsx 2b

2a
1 (x1, y1) 2 (x2, y2) 2a
(u1, v1) (u2, v2) 1 (1, 1) 2 (1, 1)
(u1, v1) (u2, v2)
x  xc y  yc x, u
 , 
a b
N 0 N2 0 N3 0 N4 0
U h ( x, y )  N( x, y )d e where N 1
0 N1 0 N2 0 N3 0 N 4 
Node 1 Node 2 Node 3 Node 4

(Interpolation)

FINITE ELEMENT METHOD 23

Shape functions construction

N1  14 (1   )(1   )
N 2  14 (1   )(1   )
N 3  14 (1   )(1   )
N j  14 (1   j )(1   j )
N 4  14 (1   )(1   ) 4 (1, +1)
(u4, v4)
3 (1, +1)
(u3, v3)

N 3 at node 1  14 (1   )(1   )  1  0

 1 
N 3 at node 2  14 (1   )(1   )  1  0
 1 Delta function 2b
N 3 at node 3  14 (1   )(1   )  1  1 property 
 1

N 3 at node 4  14 (1   )(1   )  1  0 2a

 1 1 (1, 1) 2 (1, 1)
4 (u1, v1) (u2, v2)

 N i  N1  N 2  N 3  N 4
i 1 Partition of
 [(1   )(1   )  (1   )(1   )  (1   )(1   )  (1   )(1   )]
1
4 unity
 14 [2(1   )  2(1   )]  1

FINITE ELEMENT METHOD 24

 

1
1   
2

1 

1
1    Bilinear shape
2
functions

FINITE ELEMENT METHOD 25

Strain matrix

  1a 0 1
a 0 1
a 0 1
 a 0 
1 1 1 1 1 
B  LN   0  b 0  b 0 b 0 b 
4 1
 1
 a
1
 b
1 1 1 1
 a 
1
 b a b a b 

 
 0
Note: No longer a constant matrix!  x 
 
L 0 
 y 
 
 
 y x 

FINITE ELEMENT METHOD 26

Element matrices

x  xc y  yc
 ,   dxdy = abdd
a b
Therefore,

1 1
k e   B cBdV   hB cBdA  
T T
 abhB TcBd d
1 1
V A

h 1 1
m e   N NdV    dx N NdA   h N NdA  
T T T
 abh NT Nd d
0 1 1
V A A

FINITE ELEMENT METHOD 27

 Gauss integration

 For evaluation of integrals in ke and me (in practice)

In general, weak form cannot be integrated in

closed form  numerical integration: Gauss
quadrature
1 m
In 1 direction: I   f ( )d   w j f ( j )
1
j 1

A Gauss quadrature of mth order integrates exactly a

polynomial function of degree 2m – 1 [Ral]

nx ny
1 1
In 2 directions: I    f ( , )d d    wi w j f (i , j )
1 1
i 1 j 1

FINITE ELEMENT METHOD 28

Gauss integration

m j wj Accuracy n

1 0 2 1

2 -1/3, 1/3 1, 1 3

3 -0.6, 0, 0.6 5/9, 8/9, 5/9 5

4 -0.861136, -0.339981, 0.347855, 0.652145, 7

0.339981, 0.861136 0.652145, 0.347855
5 -0.906180, -0.538469, 0, 0.236927, 0.478629, 9
0.538469, 0.906180 0.568889, 0.478629,
0.236927
6 -0.932470, -0.661209, 0.171324, 0.360762, 11
-0.238619, 0.238619, 0.467914, 0.467914,
0.661209, 0.932470 0.360762, 0.171324

FINITE ELEMENT METHOD 29

Gauss integration

Gauss integration points for nx = ny = 1, 2, y 3 in a quadrilateral region

nx ny
1 1
ke    abhB T cBd d    wi w j f (i , j )
1 1
i 1 j 1

FINITE ELEMENT METHOD 30

 Full and reduced integration

 Full integration  use the number of Gauss points

required to achieve the exact solution
 Reduced integration  evaluate the integrals at less
points than the required to achieve the exact solution 
good approximation (one order less than the order of the
interpolation)

FINITE ELEMENT METHOD 31

Evaluation of me

1 1
m e   N NdV  
T
 abh NT Nd d
1 1
V

4 0 2 0 1 0 2 0
 4 0 2 0 1 0 2 
 
 4 0 2 0 1 0
 
 hab  4 0 2 0 1 
me 
9  4 0 2 0
 
 4 0 2
 sy. 4 0
 
 4 

FINITE ELEMENT METHOD 32

Evaluation of me

1 1
mij   hab   N i N j d d
1 1

 hab 1 1

16 1  (1  i )(1   j )d 
1
(1  i )(1   j )d

 hab
 (1  13 i j )(1  13 i j )
4
 hab  hab
E.g. m33  (1   1 1)(1   1 1)  4 
1
3
1
3
4 9

Note: In practice, Gauss integration is often used

FINITE ELEMENT METHOD 33

Element matrices

 f sx 
f e   N f b dV   N f S d S =  N
T T T
  dl
2 3
 f sy 
Ve Se l

For uniformly distributed load,

0 y, v

0 4 (x4, y4) 3 (x3, y3)
  (u4, v4) (u3, v3)
 f sx   fsy
  2b fsx
 f sy 
fe  b   2a
 f sx  1 (x1, y1) 2 (x2, y2)
 f sy  (u1, v1) (u2, v2)
 
0  x, u
0 
 

FINITE ELEMENT METHOD 34

 LINEAR QUADRILATERAL ELEMENTS

 Rectangular elements
– Very useful
– More accurate
– Limited application
 Quadrilateral elements:
– Irregular shape  integration
problems
– Gauss quadrature can’t be
implemented directly
– First of all: mapping  square
element  same N and
integration method used for
the rectangular element

FINITE ELEMENT METHOD 35

Coordinate mapping

y 4 (x4, y4)
3 (x3, y3)

4 (1, +1)
3 (1, +1)



2 (x2, y2)
1 (x1, y1)
x 1 (1, 1) 2 (1, 1)

Physical coordinates Natural coordinates

U h ( , )  N( , )d e (Interpolation of displacements)

X( , )  N( , )x e (Interpolation of coordinates)

FINITE ELEMENT METHOD 36
Coordinate mapping

 x1  
y   coordinate at node 1

X( , )  N( , )x e  1
 x2  
   coordinate at node 2
x y  
where X  , xe   2 
 y  x3  
 y3   coordinate at node 3
  
 x4  
N1  14 (1   )(1   ) y   coordinate at node 4
 4 
N 2  14 (1   )(1   )
4
N 3  14 (1   )(1   ) x   N i ( , ) xi
i 1
N 4  14 (1   )(1   )
4
y   N i ( , ) yi
i 1

FINITE ELEMENT METHOD 37

Coordinate mapping

4
Substitute 1 into x   N i ( , ) xi
i 1

x  12 (1   ) x2  12 (1   ) x3 x  12 ( x2  x3 )  12  ( x3  x2 )
or
y  (1   ) y2  (1   ) y3
1
2
1
2 y  12 ( y2  y3 )  12  ( y3  y2 )

( y3  y 2 )
Eliminating , y
( x3  x2 )
 x  12 ( x2  x3 )   12 ( y2  y3 )

y 4 (x4, y4)
3 (x3, y3)

4 (1, +1)
3 (1, +1)



2 (x2, y2)
1 (x1, y1)
x 1 (1, 1) 2 (1, 1)

FINITE ELEMENT METHOD 38

 Strain matrix
N i N i x N i y  N i   N i 
      x 
 x  y 
or   J 
N i N i x N i y  N i   N i 
      y 
 x  y   
 x y 
   
where J    (Jacobian matrix)
 x y 
   

Since
X( , )  N( , )x e ,  N1 N 2 N 3 N 4   x1 y1 
   y2 
     x2
J  
 N1 N 2 N 3 N 4   x3 y3 
   
      x4 y4 
 N1 N 2 N 3 N 4 N1 N N N 
x  x 
  1  2  3  x  x4 y1  2 y2  3 y3  4 y4 
   
 
 N1 N 2 N 3 N 4 N1 N N N 
x  x 
  1 FINITE2 ELEMENT x  x4 y1  2 y2  3 y3  4 y4 
 METHOD     39 
3

Strain matrix

 N i   N i 
 x     (Relationship between differentials of shape
Therefore,  J 
1
 functions w.r.t. physical coordinates and
 N i   N i 
 y     differentials w.r.t. natural coordinates)
 

Replace differentials of Ni w.r.t. x and y

with differentials of Ni w.r.t.  and 

  x 0     0 
B  LN   0  y  N  J 1  0    N
N  bilinear functions
 y  x      
J  bilinear functions
J-1  fractional functions
FINITE ELEMENT METHOD 40
Element matrices

Murnaghan (1951) : dA=det |J | dd

1 1
k e   B cBdV   hB cBdA  
T T
 hB TcBdet J d d
1 1
V A

h 1 1
m e   N NdV    dx N NdA   h N NdA  
T T T
 h NT Ndet J d d
0 1 1
V A A

y 4 (x4, y4)
3 (x3, y3)
 f sx 
fe   N fb dV   N fSdS =  N
T T
  dl
T
2 3
 f sy 
Ve Se l

2 (x2, y2)
N j  14 (1   j )(1   j ) 1 (x1, y1)
x

FINITE ELEMENT METHOD 41

 Remarks

 Shape functions used for interpolating the

coordinates are the same as the shape functions
used for interpolation of the displacement field.
Therefore, the element is called an isoparametric
element.
 Note that the shape functions for coordinate
interpolation and displacement interpolation do not
have to be the same.
 Using the different shape functions for coordinate
interpolation and displacement interpolation,
respectively, will lead to the development of so-called
subparametric or superparametric elements.

FINITE ELEMENT METHOD 42

 HIGHER ORDER ELEMENTS

 Higher order triangular elements

(0,0,p)
nd = (p+1)(p+2)/2

IJ K  p
(1,0,p1) (0,1,p1)
Node i,
(2,0,p2)
Argyris, 1968 :
L1
L2
i (I,J,K)
N i  lII ( L1 )lJJ ( L2 )lKK ( L3 )
L3 (0,p1,1)
( L  L 0 )( L  L 1 ) ( L  L (  1) )
l ( L ) 
( L   L 0 )( L   L 1 ) ( L   L (  1) )
(p,0,0) (p1,1,0) (0,p,0)
  1, 2, 3
  I, J, K

FINITE ELEMENT METHOD 43

 HIGHER ORDER ELEMENTS

 Higher order triangular elements (Cont’d)

Quadratic element
Ni  (2 Li  1) Li (i  1, 2,3) 1
N i  (3Li  1)(3Li  2) Li (i  1, 2,3)
N 4  4 L1 L2
2 Cubic element
9
N4  L1 L2 (3L1  1)
N 5  4 L2 L3 2
N 6  4 L3 L1 N10  27 L1 L2 L3

FINITE ELEMENT METHOD 44

 HIGHER ORDER ELEMENTS

 Higher order rectangular elements

nd  (n  1)(m  1)

(0,m) (n,m) domain (1    1,  1    1)

i(n,m)
Lagrange type:
 [Zienkiewicz et al., 2000]
0
N i  N I1D N J1D  lIn ( )lJm ( )
(   0 )(  1 ) (   k 1 )(   k 1 ) (   n )
lkn ( ) 
(0,0) ( k   0 )( k  1 ) ( k   k 1 )( k   k 1 ) ( k   n )
(n,0)

FINITE ELEMENT METHOD 45

 HIGHER ORDER ELEMENTS

 Higher order rectangular elements (Cont’d)

4 7 3


(nine node quadratic element)
8 9 6

1
N 5  N11D ( ) N 01D ( )   (1   )(1   )(1   )
2
1 5 2
1
N 6  N 21D ( ) N11D ( )   (1   )(1   )(1   )
1 2
N1  N 01D ( ) N 01D ( )   (1   ) (1   )
4 1
N 7  N11D ( ) N 21D ( )  (1   )(1   )(1   )
1 2
N 2  N 21D ( ) N 01D ( )    (1   ) (1   )
4 1
N8  N 01D ( ) N11D ( )    (1   )(1   )
1 2
N 3  N 21D ( ) N 21D ( )   (1   )(1   )
4 N 9  N11D ( ) N11D ( )  (1   2 )(1   2 )
1
N 4  N 01D ( ) N 21D ( )    (1   )(1   )
4

FINITE ELEMENT METHOD 46

 HIGHER ORDER ELEMENTS

 Higher order rectangular elements (Cont’d)

Serendipity type:
=1 
4 7 3

  N j  14 (1   j )(1   j )( j   j  1) j  1, 2, 3, 4

6 N j  12 (1   2 )(1   j ) j  5, 7
8 0 
N j  12 (1   j )(1   2 ) j  6,8

1 5 2
=1 1=0

(eight node quadratic element)

FINITE ELEMENT METHOD 47

 HIGHER ORDER ELEMENTS

 Higher order rectangular elements (Cont’d)

 Nj  1
32 (1   j )(1   j )(9 2  9 2  10)
4 10 9 3 for corner nodes j  1, 2, 3, 4
Nj  9
32 (1   j )(1   2 )(1  9 j )
11 8

for side nodes j  7, 8, 11, 12 where  j  1 and  j   13
12 7
Nj  9
32 (1   j )(1   2 )(1  9 j )

2
for side nodes j  5, 6, 9, 10 where  j   13 and  j  1
1 5 6

(twelve node cubic element)

FINITE ELEMENT METHOD 48

ELEMENT WITH CURVED EDGES

3 3
5 Mapping
5
6
6
2
4 2 4
1
1

4 7 3
3
4 7
Mapping
8 6 6
8

1 2
5
1 5 2

FINITE ELEMENT METHOD 49

 COMMENTS ON GAUSS INTEGRATION

 When the Gauss integration scheme is used, one has

to decide how many Gauss points should be used.
 Theoretically, for a one-dimensional integral, using m
points can give the exact solution for the integral of a
polynomial integrand of up to an order of n=2m1
 As a general rule of thumb, more points should be
used for a higher order of elements.

FINITE ELEMENT METHOD 50

 COMMENTS ON GAUSS INTEGRATION

 Using a smaller number of Gauss points tends to

counteract the over-stiff behaviour associated with
the displacement-based method.
 Displacement in an element is assumed using shape
functions. This implies that the deformation of the
element is somehow prescribed in a fashion of the
shape function. This prescription gives a constraint to
the element. The so-constrained element behaves
stiffer than it should. It is often observed that higher
order elements are usually softer than lower order
ones. This is because using higher order elements
gives fewer constraint to the elements.

FINITE ELEMENT METHOD 51

 COMMENTS ON GAUSS INTEGRATION

 Two Gauss points for linear elements, and two or

three points for quadratic elements in each direction
should be sufficient for most cases.
 Most of the explicit FEM codes based on explicit
formulation tend to use one-point integration to
achieve the best performance in saving CPU time
(reduced integration).

FINITE ELEMENT METHOD 52

 COMMENTS ON GAUSS INTEGRATION –
ABAQUS

 All elements in Abaqus are integrated numerically.

 Abaqus will use either “full” or “reduced” integration. For full
integration the number of integration points is sufficient to integrate
the virtual work expression exactly, at least for linear material
behavior. All triangular and tetrahedral elements in Abaqus use full
integration. Reduced integration can be used for quadrilateral
and hexahedral elements; in this procedure the number of
integration points is sufficient to integrate exactly the contributions of
the strain field that are one order less than the order of interpolation.
The (incomplete) higher-order contributions to the strain field present
in these elements will not be integrated.
 The advantage of the reduced integration elements is that the strains
and stresses are calculated at the locations that provide optimal
accuracy, the so-called Barlow points (Barlow, 1976). A second
advantage is that the reduced number of integration points decreases
CPU time and storage requirements. The disadvantage is that the
reduced integration procedure can admit deformation modes that
cause no straining at the integration points [Abaqus 2012].

FINITE ELEMENT METHOD 53