pftri#

spftri

Functions

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

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

SPFTRI computes the inverse of a (real) symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPFTRF.

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 A is stored; = ‘L’: Lower triangle of 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 Cholesky factor in RFP format. On exit, the inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, the (i,i) element of the factor is zero

dpftri

Functions

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

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

DPFTRI computes the inverse of a (real) symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPFTRF.

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 A is stored; = ‘L’: Lower triangle of 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 Cholesky factor in RFP format. On exit, the inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, the (i,i) element of the factor is zero

cpftri

Functions

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

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

CPFTRI computes the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPFTRF.

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 A is stored; = ‘L’: Lower triangle of 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 Cholesky factor in RFP format. On exit, the inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, the (i,i) element of the factor is zero

zpftri

Functions

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

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

ZPFTRI computes the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPFTRF.

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 A is stored; = ‘L’: Lower triangle of 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 Cholesky factor in RFP format. On exit, the inverse of the original matrix.

out

info

= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
> 0: if info = i, the (i,i) element of the factor is zero

pftri#

This Page