NAG Library Routine Document
f01bvf (real_symm_posdef_geneig)
1
Purpose
f01bvf transforms the generalized symmetricdefinite eigenproblem
$Ax=\lambda {\mathbf{b}}x$ to the equivalent standard eigenproblem
$Cy=\lambda y$, where
$A$,
${\mathbf{b}}$ and
$C$ are symmetric band matrices and
${\mathbf{b}}$ is positive definite.
${\mathbf{b}}$ must have been decomposed by
f01buf.
2
Specification
Fortran Interface
Subroutine f01bvf ( 
n, ma1, mb1, m3, k, a, lda, b, ldb, v, ldv, w, ifail) 
Integer, Intent (In)  ::  n, ma1, mb1, m3, k, lda, ldb, ldv  Integer, Intent (Inout)  ::  ifail  Real (Kind=nag_wp), Intent (Inout)  ::  a(lda,n), b(ldb,n), v(ldv,m3)  Real (Kind=nag_wp), Intent (Out)  ::  w(m3) 

C Header Interface
#include nagmk26.h
void 
f01bvf_ (const Integer *n, const Integer *ma1, const Integer *mb1, const Integer *m3, const Integer *k, double a[], const Integer *lda, double b[], const Integer *ldb, double v[], const Integer *ldv, double w[], Integer *ifail) 

3
Description
$A$ is a symmetric band matrix of order
$n$ and bandwidth
$2{m}_{A}+1$. The positive definite symmetric band matrix
$B$, of order
$n$ and bandwidth
$2{m}_{B}+1$, must have been previously decomposed by
f01buf as
$ULD{L}^{\mathrm{T}}{U}^{\mathrm{T}}$.
f01bvf applies
$U$,
$L$ and
$D$ to
$A$,
${m}_{A}$ rows at a time, restoring the band form of
$A$ at each stage by plane rotations. The argument
$k$ defines the changeover point in the decomposition of
$B$ as used by
f01buf and is also used as a changeover point in the transformations applied by this routine. For maximum efficiency,
$k$ should be chosen to be the multiple of
${m}_{A}$ nearest to
$n/2$. The resulting symmetric band matrix
$C$ is overwritten on
a. The eigenvalues of
$C$, and thus of the original problem, may be found using
f08hef (dsbtrd) and
f08jff (dsterf). For selected eigenvalues, use
f08hef (dsbtrd) and
f08jjf (dstebz).
4
References
Crawford C R (1973) Reduction of a bandsymmetric generalized eigenvalue problem Comm. ACM 16 41–44
5
Arguments
 1: $\mathbf{n}$ – IntegerInput

On entry: $n$, the order of the matrices $A$, $B$ and $C$.
 2: $\mathbf{ma1}$ – IntegerInput

On entry: ${m}_{A}+1$, where ${m}_{A}$ is the number of nonzero superdiagonals in $A$. Normally ${\mathbf{ma1}}\ll {\mathbf{n}}$.
 3: $\mathbf{mb1}$ – IntegerInput

On entry: ${m}_{B}+1$, where ${m}_{B}$ is the number of nonzero superdiagonals in $B$.
Constraint:
${\mathbf{mb1}}\le {\mathbf{ma1}}$.
 4: $\mathbf{m3}$ – IntegerInput

On entry: the value of $3{m}_{A}+{m}_{B}$.
 5: $\mathbf{k}$ – IntegerInput

On entry:
$k$, the changeover point in the transformations. It must be the same as the value used by
f01buf in the decomposition of
$B$.
Suggested value:
the optimum value is the multiple of ${m}_{A}$ nearest to $n/2$.
Constraint:
${\mathbf{mb1}}1\le {\mathbf{k}}\le {\mathbf{n}}$.
 6: $\mathbf{a}\left({\mathbf{lda}},{\mathbf{n}}\right)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the upper triangle of the
$n$ by
$n$ symmetric band matrix
$A$, with the diagonal of the matrix stored in the
$\left({m}_{A}+1\right)$th row of the array, and the
${m}_{A}$ superdiagonals within the band stored in the first
${m}_{A}$ rows of the array. Each column of the matrix is stored in the corresponding column of the array. For example, if
$n=6$ and
${m}_{A}=2$, the storage scheme is
Elements in the top left corner of the array need not be set. The following code assigns the matrix elements within the band to the correct elements of the array:
DO 20 J = 1, N
DO 10 I = MAX(1,JMA1+1), J
A(IJ+MA1,J) = matrix (I,J)
10 CONTINUE
20 CONTINUE
On exit: is overwritten by the corresponding elements of $C$.
 7: $\mathbf{lda}$ – IntegerInput

On entry: the first dimension of the array
a as declared in the (sub)program from which
f01bvf is called.
Constraint:
${\mathbf{lda}}\ge {\mathbf{ma1}}$.
 8: $\mathbf{b}\left({\mathbf{ldb}},{\mathbf{n}}\right)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the elements of the decomposition of matrix
$B$ as returned by
f01buf.
On exit: the elements of
b will have been permuted.
 9: $\mathbf{ldb}$ – IntegerInput

On entry: the first dimension of the array
b as declared in the (sub)program from which
f01bvf is called.
Constraint:
${\mathbf{ldb}}\ge {\mathbf{mb1}}$.
 10: $\mathbf{v}\left({\mathbf{ldv}},{\mathbf{m3}}\right)$ – Real (Kind=nag_wp) arrayWorkspace
 11: $\mathbf{ldv}$ – IntegerInput

On entry: the first dimension of the array
v as declared in the (sub)program from which
f01bvf is called.
Constraint:
${\mathbf{ldv}}\ge {m}_{A}+{m}_{B}$.
 12: $\mathbf{w}\left({\mathbf{m3}}\right)$ – Real (Kind=nag_wp) arrayWorkspace

 13: $\mathbf{ifail}$ – IntegerInput/Output

On entry:
ifail must be set to
$0$,
$1\text{ or}1$. If you are unfamiliar with this argument you should refer to
Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
$1\text{ or}1$ is recommended. If the output of error messages is undesirable, then the value
$1$ is recommended. Otherwise, if you are not familiar with this argument, the recommended value is
$0$.
When the value $\mathbf{1}\text{ or}\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit:
${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
${\mathbf{ifail}}=0$ or
$1$, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
 ${\mathbf{ifail}}=1$

On entry,  ${\mathbf{mb1}}>{\mathbf{ma1}}$. 
 ${\mathbf{ifail}}=99$
An unexpected error has been triggered by this routine. Please
contact
NAG.
See
Section 3.9 in How to Use the NAG Library and its Documentation for further information.
 ${\mathbf{ifail}}=399$
Your licence key may have expired or may not have been installed correctly.
See
Section 3.8 in How to Use the NAG Library and its Documentation for further information.
 ${\mathbf{ifail}}=999$
Dynamic memory allocation failed.
See
Section 3.7 in How to Use the NAG Library and its Documentation for further information.
7
Accuracy
In general the computed system is exactly congruent to a problem $\left(A+E\right)x=\lambda \left(B+F\right)x$, where $\Vert E\Vert $ and $\Vert F\Vert $ are of the order of $\epsilon \kappa \left(B\right)\Vert A\Vert $ and $\epsilon \kappa \left(B\right)\Vert B\Vert $ respectively, where $\kappa \left(B\right)$ is the condition number of $B$ with respect to inversion and $\epsilon $ is the machine precision. This means that when $B$ is positive definite but not wellconditioned with respect to inversion, the method, which effectively involves the inversion of $B$, may lead to a severe loss of accuracy in wellconditioned eigenvalues.
8
Parallelism and Performance
f01bvf is not threaded in any implementation.
The time taken by f01bvf is approximately proportional to ${n}^{2}{m}_{B}^{2}$ and the distance of $k$ from $n/2$, e.g., $k=n/4$ and $k=3n/4$ take $502\%$ longer.
When $B$ is positive definite and wellconditioned with respect to inversion, the generalized symmetric eigenproblem can be reduced to the standard symmetric problem $Py=\lambda y$ where $P={L}^{1}A{L}^{\mathrm{T}}$ and $B=L{L}^{\mathrm{T}}$, the Cholesky factorization.
When
$A$ and
$B$ are of band form, especially if the bandwidth is small compared with the order of the matrices, storage considerations may rule out the possibility of working with
$P$ since it will be a full matrix in general. However, for any factorization of the form
$B=S{S}^{\mathrm{T}}$, the generalized symmetric problem reduces to the standard form
and there does exist a factorization such that
${S}^{1}A{S}^{\mathrm{T}}$ is still of band form (see
Crawford (1973)). Writing
the standard form is
$Cy=\lambda y$ and the bandwidth of
$C$ is the maximum bandwidth of
$A$ and
$B$.
Each stage in the transformation consists of two phases. The first reduces a leading principal submatrix of $B$ to the identity matrix and this introduces nonzero elements outside the band of $A$. In the second, further transformations are applied which leave the reduced part of $B$ unaltered and drive the extra elements upwards and off the top left corner of $A$. Alternatively, $B$ may be reduced to the identity matrix starting at the bottom righthand corner and the extra elements introduced in $A$ can be driven downwards.
The advantage of the $ULD{L}^{\mathrm{T}}{U}^{\mathrm{T}}$ decomposition of $B$ is that no extra elements have to be pushed over the whole length of $A$. If $k$ is taken as approximately $n/2$, the shifting is limited to halfway. At each stage the size of the triangular bumps produced in $A$ depends on the number of rows and columns of $B$ which are eliminated in the first phase and on the bandwidth of $B$. The number of rows and columns over which these triangles are moved at each step in the second phase is equal to the bandwidth of $A$.
In this routine,
a is defined as being at least as wide as
$B$ and must be filled out with zeros if necessary as it is overwritten with
$C$. The number of rows and columns of
$B$ which are effectively eliminated at each stage is
${m}_{A}$.
10
Example
This example finds the three smallest eigenvalues of
$Ax=\lambda Bx$, where
10.1
Program Text
Program Text (f01bvfe.f90)
10.2
Program Data
Program Data (f01bvfe.d)
10.3
Program Results
Program Results (f01bvfe.r)