.TH "getc2" 3 "Wed Feb 7 2024 11:30:40" "Version 3.12.0" "LAPACK" \" -*- nroff -*-
.ad l
.nh
.SH NAME
getc2 \- getc2: triangular factor, with complete pivoting
.SH SYNOPSIS
.br
.PP
.SS "Functions"

.in +1c
.ti -1c
.RI "subroutine \fBcgetc2\fP (n, a, lda, ipiv, jpiv, info)"
.br
.RI "\fBCGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&. "
.ti -1c
.RI "subroutine \fBdgetc2\fP (n, a, lda, ipiv, jpiv, info)"
.br
.RI "\fBDGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&. "
.ti -1c
.RI "subroutine \fBsgetc2\fP (n, a, lda, ipiv, jpiv, info)"
.br
.RI "\fBSGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&. "
.ti -1c
.RI "subroutine \fBzgetc2\fP (n, a, lda, ipiv, jpiv, info)"
.br
.RI "\fBZGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&. "
.in -1c
.SH "Detailed Description"
.PP 

.SH "Function Documentation"
.PP 
.SS "subroutine cgetc2 (integer n, complex, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, integer, dimension( * ) jpiv, integer info)"

.PP
\fBCGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 CGETC2 computes an LU factorization, using 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 a level 1 BLAS version of the algorithm\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIN\fP 
.PP
.nf
          N is INTEGER
          The order of the matrix A\&. N >= 0\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          A is COMPLEX array, dimension (LDA, N)
          On entry, the n-by-n matrix 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, giving a nonsingular perturbed system\&.
.fi
.PP
.br
\fILDA\fP 
.PP
.nf
          LDA is INTEGER
          The leading dimension of the array A\&.  LDA >= max(1, N)\&.
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
          IPIV is INTEGER array, dimension (N)\&.
          The pivot indices; for 1 <= i <= N, row i of the
          matrix has been interchanged with row IPIV(i)\&.
.fi
.PP
.br
\fIJPIV\fP 
.PP
.nf
          JPIV is INTEGER array, dimension (N)\&.
          The pivot indices; for 1 <= j <= N, column j of the
          matrix has been interchanged with column JPIV(j)\&.
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
          INFO is INTEGER
           = 0: successful exit
           > 0: if INFO = k, U(k, k) is likely to produce overflow if
                one tries to solve for x in Ax = b\&. So U is perturbed
                to avoid the overflow\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Bo Kagstrom and Peter Poromaa, Department of Computing Science, Umea University, S-901 87 Umea, Sweden\&. 
.RE
.PP

.SS "subroutine dgetc2 (integer n, double precision, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, integer, dimension( * ) jpiv, integer info)"

.PP
\fBDGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 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\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIN\fP 
.PP
.nf
          N is INTEGER
          The order of the matrix A\&. N >= 0\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          A is DOUBLE PRECISION array, dimension (LDA, N)
          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\&.
.fi
.PP
.br
\fILDA\fP 
.PP
.nf
          LDA is INTEGER
          The leading dimension of the array A\&.  LDA >= max(1,N)\&.
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
          IPIV is INTEGER array, dimension(N)\&.
          The pivot indices; for 1 <= i <= N, row i of the
          matrix has been interchanged with row IPIV(i)\&.
.fi
.PP
.br
\fIJPIV\fP 
.PP
.nf
          JPIV is INTEGER array, dimension(N)\&.
          The pivot indices; for 1 <= j <= N, column j of the
          matrix has been interchanged with column JPIV(j)\&.
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
          INFO is INTEGER
           = 0: successful exit
           > 0: if INFO = k, U(k, k) is likely to produce overflow if
                we try to solve for x in Ax = b\&. So U is perturbed to
                avoid the overflow\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Bo Kagstrom and Peter Poromaa, Department of Computing Science, Umea University, S-901 87 Umea, Sweden\&. 
.RE
.PP

.SS "subroutine sgetc2 (integer n, real, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, integer, dimension( * ) jpiv, integer info)"

.PP
\fBSGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 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\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIN\fP 
.PP
.nf
          N is INTEGER
          The order of the matrix A\&. N >= 0\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          A is REAL array, dimension (LDA, N)
          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\&.
.fi
.PP
.br
\fILDA\fP 
.PP
.nf
          LDA is INTEGER
          The leading dimension of the array A\&.  LDA >= max(1,N)\&.
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
          IPIV is INTEGER array, dimension(N)\&.
          The pivot indices; for 1 <= i <= N, row i of the
          matrix has been interchanged with row IPIV(i)\&.
.fi
.PP
.br
\fIJPIV\fP 
.PP
.nf
          JPIV is INTEGER array, dimension(N)\&.
          The pivot indices; for 1 <= j <= N, column j of the
          matrix has been interchanged with column JPIV(j)\&.
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
          INFO is INTEGER
           = 0: successful exit
           > 0: if INFO = k, U(k, k) is likely to produce overflow if
                we try to solve for x in Ax = b\&. So U is perturbed to
                avoid the overflow\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Bo Kagstrom and Peter Poromaa, Department of Computing Science, Umea University, S-901 87 Umea, Sweden\&. 
.RE
.PP

.SS "subroutine zgetc2 (integer n, complex*16, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, integer, dimension( * ) jpiv, integer info)"

.PP
\fBZGETC2\fP computes the LU factorization with complete pivoting of the general n-by-n matrix\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 ZGETC2 computes an LU factorization, using 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 a level 1 BLAS version of the algorithm\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIN\fP 
.PP
.nf
          N is INTEGER
          The order of the matrix A\&. N >= 0\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          A is COMPLEX*16 array, dimension (LDA, N)
          On entry, the n-by-n matrix 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, giving a nonsingular perturbed system\&.
.fi
.PP
.br
\fILDA\fP 
.PP
.nf
          LDA is INTEGER
          The leading dimension of the array A\&.  LDA >= max(1, N)\&.
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
          IPIV is INTEGER array, dimension (N)\&.
          The pivot indices; for 1 <= i <= N, row i of the
          matrix has been interchanged with row IPIV(i)\&.
.fi
.PP
.br
\fIJPIV\fP 
.PP
.nf
          JPIV is INTEGER array, dimension (N)\&.
          The pivot indices; for 1 <= j <= N, column j of the
          matrix has been interchanged with column JPIV(j)\&.
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
          INFO is INTEGER
           = 0: successful exit
           > 0: if INFO = k, U(k, k) is likely to produce overflow if
                one tries to solve for x in Ax = b\&. So U is perturbed
                to avoid the overflow\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Bo Kagstrom and Peter Poromaa, Department of Computing Science, Umea University, S-901 87 Umea, Sweden\&. 
.RE
.PP

.SH "Author"
.PP 
Generated automatically by Doxygen for LAPACK from the source code\&.