SUBROUTINE CGBTRF( M, N, NSUB, NSUPER, A, LDA, IPIVOT, INFO) COMPLEX A(LDA,*) INTEGER M, N, NSUB, NSUPER, LDA, INFO INTEGER IPIVOT(*) SUBROUTINE CGBTRF_64( M, N, NSUB, NSUPER, A, LDA, IPIVOT, INFO) COMPLEX A(LDA,*) INTEGER*8 M, N, NSUB, NSUPER, LDA, INFO INTEGER*8 IPIVOT(*)
SUBROUTINE GBTRF( [M], [N], NSUB, NSUPER, A, [LDA], IPIVOT, [INFO]) COMPLEX, DIMENSION(:,:) :: A INTEGER :: M, N, NSUB, NSUPER, LDA, INFO INTEGER, DIMENSION(:) :: IPIVOT SUBROUTINE GBTRF_64( [M], [N], NSUB, NSUPER, A, [LDA], IPIVOT, [INFO]) COMPLEX, DIMENSION(:,:) :: A INTEGER(8) :: M, N, NSUB, NSUPER, LDA, INFO INTEGER(8), DIMENSION(:) :: IPIVOT
void cgbtrf(int m, int n, int nsub, int nsuper, complex *a, int lda, int *ipivot, int *info);
void cgbtrf_64(long m, long n, long nsub, long nsuper, complex *a, long lda, long *ipivot, long *info);
This is the blocked version of the algorithm, calling Level 3 BLAS.
On exit, details of the factorization: U is stored as an upper triangular band matrix with NSUB+NSUPER superdiagonals in rows 1 to NSUB+NSUPER+1, and the multipliers used during the factorization are stored in rows NSUB+NSUPER+2 to 2*NSUB+NSUPER+1. See below for further details.