SUBROUTINE CGEQPF( M, N, A, LDA, JPIVOT, TAU, WORK, WORK2, INFO) COMPLEX A(LDA,*), TAU(*), WORK(*) INTEGER M, N, LDA, INFO INTEGER JPIVOT(*) REAL WORK2(*) SUBROUTINE CGEQPF_64( M, N, A, LDA, JPIVOT, TAU, WORK, WORK2, INFO) COMPLEX A(LDA,*), TAU(*), WORK(*) INTEGER*8 M, N, LDA, INFO INTEGER*8 JPIVOT(*) REAL WORK2(*)
SUBROUTINE GEQPF( [M], [N], A, [LDA], JPIVOT, TAU, [WORK], [WORK2], * [INFO]) COMPLEX, DIMENSION(:) :: TAU, WORK COMPLEX, DIMENSION(:,:) :: A INTEGER :: M, N, LDA, INFO INTEGER, DIMENSION(:) :: JPIVOT REAL, DIMENSION(:) :: WORK2 SUBROUTINE GEQPF_64( [M], [N], A, [LDA], JPIVOT, TAU, [WORK], [WORK2], * [INFO]) COMPLEX, DIMENSION(:) :: TAU, WORK COMPLEX, DIMENSION(:,:) :: A INTEGER(8) :: M, N, LDA, INFO INTEGER(8), DIMENSION(:) :: JPIVOT REAL, DIMENSION(:) :: WORK2
void cgeqpf(int m, int n, complex *a, int lda, int *jpivot, complex *tau, int *info);
void cgeqpf_64(long m, long n, complex *a, long lda, long *jpivot, complex *tau, long *info);
CGEQPF computes a QR factorization with column pivoting of a complex M-by-N matrix A: A*P = Q*R.