potf2#

spotf2

Functions

void spotf2(
    const char*          uplo,
    const INT            n,
          f32*  restrict A,
    const INT            lda,
          INT*           info
);

void spotf2(const char *uplo, const INT n, f32 *restrict A, const INT lda, INT *info)#

SPOTF2 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 unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

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

inout

A

Double precision array, dimension (lda, n). On entry, the symmetric matrix A. If UPLO = ‘U’, the leading n by n upper triangular part of A contains the upper triangular part of the matrix A. If UPLO = ‘L’, the leading n by n lower triangular part of A contains the lower triangular part of the matrix A. On exit, if info = 0, the factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T.

in

lda

The leading dimension of the array A. lda >= max(1, n).

out

info

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

dpotf2

Functions

void dpotf2(
    const char*          uplo,
    const INT            n,
          f64*  restrict A,
    const INT            lda,
          INT*           info
);

void dpotf2(const char *uplo, const INT n, f64 *restrict A, const INT lda, INT *info)#

DPOTF2 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 unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

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

inout

A

Double precision array, dimension (lda, n). On entry, the symmetric matrix A. If UPLO = ‘U’, the leading n by n upper triangular part of A contains the upper triangular part of the matrix A. If UPLO = ‘L’, the leading n by n lower triangular part of A contains the lower triangular part of the matrix A. On exit, if info = 0, the factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T.

in

lda

The leading dimension of the array A. lda >= max(1, n).

out

info

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

cpotf2

Functions

void cpotf2(
    const char*          uplo,
    const INT            n,
          c64*  restrict A,
    const INT            lda,
          INT*           info
);

void cpotf2(const char *uplo, const INT n, c64 *restrict A, const INT lda, INT *info)#

CPOTF2 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 unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

Specifies whether the upper or lower triangular part of the Hermitian matrix A is stored. = ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

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

inout

A

Complex*16 array, dimension (lda, n). On entry, the Hermitian matrix A. If UPLO = ‘U’, the leading n by n upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = ‘L’, the leading n by n lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. On exit, if info = 0, the factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H.

in

lda

The leading dimension of the array A. lda >= max(1, n).

out

info

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

zpotf2

Functions

void zpotf2(
    const char*          uplo,
    const INT            n,
          c128* restrict A,
    const INT            lda,
          INT*           info
);

void zpotf2(const char *uplo, const INT n, c128 *restrict A, const INT lda, INT *info)#

ZPOTF2 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 unblocked version of the algorithm, calling Level 2 BLAS.

Parameters

in

uplo

Specifies whether the upper or lower triangular part of the Hermitian matrix A is stored. = ‘U’: Upper triangular = ‘L’: Lower triangular

in

n

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

inout

A

Complex*16 array, dimension (lda, n). On entry, the Hermitian matrix A. If UPLO = ‘U’, the leading n by n upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = ‘L’, the leading n by n lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. On exit, if info = 0, the factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H.

in

lda

The leading dimension of the array A. lda >= max(1, n).

out

info

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

potf2#

This Page