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