F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF08JLF (DSTEGR)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F08JLF (DSTEGR) computes all the eigenvalues and, optionally, all the eigenvectors of a real $n$ by $n$ symmetric tridiagonal matrix.

## 2  Specification

 SUBROUTINE F08JLF ( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, LIWORK, INFO)
 INTEGER N, IL, IU, M, LDZ, ISUPPZ(*), LWORK, IWORK(max(1,LIWORK)), LIWORK, INFO REAL (KIND=nag_wp) D(*), E(*), VL, VU, ABSTOL, W(*), Z(LDZ,*), WORK(max(1,LWORK)) CHARACTER(1) JOBZ, RANGE
The routine may be called by its LAPACK name dstegr.

## 3  Description

F08JLF (DSTEGR) computes all the eigenvalues and, optionally, the eigenvectors, of a real symmetric tridiagonal matrix $T$. That is, the routine computes the spectral factorization of $T$ given by
 $T = ZΛZT ,$
where $\Lambda$ is a diagonal matrix whose diagonal elements are the eigenvalues, ${\lambda }_{i}$, of $T$ and $Z$ is an orthogonal matrix whose columns are the eigenvectors, ${z}_{i}$, of $T$. Thus
 $Tzi= λi zi , i = 1,2,…,n .$
The routine may also be used to compute all the eigenvalues and eigenvectors of a real symmetric matrix $A$ which has been reduced to tridiagonal form $T$:
 $A =QTQT, where ​Q​ is orthogonal =QZΛQZT.$
In this case, the matrix $Q$ must be explicitly applied to the output matrix $Z$. The routines which must be called to perform the reduction to tridiagonal form and apply $Q$ are:
 full matrix F08FEF (DSYTRD) and F08FGF (DORMTR) full matrix, packed storage F08GEF (DSPTRD) and F08GGF (DOPMTR) band matrix F08HEF (DSBTRD) with ${\mathbf{VECT}}=\text{'V'}$ and F06YAF (DGEMM).
This routine uses the dqds and the Relatively Robust Representation algorithms to compute the eigenvalues and eigenvectors respectively; see for example Parlett and Dhillon (2000) and Dhillon and Parlett (2004) for further details. F08JLF (DSTEGR) can usually compute all the eigenvalues and eigenvectors in $O\left({n}^{2}\right)$ floating point operations and so, for large matrices, is often considerably faster than the other symmetric tridiagonal routines in this chapter when all the eigenvectors are required, particularly so compared to those routines that are based on the $QR$ algorithm.

## 4  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
Barlow J and Demmel J W (1990) Computing accurate eigensystems of scaled diagonally dominant matrices SIAM J. Numer. Anal. 27 762–791
Dhillon I S and Parlett B N (2004) Orthogonal eigenvectors and relative gaps. SIAM J. Appl. Math. 25 858–899
Parlett B N and Dhillon I S (2000) Relatively robust representations of symmetric tridiagonals Linear Algebra Appl. 309 121–151

## 5  Parameters

1:     JOBZ – CHARACTER(1)Input
On entry: indicates whether eigenvectors are computed.
${\mathbf{JOBZ}}=\text{'N'}$
Only eigenvalues are computed.
${\mathbf{JOBZ}}=\text{'V'}$
Eigenvalues and eigenvectors are computed.
Constraint: ${\mathbf{JOBZ}}=\text{'N'}$ or $\text{'V'}$.
2:     RANGE – CHARACTER(1)Input
On entry: indicates which eigenvalues should be returned.
${\mathbf{RANGE}}=\text{'A'}$
All eigenvalues will be found.
${\mathbf{RANGE}}=\text{'V'}$
All eigenvalues in the half-open interval $\left({\mathbf{VL}},{\mathbf{VU}}\right]$ will be found.
${\mathbf{RANGE}}=\text{'I'}$
The ILth through IUth eigenvectors will be found.
Constraint: ${\mathbf{RANGE}}=\text{'A'}$, $\text{'V'}$ or $\text{'I'}$.
3:     N – INTEGERInput
On entry: $n$, the order of the matrix $T$.
Constraint: ${\mathbf{N}}\ge 0$.
4:     D($*$) – REAL (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array D must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the $n$ diagonal elements of the tridiagonal matrix $T$.
On exit: D is overwritten.
5:     E($*$) – REAL (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array E must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: ${\mathbf{E}}\left(1:{\mathbf{N}}-1\right)$ contains the subdiagonal elements of the tridiagonal matrix $T$. ${\mathbf{E}}\left({\mathbf{N}}\right)$ need not be set.
On exit: E is overwritten.
6:     VL – REAL (KIND=nag_wp)Input
7:     VU – REAL (KIND=nag_wp)Input
On entry: if ${\mathbf{RANGE}}=\text{'V'}$, VL and VU contain the lower and upper bounds respectively of the interval to be searched for eigenvalues.
If ${\mathbf{RANGE}}=\text{'A'}$ or $\text{'I'}$, VL and VU are not referenced.
Constraint: if ${\mathbf{RANGE}}=\text{'V'}$, ${\mathbf{VL}}<{\mathbf{VU}}$.
8:     IL – INTEGERInput
9:     IU – INTEGERInput
On entry: if ${\mathbf{RANGE}}=\text{'I'}$, IL and IU contains the indices (in ascending order) of the smallest and largest eigenvalues to be returned, respectively.
If ${\mathbf{RANGE}}=\text{'A'}$ or $\text{'V'}$, IL and IU are not referenced.
Constraints:
• if ${\mathbf{RANGE}}=\text{'I'}$ and ${\mathbf{N}}>0$, $1\le {\mathbf{IL}}\le {\mathbf{IU}}\le {\mathbf{N}}$;
• if ${\mathbf{RANGE}}=\text{'I'}$ and ${\mathbf{N}}=0$, ${\mathbf{IL}}=1$ and ${\mathbf{IU}}=0$.
10:   ABSTOL – REAL (KIND=nag_wp)Input
On entry: in earlier versions, this argument was the absolute error tolerance for the eigenvalues/eigenvectors. It is now deprecated, and only included for backwards-compatibility.
11:   M – INTEGEROutput
On exit: the total number of eigenvalues found. $0\le {\mathbf{M}}\le {\mathbf{N}}$.
If ${\mathbf{RANGE}}=\text{'A'}$, ${\mathbf{M}}={\mathbf{N}}$.
If ${\mathbf{RANGE}}=\text{'I'}$, ${\mathbf{M}}={\mathbf{IU}}-{\mathbf{IL}}+1$.
12:   W($*$) – REAL (KIND=nag_wp) arrayOutput
Note: the dimension of the array W must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On exit: the eigenvalues in ascending order.
13:   Z(LDZ,$*$) – REAL (KIND=nag_wp) arrayOutput
Note: the second dimension of the array Z must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{M}}\right)$ if ${\mathbf{JOBZ}}=\text{'V'}$, and at least $1$ otherwise.
On exit: if ${\mathbf{JOBZ}}=\text{'V'}$, then if ${\mathbf{INFO}}={\mathbf{0}}$, the columns of Z contain the orthonormal eigenvectors of the matrix $T$, with the $i$th column of $Z$ holding the eigenvector associated with ${\mathbf{W}}\left(i\right)$.
If ${\mathbf{JOBZ}}=\text{'N'}$, Z is not referenced.
Note:  you must ensure that at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{M}}\right)$ columns are supplied in the array Z; if ${\mathbf{RANGE}}=\text{'V'}$, the exact value of M is not known in advance and an upper bound of at least N must be used.
14:   LDZ – INTEGERInput
On entry: the first dimension of the array Z as declared in the (sub)program from which F08JLF (DSTEGR) is called.
Constraints:
• if ${\mathbf{JOBZ}}=\text{'V'}$, ${\mathbf{LDZ}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$;
• otherwise ${\mathbf{LDZ}}\ge 1$.
15:   ISUPPZ($*$) – INTEGER arrayOutput
Note: the dimension of the array ISUPPZ must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,2×{\mathbf{M}}\right)$.
On exit: the support of the eigenvectors in $Z$, i.e., the indices indicating the nonzero elements in $Z$. The $i$th eigenvector is nonzero only in elements ${\mathbf{ISUPPZ}}\left(2×i-1\right)$ through ${\mathbf{ISUPPZ}}\left(2×i\right)$.
16:   WORK($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{LWORK}}\right)$) – REAL (KIND=nag_wp) arrayWorkspace
On exit: if ${\mathbf{INFO}}={\mathbf{0}}$, ${\mathbf{WORK}}\left(1\right)$ returns the minimum LWORK.
17:   LWORK – INTEGERInput
On entry: the dimension of the array WORK as declared in the (sub)program from which F08JLF (DSTEGR) is called.
If ${\mathbf{LWORK}}=-1$, a workspace query is assumed; the routine only calculates the minimum sizes of the WORK and IWORK arrays, returns these values as the first entries of the WORK and IWORK arrays, and no error message related to LWORK or LIWORK is issued.
Constraint: ${\mathbf{LWORK}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,18×{\mathbf{N}}\right)$ or ${\mathbf{LWORK}}=-1$.
18:   IWORK($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{LIWORK}}\right)$) – INTEGER arrayWorkspace
On exit: if ${\mathbf{INFO}}={\mathbf{0}}$, ${\mathbf{WORK}}\left(1\right)$ returns the minimum LIWORK.
19:   LIWORK – INTEGERInput
On entry: the dimension of the array IWORK as declared in the (sub)program from which F08JLF (DSTEGR) is called.
If ${\mathbf{LIWORK}}=-1$, a workspace query is assumed; the routine only calculates the minimum sizes of the WORK and IWORK arrays, returns these values as the first entries of the WORK and IWORK arrays, and no error message related to LWORK or LIWORK is issued.
Constraint: ${\mathbf{LIWORK}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,10×{\mathbf{N}}\right)$ or ${\mathbf{LIWORK}}=-1$.
20:   INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{INFO}}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.
${\mathbf{INFO}}>0$
If ${\mathbf{INFO}}={\mathbf{1}}$, the $\mathrm{dqds}$ algorithm failed to converge, if ${\mathbf{INFO}}={\mathbf{2}}$, inverse iteration failed to converge.

## 7  Accuracy

See the description for ABSTOL. See also Section 4.7 of Anderson et al. (1999) and Barlow and Demmel (1990) for further details.

The total number of floating point operations required to compute all the eigenvalues and eigenvectors is approximately proportional to ${n}^{2}$.
The complex analogue of this routine is F08JYF (ZSTEGR).

## 9  Example

This example finds all the eigenvalues and eigenvectors of the symmetric tridiagonal matrix
 $T = 1.0 1.0 0.0 0.0 1.0 4.0 2.0 0.0 0.0 2.0 9.0 3.0 0.0 0.0 3.0 16.0 .$
ABSTOL is set to zero so that the default tolerance of $n\epsilon {‖T‖}_{1}$ is used.

### 9.1  Program Text

Program Text (f08jlfe.f90)

### 9.2  Program Data

Program Data (f08jlfe.d)

### 9.3  Program Results

Program Results (f08jlfe.r)