sygvd

ssygvd

Functions

void ssygvd(
    const INT            itype,
    const char*          jobz,
    const char*          uplo,
    const INT            n,
          f32*  restrict A,
    const INT            lda,
          f32*  restrict B,
    const INT            ldb,
          f32*  restrict W,
          f32*  restrict work,
    const INT            lwork,
          INT*  restrict iwork,
    const INT            liwork,
          INT*           info
);

void ssygvd(const INT itype, const char *jobz, const char *uplo, const INT n, f32 *restrict A, const INT lda, f32 *restrict B, const INT ldb, f32 *restrict W, f32 *restrict work, const INT lwork, INT *restrict iwork, const INT liwork, INT *info)

SSYGVD computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*B*x=(lambda)*x, or B*A*x=(lambda)*x.

If eigenvectors are desired, it uses a divide and conquer algorithm.

Parameters

in

itype

= 1: A*x = lambda*B*x; = 2: A*B*x = lambda*x; = 3: B*A*x = lambda*x

in

jobz

= ‘N’: eigenvalues only; = ‘V’: eigenvalues and eigenvectors

in

uplo

= ‘U’: upper triangles stored; = ‘L’: lower triangles stored

in

n

The order of the matrices A and B. n >= 0.

inout

A

On entry, symmetric matrix A. On exit, eigenvectors if jobz=’V’.

in

lda

Leading dimension of A. lda >= max(1, n).

inout

B

On entry, symmetric positive definite B. On exit, Cholesky factor.

in

ldb

Leading dimension of B. ldb >= max(1, n).

out

W

Eigenvalues in ascending order.

out

work

Workspace array.

in

lwork

Length of work. If -1, workspace query.

out

iwork

Integer workspace array.

in

liwork

Length of iwork. If -1, workspace query.

out

info

• = 0: success; < 0: illegal argument; > 0: SPOTRF/SSYEVD error.

dsygvd

Functions

void dsygvd(
    const INT            itype,
    const char*          jobz,
    const char*          uplo,
    const INT            n,
          f64*  restrict A,
    const INT            lda,
          f64*  restrict B,
    const INT            ldb,
          f64*  restrict W,
          f64*  restrict work,
    const INT            lwork,
          INT*  restrict iwork,
    const INT            liwork,
          INT*           info
);

void dsygvd(const INT itype, const char *jobz, const char *uplo, const INT n, f64 *restrict A, const INT lda, f64 *restrict B, const INT ldb, f64 *restrict W, f64 *restrict work, const INT lwork, INT *restrict iwork, const INT liwork, INT *info)

DSYGVD computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*B*x=(lambda)*x, or B*A*x=(lambda)*x.

If eigenvectors are desired, it uses a divide and conquer algorithm.

Parameters

in

itype

= 1: A*x = lambda*B*x; = 2: A*B*x = lambda*x; = 3: B*A*x = lambda*x

in

jobz

= ‘N’: eigenvalues only; = ‘V’: eigenvalues and eigenvectors

in

uplo

= ‘U’: upper triangles stored; = ‘L’: lower triangles stored

in

n

The order of the matrices A and B. n >= 0.

inout

A

On entry, symmetric matrix A. On exit, eigenvectors if jobz=’V’.

in

lda

Leading dimension of A. lda >= max(1, n).

inout

B

On entry, symmetric positive definite B. On exit, Cholesky factor.

in

ldb

Leading dimension of B. ldb >= max(1, n).

out

W

Eigenvalues in ascending order.

out

work

Workspace array.

in

lwork

Length of work. If -1, workspace query.

out

iwork

Integer workspace array.

in

liwork

Length of iwork. If -1, workspace query.

out

info

• = 0: success; < 0: illegal argument; > 0: DPOTRF/DSYEVD error.