zgbcon zgbtrf zgbtrs zgecon zgetrf zgetri zgetrs zgtcon zgttrf zgttrs zspcon zsptrf zsptri zsptrs zsycon zsytrf zsytri zsytrs

zgetrf() void zgetrf ( int  m, int  n, int  lda, doublecomplex  a[], int  ipiv[], int *  info  ) LU factorization of a complex matrix Purpose This routine computes an LU factorization of a complex m x n matrix A using partial pivoting with row interchanges. The factorization has the form A = P * L * U where P is a permutation matrix, L is lower triangular with unit diagonal elements (lower trapezoidal if m > n), and U is upper triangular (upper trapezoidal if m < n). This is the right-looking Level 3 BLAS version of the algorithm. Parameters [in] m Number of rows of the matrix A. (m >= 0) (If m = 0, returns without computation) [in] n Number of columns of the matrix A. (n >= 0) (If n = 0, returns without computation) [in] lda Leading dimension of the two dimensional array a[][]. (lda >= max(1, m)) [in,out] a[][] Array a[la][lda] (la >= n) [in] m x n matrix to be factored. [out] Factors L and U from the factorization A = P*L*U; the unit diagonal elements of L are not stored. [out] ipiv[] Array ipiv[lipiv] (lipiv >= min(m,n)) Pivot indices; for 1 <= i <= min(m, n), row i of the matrix was interchanged with row ipiv[i-1]. [out] info = 0: Successful exit = -1: The argument m had an illegal value (m < 0) = -2: The argument n had an illegal value (n < 0) = -3: The argument lda had an illegal value (lda < max(1, m)) = i > 0: The i-th diagonal element of the factor U is exactly zero. The factorization has been completed, but the factor U is exactly singular, and division by zero will occur if it is used to solve a system of equations. Reference LAPACK