TRIDIAGONAL MATRIX ALGORITHM

The 'tridiagonal matrix algorithm' ('TDMA'), also known as the 'Thomas algorithm', is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations. A tridiagonal system may be written as
:$$
a_i x_{i - 1} + b_i x_i + c_i x_{i + 1} = d_i , ,!
where $a\_1\; =\; 0,$ and $c\_n\; =\; 0,$. In matrix form, this system is written as
:$$
left[
egin{matrix}
{b_1} & {c_1} & { } & { } & { 0 } \
{a_2} & {b_2} & {c_2} & { } & { } \
{ } & {a_3} & {b_3} & cdot & { } \
{ } & { } & cdot & cdot & {c_{n-1}}\
{ 0 } & { } & { } & {a_n} & {b_n}\
end{matrix}
ight]
left[
egin{matrix}
{x_1 } \
{x_2 } \
cdot \
cdot \
{x_n } \
end{matrix}
ight]
=
left[
egin{matrix}
{d_1 } \
{d_2 } \
cdot \
cdot \
{d_n } \
end{matrix}
ight].

For such systems, the solution can be obtained in $O(n)$ operations instead of $O(n^3)$ required by Gaussian elimination. A first sweep eliminates the $a\_i$'s, and then an (abbreviated) backward substitution produces the solution. Example of such matrices commonly arise from the discretization of 1D problems (e.g. the 1D Poisson problem).

Contents

Algorithm

Variants

Links

References

Algorithm

Forward elimination phase
: $b\text{'}\_1\; =\; b\_1\; ,!$
: $d\text{'}\_1\; =\; d\_1,!$
: for ''k'' = 2 step 1 until ''n'' do
:: $m\; =\; \{\{a\_k\; \}\; over\; \{b\text{'}\_\{k\; -\; 1\}\; \}\}\; ,!$
:: $b\text{'}\_k\; =\; b\_k\; -\; mc\_\{k\; -\; 1\}\; ,!$
:: $d\text{'}\_k\; =\; d\_k\; -\; md\text{'}\_\{k\; -\; 1\}\; ,!$
: end loop (''k'')
Backward substitution phase
: $x\_n\; =\; \{\{d\text{'}\_n\; \}\; over\; \{b\text{'}\_n\; \}\}\; ,!$
: for ''k'' = ''n''−1 step −1 until 1 do
:: $x\_k\; =\; \{\{d\text{'}\_k\; -\; c\_k\; x\_\{k\; +\; 1\}\; \}\; over\; \{b\text{'}\_k\; \}\}\; ,!$
: end loop (''k'')

Variants

In some situations, particularly those involving periodic boundary conditions, a slightly perturbed form of the tridiagonal system may need to be solved:
:$$
a_1 x_{n} + b_1 x_1 + c_1 x_2 = d_1, ,!

:$$
a_i x_{i - 1} + b_i x_i + c_i x_{i + 1} = d_i,quadquad i = 2,ldots,n-1 ,!

:$$
a_n x_{n-1} + b_n x_n + c_n x_1 = d_n. ,!

In this case, we can make use of the Sherman-Morrison formula to avoid the additional operations of Gaussian elimination and still use the Thomas algorithm.
In other situations, the system of equations may be 'block tridiagonal' (see block matrix), with smaller submatrices arranged as the individual elements in the above matrix system(e.g. the 2D Poisson problem). Simplified forms of Gaussian elimination have been developed for these situations.

Links

Thomas algorithm - SCILAB
Thomas algorithm for tridiagonal superior periodic matrix - SCILAB

References

★ Elementary Numerical Analysis, Conte, S.D., and deBoor, C., , , McGraw-Hill, New York., 1972,

★