SUBROUTINE SGETRF( M, N, A, LDA, IPIVOT, INFO) INTEGER M, N, LDA, INFO INTEGER IPIVOT(*) REAL A(LDA,*) SUBROUTINE SGETRF_64( M, N, A, LDA, IPIVOT, INFO) INTEGER*8 M, N, LDA, INFO INTEGER*8 IPIVOT(*) REAL A(LDA,*)
SUBROUTINE GETRF( [M], [N], A, [LDA], IPIVOT, [INFO]) INTEGER :: M, N, LDA, INFO INTEGER, DIMENSION(:) :: IPIVOT REAL, DIMENSION(:,:) :: A SUBROUTINE GETRF_64( [M], [N], A, [LDA], IPIVOT, [INFO]) INTEGER(8) :: M, N, LDA, INFO INTEGER(8), DIMENSION(:) :: IPIVOT REAL, DIMENSION(:,:) :: A
void sgetrf(int m, int n, float *a, int lda, int *ipivot, int *info);
void sgetrf_64(long m, long n, float *a, long lda, long *ipivot, long *info);
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.