SUBROUTINE CHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z, * LDZ, WORK, LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO) CHARACTER * 1 JOBZ, UPLO COMPLEX AB(LDAB,*), BB(LDBB,*), Z(LDZ,*), WORK(*) INTEGER N, KA, KB, LDAB, LDBB, LDZ, LWORK, LRWORK, LIWORK, INFO INTEGER IWORK(*) REAL W(*), RWORK(*) SUBROUTINE CHBGVD_64( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, * Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO) CHARACTER * 1 JOBZ, UPLO COMPLEX AB(LDAB,*), BB(LDBB,*), Z(LDZ,*), WORK(*) INTEGER*8 N, KA, KB, LDAB, LDBB, LDZ, LWORK, LRWORK, LIWORK, INFO INTEGER*8 IWORK(*) REAL W(*), RWORK(*)
SUBROUTINE HBGVD( JOBZ, UPLO, [N], KA, KB, AB, [LDAB], BB, [LDBB], * W, Z, [LDZ], [WORK], [LWORK], [RWORK], [LRWORK], [IWORK], [LIWORK], * [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: AB, BB, Z INTEGER :: N, KA, KB, LDAB, LDBB, LDZ, LWORK, LRWORK, LIWORK, INFO INTEGER, DIMENSION(:) :: IWORK REAL, DIMENSION(:) :: W, RWORK SUBROUTINE HBGVD_64( JOBZ, UPLO, [N], KA, KB, AB, [LDAB], BB, [LDBB], * W, Z, [LDZ], [WORK], [LWORK], [RWORK], [LRWORK], [IWORK], [LIWORK], * [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: AB, BB, Z INTEGER(8) :: N, KA, KB, LDAB, LDBB, LDZ, LWORK, LRWORK, LIWORK, INFO INTEGER(8), DIMENSION(:) :: IWORK REAL, DIMENSION(:) :: W, RWORK
void chbgvd(char jobz, char uplo, int n, int ka, int kb, complex *ab, int ldab, complex *bb, int ldbb, float *w, complex *z, int ldz, int *info);
void chbgvd_64(char jobz, char uplo, long n, long ka, long kb, complex *ab, long ldab, complex *bb, long ldbb, float *w, complex *z, long ldz, long *info);
The divide and conquer algorithm makes very mild assumptions about floating point arithmetic. It will work on machines with a guard digit in add/subtract, or on those binary machines without guard digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. It could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none.
On exit, the contents of AB are destroyed.
On exit, the factor S from the split Cholesky factorization B = S**H*S, as returned by CPBSTF.
If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
If LRWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the RWORK array, returns this value as the first entry of the RWORK array, and no error message related to LRWORK is issued by XERBLA.
If LIWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the IWORK array, returns this value as the first entry of the IWORK array, and no error message related to LIWORK is issued by XERBLA.