NAME

SYNOPSIS

  SUBROUTINE CGBSL( A, LDA, N, NSUB, NSUPER, IPIVOT, B, JOB)
  COMPLEX A(LDA,*), B(*)
  INTEGER LDA, N, NSUB, NSUPER, JOB
  INTEGER IPIVOT(*)
 
  SUBROUTINE CGBSL_64( A, LDA, N, NSUB, NSUPER, IPIVOT, B, JOB)
  COMPLEX A(LDA,*), B(*)
  INTEGER*8 LDA, N, NSUB, NSUPER, JOB
  INTEGER*8 IPIVOT(*)
 

C INTERFACE

void cgbsl(complex *a, int lda, int n, int nsub, int nsuper, int *ipivot, complex *b, int job);

void cgbsl_64(complex *a, long lda, long n, long nsub, long nsuper, long *ipivot, complex *b, long job);

ARGUMENTS

* A (input)

LU factorization of the matrix A, as computed by CGBCO or CGBFA.

* LDA (input)

Leading dimension of the array A as specified in a dimension or type statement. LDA >= 2 * NSUB + NSUPER + 1.

* N (input)

Order of the matrix A. N >= 0.

* NSUB (input)

Number of subdiagonals of A. N-1 >= NSUB >= 0 but if N = 0 then NSUB = 0.

* NSUPER (input)

Number of superdiagonals of A. N-1 >= NSUPER >= 0 but if N = 0 then NSUPER = 0.

* IPIVOT (input)

Pivot vector as computed by CGBCO or CGBFA.

* B (input/output)

On entry, the right-hand side vector b. On exit, the solution vector x.

* JOB (input)

Determines which operation this subroutine will perform:

0 solve the system Ax = b

not 0 solve the linear system AHx = b Note that ATx = AHx for real matrices.