CGTSL(3F)							     CGTSL(3F)

NAME    [Toc]    [Back]

     CGTSL   - CGTSL given a general tridiagonal matrix	and a right hand side
     will find the solution.

SYNOPSYS    [Toc]    [Back]

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

DESCRIPTION    [Toc]    [Back]

     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.  LINPACK.  This version dated	08/14/78 .  Jack
     Dongarra, Argonne National	Laboratory.  No	Externals Fortran
     ABS,AIMAG,REAL


									PPPPaaaaggggeeee 1111