1SGETC2(1)           LAPACK auxiliary routine (version 3.2)           SGETC2(1)
2
3
4

NAME

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

SYNOPSIS

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

PURPOSE

19       SGETC2 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       This is the Level 2 BLAS algorithm.
24

ARGUMENTS

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

FURTHER DETAILS

54       Based on contributions by
55          Bo Kagstrom and Peter Poromaa, Department of Computing Science,
56          Umea University, S-901 87 Umea, Sweden.
57
58
59
60 LAPACK auxiliary routine (versionNo3v.e2m)ber 2008                       SGETC2(1)
Impressum