PLASMA
2.8.0
PLASMA - Parallel Linear Algebra for Scalable Multi-core Architectures
|
int CORE_cgetrf_nopiv | ( | int | M, |
int | N, | ||
int | IB, | ||
PLASMA_Complex32_t * | A, | ||
int | LDA | ||
) |
CORE_cgetrf_nopiv computes an LU factorization of a general diagonal dominant M-by-N matrix A witout pivoting.
The factorization has the form A = L * U where 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. WARNING: Your matrix need to be diagonal dominant if you want to call this routine safely.
[in] | M | The number of rows of the matrix A. M >= 0. |
[in] | N | The number of columns of the matrix A. N >= 0. |
[in] | IB | The block size to switch between blocked and unblocked code. |
[in,out] | A | On entry, the M-by-N matrix to be factored. On exit, the factors L and U from the factorization A = P*L*U; the unit diagonal elements of L are not stored. |
[in] | LDA | The leading dimension of the array A. LDA >= max(1,M). |
PLASMA_SUCCESS | successful exit |
<0 | if INFO = -k, the k-th argument had an illegal value |
>0 | if INFO = k, U(k,k) 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. |