NAME

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


SYNOPSIS

  SUBROUTINE CGETF2( M, N, A, LDA, IPIV, INFO)
  COMPLEX A(LDA,*)
  INTEGER M, N, LDA, INFO
  INTEGER IPIV(*)
  SUBROUTINE CGETF2_64( M, N, A, LDA, IPIV, INFO)
  COMPLEX A(LDA,*)
  INTEGER*8 M, N, LDA, INFO
  INTEGER*8 IPIV(*)

F95 INTERFACE

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

C INTERFACE

#include <sunperf.h>

void cgetf2(int m, int n, complex *a, int lda, int *ipiv, int *info);

void cgetf2_64(long m, long n, complex *a, long lda, long *ipiv, long *info);


PURPOSE

cgetf2 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