sspevx (l)  Linux Man Pages
sspevx: computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
Command to display sspevx
manual in Linux: $ man l sspevx
NAME
SSPEVX  computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
SYNOPSIS
 SUBROUTINE SSPEVX(

JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU,
ABSTOL, M, W, Z, LDZ, WORK, IWORK, IFAIL,
INFO )

CHARACTER
JOBZ, RANGE, UPLO

INTEGER
IL, INFO, IU, LDZ, M, N

REAL
ABSTOL, VL, VU

INTEGER
IFAIL( * ), IWORK( * )

REAL
AP( * ), W( * ), WORK( * ), Z( LDZ, * )
PURPOSE
SSPEVX computes selected eigenvalues and, optionally, eigenvectors
of a real symmetric matrix A in packed storage. Eigenvalues/vectors
can be selected by specifying either a range of values or a range of
indices for the desired eigenvalues.
ARGUMENTS
 JOBZ (input) CHARACTER*1

= aqNaq: Compute eigenvalues only;
= aqVaq: Compute eigenvalues and eigenvectors.
 RANGE (input) CHARACTER*1

= aqAaq: all eigenvalues will be found;
= aqVaq: all eigenvalues in the halfopen interval (VL,VU]
will be found;
= aqIaq: the ILth through IUth eigenvalues will be found.
 UPLO (input) CHARACTER*1

= aqUaq: Upper triangle of A is stored;
= aqLaq: Lower triangle of A is stored.
 N (input) INTEGER

The order of the matrix A. N >= 0.
 AP (input/output) REAL array, dimension (N*(N+1)/2)

On entry, the upper or lower triangle of the symmetric matrix
A, packed columnwise in a linear array. The jth column of A
is stored in the array AP as follows:
if UPLO = aqUaq, AP(i + (j1)*j/2) = A(i,j) for 1<=i<=j;
if UPLO = aqLaq, AP(i + (j1)*(2*nj)/2) = A(i,j) for j<=i<=n.
On exit, AP is overwritten by values generated during the
reduction to tridiagonal form. If UPLO = aqUaq, the diagonal
and first superdiagonal of the tridiagonal matrix T overwrite
the corresponding elements of A, and if UPLO = aqLaq, the
diagonal and first subdiagonal of T overwrite the
corresponding elements of A.
 VL (input) REAL

VU (input) REAL
If RANGE=aqVaq, the lower and upper bounds of the interval to
be searched for eigenvalues. VL < VU.
Not referenced if RANGE = aqAaq or aqIaq.
 IL (input) INTEGER

IU (input) INTEGER
If RANGE=aqIaq, the indices (in ascending order) of the
smallest and largest eigenvalues to be returned.
1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0.
Not referenced if RANGE = aqAaq or aqVaq.
 ABSTOL (input) REAL

The absolute error tolerance for the eigenvalues.
An approximate eigenvalue is accepted as converged
when it is determined to lie in an interval [a,b]
of width less than or equal to
ABSTOL + EPS * max( a,b ) ,
where EPS is the machine precision. If ABSTOL is less than
or equal to zero, then EPS*T will be used in its place,
where T is the 1norm of the tridiagonal matrix obtained
by reducing AP to tridiagonal form.
Eigenvalues will be computed most accurately when ABSTOL is
set to twice the underflow threshold 2*SLAMCH(aqSaq), not zero.
If this routine returns with INFO>0, indicating that some
eigenvectors did not converge, try setting ABSTOL to
2*SLAMCH(aqSaq).
See "Computing Small Singular Values of Bidiagonal Matrices
with Guaranteed High Relative Accuracy," by Demmel and
Kahan, LAPACK Working Note #3.
 M (output) INTEGER

The total number of eigenvalues found. 0 <= M <= N.
If RANGE = aqAaq, M = N, and if RANGE = aqIaq, M = IUIL+1.
 W (output) REAL array, dimension (N)

If INFO = 0, the selected eigenvalues in ascending order.
 Z (output) REAL array, dimension (LDZ, max(1,M))

If JOBZ = aqVaq, then if INFO = 0, the first M columns of Z
contain the orthonormal eigenvectors of the matrix A
corresponding to the selected eigenvalues, with the ith
column of Z holding the eigenvector associated with W(i).
If an eigenvector fails to converge, then that column of Z
contains the latest approximation to the eigenvector, and the
index of the eigenvector is returned in IFAIL.
If JOBZ = aqNaq, then Z is not referenced.
Note: the user must ensure that at least max(1,M) columns are
supplied in the array Z; if RANGE = aqVaq, the exact value of M
is not known in advance and an upper bound must be used.
 LDZ (input) INTEGER

The leading dimension of the array Z. LDZ >= 1, and if
JOBZ = aqVaq, LDZ >= max(1,N).
 WORK (workspace) REAL array, dimension (8*N)

 IWORK (workspace) INTEGER array, dimension (5*N)

 IFAIL (output) INTEGER array, dimension (N)

If JOBZ = aqVaq, then if INFO = 0, the first M elements of
IFAIL are zero. If INFO > 0, then IFAIL contains the
indices of the eigenvectors that failed to converge.
If JOBZ = aqNaq, then IFAIL is not referenced.
 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
> 0: if INFO = i, then i eigenvectors failed to converge.
Their indices are stored in array IFAIL.
Pages related to sspevx
 sspevx (3)
 sspev (l)  computes all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
 sspevd (l)  computes all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
 sspcon (l)  estimates the reciprocal of the condition number (in the 1norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF
 sspgst (l)  reduces a real symmetricdefinite generalized eigenproblem to standard form, using packed storage
 sspgv (l)  computes all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetricdefinite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
 sspgvd (l)  computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetricdefinite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
 sspgvx (l)  computes selected eigenvalues, and optionally, eigenvectors of a real generalized symmetricdefinite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x