PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_dspgvx (f08tb)
Purpose
nag_lapack_dspgvx (f08tb) computes selected eigenvalues and, optionally, eigenvectors of a real generalized symmetric-definite eigenproblem, of the form
where
and
are symmetric, stored in packed storage, and
is also positive definite. Eigenvalues and eigenvectors can be selected by specifying either a range of values or a range of indices for the desired eigenvalues.
Syntax
[
ap,
bp,
m,
w,
z,
jfail,
info] = f08tb(
itype,
jobz,
range,
uplo,
n,
ap,
bp,
vl,
vu,
il,
iu,
abstol)
[
ap,
bp,
m,
w,
z,
jfail,
info] = nag_lapack_dspgvx(
itype,
jobz,
range,
uplo,
n,
ap,
bp,
vl,
vu,
il,
iu,
abstol)
Description
nag_lapack_dspgvx (f08tb) first performs a Cholesky factorization of the matrix
as
, when
or
, when
. The generalized problem is then reduced to a standard symmetric eigenvalue problem
which is solved for the desired eigenvalues and eigenvectors; the eigenvectors are then backtransformed to give the eigenvectors of the original problem.
For the problem
, the eigenvectors are normalized so that the matrix of eigenvectors,
, satisfies
where
is the diagonal matrix whose diagonal elements are the eigenvalues. For the problem
we correspondingly have
and for
we have
References
Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999)
LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia
http://www.netlib.org/lapack/lug
Demmel J W and Kahan W (1990) Accurate singular values of bidiagonal matrices SIAM J. Sci. Statist. Comput. 11 873–912
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Parameters
Compulsory Input Parameters
- 1:
– int64int32nag_int scalar
-
Specifies the problem type to be solved.
- .
- .
- .
Constraint:
, or .
- 2:
– string (length ≥ 1)
-
Indicates whether eigenvectors are computed.
- Only eigenvalues are computed.
- Eigenvalues and eigenvectors are computed.
Constraint:
or .
- 3:
– string (length ≥ 1)
-
If
, all eigenvalues will be found.
If , all eigenvalues in the half-open interval will be found.
If
, the
ilth to
iuth eigenvalues will be found.
Constraint:
, or .
- 4:
– string (length ≥ 1)
-
If
, the upper triangles of
and
are stored.
If , the lower triangles of and are stored.
Constraint:
or .
- 5:
– int64int32nag_int scalar
-
, the order of the matrices and .
Constraint:
.
- 6:
– double array
-
The dimension of the array
ap
must be at least
The upper or lower triangle of the
by
symmetric matrix
, packed by columns.
More precisely,
- if , the upper triangle of must be stored with element in for ;
- if , the lower triangle of must be stored with element in for .
- 7:
– double array
-
The dimension of the array
bp
must be at least
The upper or lower triangle of the
by
symmetric matrix
, packed by columns.
More precisely,
- if , the upper triangle of must be stored with element in for ;
- if , the lower triangle of must be stored with element in for .
- 8:
– double scalar
- 9:
– double scalar
-
If
, the lower and upper bounds of the interval to be searched for eigenvalues.
If
or
,
vl and
vu are not referenced.
Constraint:
if , .
- 10:
– int64int32nag_int scalar
- 11:
– int64int32nag_int scalar
-
If
, the indices (in ascending order) of the smallest and largest eigenvalues to be returned.
If
or
,
il and
iu are not referenced.
Constraints:
- if and , and ;
- if and , .
- 12:
– double scalar
-
The absolute error tolerance for the eigenvalues. An approximate eigenvalue is accepted as converged when it is determined to lie in an interval
of width less than or equal to
where
is the
machine precision. If
abstol is less than or equal to zero, then
will be used in its place, where
is the tridiagonal matrix obtained by reducing
to tridiagonal form. Eigenvalues will be computed most accurately when
abstol is set to twice the underflow threshold
, not zero. If this function returns with
, indicating that some eigenvectors did not converge, try setting
abstol to
. See
Demmel and Kahan (1990).
Optional Input Parameters
None.
Output Parameters
- 1:
– double array
-
The dimension of the array
ap will be
The contents of
ap are destroyed.
- 2:
– double array
-
The dimension of the array
bp will be
The triangular factor or from the Cholesky factorization or , in the same storage format as .
- 3:
– int64int32nag_int scalar
-
The total number of eigenvalues found.
.
If , .
If , .
- 4:
– double array
-
The first
m elements contain the selected eigenvalues in ascending order.
- 5:
– double array
-
The first dimension,
, of the array
z will be
- if , ;
- otherwise .
The second dimension of the array
z will be
if
and
otherwise.
If
, then
- if , the first m columns of contain the orthonormal eigenvectors of the matrix corresponding to the selected eigenvalues, with the th column of holding the eigenvector associated with . The eigenvectors are normalized as follows:
- if or , ;
- if , ;
- if an eigenvector fails to converge (), then that column of contains the latest approximation to the eigenvector, and the index of the eigenvector is returned in jfail.
If
,
z is not referenced.
- 6:
– int64int32nag_int array
-
The dimension of the array
jfail will be
If
, then
- if , the first m elements of jfail are zero;
- if , jfail contains the indices of the eigenvectors that failed to converge.
If
,
jfail is not referenced.
- 7:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
Cases prefixed with W are classified as warnings and
do not generate an error of type NAG:error_n. See nag_issue_warnings.
-
If , parameter had an illegal value on entry. The parameters are numbered as follows:
1:
itype, 2:
jobz, 3:
range, 4:
uplo, 5:
n, 6:
ap, 7:
bp, 8:
vl, 9:
vu, 10:
il, 11:
iu, 12:
abstol, 13:
m, 14:
w, 15:
z, 16:
ldz, 17:
work, 18:
iwork, 19:
jfail, 20:
info.
It is possible that
info refers to a parameter that is omitted from the MATLAB interface. This usually indicates that an error in one of the other input parameters has caused an incorrect value to be inferred.
- W
-
If
,
nag_lapack_dspevx (f08gb) failed to converge;
eigenvectors failed to converge. Their indices are stored in array
jfail.
-
-
nag_lapack_dpptrf (f07gd) returned an error code; i.e., if
, for
, then the leading minor of order
of
is not positive definite. The factorization of
could not be completed and no eigenvalues or eigenvectors were computed.
Accuracy
If
is ill-conditioned with respect to inversion, then the error bounds for the computed eigenvalues and vectors may be large, although when the diagonal elements of
differ widely in magnitude the eigenvalues and eigenvectors may be less sensitive than the condition of
would suggest. See Section 4.10 of
Anderson et al. (1999) for details of the error bounds.
Further Comments
The total number of floating-point operations is proportional to .
The complex analogue of this function is
nag_lapack_zhpgvx (f08tp).
Example
This example finds the eigenvalues in the half-open interval
, and corresponding eigenvectors, of the generalized symmetric eigenproblem
, where
The example program for
nag_lapack_dspgvd (f08tc) illustrates solving a generalized symmetric eigenproblem of the form
.
Open in the MATLAB editor:
f08tb_example
function f08tb_example
fprintf('f08tb example results\n\n');
n = int64(4);
uplo = 'U';
ap = [0.24;
0.39; -0.11;
0.42; 0.79; -0.25;
-0.16; 0.63; 0.48; -0.03];
bp = [4.16;
-3.12; 5.03;
0.56; -0.83; 0.76;
-0.10; 1.09; 0.34; 1.18];
itype = int64(1);
jobz = 'Vectors';
range = 'Values in range';
vl = -1; vu = 1;
il = int64(0); iu = int64(0);
abstol = 0;
[~, ~, m, w, z, jfail, info] = ...
f08tb( ...
itype, jobz, range, uplo, n, ap, bp, vl, vu, il, iu, abstol);
disp('Selected Eigenvalues');
disp(w(1:m)');
for j = 1:m
[~,k] = max(abs(z(:,j)));
if z(k,j) < 0;
z(:,j) = -z(:,j);
end
end
disp('Corresponding Eigenvectors');
disp(z);
f08tb example results
Selected Eigenvalues
-0.4548 0.1001
Corresponding Eigenvectors
-0.3080 -0.4469
-0.5329 -0.0371
0.3496 0.0505
0.6211 0.4743
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015