






























Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The Gaussian Elimination method for solving simultaneous linear equations. It covers the steps of Forward Elimination and Back Substitution, as well as common pitfalls and improvements such as partial pivoting.
Typology: Lecture notes
1 / 38
This page cannot be seen from the preview
Don't miss anything!































1
One of the most popular techniques for
solving simultaneous linear equations of the
form
Consists of 2 steps
Linear Equations
A set of n equations and n unknowns
11 1 12 2 13 3 1 1
n n
21 1 22 2 23 3 2 2
n n
n n n nn n n
1 1 2 2 3 3
.. .. ..
Transform to an Upper Triangular Matrix
Step 1: Eliminate x 1 in 2
nd equation using equation 1 as
the pivot equation
( )
1
21
11
a
a
Eqn
Which will yield
1
11
21
1
11
21
12 2
11
21
21 1
n n
Repeat this procedure for the remaining
equations to reduce the set of equations as
11 1 12 2 13 3 1 1
n n
'
2
'
3 2
'
2 23
'
22
n n
'
3
'
3 3
'
2 33
'
32
n n
' '
3
'
2 3
'
2
... n n nn n n
a x a x a x b
... ... ...
Step 2: Eliminate x 2
in the 3
rd equation.
Equivalent to eliminating x 1 in the 2
nd equation
using equation 2 as the pivot equation.
32
22
Continue this procedure by using the third equation as the pivot
equation and so on.
At the end of (n-1) Forward Elimination steps, the system of
equations will look like:
'
2
'
3 2
'
2 23
'
22
n n
"
3
"
3
"
33
a x ... a x b n n
n
n n
n
nn
a x b
.. .. ..
11 1 12 2 13 3 1 1
n n
At the end of the Forward Elimination steps
(n- )
n n
3
2
1
n
nn
n
n
n
1
"
3
'
2
1
( 1 )
"
3
"
33
'
2
'
23
'
22
11 12 13 1
Start with the last equation because it has only
one unknown
( 1 )
( 1 )
n
nn
n
n
n
Solve the second from last equation (n-1)
th
using x n
solved for previously.
This solves for x n-
.
Representing Back Substitution for all equations
by formula
1
1
1 1
i
ii
n
j i
j
i
ij
i
i
i
For i = n -1, n -2,….,
and
( 1 )
( 1 )
n
nn
n
n
n
Assume
2 3
2 1
3
2
1
3
2
3
2
2 2
1
2
1
1
1
1
v
v
v
a
a
a
t t
t t
t t
3
2
1
Results in a matrix template of the form:
Using date from the time / velocity table, the matrix becomes:
2
2
8
144 12 1
64 8 1
25 5 1
3
2
1
a
a
a
Forward Elimination: Step 1
Yields
3
2
1
Yields
3
2
1
This is now ready for Back Substitution
Forward Elimination: Step 2
Back Substitution: Solve for a 3
using the third equation
3
3