hegvd#
Functions
-
void chegvd(const INT itype, const char *jobz, const char *uplo, const INT n, c64 *restrict A, const INT lda, c64 *restrict B, const INT ldb, f32 *restrict W, c64 *restrict work, const INT lwork, f32 *restrict rwork, const INT lrwork, INT *restrict iwork, const INT liwork, INT *info)#
CHEGVD computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*B*x=(lambda)*x, or B*A*x=(lambda)*x.
Here A and B are assumed to be Hermitian and B is also positive definite. If eigenvectors are desired, it uses a divide and conquer algorithm.
Parameters
initype= 1: A*x = lambda*B*x; = 2: A*B*x = lambda*x; = 3: B*A*x = lambda*x
injobz= ‘N’: eigenvalues only; = ‘V’: eigenvalues and eigenvectors
inuplo= ‘U’: upper triangles stored; = ‘L’: lower triangles stored
innThe order of the matrices A and B. n >= 0.
inoutAOn entry, Hermitian matrix A. On exit, eigenvectors if jobz=’V’.
inldaLeading dimension of A. lda >= max(1, n).
inoutBOn entry, Hermitian positive definite B. On exit, Cholesky factor.
inldbLeading dimension of B. ldb >= max(1, n).
outWEigenvalues in ascending order.
outworkComplex workspace array.
inlworkLength of work. If -1, workspace query.
outrworkReal workspace array.
inlrworkLength of rwork. If -1, workspace query.
outiworkInteger workspace array.
inliworkLength of iwork. If -1, workspace query.
outinfo= 0: success; < 0: illegal argument; > 0: CPOTRF/CHEEVD error.
void chegvd(
const INT itype,
const char* jobz,
const char* uplo,
const INT n,
c64* restrict A,
const INT lda,
c64* restrict B,
const INT ldb,
f32* restrict W,
c64* restrict work,
const INT lwork,
f32* restrict rwork,
const INT lrwork,
INT* restrict iwork,
const INT liwork,
INT* info
);
Functions
-
void zhegvd(const INT itype, const char *jobz, const char *uplo, const INT n, c128 *restrict A, const INT lda, c128 *restrict B, const INT ldb, f64 *restrict W, c128 *restrict work, const INT lwork, f64 *restrict rwork, const INT lrwork, INT *restrict iwork, const INT liwork, INT *info)#
ZHEGVD computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*B*x=(lambda)*x, or B*A*x=(lambda)*x.
Here A and B are assumed to be Hermitian and B is also positive definite. If eigenvectors are desired, it uses a divide and conquer algorithm.
Parameters
initype= 1: A*x = lambda*B*x; = 2: A*B*x = lambda*x; = 3: B*A*x = lambda*x
injobz= ‘N’: eigenvalues only; = ‘V’: eigenvalues and eigenvectors
inuplo= ‘U’: upper triangles stored; = ‘L’: lower triangles stored
innThe order of the matrices A and B. n >= 0.
inoutAOn entry, Hermitian matrix A. On exit, eigenvectors if jobz=’V’.
inldaLeading dimension of A. lda >= max(1, n).
inoutBOn entry, Hermitian positive definite B. On exit, Cholesky factor.
inldbLeading dimension of B. ldb >= max(1, n).
outWEigenvalues in ascending order.
outworkComplex workspace array.
inlworkLength of work. If -1, workspace query.
outrworkReal workspace array.
inlrworkLength of rwork. If -1, workspace query.
outiworkInteger workspace array.
inliworkLength of iwork. If -1, workspace query.
outinfo= 0: success; < 0: illegal argument; > 0: ZPOTRF/ZHEEVD error.
void zhegvd(
const INT itype,
const char* jobz,
const char* uplo,
const INT n,
c128* restrict A,
const INT lda,
c128* restrict B,
const INT ldb,
f64* restrict W,
c128* restrict work,
const INT lwork,
f64* restrict rwork,
const INT lrwork,
INT* restrict iwork,
const INT liwork,
INT* info
);