1ZGETRF(1) LAPACK routine (version 3.1) ZGETRF(1)
2
3
4
6 ZGETRF - an LU factorization of a general M-by-N matrix A using partial
7 pivoting with row interchanges
8
10 SUBROUTINE ZGETRF( M, N, A, LDA, IPIV, INFO )
11
12 INTEGER INFO, LDA, M, N
13
14 INTEGER IPIV( * )
15
16 COMPLEX*16 A( LDA, * )
17
19 ZGETRF computes an LU factorization of a general M-by-N matrix A using
20 partial pivoting with row interchanges.
21
22 The factorization has the form
23 A = P * L * U
24 where P is a permutation matrix, L is lower triangular with unit diago‐
25 nal elements (lower trapezoidal if m > n), and U is upper triangular
26 (upper trapezoidal if m < n).
27
28 This is the right-looking Level 3 BLAS version of the algorithm.
29
30
32 M (input) INTEGER
33 The number of rows of the matrix A. M >= 0.
34
35 N (input) INTEGER
36 The number of columns of the matrix A. N >= 0.
37
38 A (input/output) COMPLEX*16 array, dimension (LDA,N)
39 On entry, the M-by-N matrix to be factored. On exit, the fac‐
40 tors L and U from the factorization A = P*L*U; the unit diago‐
41 nal elements of L are not stored.
42
43 LDA (input) INTEGER
44 The leading dimension of the array A. LDA >= max(1,M).
45
46 IPIV (output) INTEGER array, dimension (min(M,N))
47 The pivot indices; for 1 <= i <= min(M,N), row i of the matrix
48 was interchanged with row IPIV(i).
49
50 INFO (output) INTEGER
51 = 0: successful exit
52 < 0: if INFO = -i, the i-th argument had an illegal value
53 > 0: if INFO = i, U(i,i) is exactly zero. The factorization
54 has been completed, but the factor U is exactly singular, and
55 division by zero will occur if it is used to solve a system of
56 equations.
57
58
59
60 LAPACK routine (version 3.1) November 2006 ZGETRF(1)