Gaussian Elimination

Electrical Engineering Majors

Author(s): Autar Kaw

http://numericalmethods.eng.usf.
edu

Transforming Numerical Methods Education for STEM

Undergraduates

Nave Gauss Elimination

http://numericalmethods.eng.usf
.edu

Nave Gaussian Elimination

A method to solve simultaneous linear
equations of the form [A][X]=[C]

Two steps
1. Forward Elimination
2. Back Substitution

Forward Elimination
The goal of forward elimination is to
transform the coefficient matrix into an
upper triangular matrix

25 5 1 x1 106.8
64 8 1 x 177.2

144 12 1 x3 279.2

5
1 x1 106.8
25
0 4.8 1.56 x 96.21

0
0.7 x3 0.735
0

Forward Elimination
A set of n equations and n unknowns

a11 x1 a12 x2 a13 x3 ... a1n xn b1

a21 x1 a22 x2 a23 x3 ... a2 n xn b2

.
.
.

.
.
.

an1 x1 an 2 x2 an 3 x3 ... ann xn bn

(n-1) steps of forward
elimination

Forward Elimination
Step 1
For Equation 2, divide Equation 1a11by
multiply bya21 .
a21
a ( a11 x1 a12 x2 a13 x3 ... a1n xn b1 )
11

a21
a21
a21
a21 x1
a12 x2 ...
a1n xn
b1
a11
a11
a11

and

Forward Elimination
Subtract the result from Equation 2.
a21 x1 a22 x2 a23 x3 ... a2 n xn b2
a21
a21
a21
a21 x1 a a12 x2 ... a a1n xn a b1
11
11
11
_________________________________________________

a21
a21
a21
a22
a12 x2 ... a2 n
a1n xn b2
b1
a11
a11
a11

o
r

a x ... a x b
'
22 2

'
2n n

'
2

Forward Elimination
Repeat this procedure for the remaining
equations to reduce the set of equations
as
a11 x1 a12 x2 a13 x3 ... a1n xn b1
'
'
a22
x2 a23
x3 ... a2' n xn b2'

'
'
a32
x2 a33
x3 ... a3' n xn b3'
.
.
.

.
.
.

.
.
.

'
an' 2 x2 an' 3 x3 ... ann
xn bn'

End of Step 1

Forward Elimination
Step 2
Repeat the same procedure for the 3rd
term of Equation 3.
a11 x1 a12 x2 a13 x3 ... a1n xn b1
'
'
a22
x2 a23
x3 ... a2' n xn b2'
"
a33
x3 ... a3" n xn b3"
.
.
.

.
.
.

"
an" 3 x3 ... ann
xn bn"

End of Step 2

Forward Elimination
At the end of (n-1) Forward Elimination steps, the
system of equations will look like

a11 x1 a12 x 2 a13 x3 ... a1n x n b1

'
'
a22
x2 a23
x3 ... a2' n xn b2'

a x ... a x b
"
33 3

"
3n n

.
.
.

n 1

"
3

.
.
.

n 1

ann xn bn
End of Step (n-1)

Matrix Form at End of Forward

Elimination

a11
0
0

a12
'
a22
0

a1n x1 b1
'
'

a 2 n x2
b2

"
"
a3n x3 b3

(n 1 )
(n-1 )

0 ann xn bn

a13
'
a23
a

"
33

Back Substitution
Solve each equation starting from the last
equation

5
1
25
0 4.8 1.56

0
0.7
0

x1 106.8
x 96.21
2

x3 0.735

Example of a system of 3
equations

Back Substitution Starting

Eqns
a11 x1 a12 x 2 a13 x3 ... a1n x n b1
'
'
a22
x2 a23
x3 ... a2' n xn b2'

"
a33
x3 ... an" xn b3"
.
.
.

n 1

.
.
.

n 1

ann xn bn

Back Substitution
Start with the last equation because it has only one unknown
( n 1)
n
( n 1)
nn

b
xn
a

Back Substitution
( n 1)
n
( n 1)
nn

b
xn
a
xi

bi i 1 ai ,ii11 xi 1 ai,ii12 xi 2 ... ai ,in1 xn

i 1

aii
i 1

xi

bi

aij i 1 x j
j i 1
i 1
ii

for i n 1,...,1

for i n 1,...,1

THE END
http://numericalmethods.eng.usf.edu

Nave Gauss Elimination

Example

http://numericalmethods.eng.usf
.edu

Example: Unbalanced three phase

load
Three-phase loads are common in AC systems. When the
system is balanced the analysis can be simplified to a single
equivalent circuit model. However, when it is unbalanced the
only practical solution involves the solution of simultaneous
linear equations. In a model the following equations need to be
solved.
0.7460 0.4516 0.0100 0.0080 0.0100 0.0080 I ar 120
0.4516 0.7460 0.0080 0.0100 0.0080 0.0100 I 0.000

ai

0.0100 0.0080 0.7787 0.5205 0.0100 0.0080 I br 60.00

I
0
.
0080
0
.
0100
0
.
5205
0
.
7787
0
.
0080
0
.
0100

103
.
9

bi

0.0100 0.0080 0.0100 0.0080 0.8080 0.6040 I cr 60.00

I
0
.
0080
0
.
0100
0
.
0080
0
.
0100
0
.
6040
0
.
8080
103
.
9

ci

Find the values of Iar , Iai , Ibr , Ibi , Icr , and Ici using Nave Gaussian
Elimination.

Example: Unbalanced three phase

load
Forward Elimination:
Step 1

Row1
0.4516

0.7460

For the new row 2:Row2

1.0194 0.0019464 0.014843 0.0019464 0.014843 I ai 72.643

Row1
0.0100

0.7460

For the new row 3: Row3

0.0019464 0.77857 0.52061 0.0098660 0.0078928 I br 61.609

Example: Unbalanced three phase

load
Forward Elimination:
Step 1

Row1
0.0080

0.7460

For the new row 4: Row4

0.014843 0.52039 0.77879 0.0078928 0.010086 I bi 105.19

Row1
0.0100

0.7460

For the new row 5: Row5

0.0019464 0.0098660 0.0078928 0.80787 0.60389 I cr 61.609

Example: Unbalanced three phase

load
Forward Elimination:
1 6: Row6 Row1 0.0080
For theStep
new row

0.7460

0.014843 0.0078928 0.010086 0.60389 0.80809 I ci 102.61

The system of equations after the completion of the first step

of forward elimination is:
0.0100
0.0080
0.0100
0.0080
0.7460 0.4516
0

1
.
0194
0
.
0019464
0
.
014843
0
.
0019464
0
.
014843

0
0.0019464 0.77857
0.52039 0.0098660 0.0078928

0
0
.
014843
0
.
52039
0
.
77879
0
.
0078928
0
.
010086

0
0.0019464 0.0098660 0.0078928 0.80787
0.60389

0
0
.
014843
0
.
0078928
0
.
010086
0
.
60389
0
.
80809

I ar 120
I 72.643
ai

I br 61.609

105
.
19
bi

I cr 61.609

I
102
.
61

ci

Example: Unbalanced three phase

load
Forward Elimination:
Step 2
Row2
0.0019464
For the new row 3: Row3

1.0194

0 0.77857 0.52036 0.0098697 0.0078644 I br 61.747

For the new row 4:

Row2
Row4
0.014843

1.0194

0 0.52036 0.77857 0.0078644 0.0098697 I bi 104.13

Example: Unbalanced three phase

load
Forward Elimination:
Step 2
Row2
Row5
0.0019464
For the new row 5:

1.0194

0 0.0098697 0.0078644 0.80787 0.60386 I cr 61.747

For the new row 6:

Row2
Row6
0.014843

1.0194

0 0.0078644 0.0098697 0.60386 0.80787 I ci 103.67

Example: Unbalanced three phase

load
The system of equations after the completion of the second
step of forward elimination is:

0.7460 0.4516 0.0100

0
1.0194 0.0019464

0
0
0.77857

0.0080
0.014843
0.52036

0.0080
0.0019464 0.014843
0.0098697 0.0078644
0.0100

0
0

0.52036
0.77857
0.0078644
0.0098697 0.0078644 0.80787

0.0078644

0
0

0.0098697

0.60386

I ar
I
ai

I br

0.0098697 I bi
0.60386 I cr

0.80787 I ci

120
72.643
61.747

104.13
61.747

103.67

Example: Unbalanced three phase

load
Forward Elimination:
Step 3

Row4
For the new row 4:

Row3
0.52036

0.77857

0 0 1.1264 0.0012679 0.015126 I bi 62.860

For the new row 5:

Row3
Row5
0.0098697

0.77857

0 0 0.0012679 0.80774 0.60376 I cr 60.965

Example: Unbalanced three phase

load
Forward Elimination:
3 6: Row6 Row3 0.0078644
For theStep
new row
0.77857
0 0 0 0.015126 0.60376 0.80795 I ci 104.29
The system of equations after the completion of the third step
of forward elimination is:

0.7460 0.4516 0.0100

0
1.0194 0.0019464

0
0
0.77857

0
0

0
0

0
0

0.0080
0.014843
0.52036

0.0080
0.0019464 0.014843
0.0098697 0.0078644

1.1264
0.0012679
0.0012679 0.80774
0.015126

I ar
I
ai
I br

0.015126 I bi
0.60376 I cr

0.80795 I ci

0.0100

0.60376

120
72.643
61.747

62.860
60.965

104.29

Example: Unbalanced three phase

load
Forward Elimination:
Step 4
Row4
0.0012679
For the new row 5: Row5

1.1264

0 0 0 0.80775 0.60375 I cr 61.035

For the new row 6:

Row4
Row6
0.015126

1.1264

0 0 0 0.60375 0.80775 I ci 104.97

Example: Unbalanced three phase

load
The system of equations after the completion of the fourth
step of forward elimination is:
0.0080
0.0100
0.7460 0.4516 0.0100
0
1.0194 0.0019464 0.014843 0.0019464

0.77857

0.0080 I ar 120
0.014843 I ai 72.643
0.52036 0.0098697 0.0078644 I br 61.747

1.1264 0.0012679 0.015126 I bi 62.860

0
0.80775
0.60375 I cr 61.035

0
0.60375
0.80775 I ci 104.97

Example: Unbalanced three phase

load
Forward Elimination:
Row5
5 6:
For theStep
new row
Row6
0.60375
0.80775

0 0 0 0 1.2590 I ci 150.76

The system of equations after the completion of forward

elimination is:

0.0080
0.0100
0.0080
0.7460 0.4516 0.0100
0

1
.
0194
0
.
0019464
0
.
014843
0
.
0019464
0
.
014843

0
0
0.77857 0.52036 0.0098697 0.0078644

0
0

0
0

0
0

1.1264
0

0.0012679
0.80775

I ar
I
ai
I br

0.015126 I bi
0.60375 I cr

1.2590 I ci

72.643
61.747

62.860
61.035

150.76

120

Example: Unbalanced three phase

load
Back Substitution
The six equations obtained at the end of the forward
elimination process are:
0.7460 I ar 0.4516 I ai 0.0100 I br 0.0080 I bi 0.0100 I cr 0.0080 I ci 120
1.0194 I ai 0.0019464 I br 0.014843 I bi 0.0019464 I cr 0.014843 I ci 72.643
0.77857 I br 0.52036 I bi 0.0098697 I cr 0.0078644 I ci 61.747

1.1264 I bi 0.0012679 I cr 0.015126 I ci 62.860

0.80775 I cr 0.60375 I ci 61.035

1.2590 I ci 150.76

Now solve the six equations starting with the sixth

equation and back substituting to solve the
remaining equations, ending with equation one

Example: Unbalanced three phase

load
Back Substitution
From the sixth equation:
1.2590 I ci 150.76

150.76
1.2590
119 .74

I ci

Substituting the value of Ici

in the fifth equation:
0.80775 I cr 0.60375 I ci 61.035
61.035 0.60375 I ci
0.80775
13.940

I cr

Example: Unbalanced three phase

load
Back Substitution
Substituting the value of Icr and Ici in the fourth equation
1.1264 I bi 0.0012679 I cr 0.015126 I ci 62.860
62.860 0.0012679 I cr 0.015126 I ci
I bi
1.1264

I bi 57.432

Substituting the value of Ibi , Icr and Ici in the third equation
0.77857 I br 0.52036 I bi 0.0098697 I cr 0.0078644 I ci 61.747
I br

61.747 0.52036 I bi 0.0098697 I cr 0.0078644 I ci

0.77857
I br 116.66

Example: Unbalanced three phase

load
Back Substitution

Substituting the value of Ibr , Ibi , Icr and Ici in the second
equation

1.0194 I ai 0.0019464 I br 0.014843 I bi 0.0019464 I cr 0.014843 I ci 72.643

I ai

72.643 0.0019464 I br 0.014843 I bi 0.0019464 I cr 0.014843 I ci

1.0194

I ai 71.973

Substituting the value of Iai , Ibr , Ibi , Icr and Ici in the first equation
0.7460 I ar 0.4516 I ai 0.0100 I br 0.0080 I bi 0.0100 I cr 0.0080 I ci 120
I ar

120 0.4516 I ai 0.0100 I br 0.0080 I bi 0.0100 I cr 0.0080 I ci

0.7460
I ar 119.33

Example: Unbalanced three phase

load
Solution:
The solution
vector is
I ar

119 .33
71.973

I
ai
I br 116 .66

57
.
432
bi

I cr 13.940

I ci 119 .74

THE END
http://numericalmethods.eng.usf.edu

Nave Gauss Elimination

Pitfalls
http://numericalmethods.eng.usf.edu

Pitfall#1. Division by
zero
10 x2 7 x3 3

6 x1 2 x2 3x3 11
5 x1 x2 5 x3 9
0 10 7
6 2
3

5 1 5

x1 3
x 11
2
x3 9

Is division by zero an issue

here?
12 x1 10 x2 7 x3 15
6 x1 5 x2 3x3 14
5 x1 x2 5 x3 9
7 x1 15
3 x2 14

1 5 x3 9

12 10
6 5
5

Is division by zero an issue

here? YES
12 x1 10 x2 7 x3 15
6 x1 5 x2 3x3 14
24 x1 x2 5 x3 28
12 10 7
6 5
3

24 1 5

x1 15
x 14
2
x3 28

7 x1 15
0
6.5 x2 6.5

12 21 19 x3 2
12
0

10

Division by zero is a possibility at any

step of forward elimination

Pitfall#2. Large Round-off

Errors
15
10 x 45
20
3 2.249

1
5

x 1.751
2

x3 9

Exact Solution

x1
x
2
x3

1
1

Pitfall#2. Large Round-off

Errors
15
10 x 45
20
3 2.249

1
5

x 1.751
2

x3 9

Solve it on a computer using

significant digits with
chopping

x1 0.9625
x 1.05
2

x3 0.999995

Pitfall#2. Large Round-off

Errors
15
10 x 45
20
3 2.249

1
5

x 1.751
2

x3 9

Solve it on a computer using

significant digits with
chopping

x1 0.625
x 1.5
2

x3 0.99995

Is there a way to reduce the round off

Avoiding Pitfalls
Increase the number of significant
digits
Decreases round-off error
Does not avoid division by zero

Avoiding Pitfalls
Gaussian Elimination with Partial
Pivoting
Avoids division by zero
Reduces round off error

THE END
http://numericalmethods.eng.usf.edu

Gauss Elimination with

Partial Pivoting

http://numericalmethods.eng.usf
.edu

Pitfalls of Nave Gauss

Elimination
Possible division by zero
Large round-off errors

Avoiding Pitfalls
Increase the number of significant
digits

Decreases round-off error

Does not avoid division by zero

Avoiding Pitfalls
Gaussian Elimination with Partial
Pivoting
Avoids division by zero
Reduces round off error

What is Different About Partial

Pivoting?
At the beginning of the kth step of forward
elimination, find the maximum of

akk , ak 1,k ,................, ank

a pk
If the maximum of the
values isth
in the p row,k p n, then switch rows p
and k.

Matrix Form at Beginning of 2nd

Step of Forward Elimination
a12
'
a22

a13
'
a23

'
32

'
33

a11
0

'
an 2

'
'
an 3 an 4

a1n x1 b1
'
'

a 2 n x2
b2

'
'
a3n x3 b3


'
'

ann xn bn

Example (2nd step of FE)

6
0

14

5.1 3.7

7
4
9

6
12
23

1
1
6

0 17 12

11

6 x1 5
2 x2 6

11 x3 8

8 x4 9
43 x5 3

Which two rows would you

switch?

Example (2nd step of FE)

6 14 5.1 3.7 6 x1 5
0 17 12 11 43 x 3

4
12 1 11 x3 8
0

x
0
9
23
6
8
9
4

0 7 6
1
2 x5 6

Switched Rows

Gaussian Elimination
with Partial Pivoting
A method to solve simultaneous
linear equations of the form [A]
[X]=[C]

Two steps
1. Forward Elimination
2. Back Substitution

Forward Elimination
Same as nave Gauss elimination
method except that we switch rows
before each of the (n-1) steps of
forward elimination.

Example: Matrix Form at

Beginning of 2nd Step of
Forward Elimination
a11
0

a12

a13

'
22
'
32

'
23
'
33

'
n2

'
n3

'
n4

a1n x1 b1
'
'

a 2 n x2
b2

'
'
a3n x3 b3


'
'

ann xn bn

Matrix Form at End of Forward

Elimination
a11 a12
0 a'
22

a13
a

'
23
"
33

a1n
'

a2 n
a

(n 1 )
ann

"
3n

x1
x
2

b1
b'
2

x3 b

xn bn(n-1 )

"
3

Back Substitution Starting

Eqns
a11 x1 a12 x 2 a13 x3 ... a1n x n b1
'
'
a22
x2 a23
x3 ... a2' n xn b2'

"
a33
x3 ... an" xn b3"
.
.
.

n 1

.
.
.

n 1

ann xn bn

Back Substitution
( n 1)
n
( n 1)
nn

b
xn
a
i 1

xi

bi

i 1

aij x j
j i 1
i 1
ii

for i n 1,...,1

THE END
http://numericalmethods.eng.usf.edu

Gauss Elimination with

Partial Pivoting
Example

http://numericalmethods.eng.usf
.edu

Example 2

Solve the following set of

equations by Gaussian
elimination with partial pivoting

5 1 a1
25
106.8
64

8 1 a 2 177.2

144 12 1 a 3
279.2

Example 2 Cont.
25 5 1 a1
106.8
25 5 1 106.8
64 8 1 a 177.2

64
8
1

177
.
2
2

144 12 1 a 3
279.2
144 12 1 279.2

1. Forward Elimination
2. Back Substitution

Forward Elimination

Number of Steps of Forward

Elimination
Number of steps of forward elimination
is (n1)=(31)=2

Forward Elimination: Step 1

Examine absolute values of first column, first row
and below.

25 , 64 , 144
Largest absolute value is 144 and exists in row
3.
Switch row 1 and row 3.

25
64

1 106.8
144 12 1 279.2
1 177.2 64 8 1 177.2
144 12 1 279.2
25 5 1 106.8
5
8

Forward Elimination: Step 1

(cont.)
144 12 1 279.2

64

25

8
5

1 177.2
1 106.8

Divide Equation 1 by 144

and
64
0.4444
144
multiply it by 64,

.
144 12 1 279.2 0.4444 63.99 5.333 0.4444 124.1

8
1 177.2
Subtract the result from 64
63.99 5.333 0.4444 124.1
Equation 2
.

2.667 0.5556 53.10

1
279.2
Substitute new equation 144 12
0 2.667 0.5556 53.10
for Equation 2

25
5
1
106.8

Forward Elimination: Step 1

(cont.)
144
12
1
279.2

25

2.667 0.5556 53.10

Divide Equation 1 by 144

and
25
0.1736
144
multiply it by 25,

106.8

.
144 12 1 279.2 0.1736 25.00 2.083 0.1736 48.47

25
25
0

Subtract the result from

Equation 3

Substitute new equation

for Equation 3

1 106.8

2.917

0.8264 58.33

2.083 0.1736 48.47

12
1
279.2
144
0 2.667 0.5556 53.10
0

2.917 0.8264 58.33

Forward Elimination: Step 2

Examine absolute values of second column, second row
and below.

2.667 , 2.917
Largest absolute value is 2.917 and exists in
row 3.
Switch row 2 and row 3.
12
1
279.2
12
1
279.2
144
144
0 2.667 0.5556 53.10 0 2.917 0.8264 58.33

0 2.917 0.8264 58.33

0 2.667 0.5556 53.10

Forward Elimination: Step 2

(cont.)
12
1
279.2
144
0 2.917 0.8264 58.33

0 2.667 0.5556 53.10

Divide Equation 2 by 2.917

and
2.667
multiply
it by 2.667,
0.9143.
2.917

2.917 0.8264 58.33 0.9143 0 2.667 0.7556 53.33

.

Subtract the result from

Equation 3

Substitute new equation

for Equation 3

0
0
0

2.667 0.5556 53.10

2.667 0.7556 53.33
0

0.2 0.23

12
1
279.2
144
0 2.917 0.8264 58.33

0.2

0.23

Back Substitution

Back Substitution
12
1
279.2
1
144
144 12
0 2.917 0.8264 58.33 0 2.917 0.8264

0
0
0
0.2 0.23
0
0.2

Solving for a3
0.2a3 0.23
0.23
a3
0 .2
1.15

a1
279.2
a 58.33
2

a3
0.23

Back Substitution (cont.)

1
144 12
0 2.917 0.8264

0
0.2
0

a1 279.2
a 58.33
2

a3 0.23

Solving for a2
2.917 a2 0.8264a3 58.33
58.33 0.8264a3
a2
2.917
58.33 0.8264 1.15

2.917
19.67

Back Substitution (cont.)

1
144 12
0 2.917 0.8264

0
0.2
0

a1 279.2
a 58.33
2

a3 0.23

Solving for a1

144a1 12a2 a3 279.2

279.2 12a2 a3
a1
144
279.2 12 19.67 1.15

144
0.2917

Gaussian Elimination with

Partial Pivoting Solution
25 5 1 a1
106.8
64 8 1 a 177.2

144 12 1 a3
279.2
a1
0.2917
a 19.67
2

a3
1.15

Gauss Elimination with

Partial Pivoting
Another Example

http://numericalmethods.eng.usf
.edu

Partial Pivoting: Example

Consider the system of equations

10 x1 7 x2 7

3 x1 2.099 x2 6 x3 3.901
5 x1 x2 5 x3 6
In matrix form

7 0
10
3 2.099 6

5
1 5

x1
7
x
3.901
2 =

x3
6

Solve using Gaussian Elimination with Partial Pivoting using five

significant digits with chopping

Partial Pivoting: Example

Forward Elimination: Step 1
Examining the values of the first column
|10|, |-3|, and |5| or 10, 3, and 5
The largest absolute value is 10, which means, to
follow the rules of Partial Pivoting, we switch
row1 with row1.
Performing Forward Elimination
7 0 x1 7
10
3 2.099 6 x 3.901

5
1 5 x3 6

7
0 x1 7
10
0 0.001 6 x 6.001

0
2.5
5 x3 2.5

Partial Pivoting: Example

Forward Elimination: Step 2
Examining the values of the first column
|-0.001| and |2.5| or 0.0001 and 2.5
The largest absolute value is 2.5, so row 2 is
switched with row 3
Performing the row swap
7
0 x1 7
10
0 0.001 6 x 6.001

0
2.5
5 x3 2.5

7
0 x1 7
10
0
x 2.5
2
.
5
5

0 0.001 6 x3 6.001

Partial Pivoting: Example

Forward Elimination: Step 2

Performing the Forward Elimination results in:

0
10 7
0 2.5

0
0 6.002

x1 7
x 2.5
2

x3 6.002

Partial Pivoting: Example

Back Substitution
Solving the equations through back substitution

10 7
0 2.5

0 x1
7
5 x 2 2.5
6.002
6.002 x3

6.002
x3
1
6.002

2.5 5 x3
x2
1
2.5
7 7 x 2 0 x3
x1
0
10

Partial Pivoting: Example

Compare the calculated and exact solution
The fact that they are equal is coincidence, but it
does illustrate the advantage of Partial Pivoting

X calculated

x1 0
x2 1
x3 1

X exact

x1 0
x 2 1
x3 1

THE END
http://numericalmethods.eng.usf.edu

Determinant of a Square
Matrix
Using Nave Gauss Elimination
Example

http://numericalmethods.eng.usf.edu

Theorem of Determinants
If a multiple of one row of [A]nxn is added or
subtracted to another row of [A]nxn to result
in [B]nxn then det(A)=det(B)

Theorem of Determinants
The determinant of an upper triangular matrix [A] nxn is
given by

det A a11 a22 ... aii ... ann

n

aii
i 1

Forward Elimination of a
Square Matrix
Using forward elimination to transform [A]nxn to an
upper triangular matrix, [U]nxn.

A nn U nn
det A det U

Example
Using nave Gaussian elimination find
the determinant of the following
square matrix.

25 5 1
64 8 1

144 12 1

Forward Elimination

Forward Elimination: Step 1

25 5 1
64 8 1

144 12 1

25

Divide Equation 1 by 25
and
64
2.56
25
multiply it by 64,

5 1 2.56. 64 12.8 2.56

Subtract the result from

Equation 2

64
64
0

Substitute new equation

for Equation 2

5
1
25
0 4.8 1.56

144 12
1

8
12.8

1
2.56

4.8 1.56

Forward Elimination: Step 1

5
1 (cont.)
25

0 4.8 1.56 Divide Equation 1 by 25

144

and
5.76
144 12

1 multiply it by 144,
25
.
25 5 1 5.76 144
28.8 5.76
.

Subtract the result from

Equation 3

Substitute new equation

for Equation 3

144 12
144 28.8
0 16.8

1
5.76

4.76

5
1
25
0 4.8 1.56

0 16.8 4.76

Forward Elimination: Step 2

5
1
25
0 4.8 1.56

0 16.8 4.76

Divide Equation 2 by
4.8

16.8multiply it by
and
3 .5
4 .8
16.8,

4.8 1.56 3.5 0 16..8 5.46

Subtract the result from

Equation 3

Substitute new equation

for Equation 3

0
0
0

16.8 4.76
16.8 5.46
0

0.7

5
1
25
0 4.8 1.56

0.7

Finding the Determinant

After forward elimination

5
1
25 5 1
25
64 8 1 0 4.8 1.56

0
0.7
144 12 1
0
.

det A u11 u 22 u33

25 4.8 0.7
84.00

Summary
-Forward Elimination
-Back Substitution
-Pitfalls
-Improvements
-Partial Pivoting
-Determinant of a Matrix

Additional Resources
For all resources on this topic such as digital
audiovisual lectures, primers, textbook chapters,
multiple-choice tests, worksheets in MATLAB,
MATHEMATICA, MathCad and MAPLE, blogs, related
physical problems, please visit
http://numericalmethods.eng.usf.edu/topics/gaussia
n_elimination.html

THE END
http://numericalmethods.eng.usf.edu