pptrf#

spptrf

Functions

void spptrf(
    const char*          uplo,
    const INT            n,
          f32*  restrict AP,
          INT*           info
);

void spptrf(const char *uplo, const INT n, f32 *restrict AP, INT *info)#

SPPTRF computes the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format.

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

in

uplo

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

in

n

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

inout

AP

On entry, the upper or lower triangle of the symmetric matrix A, packed columnwise in a linear array. On exit, if info = 0, the triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T, in the same storage format as A. Array of dimension (n*(n+1)/2).

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.

dpptrf

Functions

void dpptrf(
    const char*          uplo,
    const INT            n,
          f64*  restrict AP,
          INT*           info
);

void dpptrf(const char *uplo, const INT n, f64 *restrict AP, INT *info)#

DPPTRF computes the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format.

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

in

uplo

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

in

n

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

inout

AP

On entry, the upper or lower triangle of the symmetric matrix A, packed columnwise in a linear array. On exit, if info = 0, the triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T, in the same storage format as A. Array of dimension (n*(n+1)/2).

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.

cpptrf

Functions

void cpptrf(
    const char*          uplo,
    const INT            n,
          c64*  restrict AP,
          INT*           info
);

void cpptrf(const char *uplo, const INT n, c64 *restrict AP, INT *info)#

CPPTRF computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format.

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

in

uplo

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

in

n

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

inout

AP

On entry, the upper or lower triangle of the Hermitian matrix A, packed columnwise in a linear array. On exit, if info = 0, the triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, in the same storage format as A. Array of dimension (n*(n+1)/2).

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.

zpptrf

Functions

void zpptrf(
    const char*          uplo,
    const INT            n,
          c128* restrict AP,
          INT*           info
);

void zpptrf(const char *uplo, const INT n, c128 *restrict AP, INT *info)#

ZPPTRF computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format.

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

in

uplo

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

in

n

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

inout

AP

On entry, the upper or lower triangle of the Hermitian matrix A, packed columnwise in a linear array. On exit, if info = 0, the triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, in the same storage format as A. Array of dimension (n*(n+1)/2).

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.

pptrf#

This Page