gttrs#
Functions
-
void sgttrs(const char *trans, const INT n, const INT nrhs, const f32 *restrict DL, const f32 *restrict D, const f32 *restrict DU, const f32 *restrict DU2, const INT *restrict ipiv, f32 *restrict B, const INT ldb, INT *info)#
SGTTRS solves one of the systems of equations.
with a tridiagonal matrix A using the LU factorization computed by SGTTRF.A * X = B or A**T * X = B
Parameters
intransSpecifies the form of the system of equations.
'N': A * X = B (No transpose)'T': A**T * X = B (Transpose)'C': A**T * X = B (Conjugate transpose = Transpose)
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.inDLArray of dimension (
n-1). The (n-1) multipliers that define the matrix L from the LU factorization of A.inDArray of dimension (
n). The n diagonal elements of the upper triangular matrix U from the LU factorization of A.inDUArray of dimension (
n-1). The (n-1) elements of the first super-diagonal of U.inDU2Array of dimension (
n-2). The (n-2) elements of the second super-diagonal of U.inipivArray of dimension (
n). The pivot indices; for0<=i<n, row i of the matrix was interchanged with rowipiv[i].ipiv[i]will always be either i or i+1;ipiv[i]=iindicates a row interchange was not required.inoutBArray of dimension (
ldb,nrhs). On entry, the matrix of right hand side vectorsB. On exit,Bis overwritten by the solution vectors X.inldbThe leading dimension of the array
B.ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void sgttrs(
const char* trans,
const INT n,
const INT nrhs,
const f32* restrict DL,
const f32* restrict D,
const f32* restrict DU,
const f32* restrict DU2,
const INT* restrict ipiv,
f32* restrict B,
const INT ldb,
INT* info
);
Functions
-
void dgttrs(const char *trans, const INT n, const INT nrhs, const f64 *restrict DL, const f64 *restrict D, const f64 *restrict DU, const f64 *restrict DU2, const INT *restrict ipiv, f64 *restrict B, const INT ldb, INT *info)#
DGTTRS solves one of the systems of equations.
with a tridiagonal matrix A using the LU factorization computed by DGTTRF.A * X = B or A**T * X = B
Parameters
intransSpecifies the form of the system of equations.
'N': A * X = B (No transpose)'T': A**T * X = B (Transpose)'C': A**T * X = B (Conjugate transpose = Transpose)
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.inDLArray of dimension (
n-1). The (n-1) multipliers that define the matrix L from the LU factorization of A.inDArray of dimension (
n). The n diagonal elements of the upper triangular matrix U from the LU factorization of A.inDUArray of dimension (
n-1). The (n-1) elements of the first super-diagonal of U.inDU2Array of dimension (
n-2). The (n-2) elements of the second super-diagonal of U.inipivArray of dimension (
n). The pivot indices; for0<=i<n, row i of the matrix was interchanged with rowipiv[i].ipiv[i]will always be either i or i+1;ipiv[i]=iindicates a row interchange was not required.inoutBArray of dimension (
ldb,nrhs). On entry, the matrix of right hand side vectorsB. On exit,Bis overwritten by the solution vectors X.inldbThe leading dimension of the array
B.ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void dgttrs(
const char* trans,
const INT n,
const INT nrhs,
const f64* restrict DL,
const f64* restrict D,
const f64* restrict DU,
const f64* restrict DU2,
const INT* restrict ipiv,
f64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void cgttrs(const char *trans, const INT n, const INT nrhs, const c64 *restrict DL, const c64 *restrict D, const c64 *restrict DU, const c64 *restrict DU2, const INT *restrict ipiv, c64 *restrict B, const INT ldb, INT *info)#
CGTTRS solves one of the systems of equations.
with a tridiagonal matrix A using the LU factorization computed by CGTTRF.A * X = B, A**T * X = B, or A**H * X = B
Parameters
intransSpecifies the form of the system of equations.
'N': A * X = B (No transpose)'T': A**T * X = B (Transpose)'C': A**H * X = B (Conjugate transpose)
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.inDLArray of dimension (
n-1). The (n-1) multipliers that define the matrix L from the LU factorization of A.inDArray of dimension (
n). The n diagonal elements of the upper triangular matrix U from the LU factorization of A.inDUArray of dimension (
n-1). The (n-1) elements of the first super-diagonal of U.inDU2Array of dimension (
n-2). The (n-2) elements of the second super-diagonal of U.inipivArray of dimension (
n). The pivot indices; for0<=i<n, row i of the matrix was interchanged with rowipiv[i].ipiv[i]will always be either i or i+1;ipiv[i]=iindicates a row interchange was not required.inoutBArray of dimension (
ldb,nrhs). On entry, the matrix of right hand side vectorsB. On exit,Bis overwritten by the solution vectors X.inldbThe leading dimension of the array
B.ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void cgttrs(
const char* trans,
const INT n,
const INT nrhs,
const c64* restrict DL,
const c64* restrict D,
const c64* restrict DU,
const c64* restrict DU2,
const INT* restrict ipiv,
c64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void zgttrs(const char *trans, const INT n, const INT nrhs, const c128 *restrict DL, const c128 *restrict D, const c128 *restrict DU, const c128 *restrict DU2, const INT *restrict ipiv, c128 *restrict B, const INT ldb, INT *info)#
ZGTTRS solves one of the systems of equations.
with a tridiagonal matrix A using the LU factorization computed by ZGTTRF.A * X = B, A**T * X = B, or A**H * X = B
Parameters
intransSpecifies the form of the system of equations.
'N': A * X = B (No transpose)'T': A**T * X = B (Transpose)'C': A**H * X = B (Conjugate transpose)
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.inDLArray of dimension (
n-1). The (n-1) multipliers that define the matrix L from the LU factorization of A.inDArray of dimension (
n). The n diagonal elements of the upper triangular matrix U from the LU factorization of A.inDUArray of dimension (
n-1). The (n-1) elements of the first super-diagonal of U.inDU2Array of dimension (
n-2). The (n-2) elements of the second super-diagonal of U.inipivArray of dimension (
n). The pivot indices; for0<=i<n, row i of the matrix was interchanged with rowipiv[i].ipiv[i]will always be either i or i+1;ipiv[i]=iindicates a row interchange was not required.inoutBArray of dimension (
ldb,nrhs). On entry, the matrix of right hand side vectorsB. On exit,Bis overwritten by the solution vectors X.inldbThe leading dimension of the array
B.ldb>=max(1,n).outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal value
void zgttrs(
const char* trans,
const INT n,
const INT nrhs,
const c128* restrict DL,
const c128* restrict D,
const c128* restrict DU,
const c128* restrict DU2,
const INT* restrict ipiv,
c128* restrict B,
const INT ldb,
INT* info
);