cgtsl
cgtsl - (obsolete) solve the linear system Ax = b for a tridiagonal matrix A and vectors b
and x.
SUBROUTINE CGTSL( N, SUB, DIAG, SUPER, B, INFO)
COMPLEX SUB(*), DIAG(*), SUPER(*), B(*)
INTEGER N, INFO
SUBROUTINE CGTSL_64( N, SUB, DIAG, SUPER, B, INFO)
COMPLEX SUB(*), DIAG(*), SUPER(*), B(*)
INTEGER*8 N, INFO
#include <sunperf.h>
void cgtsl(int n, complex *sub, complex *diag, complex *super, complex *b, int *info);
void cgtsl_64(long n, complex *sub, complex *diag, complex *super, complex *b, long *info);
-
* N (input)
-
Order of the matrix A. N >= 0.
-
* SUB (input)
-
Subdiagonal of A. SUB(2) through SUB(N) contain the
subdiagonal and SUB(1) is not referenced.
-
* DIAG (input)
-
Diagonal of A.
-
* SUPER (input)
-
Superdiagonal of A. SUPER(1) through SUPER(N-1) contain
the superdiagonal and SUPER(N) is not referenced.
-
* B (input/output)
-
On entry, the right-hand side vector b.
On exit, the solution vector x.
-
* INFO (output)
-
On exit:
INFO = 0 Subroutine completed normally.
INFO > 0 Returns a value k when the kth element of the diagonal
becomes exactly zero.