A method which can be used to solve a Tridiagonal Matrix equation with largest absolute values in each row and column dominated by the diagonal element. Each diagonal element is solved for, and an approximate value plugged in. The process is then iterated until it converges. This algorithm is a stripped-down version of the Jacobi Method of matrix diagonalization.
See also Jacobi Method, Tridiagonal Matrix
Acton, F. S. Numerical Methods That Work, 2nd printing. Washington, DC: Math. Assoc. Amer.,
pp. 161-163, 1990.