Numerical Methods (CENG 2002) Lecture Note

CHAPTER -III
LINEAR ALGEBRAIC EQUATIONS

3.1 Introduction
In this chapter, we will deal with the case of determining the values of x1 , x 2 ,..., x n that
simultaneously satisfy the set of equations:
f1 x1 , x 2 ,..., x n   0
f 2 x1 , x 2 ,..., x n   0
(3.1)
......
f n x1 , x 2 ,..., x n   0
In particular we will consider linear algebraic equations which are of the form:
a11 x1  a12 x 2  ...  a1n x n  b1
a 21 x1  a 22 x 2  ...  a 2 n x n  b2
(3.2)
....
a n1 x1  a n12 x 2  ...  a n1n x n  bn

where the a 's are constant coefficients, the b 's are constants, and n is the number of
equations.
The above system of linear equations may also be written in matrix form as:
AX   B (3.3)
where A is an n by n square matrix of coefficients (called the coefficient matrix),
 a11 a12 ... a1n 
a a ... a 2 n 
A   21 22
 ... ... ... ... 
 
a1n a 2 n ... a nn 
B is an n by 1 column vector of constants,
BT  b1
b2 ... bn 
and X  is an n by 1 column vector of unknowns:
X   x1 x2 ... xn 

3.2 Non - Computer methods

There are some non-computer methods which are used to solve small ( n  3 ) sets of
simultaneous equations that do not require a computer.

Academic year 2007/8 Instructor: Workman Paulo’s 1

Numerical Methods (CENG 2002) Lecture Note

3.2.1 The Graphical Method

Plotting the graphs (straight lines) and finding the point of intersection of the graphs.
3.2.2 Cramer's Rule
Cramer's rule states that the solution of a set of linear equations given in Eq. 3.3 can be
give as:
Di
xi  (3.4)
D
where D is the determinant of the coefficient matrix A , and Di is the determinant of
the matrix obtained by replacing the coefficients of the unknown xi in the coefficient
matrix by the constants b1 , b2 , ..., bn . For example, x1 can be obtained as:

b1 a12 a13
b2 a 22 a 23
b3 a32 a33
x1 
D
For more than three equations, Cramer's rule becomes impractical because, as the number
of equations increase, the determinants are time-consuming to evaluate by hand (or by
computer). Consequently, more efficient alternatives are used.
3.2.3 Elimination of Unknowns
The basic strategy is to multiply the equations by constants so that one of the unknowns
will be eliminated when the equations are combined. The result is a single equation that
can be solved for the remaining unknown. This can then be substituted into either of the
original equations to compute the other variable.
The elimination of unknowns can be extended to systems with more than two or three
equations. However, the numerous calculations that are required for larger systems make
the method extremely tedious to implement by hand. However, the technique can be
formalized and readily programmed for the computer.

3.3 Gauss Elimination

3.3.1 Description of the method
The approach is designed to solve a general set of n equations:

a11x1  a12 x2  ...  a1n xn  b1 (3.5a)

a21x1  a22 x2  ...  a2n xn  b2 (3.5b)
....
a1n x1  a1n x2  ...  ann xn  bn (3.5c)

Academic year 2007/8 Instructor: Workman Paulo’s 2

Numerical Methods (CENG 2002) Lecture Note

The naive Gauss elimination method consists of two phases:

1. Forward Elimination: The first step is designed to reduce the set of equations to an
upper triangular system. The initial step will be to eliminate the first unknown x1 ,
from the second through the n th equations. To do this, multiply Eq. (3.5a) by a21 a11
to give:
a 21 a a
a 21 x1  a12 x2  ...  21 a1n xn  21 b1 (3.6)
a11 a11 a11
Now this equation can be subtracted from Eq. 3.5b to give:
 a   a  a
 a 22  21 a12  x2  ...   a 2 n  21 a1n xn  b2  21 b1
 a11   a11  a11
or
 x2  .....  a2 n xn  b2
a22

where the prime indicates that the elements have been changed from their original values.
The procedure is then repeated for the remaining equations. For instance, Eq. (3.5a) can
be multiplied by a31 a11 and the result subtracted from the third equation. Repeating the
procedure for the remaining equations results in the following modified system:

a11x1  a12 x2  a13 x3  ...  a1n xn  b1 (3.7a)

 x2  a23
a22  x3  ...  a2 n xn  b2 (3.7b)
 x2  a33
a32  x3  ...  a3 n xn  b3 (3.7c)
.....

an 2 x2  an 3 x3  ...  ann

 xn  bn (3.7d)

For the foregoing steps, Eq.(3.5a) is called the pivot equation, and a11 is the pivot
coefficient or element.

Now repeat the above to eliminate the second unknown from Eq. (3.7c) through Eq.
 a22
(3.7d). To this multiply Eq. (3.7b) by a32  , and subtract the result from Eq. (3.7c).
Perform a similar elimination for the remaining equations to yield

a11x1  a12 x2  a13 x3  ...  a13 xn  b1

 x2  a23
a22  x3  ...  a2 n xn  b2
 x3  ...  a3n xn  b3
a33
.....

an3 x3  ...  ann

 xn  bn

Academic year 2007/8 Instructor: Workman Paulo’s 3

Numerical Methods (CENG 2002) Lecture Note

where the double prime indicates that the elements have been modified twice.
The procedure can be continued using the remaining pivot equations. The final
manipulation in the sequence is to use the n  1th equation to eliminate the x n 1 term
from the nth equation. At this point, the system will have been transformed to an upper
triangular system:
a11x1  a12 x2  a13 x3  ...  a1n xn  b1n (3.8a)
 x2  a23
a22  x3  ...  a2 n xn  b2 (3.8b)
 x3  ...  a3n xn  b3
a33 (3.8c)
.
.
.
n 1
ann xn  bnn1 (3.8d)

2. Back Substitution: Eq. (3.8d) can now be solved for x n :

bnn 1
x n  n 1 (3.9)
an

This result can be back substituted into the n  1th equation to solve for x n 1 . The
procedure, which is repeated to evaluate the remaining x 's, can be represented by the
following formula:

n
bii 1   a
j i 1
ij
i 1
xj
xi  for i  n  1, n  2,...,1 (3.10)
aiii 1

3.3.2 Pitfalls of Gauss Elimination

Whereas there are many systems of equations that can be solved with naive Gauss
elimination, there are some pitfalls that must be explored before writing general computer
program to implement the method.
i, Division by Zero
The primary reason that the foregoing technique is called "naive" is that during both
elimination and back-substitution phases, it is possible that a division by zero can occur.
Problems also arise when the coefficient is very close to zero. The technique of pivoting
(to be discussed later) has been developed to partially avoid these problems.
ii, Round-off Errors
The problem of round-off errors can become particularly important when large numbers
of equations are to be solved. A rough rule of thumb is that round-off errors may be
important when dealing with 100 or more equations. In any event, one should always

Academic year 2007/8 Instructor: Workman Paulo’s 4

Numerical Methods (CENG 2002) Lecture Note

substitute the answers back into the original equations to check whether a substantial
error has occurred.
iii, Ill conditioned Systems
Ill-conditioned systems are those where a small change in coefficients in large changes in
the solution. An alternative interpretation of ill-conditioning is that a wide range of
answers can approximately satisfy the equations.
An ill-conditioned system is one with a determinant of the coefficient matrix close to
zero. It is difficult to specify how close to zero the determinant must be to indicate ill-
conditioning. This is complicated by the fact that the determinant can be changed by
multiplying one or more of the equations by a scale factor without changing the solution.
One way to avoid this difficulty is to scale the equations so that the maximum element in
any row is equal to 1 (This process is called scaling).
iv, Singular Systems
The system is singular when at least two of the equations are identical. In such cases, we
would lose one degree of freedom, and would be dealing with impossible case of n  1
equations in n unknowns. Such cases might not be obvious particularly when dealing
with large equation sets. Consequently, it would be nice to have some way of
automatically detecting singularity. The answer to this problem is neatly offered by the
fact that the determinant of a singular system is zero. This idea can, in turn, be connected
to Gauss elimination by recognizing that after the elimination step, the determinant can
be evaluated as the product of the diagonal elements. Thus, a computer algorithm can test
to discern whether a zero diagonal element is created during the elimination stage.
3.3.3 Techniques for Improving Solutions
1. Use of more significant figures.
2. Pivoting: can be partial or complete.
Partial Pivoting: Determine the largest available coefficient in the column below the
pivot element. The rows are then switched so that the largest element is the pivot
element.
Complete Pivoting: When columns as well as rows are switched.
3. Scaling: Scaling is the process by which the maximum element in a row is made to be
1 by dividing the equation by the largest coefficient.

Gauss-Jordan Elimination
Gauss-Jordan is a variation of the Gauss elimination. The major difference is that when
an unknown is eliminated in the Gauss-Jordan method, it is eliminated from all other
equations rather than just the subsequent ones. In addition, all rows are normalized by
dividing them by their pivot elements. Thus, the elimination step results in an identity
matrix rather than a triangular matrix. Thus, back-substitution is not necessary.
The method is attributed to Johann Carl Friedrich Gauss (1777-1855) and Wilhelm
Jordan (1842 to 1899).

Academic year 2007/8 Instructor: Workman Paulo’s 5

Numerical Methods (CENG 2002) Lecture Note

Example Use the Gauss-Jordan elimination method to solve the linear system

First form the augmented matrix M = [A , B]

Then perform Gauss-Jordan elimination.

Hence, the solution is

LU-Decomposition
Gauss elimination is a sound way to solve systems of algebraic equations of the form
AX   B (3.11)
However, it becomes inefficient when solving equations with the same coefficients A ,
but with different right-hand side constants.
LU decomposition methods separate the time-consuming elimination of the matrix A
from the manipulations of the right-hand side B. Thus, once A has been
"decomposed", multiple right-hand side vectors can be evaluated in an efficient manner.

3.5.1 Derivation of LU Decomposition Method

Eq. (2.11) can be rearranged to give:
AX  B  0 (3.12)
Suppose that Eq. (3.12) could be expressed as an upper triangular system:

Academic year 2007/8 Instructor: Workman Paulo’s 6

Numerical Methods (CENG 2002) Lecture Note

u11 u12 u13   x1   d1 

0 u    
 22 u 23   x 2   d 2  (3.13)
 0 0 u 33   x3  d 3 

Eq. (3.13) can also be expressed in matrix notation and rearranged to give:
U X  D  0 (3.14)
Now, assume that there is a lower diagonal matrix with 1's on the diagonal,

1 0 0
L  l 21 1 0 (3.15)
l31 l32 1

that has the property that when Eq. (3.14) is premultiplied by it, Eq. (3.12) is the result.
That is,
LU X  D  AX  B (3.16)
If this equation holds, it follows that
LU   A (3.17)
and
LD  B (3.18)

A two-step strategy (see Fig. 3.1) for obtaining solutions can be based on Eqs. (3.14),
(3.17) and (3.18):
1. LU decomposition step. A is factored or decomposed into the lower L  and upper
U  triangular matrices.
2. Substitution step. L  and U  are used to determine a solution X  for a right-hand
side B. This step itself consists of two steps. First, Eq. (3.18) is used to generate an
intermediate vector by forward substitution. Then, the result is substituted into Eq.
(3.14) which can be solved by back substitution for X .

Academic year 2007/8 Instructor: Workman Paulo’s 7

Numerical Methods (CENG 2002) Lecture Note

A X   B
(a) Decomposition

U  L

L D  B

(b) Forward

D
Substitution
U  X   D
(c) Backward
X 

Fig. 3.1 Steps in LU Decomposition

Example Given

Find matrices L and U so that LU = A.

Academic year 2007/8 Instructor: Workman Paulo’s 8

Numerical Methods (CENG 2002) Lecture Note

Hence,

Gauss-Seidel Method
Iteration is a popular technique finding roots of equations. Generalization of fixed point
iteration can be applied to systems of linear equations to produce accurate results. The
Gauss-Seidel mehtod is the most common iterative method and is attributed to Philipp
Ludwig von Seidel (1821-1896).
Consider that the n×n square matrix A is split into three parts, the main diagonal D, below
diagonal L and above diagonal U. We have A = D - L - U.

A=

D=

U=

Academic year 2007/8 Instructor: Workman Paulo’s 9

Numerical Methods (CENG 2002) Lecture Note

L=

The solution to the linear system AX=B can be obtained starting with P0, and using
iteration scheme

where

and
.

A sufficient condition for the method to be applicable is that A is strictly diagonally

dominant.
Example1 Use Gauss-Seidel iteration to solve the linear system

.
Try 10 iterations.

The system can be expressed as

Using 10 iterations we have:

Academic year 2007/8 Instructor: Workman Paulo’s 10

Numerical Methods (CENG 2002) Lecture Note

Hence,

For the purpose of hand calculation let’s see 3 set of linear equations containing 3
unknowns.

a11 x1  a12 x 2  a13 x3  b1

a 21 x1  a 22 x 2  a 23 x3  b2
a31 x1  a32 x 2  a 33 x3  b3

If the diagonal elements are all nonzero, the first equation can be solved for x1 , the
second for x 2 and the third for x3 to yield:

b1  a12 x2  a13 x3
x1 = (a)
a11

b2  a 21 x1  a 23 x3
x2 = (b)
a 22

b3  a31 x1  a32 x2
x3 = (c)
a33

Steps to be followed
i Using the initital guess x 2 = x3 = 0.0 solve for x1 from (a)
ii Using the values of x1 from step i and x3 = 0.0 solve for x 2 from (b)
iii Using the value of x1 from step i and that of x 2 from step ii solve for x3 from (c)
iv Using the value of x 2 from step ii and that of x3 from step iii solve for x1 from (a)
v Using the value of x1 from step iv and that of x3 from step iii solve for x 2 from (b)
vi Using the value of x1 from step iv and that of x 2 from step v solve for x3 from(c)
vii Repeat the process until the required accuracay is achieved.

Example2 Use the Gauss-Seidel method to obtain the solution of the following system of
linear equations.
5 x1  x 2  x3  4
x1  3x 2  x3  2
 x1  x 2  4 x3  3

Academic year 2007/8 Instructor: Workman Paulo’s 11

Numerical Methods (CENG 2002) Lecture Note

4  x 2  x3
Solving for: x1 from eq1 x1 =
5

2  x1  x3
x 2 from eq2 x2 =
3

3  x1  x 2
x3 from eq3 x3 =
4

Executing the above steps repetitively we will have the following result.

x1 x2 x3
0.8 0.4 0.85
0.71 0.146667 0.890833
0.651167 0.152667 0.874625
0.655608 0.156589 0.874755
0.656367 0.156293 0.875019
0.656255 0.156242 0.875003
0.656248 0.15625 0.875
0.65625 0.15625 0.875
0.65625 0.15625 0.875

As we can see the values start to repeat after the 8th iteration hence we can stop the
calculation and take the final values as the solution of the linear system of equations.

Hence, x1 = 0.65625
x 2 = 0.15625
x3 = 0.875

Academic year 2007/8 Instructor: Workman Paulo’s 12

Numerical Methods (CENG 2002) Lecture Note

hg

Academic year 2007/8 Instructor: Workman Paulo’s 13