1SSPGV(1) LAPACK driver routine (version 3.2) SSPGV(1)
2
6 SSPGV - computes all the eigenvalues and, optionally, the eigenvectors
7 of a real generalized symmetric-definite eigenproblem, of the form
8 A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
9
11 SUBROUTINE SSPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, INFO )
12 CHARACTER JOBZ, UPLO
14 INTEGER INFO, ITYPE, LDZ, N
16 REAL AP( * ), BP( * ), W( * ), WORK( * ), Z( LDZ, * )
18
20 SSPGV computes all the eigenvalues and, optionally, the eigenvectors of
21 a real generalized symmetric-definite eigenproblem, of the form
22 A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. Here A and B
23 are assumed to be symmetric, stored in packed format, and B is also
24 positive definite.
25
27 ITYPE (input) INTEGER
28 Specifies the problem type to be solved:
29 = 1: A*x = (lambda)*B*x
30 = 2: A*B*x = (lambda)*x
31 = 3: B*A*x = (lambda)*x
32 JOBZ (input) CHARACTER*1
34 = 'N': Compute eigenvalues only;
35 = 'V': Compute eigenvalues and eigenvectors.
36 UPLO (input) CHARACTER*1
38 = 'U': Upper triangles of A and B are stored;
39 = 'L': Lower triangles of A and B are stored.
40 N (input) INTEGER
42 The order of the matrices A and B. N >= 0.
43 AP (input/output) REAL array, dimension
45 (N*(N+1)/2) On entry, the upper or lower triangle of the sym‐
46 metric matrix A, packed columnwise in a linear array. The j-th
47 column of A is stored in the array AP as follows: if UPLO =
48 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; if UPLO = 'L',
49 AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n. On exit, the
50 contents of AP are destroyed.
51 BP (input/output) REAL array, dimension (N*(N+1)/2)
53 On entry, the upper or lower triangle of the symmetric matrix
54 B, packed columnwise in a linear array. The j-th column of B
55 is stored in the array BP as follows: if UPLO = 'U', BP(i +
56 (j-1)*j/2) = B(i,j) for 1<=i<=j; if UPLO = 'L', BP(i +
57 (j-1)*(2*n-j)/2) = B(i,j) for j<=i<=n. On exit, the triangular
58 factor U or L from the Cholesky factorization B = U**T*U or B =
59 L*L**T, in the same storage format as B.
60 W (output) REAL array, dimension (N)
62 If INFO = 0, the eigenvalues in ascending order.
63 Z (output) REAL array, dimension (LDZ, N)
65 If JOBZ = 'V', then if INFO = 0, Z contains the matrix Z of
66 eigenvectors. The eigenvectors are normalized as follows: if
67 ITYPE = 1 or 2, Z**T*B*Z = I; if ITYPE = 3, Z**T*inv(B)*Z = I.
68 If JOBZ = 'N', then Z is not referenced.
69 LDZ (input) INTEGER
71 The leading dimension of the array Z. LDZ >= 1, and if JOBZ =
72 'V', LDZ >= max(1,N).
73 WORK (workspace) REAL array, dimension (3*N)
75 INFO (output) INTEGER
77 = 0: successful exit
78 < 0: if INFO = -i, the i-th argument had an illegal value
79 > 0: SPPTRF or SSPEV returned an error code:
80 <= N: if INFO = i, SSPEV failed to converge; i off-diagonal
81 elements of an intermediate tridiagonal form did not converge
82 to zero. > N: if INFO = n + i, for 1 <= i <= n, then the
83 leading minor of order i of B is not positive definite. The
84 factorization of B could not be completed and no eigenvalues or
85 eigenvectors were computed.
86 LAPACK driver routine (version 3.N2o)vember 2008 SSPGV(1)