|
|
◆ dstebz()
| void dstebz |
( |
char |
range, |
|
|
char |
order, |
|
|
int |
n, |
|
|
double |
vl, |
|
|
double |
vu, |
|
|
int |
il, |
|
|
int |
iu, |
|
|
double |
abstol, |
|
|
double |
d[], |
|
|
double |
e[], |
|
|
int * |
m, |
|
|
int * |
nsplit, |
|
|
double |
w[], |
|
|
int |
iblock[], |
|
|
int |
isplit[], |
|
|
double |
work[], |
|
|
int |
iwork[], |
|
|
int * |
info |
|
) |
| |
Eigenvalues of a symmetric tridiagonal matrix (Bisection method)
- Purpose
- This routine computes the eigenvalues of a symmetric tridiagonal matrix T. The user may ask for all eigenvalues, all eigenvalues in the half-open interval (vl, vu], or the il-th through iu-th eigenvalues.
To avoid overflow, the matrix must be scaled so that its largest element is no greater than overflow^(1/2) * underflow^(1/4) in absolute value, and for greatest accuracy, it should not be much smaller than that.
- Parameters
-
| [in] | range | = 'A': All eigenvalues will be found.
= 'V': All eigenvalues in the half-open interval (vl, vu] will be found.
= 'I': The il-th through iu-th eigenvalues will be found. |
| [in] | order | = 'B': The eigenvalues will be grouped by split-off block (see iblock, isplit) and ordered from smallest to largest within the block.
= 'E': The eigenvalues for the entire matrix will be ordered from smallest to largest. |
| [in] | n | Order of the tridiagonal matrix. (n >= 0) (If n = 0, returns without computation) |
| [in] | vl | range = 'V': The lower bound of the interval to be searched for eigenvalues. Eigenvalues less than or equal to vl, or greater than vu, will not be returned. (vl < vu)
range = 'A' or 'I': Not referenced. |
| [in] | vu | range = 'V': The upper bound of the interval to be searched for eigenvalues. Eigenvalues less than or equal to vl, or greater than vu, will not be returned. (vl < vu)
range = 'A' or 'I': Not referenced. |
| [in] | il | range = 'I': The index of the smallest eigenvalue to be returned. (1 <= il <= iu <= n, if n > 0. il = 1 and iu = 0 if n = 0)
range = 'A' or 'V': Not referenced. |
| [in] | iu | range = 'I': The index of the largest eigenvalues to be returned. (1 <= il <= iu <= n, if n > 0. il = 1 and iu = 0 if n = 0)
range = 'A' or 'V': Not referenced. |
| [in] | abstol | The absolute error tolerance for the eigenvalues. An eigenvalue (or cluster) is considered to be located if it has been determined to lie in an interval whose width is abstol or less. If abstol is less than or equal to zero, then ulp*|T| will be used, where |T| means the 1-norm of T.
Eigenvalues will be computed most accurately when abstol is set to twice the underflow threshold 2*dlamch('S'), not zero. |
| [in] | d[] | Array d[ld] (ld >= n)
The n diagonal elements of the tridiagonal matrix T. |
| [in] | e[] | Array e[le] (le >= n - 1)
The (n-1) off-diagonal elements of the tridiagonal matrix T. |
| [out] | m | The actual number of eigenvalues found. (0 <= m <= n)
(See also the description of info = 2, 3.) |
| [out] | nsplit | The number of diagonal blocks in the matrix T. (1 <= nsplit <= n) |
| [out] | w[] | Array w[lw] (lw >= n)
The first m elements of w[] will contain the eigenvalues. (This routine may use the remaining n - m elements as workspace.) |
| [out] | iblock[] | Array iblock[liblock] (liblock >= n)
At each row/column j where e[j] is zero or small, the matrix T is considered to split into a block diagonal matrix. On exit, if info = 0, iblock[i] specifies to which block (from 1 to the number of blocks) the eigenvalue w[i] belongs. (dstebz may use the remaining n-m elements as workspace.) |
| [out] | isplit[] | Array isplit[lisplit] (lisplit >= n)
The splitting points, at which T breaks up into submatrices. The first submatrix consists of rows/columns 1 to isplit[0], the second of rows/columns isplit[0] + 1 through isplit[1], etc., and the nsplit-th consists of rows/columns isplit[nsplit - 2] + 1 through isplit[nsplit - 1] = n. (Only the first nsplit elements will actually be used, but since the user cannot know a priori what value nsplit will have, n words must be reserved for isplit.) |
| [out] | work[] | Array work[lwork] (lwork >= 4*n)
Work array. |
| [out] | iwork[] | Array iwork[liwork] (liwork >= 3*n)
Integer work array. |
| [out] | info | = 0: Successful exit.
= -1: The argument range had an illegal value. (range != 'A', 'V' nor 'I')
= -2: The argument order had an illegal value. (order != 'B' nor 'E')
= -3: The argument n had an illegal value. (n < 0)
= -5: The argument vu had an illegal value. (vu <= vl)
= -6: The argument il had an illegal value. (il < 1 or il > n)
= -7: The argument iu had an illegal value. (iu < min(n, il) or iu > n)
= > 0: Some or all of the eigenvalues failed to converge or were not computed.
= 1 or 3: Bisection failed to converge for some eigenvalues. These eigenvalues are flagged by a negative block number.
= 2 or 3: Not all of the eigenvalues il:iu were found. Returns m < iu + 1 - il. (range = 'I')
= 4: The Gershgorin interval initially used was too small. No eigenvalues were computed. (range = 'I') |
- Reference
- LAPACK
|