SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO) CHARACTER * 1 JOBZ, UPLO COMPLEX A(LDA,*), B(LDB,*), WORK(*) INTEGER ITYPE, N, LDA, LDB, LWORK, LRWORK, LIWORK, INFO INTEGER IWORK(*) REAL W(*), RWORK(*) SUBROUTINE CHEGVD_64( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO) CHARACTER * 1 JOBZ, UPLO COMPLEX A(LDA,*), B(LDB,*), WORK(*) INTEGER*8 ITYPE, N, LDA, LDB, LWORK, LRWORK, LIWORK, INFO INTEGER*8 IWORK(*) REAL W(*), RWORK(*)
SUBROUTINE HEGVD( ITYPE, JOBZ, UPLO, [N], A, [LDA], B, [LDB], W, * [WORK], [LWORK], [RWORK], [LRWORK], [IWORK], [LIWORK], [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: A, B INTEGER :: ITYPE, N, LDA, LDB, LWORK, LRWORK, LIWORK, INFO INTEGER, DIMENSION(:) :: IWORK REAL, DIMENSION(:) :: W, RWORK SUBROUTINE HEGVD_64( ITYPE, JOBZ, UPLO, [N], A, [LDA], B, [LDB], W, * [WORK], [LWORK], [RWORK], [LRWORK], [IWORK], [LIWORK], [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: A, B INTEGER(8) :: ITYPE, N, LDA, LDB, LWORK, LRWORK, LIWORK, INFO INTEGER(8), DIMENSION(:) :: IWORK REAL, DIMENSION(:) :: W, RWORK
void chegvd(int itype, char jobz, char uplo, int n, complex *a, int lda, complex *b, int ldb, float *w, int *info);
void chegvd_64(long itype, char jobz, char uplo, long n, complex *a, long lda, complex *b, long ldb, float *w, 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, if JOBZ = 'V', then if INFO = 0, A contains the matrix Z of eigenvectors. The eigenvectors are normalized as follows: if ITYPE = 1 or 2, Z**H*B*Z = I; if ITYPE = 3, Z**H*inv(B)*Z = I. If JOBZ = 'N', then on exit the upper triangle (if UPLO='U') or the lower triangle (if UPLO='L') of A, including the diagonal, is destroyed.
On exit, if INFO <= N, the part of B containing the matrix is overwritten by the triangular factor U or L from the Cholesky factorization B = U**H*U or B = L*L**H.
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.