ctbtrs - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
SUBROUTINE CTBTRS( UPLO, TRANSA, DIAG, N, NDIAG, NRHS, A, LDA, B, * LDB, INFO) CHARACTER * 1 UPLO, TRANSA, DIAG COMPLEX A(LDA,*), B(LDB,*) INTEGER N, NDIAG, NRHS, LDA, LDB, INFO
SUBROUTINE CTBTRS_64( UPLO, TRANSA, DIAG, N, NDIAG, NRHS, A, LDA, B, * LDB, INFO) CHARACTER * 1 UPLO, TRANSA, DIAG COMPLEX A(LDA,*), B(LDB,*) INTEGER*8 N, NDIAG, NRHS, LDA, LDB, INFO
SUBROUTINE TBTRS( UPLO, TRANSA, DIAG, [N], NDIAG, [NRHS], A, [LDA], * B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO, TRANSA, DIAG COMPLEX, DIMENSION(:,:) :: A, B INTEGER :: N, NDIAG, NRHS, LDA, LDB, INFO
SUBROUTINE TBTRS_64( UPLO, TRANSA, DIAG, [N], NDIAG, [NRHS], A, [LDA], * B, [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO, TRANSA, DIAG COMPLEX, DIMENSION(:,:) :: A, B INTEGER(8) :: N, NDIAG, NRHS, LDA, LDB, INFO
#include <sunperf.h>
void ctbtrs(char uplo, char transa, char diag, int n, int ndiag, int nrhs, complex *a, int lda, complex *b, int ldb, int *info);
void ctbtrs_64(char uplo, char transa, char diag, long n, long ndiag, long nrhs, complex *a, long lda, complex *b, long ldb, long *info);
ctbtrs solves a triangular system of the form
where A is a triangular band matrix of order N, and B is an N-by-NRHS matrix. A check is made to verify that A is nonsingular.
= 'U': A is upper triangular;
= 'L': A is lower triangular.
= 'N': A * X = B (No transpose)
= 'T': A**T * X = B (Transpose)
= 'C': A**H * X = B (Conjugate transpose)
= 'N': A is non-unit triangular;
= 'U': A is unit triangular.
A(kd+1+i-j,j)
= A(i,j)
for max(1,j-kd)
< =i < =j;
if UPLO = 'L', A(1+i-j,j)
= A(i,j)
for j < =i < =min(n,j+kd).
If DIAG = 'U', the diagonal elements of A are not referenced
and are assumed to be 1.
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, the i-th diagonal element of A is zero, indicating that the matrix is singular and the solutions X have not been computed.