spgv#

sspgv

Functions

void sspgv(
    const INT            itype,
    const char*          jobz,
    const char*          uplo,
    const INT            n,
          f32*  restrict AP,
          f32*  restrict BP,
          f32*  restrict W,
          f32*  restrict Z,
    const INT            ldz,
          f32*  restrict work,
          INT*           info
);

void sspgv(const INT itype, const char *jobz, const char *uplo, const INT n, f32 *restrict AP, f32 *restrict BP, f32 *restrict W, f32 *restrict Z, const INT ldz, f32 *restrict work, INT *info)#

SSPGV 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.

Here A and B are assumed to be symmetric, stored in packed format, and B is also positive definite.

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

AP

Packed symmetric matrix A. On exit, destroyed.

inout

BP

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

out

W

Eigenvalues in ascending order.

out

Z

Eigenvectors if jobz=’V’; not referenced if jobz=’N’.

in

ldz

Leading dimension of Z. ldz >= 1, or ldz >= n if jobz=’V’.

out

work

Workspace array, dimension (3*n).

out

info

= 0: success; < 0: illegal argument; > 0: SPPTRF/SSPEV error.

dspgv

Functions

void dspgv(
    const INT            itype,
    const char*          jobz,
    const char*          uplo,
    const INT            n,
          f64*  restrict AP,
          f64*  restrict BP,
          f64*  restrict W,
          f64*  restrict Z,
    const INT            ldz,
          f64*  restrict work,
          INT*           info
);

void dspgv(const INT itype, const char *jobz, const char *uplo, const INT n, f64 *restrict AP, f64 *restrict BP, f64 *restrict W, f64 *restrict Z, const INT ldz, f64 *restrict work, INT *info)#

DSPGV 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.

Here A and B are assumed to be symmetric, stored in packed format, and B is also positive definite.

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

AP

Packed symmetric matrix A. On exit, destroyed.

inout

BP

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

out

W

Eigenvalues in ascending order.

out

Z

Eigenvectors if jobz=’V’; not referenced if jobz=’N’.

in

ldz

Leading dimension of Z. ldz >= 1, or ldz >= n if jobz=’V’.

out

work

Workspace array, dimension (3*n).

out

info

= 0: success; < 0: illegal argument; > 0: DPPTRF/DSPEV error.

spgv#

This Page