Introduction of Thomas Algorithm to TDMA

N=0

N=1

N=2

N=3

N=4

N=5

N=6

XL

X1

X2

X3

X4

X5

XR

B.C

!
#
#
#
#
#
#
#"

Interior node

b1

c1

a2

b2

c2

a3

b3

c3

a4

b4

a5

0 $!
&#
0 &#
&#
0 &#
c4 &#
&#
b5 &%#"

X1 $ !
& #
X2 & #
& #
X3 & = #
X4 & #
& #
X5 &% #"

S1 $
&
S2 &
&
S3 &
S4 &
&
S5 &%

A.1

b1 X1 + c1 X2 = S1 = Soriginal a1 X L

A.2

a2 X1 + b2 X2 + c2 X 3 = S2

A.3
A.4

B.C

a3 X2 + b3 X 3 + c3 X 4 = S3

Upper diagonal ais

a4 X 3 + b4 X 4 + c4 X5 = S4

A.5

a5 X 4 + b5 X5 = S5 = Soriginal c5 X R
Main diagonal ais
Lower diagonal ais

Start with A.1 and A.2

Solve with A.4 and A.7

A.2 b1 !!
b1 (a2 X1 + b2 X2 + c2 X 3 ) = b1S2
-)

A.1 a2 !!
a2 (b1 X1 + c1 X2 )

= a2 S1

A.4 b3" !!
b3# (a4 X 3 + b4 X 4 + c4 X5 ) = b3! S4
-)

A.7 a4 !!
a4 (b3! X 3 + c3 X 4 )

(b1b2 a2 c1 )X2 + b1c2 X 3 = b1S2 a2 S1

b1

(b2
A.6 !!
(

(b3!b4 a4 c3 )X 4 + b3! c4 X5 = b3! S4 a4 S3!

b3!

a2 c1
aS
)X2 + c2 X 3 = S2 2 1
b1
b1

b2!

)X2 + c2 X 3 =

= S3!

(b4

S2!

A.8 !!
(

a 4 c3
a S!
)X 4 + c4 X5 = S4 4 3
b3!
b3!

b4!

)X 4 + c4 X5 =

S4!

Solve with A.5 and A.8

A.3 b2" !!
b2# (a3 X2 + b3 X 3 + c3 X 4 ) = b2! S3
-)

A.6 a3 !!
a3 (b2! X2 + c2 X 3 )

=a3S2!

-)

A.5 b4" !!

b4# (a5 X 4 + b5 X5 ) = b4! S5

A.8 a5 !!

a5 (b4! X 4 + c4 X5 ) = S4!

(b2! b3 a3c2 )X 3 + b2! c3 X 4 = b2! S3 a3S2!

b2!

(b3
A.7 !!
(

(b4! b5 a5 c4 )X5 = b4! S5 a5 S4!

b2!

a3c2
a S!
)X 3 + c3 X 4 = S3 3 2
b2!
b2!

b3!

)X 3 + c3 X 4 =

S3!

(b5
A.9 !!

a5 c4
a S!
)X5 = S5 5 4
b4!
b4!

b5!

)X5 =

S5!

Introduction of Thomas Algorithm to TDMA

!
#
#
#
#
#
#
#"

b1

c1

a2

b2

c2

a3

b3

c3

a4

b4

a5

0 $!
&#
0 &#
&#
0 &#
c4 &#
&#
b5 &%#"

X1 $ !
& #
X2 & #
& #
X3 & = #
X4 & #
& #
X5 &% #"

S1 $ Result in an upper
&
S2 & bidiagonal form after
& using Thomas algorithm
S3 &
S4 &
&
S5 &%

!
#
#
#
#
#
#
#"

b1

c1

b2!

c2

b3!

c3

b4!

0 $!
&#
0 &#
&#
0 &#
c4 &#
&#
b5! &%#"

X1 $ !
& #
X2 & #
& #
X3 & = #
X4 & #
& #
X5 &% #"

S1 $
&
S2! &
&
S3! &
S4! &
&
S5! &%

Replace the coefficient of the main-diagonal term by:

bi! = bi

ai ci1
!
bi1

i = 2, 3,...,n

Replace the term on the right-hand side of the equation by:

Si! = Si

!
ai Si1
!
bi1

i = 2, 3,...,n

Examining the above system of equations, we note that the last equation, Eq.(A.
9),contains only one unknown, namely,Xn=5; hence:

Xn=5 =

!
Sn=5
!
bn=5

The solution of the remaining unknowns is obtained by working upward in the above
system. For example, the value of Xn=4 can be found from Eq.(A.8) as:

X n1=4 =

! cn1=4 X n=5
Sn1=4
!
bn1=4

Indeed, by inspection we can see that Eq.(A.8) can be replaced by the general recursion
formula:

Xi =

Si! ci Xi+1
bi!