hetrs_aa#
Functions
-
void chetrs_aa(const char *uplo, const INT n, const INT nrhs, const c64 *restrict A, const INT lda, const INT *restrict ipiv, c64 *restrict B, const INT ldb, c64 *restrict work, const INT lwork, INT *info)#
CHETRS_AA solves a system of linear equations A*X = B with a complex hermitian matrix A using the factorization A = U**H*T*U or A = L*T*L**H computed by CHETRF_AA.
Parameters
inuploSpecifies whether the details of the factorization are stored as an upper or lower triangular matrix. = ‘U’: Upper triangular, form is A = U**H*T*U; = ‘L’: Lower triangular, form is A = L*T*L**H.
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides, i.e., the number of columns of the matrix B. nrhs >= 0.
inAComplex*16 array, dimension (lda, n). Details of factors computed by CHETRF_AA.
inldaThe leading dimension of the array A. lda >= max(1, n).
inipivInteger array, dimension (n). Details of the interchanges as computed by CHETRF_AA.
inoutBComplex*16 array, dimension (ldb, nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.
inldbThe leading dimension of the array B. ldb >= max(1, n).
outworkComplex*16 array, dimension (max(1, lwork)).
inlworkThe dimension of the array work. If min(n, nrhs) = 0, lwork >= 1, else lwork >= 3*n-2. If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
void chetrs_aa(
const char* uplo,
const INT n,
const INT nrhs,
const c64* restrict A,
const INT lda,
const INT* restrict ipiv,
c64* restrict B,
const INT ldb,
c64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void zhetrs_aa(const char *uplo, const INT n, const INT nrhs, const c128 *restrict A, const INT lda, const INT *restrict ipiv, c128 *restrict B, const INT ldb, c128 *restrict work, const INT lwork, INT *info)#
ZHETRS_AA solves a system of linear equations A*X = B with a complex hermitian matrix A using the factorization A = U**H*T*U or A = L*T*L**H computed by ZHETRF_AA.
Parameters
inuploSpecifies whether the details of the factorization are stored as an upper or lower triangular matrix. = ‘U’: Upper triangular, form is A = U**H*T*U; = ‘L’: Lower triangular, form is A = L*T*L**H.
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides, i.e., the number of columns of the matrix B. nrhs >= 0.
inAComplex*16 array, dimension (lda, n). Details of factors computed by ZHETRF_AA.
inldaThe leading dimension of the array A. lda >= max(1, n).
inipivInteger array, dimension (n). Details of the interchanges as computed by ZHETRF_AA.
inoutBComplex*16 array, dimension (ldb, nrhs). On entry, the right hand side matrix B. On exit, the solution matrix X.
inldbThe leading dimension of the array B. ldb >= max(1, n).
outworkComplex*16 array, dimension (max(1, lwork)).
inlworkThe dimension of the array work. If min(n, nrhs) = 0, lwork >= 1, else lwork >= 3*n-2. If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
void zhetrs_aa(
const char* uplo,
const INT n,
const INT nrhs,
const c128* restrict A,
const INT lda,
const INT* restrict ipiv,
c128* restrict B,
const INT ldb,
c128* restrict work,
const INT lwork,
INT* info
);