dsygvd

NAME

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

SYNOPSIS 

  SUBROUTINE DSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, 
 *      LWORK, IWORK, LIWORK, INFO)
  CHARACTER * 1 JOBZ, UPLO
  INTEGER ITYPE, N, LDA, LDB, LWORK, LIWORK, INFO
  INTEGER IWORK(*)
  DOUBLE PRECISION A(LDA,*), B(LDB,*), W(*), WORK(*)
 
  SUBROUTINE DSYGVD_64( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, 
 *      LWORK, IWORK, LIWORK, INFO)
  CHARACTER * 1 JOBZ, UPLO
  INTEGER*8 ITYPE, N, LDA, LDB, LWORK, LIWORK, INFO
  INTEGER*8 IWORK(*)
  DOUBLE PRECISION A(LDA,*), B(LDB,*), W(*), WORK(*)

F95 INTERFACE 

  SUBROUTINE SYGVD( ITYPE, JOBZ, UPLO, [N], A, [LDA], B, [LDB], W, 
 *       [WORK], [LWORK], [IWORK], [LIWORK], [INFO])
  CHARACTER(LEN=1) :: JOBZ, UPLO
  INTEGER :: ITYPE, N, LDA, LDB, LWORK, LIWORK, INFO
  INTEGER, DIMENSION(:) :: IWORK
  REAL(8), DIMENSION(:) :: W, WORK
  REAL(8), DIMENSION(:,:) :: A, B
 
  SUBROUTINE SYGVD_64( ITYPE, JOBZ, UPLO, [N], A, [LDA], B, [LDB], W, 
 *       [WORK], [LWORK], [IWORK], [LIWORK], [INFO])
  CHARACTER(LEN=1) :: JOBZ, UPLO
  INTEGER(8) :: ITYPE, N, LDA, LDB, LWORK, LIWORK, INFO
  INTEGER(8), DIMENSION(:) :: IWORK
  REAL(8), DIMENSION(:) :: W, WORK
  REAL(8), DIMENSION(:,:) :: A, B

C INTERFACE

#include <sunperf.h>

void dsygvd(int itype, char jobz, char uplo, int n, double *a, int lda, double *b, int ldb, double *w, int *info);

void dsygvd_64(long itype, char jobz, char uplo, long n, double *a, long lda, double *b, long ldb, double *w, long *info);

PURPOSE

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*Bx=(lambda)*x, or B*A*x=(lambda)*x. Here A and B are assumed to be symmetric and B is also positive definite. If eigenvectors are desired, it uses a divide and conquer algorithm.

The divide and conquer algorithm makes very mild assumptions about floating point arithmetic. It will work on machines with a guard digit in add/subtract, or on those binary machines without guard digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. It could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none.

ARGUMENTS

* ITYPE (input)
Specifies the problem type to be solved:

* JOBZ (input)

* UPLO (input)

* N (input)
The order of the matrices A and B. N >= 0.

* A (input/output)
On entry, the symmetric matrix A. If UPLO = 'U', the leading N-by-N upper triangular part of A contains the upper triangular part of the matrix A. If UPLO = 'L', the leading N-by-N lower triangular part of A contains the lower triangular part of the matrix A.

On exit, if JOBZ = 'V', then if INFO = 0, A contains the matrix Z of eigenvectors. The eigenvectors are normalized as follows: if ITYPE = 1 or 2, Z**T*B*Z = I; if ITYPE = 3, Z**T*inv(B)*Z = I. If JOBZ = 'N', then on exit the upper triangle (if UPLO='U') or the lower triangle (if UPLO='L') of A, including the diagonal, is destroyed.

* LDA (input)
The leading dimension of the array A. LDA >= max(1,N).

* B (input/output)
On entry, the symmetric matrix B. If UPLO = 'U', the leading N-by-N upper triangular part of B contains the upper triangular part of the matrix B. If UPLO = 'L', the leading N-by-N lower triangular part of B contains the lower triangular part of the matrix B.

On exit, if INFO <= N, the part of B containing the matrix is overwritten by the triangular factor U or L from the Cholesky factorization B = U**T*U or B = L*L**T.

* LDB (input)
The leading dimension of the array B. LDB >= max(1,N).

* W (output)
If INFO = 0, the eigenvalues in ascending order.

* WORK (workspace)
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.

* LWORK (input)
The dimension of the array WORK. If N <= 1, LWORK >= 1. If JOBZ = 'N' and N > 1, LWORK >= 2*N+1. If JOBZ = 'V' and N > 1, LWORK >= 1 + 6*N + 2*N**2.

If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.

* IWORK (workspace)
On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.

* LIWORK (input)
The dimension of the array IWORK. If N <= 1, LIWORK >= 1. If JOBZ = 'N' and N > 1, LIWORK >= 1. If JOBZ = 'V' and N > 1, LIWORK >= 3 + 5*N.

If LIWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the IWORK array, returns this value as the first entry of the IWORK array, and no error message related to LIWORK is issued by XERBLA.

* INFO (output)