pbtrf#
Functions
-
void spbtrf(const char *uplo, const INT n, const INT kd, f32 *restrict AB, const INT ldab, INT *info)#
SPBTRF computes the Cholesky factorization of a real symmetric positive definite band matrix A.
The factorization has the form A = U**T * U, if UPLO = ‘U’, or A = L * L**T, if UPLO = ‘L’, where U is an upper triangular matrix and L is lower triangular.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
inkdThe number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.
inoutABThe banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.
inldabThe leading dimension of AB. ldab >= kd+1.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = k, the leading minor of order k is not positive definite.
void spbtrf(
const char* uplo,
const INT n,
const INT kd,
f32* restrict AB,
const INT ldab,
INT* info
);
Functions
-
void dpbtrf(const char *uplo, const INT n, const INT kd, f64 *restrict AB, const INT ldab, INT *info)#
DPBTRF computes the Cholesky factorization of a real symmetric positive definite band matrix A.
The factorization has the form A = U**T * U, if UPLO = ‘U’, or A = L * L**T, if UPLO = ‘L’, where U is an upper triangular matrix and L is lower triangular.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
inkdThe number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.
inoutABThe banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.
inldabThe leading dimension of AB. ldab >= kd+1.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = k, the leading minor of order k is not positive definite.
void dpbtrf(
const char* uplo,
const INT n,
const INT kd,
f64* restrict AB,
const INT ldab,
INT* info
);
Functions
-
void cpbtrf(const char *uplo, const INT n, const INT kd, c64 *restrict AB, const INT ldab, INT *info)#
CPBTRF computes the Cholesky factorization of a complex Hermitian positive definite band matrix A.
The factorization has the form A = U**H * U, if UPLO = ‘U’, or A = L * L**H, if UPLO = ‘L’, where U is an upper triangular matrix and L is lower triangular.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
inkdThe number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.
inoutABThe banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.
inldabThe leading dimension of AB. ldab >= kd+1.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = k, the leading minor of order k is not positive definite.
void cpbtrf(
const char* uplo,
const INT n,
const INT kd,
c64* restrict AB,
const INT ldab,
INT* info
);
Functions
-
void zpbtrf(const char *uplo, const INT n, const INT kd, c128 *restrict AB, const INT ldab, INT *info)#
ZPBTRF computes the Cholesky factorization of a complex Hermitian positive definite band matrix A.
The factorization has the form A = U**H * U, if UPLO = ‘U’, or A = L * L**H, if UPLO = ‘L’, where U is an upper triangular matrix and L is lower triangular.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
inkdThe number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.
inoutABThe banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.
inldabThe leading dimension of AB. ldab >= kd+1.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = k, the leading minor of order k is not positive definite.
void zpbtrf(
const char* uplo,
const INT n,
const INT kd,
c128* restrict AB,
const INT ldab,
INT* info
);