pbtf2#

spbtf2

Functions

void spbtf2(
    const char*          uplo,
    const INT            n,
    const INT            kd,
          f32*  restrict AB,
    const INT            ldab,
          INT*           info
);

void spbtf2(const char *uplo, const INT n, const INT kd, f32 *restrict AB, const INT ldab, INT *info)#

SPBTF2 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.

This is the unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

= ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

The order of the matrix A. n >= 0.

in

kd

The number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.

inout

AB

The banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.

in

ldab

The leading dimension of AB. ldab >= kd+1.

out

info

= 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.

dpbtf2

Functions

void dpbtf2(
    const char*          uplo,
    const INT            n,
    const INT            kd,
          f64*  restrict AB,
    const INT            ldab,
          INT*           info
);

void dpbtf2(const char *uplo, const INT n, const INT kd, f64 *restrict AB, const INT ldab, INT *info)#

DPBTF2 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.

This is the unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

= ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

The order of the matrix A. n >= 0.

in

kd

The number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.

inout

AB

The banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.

in

ldab

The leading dimension of AB. ldab >= kd+1.

out

info

= 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.

cpbtf2

Functions

void cpbtf2(
    const char*          uplo,
    const INT            n,
    const INT            kd,
          c64*  restrict AB,
    const INT            ldab,
          INT*           info
);

void cpbtf2(const char *uplo, const INT n, const INT kd, c64 *restrict AB, const INT ldab, INT *info)#

CPBTF2 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, U**H is the conjugate transpose of U, and L is lower triangular.

This is the unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

= ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

The order of the matrix A. n >= 0.

in

kd

The number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.

inout

AB

The banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.

in

ldab

The leading dimension of AB. ldab >= kd+1.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = k, the leading principal minor of order k is not positive definite.

zpbtf2

Functions

void zpbtf2(
    const char*          uplo,
    const INT            n,
    const INT            kd,
          c128* restrict AB,
    const INT            ldab,
          INT*           info
);

void zpbtf2(const char *uplo, const INT n, const INT kd, c128 *restrict AB, const INT ldab, INT *info)#

ZPBTF2 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, U**H is the conjugate transpose of U, and L is lower triangular.

This is the unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

= ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

The order of the matrix A. n >= 0.

in

kd

The number of super-diagonals (if uplo=’U’) or sub-diagonals (if uplo=’L’). kd >= 0.

inout

AB

The banded matrix A. Array of dimension (ldab, n). On exit, the factor U or L.

in

ldab

The leading dimension of AB. ldab >= kd+1.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = k, the leading principal minor of order k is not positive definite.

pbtf2#

This Page