NAG Library Routine Document
F08UEF (DSBGST)
1 Purpose
F08UEF (DSBGST) reduces a real symmetric-definite generalized eigenproblem
to the standard form
, where
and
are band matrices,
is a real symmetric matrix, and
has been factorized by
F08UFF (DPBSTF).
2 Specification
SUBROUTINE F08UEF ( |
VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X, LDX, WORK, INFO) |
INTEGER |
N, KA, KB, LDAB, LDBB, LDX, INFO |
REAL (KIND=nag_wp) |
AB(LDAB,*), BB(LDBB,*), X(LDX,*), WORK(2*N) |
CHARACTER(1) |
VECT, UPLO |
|
The routine may be called by its
LAPACK
name dsbgst.
3 Description
To reduce the real symmetric-definite generalized eigenproblem
to the standard form
, where
,
and
are banded, F08UEF (DSBGST) must be preceded by a call to
F08UFF (DPBSTF) which computes the split Cholesky factorization of the positive definite matrix
:
. The split Cholesky factorization, compared with the ordinary Cholesky factorization, allows the work to be approximately halved.
This routine overwrites with , where and is a orthogonal matrix chosen (implicitly) to preserve the bandwidth of . The routine also has an option to allow the accumulation of , and then, if is an eigenvector of , is an eigenvector of the original system.
4 References
Crawford C R (1973) Reduction of a band-symmetric generalized eigenvalue problem Comm. ACM 16 41–44
Kaufman L (1984) Banded eigenvalue solvers on vector machines ACM Trans. Math. Software 10 73–86
5 Parameters
- 1: VECT – CHARACTER(1)Input
On entry: indicates whether
is to be returned.
- is not returned.
- is returned.
Constraint:
or .
- 2: UPLO – CHARACTER(1)Input
On entry: indicates whether the upper or lower triangular part of
is stored.
- The upper triangular part of is stored.
- The lower triangular part of is stored.
Constraint:
or .
- 3: N – INTEGERInput
On entry: , the order of the matrices and .
Constraint:
.
- 4: KA – INTEGERInput
On entry: if
, the number of superdiagonals,
, of the matrix
.
If , the number of subdiagonals, , of the matrix .
Constraint:
.
- 5: KB – INTEGERInput
On entry: if
, the number of superdiagonals,
, of the matrix
.
If , the number of subdiagonals, , of the matrix .
Constraint:
.
- 6: AB(LDAB,) – REAL (KIND=nag_wp) arrayInput/Output
-
Note: the second dimension of the array
AB
must be at least
.
On entry: the upper or lower triangle of the
by
symmetric band matrix
.
The matrix is stored in rows
to
, more precisely,
- if , the elements of the upper triangle of within the band must be stored with element in ;
- if , the elements of the lower triangle of within the band must be stored with element in
On exit: the upper or lower triangle of
AB is overwritten by the corresponding upper or lower triangle of
as specified by
UPLO.
- 7: LDAB – INTEGERInput
On entry: the first dimension of the array
AB as declared in the (sub)program from which F08UEF (DSBGST) is called.
Constraint:
.
- 8: BB(LDBB,) – REAL (KIND=nag_wp) arrayInput
-
Note: the second dimension of the array
BB
must be at least
.
On entry: the banded split Cholesky factor of
as specified by
UPLO,
N and
KB and returned by
F08UFF (DPBSTF).
- 9: LDBB – INTEGERInput
On entry: the first dimension of the array
BB as declared in the (sub)program from which F08UEF (DSBGST) is called.
Constraint:
.
- 10: X(LDX,) – REAL (KIND=nag_wp) arrayOutput
-
Note: the second dimension of the array
X
must be at least
if
and at least
if
.
On exit: the
by
matrix
, if
.
If
,
X is not referenced.
- 11: LDX – INTEGERInput
On entry: the first dimension of the array
X as declared in the (sub)program from which F08UEF (DSBGST) is called.
Constraints:
- if , ;
- if , .
- 12: WORK() – REAL (KIND=nag_wp) arrayWorkspace
- 13: INFO – INTEGEROutput
On exit:
unless the routine detects an error (see
Section 6).
6 Error Indicators and Warnings
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
7 Accuracy
Forming the reduced matrix is a stable procedure. However it involves implicit multiplication by . When F08UEF (DSBGST) is used as a step in the computation of eigenvalues and eigenvectors of the original problem, there may be a significant loss of accuracy if is ill-conditioned with respect to inversion.
The total number of floating point operations is approximately , when , assuming ; there are an additional operations when .
The complex analogue of this routine is
F08USF (ZHBGST).
9 Example
This example computes all the eigenvalues of
, where
Here
is symmetric,
is symmetric positive definite, and
and
are treated as band matrices.
must first be factorized by
F08UFF (DPBSTF). The program calls F08UEF (DSBGST) to reduce the problem to the standard form
, then
F08HEF (DSBTRD) to reduce
to tridiagonal form, and
F08JFF (DSTERF) to compute the eigenvalues.
9.1 Program Text
Program Text (f08uefe.f90)
9.2 Program Data
Program Data (f08uefe.d)
9.3 Program Results
Program Results (f08uefe.r)