dspev - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
SUBROUTINE DSPEV( JOBZ, UPLO, N, A, W, Z, LDZ, WORK, INFO) CHARACTER * 1 JOBZ, UPLO INTEGER N, LDZ, INFO DOUBLE PRECISION A(*), W(*), Z(LDZ,*), WORK(*)
SUBROUTINE DSPEV_64( JOBZ, UPLO, N, A, W, Z, LDZ, WORK, INFO) CHARACTER * 1 JOBZ, UPLO INTEGER*8 N, LDZ, INFO DOUBLE PRECISION A(*), W(*), Z(LDZ,*), WORK(*)
SUBROUTINE SPEV( JOBZ, UPLO, [N], A, W, Z, [LDZ], [WORK], [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO INTEGER :: N, LDZ, INFO REAL(8), DIMENSION(:) :: A, W, WORK REAL(8), DIMENSION(:,:) :: Z
SUBROUTINE SPEV_64( JOBZ, UPLO, [N], A, W, Z, [LDZ], [WORK], [INFO]) CHARACTER(LEN=1) :: JOBZ, UPLO INTEGER(8) :: N, LDZ, INFO REAL(8), DIMENSION(:) :: A, W, WORK REAL(8), DIMENSION(:,:) :: Z
#include <sunperf.h>
void dspev(char jobz, char uplo, int n, double *a, double *w, double *z, int ldz, int *info);
void dspev_64(char jobz, char uplo, long n, double *a, double *w, double *z, long ldz, long *info);
dspev computes all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage.
= 'N': Compute eigenvalues only;
= 'V': Compute eigenvalues and eigenvectors.
= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
A(i,j)
for 1 < =i < =j;
if UPLO = 'L', A(i + (j-1)*(2*n-j)/2) = A(i,j)
for j < =i < =n.
On exit, A is overwritten by values generated during the reduction to tridiagonal form. If UPLO = 'U', the diagonal and first superdiagonal of the tridiagonal matrix T overwrite the corresponding elements of A, and if UPLO = 'L', the diagonal and first subdiagonal of T overwrite the corresponding elements of A.
dimension(3*N)
= 0: successful exit.
< 0: if INFO = -i, the i-th argument had an illegal value.
> 0: if INFO = i, the algorithm failed to converge; i off-diagonal elements of an intermediate tridiagonal form did not converge to zero.