Tridiagonal matrix algorithm - TDMA (Thomas 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
where and . In matrix form, this system is written as
For such systems, the solution can be obtained in operations instead of required by Gaussian Elimination. A first sweep eliminates the '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).
The following algorithm performs the TDMA, overwriting the original arrays. In some situations this is not desirable, so some prefer to copy the original arrays beforehand.
Forward elimination phase
- for k = 2 step until n do
- end loop (k)
Backward substitution phase
- for k = n-1 stepdown until 1 do
- end loop (k)
In some situations, particularly those involving periodic boundary conditions, a slightly perturbed form of the tridiagonal system may need to be solved:
In matrix form, this is
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. We will now solve
is a slightly different tridiagonal system than above, and the solution to the perturbed system is obtained by solving
and compute as
In other situation, the system of equation may be block tridiagonal, with smaller submatrices arranged as the individual elements in the above matrix system. Simplified forms of Gaussian elimination have been developed for these situations.
- Conte, S.D., and deBoor, C. (1972), Elementary Numerical Analysis, McGraw-Hill, New York..
Still TODO: Add more references, more on the variants, make things nicer looking, and maybe more performance type info --Jasond 22:59, 7 April 2006 (MDT)