1DGETC2(1)           LAPACK auxiliary routine (version 3.1)           DGETC2(1)
2
3
4

NAME

6       DGETC2  -  an  LU  factorization  with  complete pivoting of the n-by-n
7       matrix A
8

SYNOPSIS

10       SUBROUTINE DGETC2( N, A, LDA, IPIV, JPIV, INFO )
11
12           INTEGER        INFO, LDA, N
13
14           INTEGER        IPIV( * ), JPIV( * )
15
16           DOUBLE         PRECISION A( LDA, * )
17

PURPOSE

19       DGETC2 computes an LU factorization with complete pivoting of the n-by-
20       n  matrix  A. The factorization has the form A = P * L * U * Q, where P
21       and Q are permutation matrices, L is lower triangular with unit  diago‐
22       nal elements and U is upper triangular.
23
24       This is the Level 2 BLAS algorithm.
25
26

ARGUMENTS

28       N       (input) INTEGER
29               The order of the matrix A. N >= 0.
30
31       A       (input/output) DOUBLE PRECISION array, dimension (LDA, N)
32               On  entry,  the  n-by-n  matrix A to be factored.  On exit, the
33               factors L and U from the factorization A =  P*L*U*Q;  the  unit
34               diagonal  elements  of L are not stored.  If U(k, k) appears to
35               be less than SMIN, U(k, k) is given the value  of  SMIN,  i.e.,
36               giving a nonsingular perturbed system.
37
38       LDA     (input) INTEGER
39               The leading dimension of the array A.  LDA >= max(1,N).
40
41       IPIV    (output) INTEGER array, dimension(N).
42               The  pivot  indices;  for  1 <= i <= N, row i of the matrix has
43               been interchanged with row IPIV(i).
44
45       JPIV    (output) INTEGER array, dimension(N).
46               The pivot indices; for 1 <= j <= N, column j of the matrix  has
47               been interchanged with column JPIV(j).
48
49       INFO    (output) INTEGER
50               = 0: successful exit
51               >  0:  if INFO = k, U(k, k) is likely to produce owerflow if we
52               try to solve for x in Ax = b. So U is perturbed  to  avoid  the
53               overflow.
54

FURTHER DETAILS

56       Based on contributions by
57          Bo Kagstrom and Peter Poromaa, Department of Computing Science,
58          Umea University, S-901 87 Umea, Sweden.
59
60
61
62
63 LAPACK auxiliary routine (versionNo3v.e1m)ber 2006                       DGETC2(1)
Impressum