Scribd
Upload
11 views

MECH300H Introduction To Finite Element Methods: Review

This document provides an overview of matrix algebra and numerical integration techniques relevant to finite element methods. It discusses operations on matrices like addition, subtraction, multiplication, transposition, and inversion. It also covers numerical integration methods like the trapezoidal rule, Simpson's 1/3 rule, Gaussian quadrature, and their application to calculate definite integrals. Gaussian elimination for solving systems of linear equations is described along with pseudocode.

Uploaded by

amitaiisc
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
11 views

MECH300H Introduction To Finite Element Methods: Review

This document provides an overview of matrix algebra and numerical integration techniques relevant to finite element methods. It discusses operations on matrices like addition, subtraction, multiplication, transposition, and inversion. It also covers numerical integration methods like the trapezoidal rule, Simpson's 1/3 rule, Gaussian quadrature, and their application to calculate definite integrals. Gaussian elimination for solving systems of linear equations is described along with pseudocode.

Uploaded by

amitaiisc
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

MECH300H Introduction to Finite

Element Methods
Lecture 2
Review
Matrix Algebra
Row and column vectors


Addition and Subtraction must have the same dimensions
Multiplication with scalar, with vector, with matrix

Transposition

Differentiation and I ntegration



Matrix Algebra
Determinant of a Matrix:

Matrix inversion -

I mportant Matrices
diagonal matrix
identity matrix
zero matrix
eye matrix

Numerical Integration
Calculate: ( )dx x f I
b
a
}
=
Newton Cotes integration
Trapezoidal rule 1
st
order Newton-Cotes integration




Trapezoidal rule multiple application
) (
) ( ) (
) ( ) ( ) (
1
a x
a b
a f b f
a f x f x f

+ = ~
} }
+
= ~ =
b
a
b
a
b f a f
a b dx x f dx x f I
2
) ( ) (
) ( ) ( ) (
1
} } } } }

+ + + = ~ =
n
n
n
x
x
x
x
b
a
x
x
x
x
n
dx x f dx x f dx x f dx x f dx x f I
1
2
1 0
1
0
) ( ) ( ) ( ) ( ) (
(

+ + =

=
1
1
) ( ) ( 2 ) (
2
n
i
i
b f x f a f
h
I
Numerical Integration
Calculate: ( )dx x f I
b
a
}
=
Newton Cotes integration
Simpson 1/3 rule 2
nd
order Newton-Cotes integration
) (
) )( (
) )( (
) (
) )( (
) )( (
) (
) )( (
) )( (
) ( ) (
2
1 2 0 2
1 0
1
2 1 0 1
2 0
0
2 0 1 0
2 1
2
x f
x x x x
x x x x
x f
x x x x
x x x x
x f
x x x x
x x x x
x f x f


+


+


= ~
} }
+ +
= ~ =
b
a
b
a
x f x f x f
x x dx x f dx x f I
6
) ( ) ( 4 ) (
) ( ) ( ) (
2 1 0
0 2 2
Numerical Integration
Calculate: ( )dx x f I
b
a
}
=
Gaussian Quadrature
) (
2
) (
) (
2
) (
2
) ( ) (
) (
b f
a b
a f
a b
b f a f
a b I

=
+
=
) ( ) (
1 1 0 0
x f c x f c I + =
Trapezoidal Rule:
Gaussian Quadrature:
Choose according to certain criteria
1 0 1 0
, , , x x c c
Numerical Integration
Calculate: ( )dx x f I
b
a
}
=
Gaussian Quadrature
2pt Gaussian Quadrature


3pt Gaussian Quadrature
( )
|
.
|

\
|
+
|
.
|

\
|
= =
}

3
1
3
1
1
1
f f dx x f I
( ) ( ) ( ) ( ) 77 . 0 55 . 0 0 89 . 0 77 . 0 55 . 0
1
1
f f f dx x f I + + = =
}

( ) ( ) ( ) ( )
1 1 1 1 0 0
1
1

+ + + = =
}
n n
x f c x f c x f c dx x f I
a b
a x
x

+ =
) ( 2
1
~
Let:
x d x a b b a f a b dx x f
b
a
~ ~
) (
2
1
) (
2
1
) (
2
1
) (
1
1
} }

(

+ + =
Numerical Integration - Example
Calculate: dx x e I
x
}
=
1
0
sin
Trapezoidal rule

Simpson 1/3 rule

2pt Gaussian quadrature




Exact solution
90933 . 0
2
cos sin
sin
1
0
1
0
=

= =
}
x e x e
dx x e I
x x
x
Linear System Solver
Solve:
b Ax=
Gaussian Elimination: forward elimination +back substitution
Example:
0 3
3 3 2 2
0 6 2
2 1
3 2 1
3 2 1
= + +
= + +
= +
x x
x x x
x x x

(
(
(

2
3
0
6 1 0
9 6 0
6 2 1
3
2
1
x
x
x

(
(
(

2
3
0
0 3 1
3 2 2
6 2 1
3
2
1
x
x
x

(
(
(

2 3
3
0
2 15 0 0
9 6 0
6 2 1
3
2
1
x
x
x
Linear System Solver
Solve:
b Ax=
Gaussian Elimination: forward elimination +back substitution
Pseudo code:
Forward elimination: Back substitution:
Do k = 1, n-1
Do i = k+1,n


Do j = k+1, n


kk
ik
a
a
c =
k i i
kj ij ij
cb b b
ca a a
=
=
Do ii = 1, n-1
i = n ii
sum = 0
Do j = i+1, n
sum = sum +

ii
i
i
a
sum b
b

=
j ij
b a

You might also like