pftrf#

spftrf

Functions

void spftrf(
    const char*          transr,
    const char*          uplo,
    const INT            n,
          f32*  restrict A,
          INT*           info
);

void spftrf(const char *transr, const char *uplo, const INT n, f32 *restrict A, INT *info)#

SPFTRF computes the Cholesky factorization of a real symmetric positive definite 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 block version of the algorithm, calling Level 3 BLAS.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘T’: The Transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

inout

A

Double precision array, dimension (n*(n+1)/2). On entry, the symmetric matrix A in RFP format. On exit, the factor U or L from the Cholesky factorization.

out

info

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

dpftrf

Functions

void dpftrf(
    const char*          transr,
    const char*          uplo,
    const INT            n,
          f64*  restrict A,
          INT*           info
);

void dpftrf(const char *transr, const char *uplo, const INT n, f64 *restrict A, INT *info)#

DPFTRF computes the Cholesky factorization of a real symmetric positive definite 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 block version of the algorithm, calling Level 3 BLAS.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘T’: The Transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

inout

A

Double precision array, dimension (n*(n+1)/2). On entry, the symmetric matrix A in RFP format. On exit, the factor U or L from the Cholesky factorization.

out

info

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

cpftrf

Functions

void cpftrf(
    const char*          transr,
    const char*          uplo,
    const INT            n,
          c64*  restrict A,
          INT*           info
);

void cpftrf(const char *transr, const char *uplo, const INT n, c64 *restrict A, INT *info)#

CPFTRF computes the Cholesky factorization of a complex Hermitian positive definite 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.

This is the block version of the algorithm, calling Level 3 BLAS.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘C’: The Conjugate-transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

inout

A

Single complex array, dimension (n*(n+1)/2). On entry, the Hermitian matrix A in RFP format. On exit, the factor U or L from the Cholesky factorization.

out

info

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

zpftrf

Functions

void zpftrf(
    const char*          transr,
    const char*          uplo,
    const INT            n,
          c128* restrict A,
          INT*           info
);

void zpftrf(const char *transr, const char *uplo, const INT n, c128 *restrict A, INT *info)#

ZPFTRF computes the Cholesky factorization of a complex Hermitian positive definite 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.

This is the block version of the algorithm, calling Level 3 BLAS.

Parameters

in

transr

= ‘N’: The Normal TRANSR of RFP A is stored; = ‘C’: The Conjugate-transpose TRANSR of RFP A is stored.

in

uplo

= ‘U’: Upper triangle of RFP A is stored; = ‘L’: Lower triangle of RFP A is stored.

in

n

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

inout

A

Double complex array, dimension (n*(n+1)/2). On entry, the Hermitian matrix A in RFP format. On exit, the factor U or L from the Cholesky factorization.

out

info

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

pftrf#

This Page