Scribd
Upload
116 views4 pages

Solution To Problem 2

1. The Thomas Algorithm was used to solve the given system of equations. 2. The coefficients of the augmented matrix were modified using the Thomas Algorithm equations. 3. Back-substitution was then used to solve for the variables, giving the solution as x1=1, x2=2, x3=3, x4=4.

Uploaded by

BBaire703
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
116 views4 pages

Solution To Problem 2

1. The Thomas Algorithm was used to solve the given system of equations. 2. The coefficients of the augmented matrix were modified using the Thomas Algorithm equations. 3. Back-substitution was then used to solve for the variables, giving the solution as x1=1, x2=2, x3=3, x4=4.

Uploaded by

BBaire703
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

2

1
6 0
6
4 0
0
Apply the operations: R1

0
1
0
0

4
3
1
24

3
15
4 7
7
4 5
72

4
3
2
24

(5)

4R3 , R2 + 3R3 , R4 + 24R3 :


2

1
6 0
6
4 0
0

3
0
4
1
0 3
8 7
7
1 2
4 5
0 24 24

0
1
0
0

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


2

1
6 0
6
4 0
0

0
1
0
0

0
0
1
0

0
0
0
1

(6)

3R4 , R3

3
3
5 7
7
2 5
1

2R1 :

(7)

The solution to the system of equations is therefore:


2

3 2
x1
3
6 x2 7 6 5
6
7 6
4 x3 5 = 4 2
x4
1

3
7
7
5

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

2
6 1
6
4 0
0

1
4
1
0

32
0
P1
6 P2
0 7
76
1 5 4 P3
2
P4

0
1
4
1

3
4
7 6 12 7
7=6
7
5 4 18 5
11

(9)

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

c0i

d0i =

ci
bi
bi

ci
c0i

(d

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

1 ai

i=1

bi
di d0i
bi c0i

1 ai
1 ai

i = 2, 3 . . . , n

(10)

(11)

Then the solution is given using back-substitution:

xn = d0n
xi = d0i

c0i xi+1

(12)
(13)

Therefore, we proceed by following this algorithm:

c01 =

c1
1
=
b1
2

(14)

b2

c2
1
=
0
c1 a2
4

b3

c3
1
=
0
c 2 a3
4

c02 =

c03 =

d01 =
d2
b2

d01 a2
12
=
0
c 1 a2
4

d03 =

d2
b3

18
d02 a3
=
0
c 2 a3
4

d4
b4

2
7

(15)

2
7

7
26

(16)

d1
=2
b1

d02 =

d04 =

1
2

11
d03 a4
=
c03 a4
2

(17)
2
1
2

20
7

(18)

53
13

(19)

=4

(20)

20
7
2
7
53
13
7
26

Next we apply back-substitution:

x4 = d04 = 4

(21)

x3 = d03

c03 x4 =

53
13

7
4=3
26

(22)

x2 = d02

c02 x3 =

20
7

2
3=2
7

(23)

x1 = d01

Therefore, the solution is given by:

c01 x2 = 2

1
2=1
2

(24)

3 2
x1
1
6 x2 7 6 2
6
7 6
4 x3 5 = 4 3
x4
4
As required. .

3
7
7
5

(25)

You might also like