NAME

cgetrf - compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges


SYNOPSIS

  SUBROUTINE CGETRF( M, N, A, LDA, IPIVOT, INFO)
  COMPLEX A(LDA,*)
  INTEGER M, N, LDA, INFO
  INTEGER IPIVOT(*)
  SUBROUTINE CGETRF_64( M, N, A, LDA, IPIVOT, INFO)
  COMPLEX A(LDA,*)
  INTEGER*8 M, N, LDA, INFO
  INTEGER*8 IPIVOT(*)

F95 INTERFACE

  SUBROUTINE GETRF( [M], [N], A, [LDA], IPIVOT, [INFO])
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER :: M, N, LDA, INFO
  INTEGER, DIMENSION(:) :: IPIVOT
  SUBROUTINE GETRF_64( [M], [N], A, [LDA], IPIVOT, [INFO])
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER(8) :: M, N, LDA, INFO
  INTEGER(8), DIMENSION(:) :: IPIVOT

C INTERFACE

#include <sunperf.h>

void cgetrf(int m, int n, complex *a, int lda, int *ipivot, int *info);

void cgetrf_64(long m, long n, complex *a, long lda, long *ipivot, long *info);


PURPOSE

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


ARGUMENTS