ctrtrs - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
SUBROUTINE CTRTRS( UPLO, TRANSA, DIAG, N, NRHS, A, LDA, B, LDB, * INFO) CHARACTER * 1 UPLO, TRANSA, DIAG COMPLEX A(LDA,*), B(LDB,*) INTEGER N, NRHS, LDA, LDB, INFO
SUBROUTINE CTRTRS_64( UPLO, TRANSA, DIAG, N, NRHS, A, LDA, B, LDB, * INFO) CHARACTER * 1 UPLO, TRANSA, DIAG COMPLEX A(LDA,*), B(LDB,*) INTEGER*8 N, NRHS, LDA, LDB, INFO
SUBROUTINE TRTRS( UPLO, [TRANSA], DIAG, [N], [NRHS], A, [LDA], B, * [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO, TRANSA, DIAG COMPLEX, DIMENSION(:,:) :: A, B INTEGER :: N, NRHS, LDA, LDB, INFO
SUBROUTINE TRTRS_64( UPLO, [TRANSA], DIAG, [N], [NRHS], A, [LDA], B, * [LDB], [INFO]) CHARACTER(LEN=1) :: UPLO, TRANSA, DIAG COMPLEX, DIMENSION(:,:) :: A, B INTEGER(8) :: N, NRHS, LDA, LDB, INFO
#include <sunperf.h>
void ctrtrs(char uplo, char transa, char diag, int n, int nrhs, complex *a, int lda, complex *b, int ldb, int *info);
void ctrtrs_64(char uplo, char transa, char diag, long n, long nrhs, complex *a, long lda, complex *b, long ldb, long *info);
ctrtrs solves a triangular system of the form
where A is a triangular 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.
= 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.