pbtrs#
Functions
-
void spbtrs(const char *uplo, const INT n, const INT kd, const INT nrhs, const f32 *restrict AB, const INT ldab, f32 *restrict B, const INT ldb, INT *info)#
SPBTRS solves a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF.
Parameters
inuplo'U': Upper triangular factor stored in AB'L': Lower triangular factor stored in AB
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.innrhsThe number of right hand sides.
nrhs>=0.inABArray of dimension (
ldab,n). The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T of the band matrix A, stored in the firstkd+1rows of the array. The j-th column of U or L is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = U(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = L(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.inoutBArray of dimension (
ldb,nrhs). On entry, the right hand side matrixB. On exit, the solution matrix 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 spbtrs(
const char* uplo,
const INT n,
const INT kd,
const INT nrhs,
const f32* restrict AB,
const INT ldab,
f32* restrict B,
const INT ldb,
INT* info
);
Functions
-
void dpbtrs(const char *uplo, const INT n, const INT kd, const INT nrhs, const f64 *restrict AB, const INT ldab, f64 *restrict B, const INT ldb, INT *info)#
DPBTRS solves a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF.
Parameters
inuplo'U': Upper triangular factor stored in AB'L': Lower triangular factor stored in AB
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.innrhsThe number of right hand sides.
nrhs>=0.inABArray of dimension (
ldab,n). The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T of the band matrix A, stored in the firstkd+1rows of the array. The j-th column of U or L is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = U(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = L(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.inoutBArray of dimension (
ldb,nrhs). On entry, the right hand side matrixB. On exit, the solution matrix 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 dpbtrs(
const char* uplo,
const INT n,
const INT kd,
const INT nrhs,
const f64* restrict AB,
const INT ldab,
f64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void cpbtrs(const char *uplo, const INT n, const INT kd, const INT nrhs, const c64 *restrict AB, const INT ldab, c64 *restrict B, const INT ldb, INT *info)#
CPBTRS solves a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF.
Parameters
inuplo'U': Upper triangular factor stored in AB'L': Lower triangular factor stored in AB
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.innrhsThe number of right hand sides.
nrhs>=0.inABArray of dimension (
ldab,n). The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H of the band matrix A, stored in the firstkd+1rows of the array. The j-th column of U or L is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = U(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = L(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.inoutBArray of dimension (
ldb,nrhs). On entry, the right hand side matrixB. On exit, the solution matrix 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 cpbtrs(
const char* uplo,
const INT n,
const INT kd,
const INT nrhs,
const c64* restrict AB,
const INT ldab,
c64* restrict B,
const INT ldb,
INT* info
);
Functions
-
void zpbtrs(const char *uplo, const INT n, const INT kd, const INT nrhs, const c128 *restrict AB, const INT ldab, c128 *restrict B, const INT ldb, INT *info)#
ZPBTRS solves a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF.
Parameters
inuplo'U': Upper triangular factor stored in AB'L': Lower triangular factor stored in AB
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.innrhsThe number of right hand sides.
nrhs>=0.inABArray of dimension (
ldab,n). The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H of the band matrix A, stored in the firstkd+1rows of the array. The j-th column of U or L is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = U(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = L(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.inoutBArray of dimension (
ldb,nrhs). On entry, the right hand side matrixB. On exit, the solution matrix 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 zpbtrs(
const char* uplo,
const INT n,
const INT kd,
const INT nrhs,
const c128* restrict AB,
const INT ldab,
c128* restrict B,
const INT ldb,
INT* info
);