CGTSL(3)

SYNOPSIS
SUBROUTINE CGTSL (N, C, D, E, B, INFO)

NAME
cgtsl - Solve a tridiagonal linear system.

LIBRARY
SLATEC (LINPACK)

CATEGORY
D2C2A

TYPE
COMPLEX (SGTSL-S, DGTSL-D, CGTSL-C)

KEYWORDS
LINEAR ALGEBRA, LINPACK, MATRIX, SOLVE, TRIDIAGONAL

AUTHOR
Dongarra, J., (ANL)

DESCRIPTION
CGTSL given a general tridiagonal matrix and a right hand side will find the solution. On Entry N INTEGER is the order of the tridiagonal matrix. C COMPLEX(N) is the subdiagonal of the tridiagonal matrix. C(2) through C(N) should contain the subdiagonal. On output C is destroyed. D COMPLEX(N) is the diagonal of the tridiagonal matrix. On output D is destroyed. E COMPLEX(N) is the superdiagonal of the tridiagonal matrix. E(1) through E(N-1) should contain the superdiagonal. On output E is destroyed. B COMPLEX(N) is the right hand side vector. On Return B is the solution vector. INFO INTEGER = 0 normal value. = K if the K-th element of the diagonal becomes exactly zero. The subroutine returns when this is detected.

REFERENCES
J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart, LINPACK Users' Guide, SIAM, 1979.

ROUTINES CALLED
(NONE)

REVISION HISTORY (YYMMDD)
780814 DATE WRITTEN
890831 Modified array declarations. (WRB)
890831 REVISION DATE from Version 3.2
891214 Prologue converted to Version 4.0 format. (BAB)
900326 Removed duplicate information from DESCRIPTION section. (WRB)
920501 Reformatted the REFERENCES section. (WRB)