Thomas Algorithm for Tridiagonal Matrices
Translated by
ScribdTranslationsThomas Algorithm for Tridiagonal Matrices
Translated by
ScribdTranslationsMETHOD OF
THOMAS
THOMAS METHOD
Also known as the tridiagonal matrix algorithm.
It is a method that arises from applying the LU decomposition method to a tridiagonal matrix.
In general, a linear equation can be solved using the Gaussian elimination technique.
except for special types of matrices, where the Gaussian elimination method
It will require a lot of work, storage, and computer time.
WHEN IS IT USED?
. The Thomas algorithm is used when the coefficient matrix is tridiagonal.
WHAT IS A MATRIX
TRIADIAGONAL?
. A matrix A is called tridiagonal if its only non-zero elements are those corresponding to the
main diagonal and the upper and lower diagonals adjacent to the diagonal.
LU METHOD
. Given a square matrix A, we can express it as a product of matrices.
=
:
[ ] [ ]
=
:
1. 1 = 1
1. 1 = 1
′ 2 . 1= 1
′ 2 . 1 +1.2= 2
1. 2 = 2
…
′ . ′ −1 =
1. 1 =1→1= 1
11= 1→ 1= 1
′ 2. 1= 1 → ′ 2= 1 / 1
′ 2. 1 +1. ′ 2 = 2→ ′ 2 = 2 − ′ 2. 1
1. 2 = 2 → 2 = 2
…
′ . ′ −1 = → = ′ / ′ −1
′ . −1 +1.' = → ′ = − ′ . −1
EXAMPLE
. Given the following system of linear equations, solve by Thomas's method.
This is the selected text:
CODE (MATLAB)