sbevd_2stage#

Functions

void ssbevd_2stage(
    const char*          jobz,
    const char*          uplo,
    const INT            n,
    const INT            kd,
          f32*  restrict AB,
    const INT            ldab,
          f32*  restrict W,
          f32*  restrict Z,
    const INT            ldz,
          f32*  restrict work,
    const INT            lwork,
          INT*  restrict iwork,
    const INT            liwork,
          INT*           info
);
void ssbevd_2stage(const char *jobz, const char *uplo, const INT n, const INT kd, f32 *restrict AB, const INT ldab, f32 *restrict W, f32 *restrict Z, const INT ldz, f32 *restrict work, const INT lwork, INT *restrict iwork, const INT liwork, INT *info)#

SSBEVD_2STAGE computes all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A using the 2-stage technique for the reduction to tridiagonal.

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

Parameters

in
jobz

= ‘N’: eigenvalues only; = ‘V’: not available in this release.

in
uplo

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

in
n

The order of the matrix A. n >= 0.

in
kd

Number of super/sub-diagonals. kd >= 0.

inout
AB

Band matrix, overwritten on exit.

in
ldab

Leading dimension of AB. ldab >= kd+1.

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. On exit, work[0] = optimal LWORK.

in
lwork

Length of work. If -1, workspace query.

out
iwork

Integer workspace. On exit, iwork[0] = optimal LIWORK.

in
liwork

Length of iwork. If -1, workspace query.

out
info

  • = 0: success; < 0: illegal argument; > 0: convergence failure.

Functions

void dsbevd_2stage(
    const char*          jobz,
    const char*          uplo,
    const INT            n,
    const INT            kd,
          f64*  restrict AB,
    const INT            ldab,
          f64*  restrict W,
          f64*  restrict Z,
    const INT            ldz,
          f64*  restrict work,
    const INT            lwork,
          INT*  restrict iwork,
    const INT            liwork,
          INT*           info
);
void dsbevd_2stage(const char *jobz, const char *uplo, const INT n, const INT kd, f64 *restrict AB, const INT ldab, f64 *restrict W, f64 *restrict Z, const INT ldz, f64 *restrict work, const INT lwork, INT *restrict iwork, const INT liwork, INT *info)#

DSBEVD_2STAGE computes all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A using the 2-stage technique for the reduction to tridiagonal.

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

Parameters

in
jobz

= ‘N’: eigenvalues only; = ‘V’: not available in this release.

in
uplo

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

in
n

The order of the matrix A. n >= 0.

in
kd

Number of super/sub-diagonals. kd >= 0.

inout
AB

Band matrix, overwritten on exit.

in
ldab

Leading dimension of AB. ldab >= kd+1.

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. On exit, work[0] = optimal LWORK.

in
lwork

Length of work. If -1, workspace query.

out
iwork

Integer workspace. On exit, iwork[0] = optimal LIWORK.

in
liwork

Length of iwork. If -1, workspace query.

out
info

  • = 0: success; < 0: illegal argument; > 0: convergence failure.