getc2#

sgetc2

Functions

void sgetc2(
    const INT           n,
          f32* restrict A,
    const INT           lda,
          INT* restrict ipiv,
          INT* restrict jpiv,
          INT*          info
);

void sgetc2(const INT n, f32 *restrict A, const INT lda, INT *restrict ipiv, INT *restrict jpiv, INT *info)#

SGETC2 computes an LU factorization with complete pivoting of the n-by-n matrix A.

The factorization has the form A = P * L * U * Q, where P and Q are permutation matrices, L is lower triangular with unit diagonal elements and U is upper triangular.

This is the Level 2 BLAS algorithm.

Parameters

in

n

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

inout

A

On entry, the n-by-n matrix A to be factored. On exit, the factors L and U from the factorization A = P*L*U*Q; the unit diagonal elements of L are not stored. If U(k, k) appears to be less than SMIN, U(k, k) is given the value of SMIN, i.e., giving a nonsingular perturbed system. Array of dimension (lda, n).

in

lda

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

out

ipiv

The pivot indices; for 0 <= i < n, row i of the matrix has been interchanged with row ipiv[i]. Array of dimension n, 0-based.

out

jpiv

The pivot indices; for 0 <= j < n, column j of the matrix has been interchanged with column jpiv[j]. Array of dimension n, 0-based.

out

info

Exit status:

= 0: successful exit
> 0: if info = k, U(k-1, k-1) is likely to produce overflow if we try to solve for x in Ax = b. So U is perturbed to avoid the overflow.

dgetc2

Functions

void dgetc2(
    const INT           n,
          f64* restrict A,
    const INT           lda,
          INT* restrict ipiv,
          INT* restrict jpiv,
          INT*          info
);

void dgetc2(const INT n, f64 *restrict A, const INT lda, INT *restrict ipiv, INT *restrict jpiv, INT *info)#

DGETC2 computes an LU factorization with complete pivoting of the n-by-n matrix A.

The factorization has the form A = P * L * U * Q, where P and Q are permutation matrices, L is lower triangular with unit diagonal elements and U is upper triangular.

This is the Level 2 BLAS algorithm.

Parameters

in

n

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

inout

A

On entry, the n-by-n matrix A to be factored. On exit, the factors L and U from the factorization A = P*L*U*Q; the unit diagonal elements of L are not stored. If U(k, k) appears to be less than SMIN, U(k, k) is given the value of SMIN, i.e., giving a nonsingular perturbed system. Array of dimension (lda, n).

in

lda

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

out

ipiv

The pivot indices; for 0 <= i < n, row i of the matrix has been interchanged with row ipiv[i]. Array of dimension n, 0-based.

out

jpiv

The pivot indices; for 0 <= j < n, column j of the matrix has been interchanged with column jpiv[j]. Array of dimension n, 0-based.

out

info

Exit status:

= 0: successful exit
> 0: if info = k, U(k-1, k-1) is likely to produce overflow if we try to solve for x in Ax = b. So U is perturbed to avoid the overflow.

cgetc2

Functions

void cgetc2(
    const INT           n,
          c64* restrict A,
    const INT           lda,
          INT* restrict ipiv,
          INT* restrict jpiv,
          INT*          info
);

void cgetc2(const INT n, c64 *restrict A, const INT lda, INT *restrict ipiv, INT *restrict jpiv, INT *info)#

CGETC2 computes an LU factorization with complete pivoting of the n-by-n matrix A.

The factorization has the form A = P * L * U * Q, where P and Q are permutation matrices, L is lower triangular with unit diagonal elements and U is upper triangular.

This is the Level 2 BLAS algorithm.

Parameters

in

n

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

inout

A

On entry, the n-by-n matrix A to be factored. On exit, the factors L and U from the factorization A = P*L*U*Q; the unit diagonal elements of L are not stored. If U(k, k) appears to be less than SMIN, U(k, k) is given the value of SMIN, i.e., giving a nonsingular perturbed system. Array of dimension (lda, n).

in

lda

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

out

ipiv

The pivot indices; for 0 <= i < n, row i of the matrix has been interchanged with row ipiv[i]. Array of dimension n, 0-based.

out

jpiv

The pivot indices; for 0 <= j < n, column j of the matrix has been interchanged with column jpiv[j]. Array of dimension n, 0-based.

out

info

Exit status:

= 0: successful exit
> 0: if info = k, U(k-1, k-1) is likely to produce overflow if we try to solve for x in Ax = b. So U is perturbed to avoid the overflow.

zgetc2

Functions

void zgetc2(
    const INT            n,
          c128* restrict A,
    const INT            lda,
          INT*  restrict ipiv,
          INT*  restrict jpiv,
          INT*           info
);

void zgetc2(const INT n, c128 *restrict A, const INT lda, INT *restrict ipiv, INT *restrict jpiv, INT *info)#

ZGETC2 computes an LU factorization with complete pivoting of the n-by-n matrix A.

The factorization has the form A = P * L * U * Q, where P and Q are permutation matrices, L is lower triangular with unit diagonal elements and U is upper triangular.

This is the Level 2 BLAS algorithm.

Parameters

in

n

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

inout

A

On entry, the n-by-n matrix A to be factored. On exit, the factors L and U from the factorization A = P*L*U*Q; the unit diagonal elements of L are not stored. If U(k, k) appears to be less than SMIN, U(k, k) is given the value of SMIN, i.e., giving a nonsingular perturbed system. Array of dimension (lda, n).

in

lda

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

out

ipiv

The pivot indices; for 0 <= i < n, row i of the matrix has been interchanged with row ipiv[i]. Array of dimension n, 0-based.

out

jpiv

The pivot indices; for 0 <= j < n, column j of the matrix has been interchanged with column jpiv[j]. Array of dimension n, 0-based.

out

info

Exit status:

= 0: successful exit
> 0: if info = k, U(k-1, k-1) is likely to produce overflow if we try to solve for x in Ax = b. So U is perturbed to avoid the overflow.

getc2#

This Page