1DLAED0(1)                LAPACK routine (version 3.1)                DLAED0(1)
2
3
4

NAME

6       DLAED0  - all eigenvalues and corresponding eigenvectors of a symmetric
7       tridiagonal matrix using the divide and conquer method
8

SYNOPSIS

10       SUBROUTINE DLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE,  LDQS,  WORK,
11                          IWORK, INFO )
12
13           INTEGER        ICOMPQ, INFO, LDQ, LDQS, N, QSIZ
14
15           INTEGER        IWORK( * )
16
17           DOUBLE         PRECISION D( * ), E( * ), Q( LDQ, * ), QSTORE( LDQS,
18                          * ), WORK( * )
19

PURPOSE

21       DLAED0 computes all eigenvalues and  corresponding  eigenvectors  of  a
22       symmetric tridiagonal matrix using the divide and conquer method.
23
24

ARGUMENTS

26       ICOMPQ  (input) INTEGER
27               = 0:  Compute eigenvalues only.
28               =  1:   Compute eigenvectors of original dense symmetric matrix
29               also.  On entry, Q  contains  the  orthogonal  matrix  used  to
30               reduce  the original matrix to tridiagonal form.  = 2:  Compute
31               eigenvalues and eigenvectors of tridiagonal matrix.
32
33       QSIZ   (input) INTEGER
34              The dimension of the orthogonal matrix used to reduce  the  full
35              matrix to tridiagonal form.  QSIZ >= N if ICOMPQ = 1.
36
37       N      (input) INTEGER
38              The dimension of the symmetric tridiagonal matrix.  N >= 0.
39
40       D      (input/output) DOUBLE PRECISION array, dimension (N)
41              On entry, the main diagonal of the tridiagonal matrix.  On exit,
42              its eigenvalues.
43
44       E      (input) DOUBLE PRECISION array, dimension (N-1)
45              The off-diagonal elements of the tridiagonal matrix.  On exit, E
46              has been destroyed.
47
48       Q      (input/output) DOUBLE PRECISION array, dimension (LDQ, N)
49              On entry, Q must contain an N-by-N orthogonal matrix.  If ICOMPQ
50              = 0    Q is not referenced.  If ICOMPQ = 1    On entry, Q  is  a
51              subset  of  the  columns of the orthogonal matrix used to reduce
52              the full matrix to tridiagonal form corresponding to the  subset
53              of  the  full matrix which is being decomposed at this time.  If
54              ICOMPQ = 2    On entry, Q will be the identity matrix.  On exit,
55              Q contains the eigenvectors of the tridiagonal matrix.
56
57       LDQ    (input) INTEGER
58              The  leading  dimension  of  the  array  Q.  If eigenvectors are
59              desired, then  LDQ >= max(1,N).  In any case,  LDQ >= 1.
60
61              QSTORE (workspace) DOUBLE PRECISION array, dimension  (LDQS,  N)
62              Referenced  only  when  ICOMPQ  = 1.  Used to store parts of the
63              eigenvector matrix when  the  updating  matrix  multiplies  take
64              place.
65
66       LDQS   (input) INTEGER
67              The  leading dimension of the array QSTORE.  If ICOMPQ = 1, then
68              LDQS >= max(1,N).  In any case,  LDQS >= 1.
69
70       WORK   (workspace) DOUBLE PRECISION array,
71              If ICOMPQ = 0 or 1, the dimension of WORK must be at least  1  +
72              3*N + 2*N*lg N + 2*N**2 ( lg( N ) = smallest integer k such that
73              2^k >= N ) If ICOMPQ = 2, the dimension of WORK must be at least
74              4*N + N**2.
75
76       IWORK  (workspace) INTEGER array,
77              If  ICOMPQ = 0 or 1, the dimension of IWORK must be at least 6 +
78              6*N + 5*N*lg N.  ( lg( N ) = smallest integer k such that 2^k >=
79              N  )  If ICOMPQ = 2, the dimension of IWORK must be at least 3 +
80              5*N.
81
82       INFO   (output) INTEGER
83              = 0:  successful exit.
84              < 0:  if INFO = -i, the i-th argument had an illegal value.
85              > 0:  The algorithm failed to compute an eigenvalue while  work‐
86              ing  on  the  submatrix  lying  in  rows  and columns INFO/(N+1)
87              through mod(INFO,N+1).
88

FURTHER DETAILS

90       Based on contributions by
91          Jeff Rutter, Computer Science Division, University of California
92          at Berkeley, USA
93
94
95
96
97 LAPACK routine (version 3.1)    November 2006                       DLAED0(1)
Impressum