Method of Finite Elements I
Method of Finite Elements I
Page 1
Page 2
Contents
Course Overview
Page 3
Course Overview
Page 4
MFE development
The MFE is the confluence of three ingredients: matrix structural analysis,
variational approach and a computer
Theoretical Formulation
1. Lsung von Variationsproblemen by W. Ritz in 1908
2. Weak formulation by B. Galerkin in 1915
3. Mathematical foundation by R. Courant ca. 1943
Formulation & First Applications (1950s and 1960s)
1. 1950s, M.J. Turner at Boeing (aerospace industry in general): Direct
Stiffness Method
2. Matrix formulation of structural analysis by Agyris in 1954
3. Term Finite Element coined by Clough in 1960
4. First book on EM by Zienkiewicz and Cheung in 1967
Page 5
MFE development
Commercial Software (since 1970s)
1.
2.
Page 6
Page 7
Page 8
civil
fluid dynamics
aerospace
mechanical
Applications
Page 9
Page 10
Page 11
Page 12
Page 13
The way in which these three steps are approached has a great
influence on the results of the calculations .
Method of Finite Elements I
Page 14
Page 15
Page 16
Simple Example
Page 17
Simple Example
Page 18
Page 19
Considerations
Page 20
Page 21
Page 22
Chapter 1
Fundamental Mathematical Concepts
(short review)
Page 23
Matrices
A matrix is an array of ordered numbers. A general matrix
consists of mn numbers arranged in m rows and n columns,
thus the matrix is of order m x n (m by n). When we have
only one row (m = 1) or one column (n = 1), A is also called a
vector
Page 24
Matrices
When dealing with systems of linear equations, a matrix
formulation proves highly advantages:
Page 25
where 1 i m and 1 j n
Addition:
Two matrices A and B may be added to each other iff they possess
the same order. The sum A+B is calculated entry wise:
+
Method of Finite Elements I
= +
Page 26
Multiplication:
Two matrices A and B may be multiplied iff A is m-by-n and B is n-by-p
such that the resulting matrix will be of order m-by-p. The matrix product
AB is given by the dot product of the corresponding row of A and the
column of B.
+
Method of Finite Elements I
= +
Page 27
1 0 0
3 = 0 1 0
0 0 1
Method of Finite Elements I
Page 28
Page 29
Special Matrices
Symmetric Matrix:
A symmetric matrix is a square matrix the satisfies AT = A
Sparse Matrix:
A matrix with mostly/many zero entries
Rotation Matrix R:
Used to rotate quantities about a certain point
In 2D it is given as follows:
cos() sin()
=
sin() cos()
Method of Finite Elements I
Page 30
Page 31
Special Matrices
Banded Matrix:
For symmetric banded matrix A we have aij = 0 for j > i+mA, 2mA+1 being the
bandwidth
If the half-bandwidth, mA, of a matrix is zero, we have nonzero elements only
on the diagonal of the matrix and denote it as a diagonal matrix (for
example, unit matrix).
mA
a14 0 j 4 1 mA mA 2
2mA 1 2 2 1 5
Matrix Inversion
The inverse of a matrix A is denoted as A-1
If a matrix is invertible then there is
AA-1 = A-1A = I
and A is said to be non-singular.
Page 32
Matrix Inversion
Inversion: AA-1 = A-1A = I
Page 33
Page 34
Sub Matrices
Matrices can be subdivided to facilitate matrix
manipulations
Partitioning lines must run completely across the original
matrix
Page 35
a
i 1
Some rules:
tr(A+B) = tr(A) + tr(B)
tr(cA) = c tr(A)
tr(AB) = tr(BA)
ii
Page 36
Page 37
det( A) 1 a1 j det A1 j
1 j
j 1
Page 38
det( A) 1 a1 j det A1 j
j 1
1 j
det( A) 1 a1 j det A1 j
j 1
1 j
Page 39
Page 40
Page 41
0
0
1
de tA
d
i 1
ii
Page 42
Page 43
Tensors
A set of quantities that obey certain transformation laws
relating the bases in one generalized coordinate system to
those of another
A tensor consists of an array of a certain order (for
example: tensor of order 0 is a scalar, tensor of order 1 is a
vector)
Each tensor has a transformation law detailing the
response of a change of basis (or frame of reference).
Bathe: An entity is called a second-order tensor if it has
nine components tij, i=1,2,3 and j=1,2,3 in the unprimed
frame and nine components tij in the primed frame and if
these components are related by the characteristic law
tij=pikpjltkl, P being a rotation matrix
Method of Finite Elements I
Stress Tensors
xx xy xz
yy yz
zz
Page 44
Page 45
Variational Calculus
Variational operator d
Variations (of deformation) are small enough not to disturb
the equilibrium and are consistent with the geometric constraint
of the system
Some rules:
du d
d du
dx dx
a
d udx dudx
0
d F1 F2 dF1 dF2
d F1 F2 d F1 F2 F1d F2
F1
d
F2
d F1 F2 F1d F2
2
F
dF n nF n1dF