getrf Interface

public interface getrf

GETRF 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.


Subroutines

public pure subroutine cgetrf(m, n, a, lda, ipiv, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
complex(kind=sp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
integer(kind=ilp), intent(out) :: ipiv(*)
integer(kind=ilp), intent(out) :: info

public pure subroutine dgetrf(m, n, a, lda, ipiv, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
real(kind=dp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
integer(kind=ilp), intent(out) :: ipiv(*)
integer(kind=ilp), intent(out) :: info

public pure subroutine sgetrf(m, n, a, lda, ipiv, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
real(kind=sp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
integer(kind=ilp), intent(out) :: ipiv(*)
integer(kind=ilp), intent(out) :: info

public pure subroutine zgetrf(m, n, a, lda, ipiv, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
complex(kind=dp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
integer(kind=ilp), intent(out) :: ipiv(*)
integer(kind=ilp), intent(out) :: info

Module Procedures

public interface stdlib_cgetrf()

Arguments

None

public interface stdlib_dgetrf()

Arguments

None

public interface stdlib_sgetrf()

Arguments

None

public interface stdlib_zgetrf()

Arguments

None