\brief \b ESMF_DGETRF \htmlonly Download ESMF_DGETRF + dependencies [TGZ] [ZIP] [TXT] \endhtmlonly \par Purpose:
\verbatim
ESMF_DGETRF computes an LU factorization of a general M-by-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. \endverbatim \param[in] M \verbatim M is INTEGER The number of rows of the matrix A. M >= 0. \endverbatim
\param[in] N \verbatim N is INTEGER The number of columns of the matrix A. N >= 0. \endverbatim
\param[in,out] A \verbatim A is DOUBLE PRECISION array, dimension (LDA,N) On entry, the M-by-N matrix to be factored. On exit, the factors L and U from the factorization A = PLU; the unit diagonal elements of L are not stored. \endverbatim
\param[in] LDA \verbatim LDA is INTEGER The leading dimension of the array A. LDA >= max(1,M). \endverbatim
\param[out] IPIV \verbatim IPIV is INTEGER array, dimension (min(M,N)) The pivot indices; for 1 <= i <= min(M,N), row i of the matrix was interchanged with row IPIV(i). \endverbatim
\param[out] INFO \verbatim INFO is INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value > 0: if INFO = i, U(i,i) 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. \endverbatim \author Univ. of Tennessee \author Univ. of California Berkeley \author Univ. of Colorado Denver \author NAG Ltd. \date December 2016 \ingroup doubleGEcomputational
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer | :: | M | ||||
| integer | :: | N | ||||
| double precision | :: | A(LDA,*) | ||||
| integer | :: | LDA | ||||
| integer | :: | IPIV(*) | ||||
| integer | :: | INFO |