NAME

sgetf2 - compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges


SYNOPSIS

  SUBROUTINE SGETF2( M, N, A, LDA, IPIV, INFO)
  INTEGER M, N, LDA, INFO
  INTEGER IPIV(*)
  REAL A(LDA,*)
  SUBROUTINE SGETF2_64( M, N, A, LDA, IPIV, INFO)
  INTEGER*8 M, N, LDA, INFO
  INTEGER*8 IPIV(*)
  REAL A(LDA,*)

F95 INTERFACE

  SUBROUTINE GETF2( [M], [N], A, [LDA], IPIV, [INFO])
  INTEGER :: M, N, LDA, INFO
  INTEGER, DIMENSION(:) :: IPIV
  REAL, DIMENSION(:,:) :: A
  SUBROUTINE GETF2_64( [M], [N], A, [LDA], IPIV, [INFO])
  INTEGER(8) :: M, N, LDA, INFO
  INTEGER(8), DIMENSION(:) :: IPIV
  REAL, DIMENSION(:,:) :: A

C INTERFACE

#include <sunperf.h>

void sgetf2(int m, int n, float *a, int lda, int *ipiv, int *info);

void sgetf2_64(long m, long n, float *a, long lda, long *ipiv, long *info);


PURPOSE

sgetf2 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 2 BLAS version of the algorithm.


ARGUMENTS