SUBROUTINE CHEGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LDWORK, WORK2, INFO) CHARACTER * 1 JOBZ, UPLO COMPLEX A(LDA,*), B(LDB,*), WORK(*) INTEGER ITYPE, N, LDA, LDB, LDWORK, INFO REAL W(*), WORK2(*) SUBROUTINE CHEGV_64( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LDWORK, WORK2, INFO) CHARACTER * 1 JOBZ, UPLO COMPLEX A(LDA,*), B(LDB,*), WORK(*) INTEGER*8 ITYPE, N, LDA, LDB, LDWORK, INFO REAL W(*), WORK2(*)
SUBROUTINE HEGV( ITYPE, JOBZ, UPLO, N, A, [LDA], B, [LDB], W, [WORK], * [LDWORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: A, B INTEGER :: ITYPE, N, LDA, LDB, LDWORK, INFO REAL, DIMENSION(:) :: W, WORK2 SUBROUTINE HEGV_64( ITYPE, JOBZ, UPLO, N, A, [LDA], B, [LDB], W, * [WORK], [LDWORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: A, B INTEGER(8) :: ITYPE, N, LDA, LDB, LDWORK, INFO REAL, DIMENSION(:) :: W, WORK2
void chegv(int itype, char jobz, char uplo, int n, complex *a, int lda, complex *b, int ldb, float *w, int *info);
void chegv_64(long itype, char jobz, char uplo, long n, complex *a, long lda, complex *b, long ldb, float *w, long *info);
positive definite.
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 LDWORK = -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 LDWORK is issued by XERBLA.