Below is the system of equations in matrix form.

1 1
1
1
x1
2 3 1 1 x2

1 5 2 1 x3
5 1 1 1
x4

11
18
=

25
7

(1)

The augmented matrix is given by:

1 1
1
1
11
2 3 1 1 18

1 5 2 1 25
5 1 1 1 7

(2)

Apply the following operations: R2 2R1 , R3 R1 , R4 5R1 , to get:

1 1
1
1
11
0 1 3 3 4

0 6 3 0 36
0 6 6 6 48

(3)

Apply the following operations: R1 R2 , R3 + 6R2 , R4 + 6R2 :

1
0

0
0

0 4
4
15
1 3 3 4

0 21 18 60
0 24 24 72

Subtract R4 from R3 , then multiply R3 by 31 :

(4)

1
0

0
0

0 4
4
15
1 3 3 4

0 1
2
4
0 24 24 72

(5)

Apply the operations: R1 4R3 , R2 + 3R3 , R4 + 24R3 :

1
0

0
0

0 4 1
0 3
8

1 2
4
0 24 24

0
1
0
0

(6)

Divide R4 by 24, and apply the operations: R1 + 4R4 , R2 3R4 , R3 2R1 :

1
0

0
0

0
1
0
0

0
0
1
0

0
0
0
1

3
5

2
1

(7)

The solution to the system of equations is therefore:

x1
3
x2 5

x3 = 2
x4
1

As required. 

1. Solution to Problem 2
Using the Thomas Algorithm solve for the given system of equations

(8)

Solution:
Below is the system in matrix form:

2
1

0
0

1
4
1
0

0
1
4
1

0
P1
P2
0

1 P3
2
P4

4
12
=

18
11

(9)

The Thomas Algorithm is done by using the equations below to modify the coefficients of the augmented matrix:

(
c0i

ci
bi

i=1
i = 2, 3 . . . , n 1

ci
bi c0i1 ai

(d

d0i =

bi
di d0i1 ai
bi c0i1 ai

i=1
i = 2, 3 . . . , n

(10)

(11)

Then the solution is given using back-substitution:

xn = d0n

(12)

xi = d0i c0i xi+1

(13)

Therefore, we proceed by following this algorithm:

c01 =

c1
1
=
b1
2

(14)

c02 =

1
c2
=
0
b2 c1 a2
4

c03 =

1
c3
=
0
b 3 c 2 a3
4

1
2

2
7

2
7

(15)

7
26

(16)

d1
=2
b1

(17)

d02 =

d2 d01 a2
12 2
20
=
1 =
0
b 2 c 1 a2
7
4 2

(18)

d03 =

18 20
d2 d02 a3
53
7
=
2 =
0
b 3 c 2 a3
13
4 7

(19)

53
11 13
d4 d03 a4
=
7 = 4
b4 c03 a4
2 26

(20)

d01 =

d04 =

Next we apply back-substitution:

x4 = d04 = 4

(21)

x3 = d03 c03 x4 =

7
53

4=3
13 26

(22)

x2 = d02 c02 x3 =

20 2
3=2
7
7

(23)

x1 = d01 c01 x2 = 2

Therefore, the solution is given by:

1
2=1
2

(24)

x1
1
x2 2

x3 = 3
x4
4
As required. .

(25)