SUBROUTINE CGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO) COMPLEX AB(LDAB,*) INTEGER M, N, KL, KU, LDAB, INFO INTEGER IPIV(*) SUBROUTINE CGBTF2_64( M, N, KL, KU, AB, LDAB, IPIV, INFO) COMPLEX AB(LDAB,*) INTEGER*8 M, N, KL, KU, LDAB, INFO INTEGER*8 IPIV(*)
SUBROUTINE GBTF2( [M], [N], KL, KU, AB, [LDAB], IPIV, [INFO]) COMPLEX, DIMENSION(:,:) :: AB INTEGER :: M, N, KL, KU, LDAB, INFO INTEGER, DIMENSION(:) :: IPIV SUBROUTINE GBTF2_64( [M], [N], KL, KU, AB, [LDAB], IPIV, [INFO]) COMPLEX, DIMENSION(:,:) :: AB INTEGER(8) :: M, N, KL, KU, LDAB, INFO INTEGER(8), DIMENSION(:) :: IPIV
void cgbtf2(int m, int n, int kl, int ku, complex *ab, int ldab, int *ipiv, int *info);
void cgbtf2_64(long m, long n, long kl, long ku, complex *ab, long ldab, long *ipiv, long *info);
This is the unblocked version of the algorithm, calling Level 2 BLAS.
On exit, details of the factorization: U is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to KL+KU+1, and the multipliers used during the factorization are stored in rows KL+KU+2 to 2*KL+KU+1. See below for further details.