SUBROUTINE DPBSTF( UPLO, N, KD, AB, LDAB, INFO) CHARACTER * 1 UPLO INTEGER N, KD, LDAB, INFO DOUBLE PRECISION AB(LDAB,*) SUBROUTINE DPBSTF_64( UPLO, N, KD, AB, LDAB, INFO) CHARACTER * 1 UPLO INTEGER*8 N, KD, LDAB, INFO DOUBLE PRECISION AB(LDAB,*)
SUBROUTINE PBSTF( UPLO, [N], KD, AB, [LDAB], [INFO]) CHARACTER(LEN=1) :: UPLO INTEGER :: N, KD, LDAB, INFO REAL(8), DIMENSION(:,:) :: AB SUBROUTINE PBSTF_64( UPLO, [N], KD, AB, [LDAB], [INFO]) CHARACTER(LEN=1) :: UPLO INTEGER(8) :: N, KD, LDAB, INFO REAL(8), DIMENSION(:,:) :: AB
void dpbstf(char uplo, int n, int kd, double *ab, int ldab, int *info);
void dpbstf_64(char uplo, long n, long kd, double *ab, long ldab, long *info);
This routine is designed to be used in conjunction with SSBGST.
The factorization has the form A = S**T*S where S is a band matrix of the same bandwidth as A and the following structure:
S = ( U ) ( M L )
where U is upper triangular of order m = (n+kd)/2, and L is lower triangular of order n-m.
On exit, if INFO = 0, the factor S from the split Cholesky factorization A = S**T*S. See Further Details.