ruby-lapack 1.3

data/dev/defs/zstegr

@@ -0,0 +1,233 @@
+--- 
+:name: zstegr
+:md5sum: 49832177055455b53b056123ac827dbc
+:category: :subroutine
+:arguments: 
+- jobz: 
+    :type: char
+    :intent: input
+- range: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- d: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- e: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- vl: 
+    :type: doublereal
+    :intent: input
+- vu: 
+    :type: doublereal
+    :intent: input
+- il: 
+    :type: integer
+    :intent: input
+- iu: 
+    :type: integer
+    :intent: input
+- abstol: 
+    :type: doublereal
+    :intent: input
+- m: 
+    :type: integer
+    :intent: output
+- w: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - n
+- z: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - ldz
+    - MAX(1,m)
+- ldz: 
+    :type: integer
+    :intent: input
+- isuppz: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - 2*MAX(1,m)
+- work: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: "lsame_(&jobz,\"V\") ? 18*n : lsame_(&jobz,\"N\") ? 12*n : 0"
+- iwork: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - MAX(1,liwork)
+- liwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: "lsame_(&jobz,\"V\") ? 10*n : lsame_(&jobz,\"N\") ? 8*n : 0"
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  ldz: "lsame_(&jobz,\"V\") ? MAX(1,n) : 1"
+  m: "lsame_(&range,\"A\") ? n : lsame_(&range,\"I\") ? iu-il+1 : 0"
+:fortran_help: "      SUBROUTINE ZSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, LIWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZSTEGR computes selected eigenvalues and, optionally, eigenvectors\n\
+  *  of a real symmetric tridiagonal matrix T. Any such unreduced matrix has\n\
+  *  a well defined set of pairwise different real eigenvalues, the corresponding\n\
+  *  real eigenvectors are pairwise orthogonal.\n\
+  *\n\
+  *  The spectrum may be computed either completely or partially by specifying\n\
+  *  either an interval (VL,VU] or a range of indices IL:IU for the desired\n\
+  *  eigenvalues.\n\
+  *\n\
+  *  ZSTEGR is a compatability wrapper around the improved ZSTEMR routine.\n\
+  *  See DSTEMR for further details.\n\
+  *\n\
+  *  One important change is that the ABSTOL parameter no longer provides any\n\
+  *  benefit and hence is no longer used.\n\
+  *\n\
+  *  Note : ZSTEGR and ZSTEMR work only on machines which follow\n\
+  *  IEEE-754 floating-point standard in their handling of infinities and\n\
+  *  NaNs.  Normal execution may create these exceptiona values and hence\n\
+  *  may abort due to a floating point exception in environments which\n\
+  *  do not conform to the IEEE-754 standard.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  JOBZ    (input) CHARACTER*1\n\
+  *          = 'N':  Compute eigenvalues only;\n\
+  *          = 'V':  Compute eigenvalues and eigenvectors.\n\
+  *\n\
+  *  RANGE   (input) CHARACTER*1\n\
+  *          = 'A': all eigenvalues will be found.\n\
+  *          = 'V': all eigenvalues in the half-open interval (VL,VU]\n\
+  *                 will be found.\n\
+  *          = 'I': the IL-th through IU-th eigenvalues will be found.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix.  N >= 0.\n\
+  *\n\
+  *  D       (input/output) DOUBLE PRECISION array, dimension (N)\n\
+  *          On entry, the N diagonal elements of the tridiagonal matrix\n\
+  *          T. On exit, D is overwritten.\n\
+  *\n\
+  *  E       (input/output) DOUBLE PRECISION array, dimension (N)\n\
+  *          On entry, the (N-1) subdiagonal elements of the tridiagonal\n\
+  *          matrix T in elements 1 to N-1 of E. E(N) need not be set on\n\
+  *          input, but is used internally as workspace.\n\
+  *          On exit, E is overwritten.\n\
+  *\n\
+  *  VL      (input) DOUBLE PRECISION\n\
+  *  VU      (input) DOUBLE PRECISION\n\
+  *          If RANGE='V', the lower and upper bounds of the interval to\n\
+  *          be searched for eigenvalues. VL < VU.\n\
+  *          Not referenced if RANGE = 'A' or 'I'.\n\
+  *\n\
+  *  IL      (input) INTEGER\n\
+  *  IU      (input) INTEGER\n\
+  *          If RANGE='I', the indices (in ascending order) of the\n\
+  *          smallest and largest eigenvalues to be returned.\n\
+  *          1 <= IL <= IU <= N, if N > 0.\n\
+  *          Not referenced if RANGE = 'A' or 'V'.\n\
+  *\n\
+  *  ABSTOL  (input) DOUBLE PRECISION\n\
+  *          Unused.  Was the absolute error tolerance for the\n\
+  *          eigenvalues/eigenvectors in previous versions.\n\
+  *\n\
+  *  M       (output) INTEGER\n\
+  *          The total number of eigenvalues found.  0 <= M <= N.\n\
+  *          If RANGE = 'A', M = N, and if RANGE = 'I', M = IU-IL+1.\n\
+  *\n\
+  *  W       (output) DOUBLE PRECISION array, dimension (N)\n\
+  *          The first M elements contain the selected eigenvalues in\n\
+  *          ascending order.\n\
+  *\n\
+  *  Z       (output) COMPLEX*16 array, dimension (LDZ, max(1,M) )\n\
+  *          If JOBZ = 'V', and if INFO = 0, then the first M columns of Z\n\
+  *          contain the orthonormal eigenvectors of the matrix T\n\
+  *          corresponding to the selected eigenvalues, with the i-th\n\
+  *          column of Z holding the eigenvector associated with W(i).\n\
+  *          If JOBZ = 'N', then Z is not referenced.\n\
+  *          Note: the user must ensure that at least max(1,M) columns are\n\
+  *          supplied in the array Z; if RANGE = 'V', the exact value of M\n\
+  *          is not known in advance and an upper bound must be used.\n\
+  *          Supplying N columns is always safe.\n\
+  *\n\
+  *  LDZ     (input) INTEGER\n\
+  *          The leading dimension of the array Z.  LDZ >= 1, and if\n\
+  *          JOBZ = 'V', then LDZ >= max(1,N).\n\
+  *\n\
+  *  ISUPPZ  (output) INTEGER ARRAY, dimension ( 2*max(1,M) )\n\
+  *          The support of the eigenvectors in Z, i.e., the indices\n\
+  *          indicating the nonzero elements in Z. The i-th computed eigenvector\n\
+  *          is nonzero only in elements ISUPPZ( 2*i-1 ) through\n\
+  *          ISUPPZ( 2*i ). This is relevant in the case when the matrix\n\
+  *          is split. ISUPPZ is only accessed when JOBZ is 'V' and N > 0.\n\
+  *\n\
+  *  WORK    (workspace/output) DOUBLE PRECISION array, dimension (LWORK)\n\
+  *          On exit, if INFO = 0, WORK(1) returns the optimal\n\
+  *          (and minimal) LWORK.\n\
+  *\n\
+  *  LWORK   (input) INTEGER\n\
+  *          The dimension of the array WORK. LWORK >= max(1,18*N)\n\
+  *          if JOBZ = 'V', and LWORK >= max(1,12*N) if JOBZ = 'N'.\n\
+  *          If LWORK = -1, then a workspace query is assumed; the routine\n\
+  *          only calculates the optimal size of the WORK array, returns\n\
+  *          this value as the first entry of the WORK array, and no error\n\
+  *          message related to LWORK is issued by XERBLA.\n\
+  *\n\
+  *  IWORK   (workspace/output) INTEGER array, dimension (LIWORK)\n\
+  *          On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.\n\
+  *\n\
+  *  LIWORK  (input) INTEGER\n\
+  *          The dimension of the array IWORK.  LIWORK >= max(1,10*N)\n\
+  *          if the eigenvectors are desired, and LIWORK >= max(1,8*N)\n\
+  *          if only the eigenvalues are to be computed.\n\
+  *          If LIWORK = -1, then a workspace query is assumed; the\n\
+  *          routine only calculates the optimal size of the IWORK array,\n\
+  *          returns this value as the first entry of the IWORK array, and\n\
+  *          no error message related to LIWORK is issued by XERBLA.\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          On exit, INFO\n\
+  *          = 0:  successful exit\n\
+  *          < 0:  if INFO = -i, the i-th argument had an illegal value\n\
+  *          > 0:  if INFO = 1X, internal error in DLARRE,\n\
+  *                if INFO = 2X, internal error in ZLARRV.\n\
+  *                Here, the digit X = ABS( IINFO ) < 10, where IINFO is\n\
+  *                the nonzero error code returned by DLARRE or\n\
+  *                ZLARRV, respectively.\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  Based on contributions by\n\
+  *     Inderjit Dhillon, IBM Almaden, USA\n\
+  *     Osni Marques, LBNL/NERSC, USA\n\
+  *     Christof Voemel, LBNL/NERSC, USA\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n\
+  *     .. Local Scalars ..\n      LOGICAL TRYRAC\n\
+  *     ..\n\
+  *     .. External Subroutines ..\n      EXTERNAL ZSTEMR\n\
+  *     ..\n"

data/dev/defs/zstein

@@ -0,0 +1,159 @@
+--- 
+:name: zstein
+:md5sum: e31fefcd280e4ed544d4a3d6fa703ad2
+:category: :subroutine
+:arguments: 
+- n: 
+    :type: integer
+    :intent: input
+- d: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - n
+- e: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - n-1
+- m: 
+    :type: integer
+    :intent: input
+- w: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - n
+- iblock: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- isplit: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- z: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - ldz
+    - m
+- ldz: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: doublereal
+    :intent: workspace
+    :dims: 
+    - 5*n
+- iwork: 
+    :type: integer
+    :intent: workspace
+    :dims: 
+    - n
+- ifail: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - m
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  ldz: MAX(1,n)
+  m: n
+:fortran_help: "      SUBROUTINE ZSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK, IWORK, IFAIL, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZSTEIN computes the eigenvectors of a real symmetric tridiagonal\n\
+  *  matrix T corresponding to specified eigenvalues, using inverse\n\
+  *  iteration.\n\
+  *\n\
+  *  The maximum number of iterations allowed for each eigenvector is\n\
+  *  specified by an internal parameter MAXITS (currently set to 5).\n\
+  *\n\
+  *  Although the eigenvectors are real, they are stored in a complex\n\
+  *  array, which may be passed to ZUNMTR or ZUPMTR for back\n\
+  *  transformation to the eigenvectors of a complex Hermitian matrix\n\
+  *  which was reduced to tridiagonal form.\n\
+  *\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix.  N >= 0.\n\
+  *\n\
+  *  D       (input) DOUBLE PRECISION array, dimension (N)\n\
+  *          The n diagonal elements of the tridiagonal matrix T.\n\
+  *\n\
+  *  E       (input) DOUBLE PRECISION array, dimension (N-1)\n\
+  *          The (n-1) subdiagonal elements of the tridiagonal matrix\n\
+  *          T, stored in elements 1 to N-1.\n\
+  *\n\
+  *  M       (input) INTEGER\n\
+  *          The number of eigenvectors to be found.  0 <= M <= N.\n\
+  *\n\
+  *  W       (input) DOUBLE PRECISION array, dimension (N)\n\
+  *          The first M elements of W contain the eigenvalues for\n\
+  *          which eigenvectors are to be computed.  The eigenvalues\n\
+  *          should be grouped by split-off block and ordered from\n\
+  *          smallest to largest within the block.  ( The output array\n\
+  *          W from DSTEBZ with ORDER = 'B' is expected here. )\n\
+  *\n\
+  *  IBLOCK  (input) INTEGER array, dimension (N)\n\
+  *          The submatrix indices associated with the corresponding\n\
+  *          eigenvalues in W; IBLOCK(i)=1 if eigenvalue W(i) belongs to\n\
+  *          the first submatrix from the top, =2 if W(i) belongs to\n\
+  *          the second submatrix, etc.  ( The output array IBLOCK\n\
+  *          from DSTEBZ is expected here. )\n\
+  *\n\
+  *  ISPLIT  (input) INTEGER array, dimension (N)\n\
+  *          The splitting points, at which T breaks up into submatrices.\n\
+  *          The first submatrix consists of rows/columns 1 to\n\
+  *          ISPLIT( 1 ), the second of rows/columns ISPLIT( 1 )+1\n\
+  *          through ISPLIT( 2 ), etc.\n\
+  *          ( The output array ISPLIT from DSTEBZ is expected here. )\n\
+  *\n\
+  *  Z       (output) COMPLEX*16 array, dimension (LDZ, M)\n\
+  *          The computed eigenvectors.  The eigenvector associated\n\
+  *          with the eigenvalue W(i) is stored in the i-th column of\n\
+  *          Z.  Any vector which fails to converge is set to its current\n\
+  *          iterate after MAXITS iterations.\n\
+  *          The imaginary parts of the eigenvectors are set to zero.\n\
+  *\n\
+  *  LDZ     (input) INTEGER\n\
+  *          The leading dimension of the array Z.  LDZ >= max(1,N).\n\
+  *\n\
+  *  WORK    (workspace) DOUBLE PRECISION array, dimension (5*N)\n\
+  *\n\
+  *  IWORK   (workspace) INTEGER array, dimension (N)\n\
+  *\n\
+  *  IFAIL   (output) INTEGER array, dimension (M)\n\
+  *          On normal exit, all elements of IFAIL are zero.\n\
+  *          If one or more eigenvectors fail to converge after\n\
+  *          MAXITS iterations, then their indices are stored in\n\
+  *          array IFAIL.\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          = 0: successful exit\n\
+  *          < 0: if INFO = -i, the i-th argument had an illegal value\n\
+  *          > 0: if INFO = i, then i eigenvectors failed to converge\n\
+  *               in MAXITS iterations.  Their indices are stored in\n\
+  *               array IFAIL.\n\
+  *\n\
+  *  Internal Parameters\n\
+  *  ===================\n\
+  *\n\
+  *  MAXITS  INTEGER, default = 5\n\
+  *          The maximum number of iterations performed.\n\
+  *\n\
+  *  EXTRA   INTEGER, default = 2\n\
+  *          The number of iterations performed after norm growth\n\
+  *          criterion is satisfied, should be at least 1.\n\
+  *\n\n\
+  * =====================================================================\n\
+  *\n"

data/dev/defs/zstemr

@@ -0,0 +1,302 @@
+--- 
+:name: zstemr
+:md5sum: 18429e0d76905fc8f0eb2c094229686f
+:category: :subroutine
+:arguments: 
+- jobz: 
+    :type: char
+    :intent: input
+- range: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- d: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- e: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- vl: 
+    :type: doublereal
+    :intent: input
+- vu: 
+    :type: doublereal
+    :intent: input
+- il: 
+    :type: integer
+    :intent: input
+- iu: 
+    :type: integer
+    :intent: input
+- m: 
+    :type: integer
+    :intent: output
+- w: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - n
+- z: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - ldz
+    - MAX(1,m)
+- ldz: 
+    :type: integer
+    :intent: input
+- nzc: 
+    :type: integer
+    :intent: input
+- isuppz: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - 2*MAX(1,m)
+- tryrac: 
+    :type: logical
+    :intent: input/output
+- work: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: "lsame_(&jobz,\"V\") ? 18*n : lsame_(&jobz,\"N\") ? 12*n : 0"
+- iwork: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - MAX(1,liwork)
+- liwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: "lsame_(&jobz,\"V\") ? 10*n : lsame_(&jobz,\"N\") ? 8*n : 0"
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  ldz: "lsame_(&jobz,\"V\") ? MAX(1,n) : 1"
+  m: "lsame_(&range,\"A\") ? n : lsame_(&range,\"I\") ? iu-il+1 : 0"
+:fortran_help: "      SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, IWORK, LIWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZSTEMR computes selected eigenvalues and, optionally, eigenvectors\n\
+  *  of a real symmetric tridiagonal matrix T. Any such unreduced matrix has\n\
+  *  a well defined set of pairwise different real eigenvalues, the corresponding\n\
+  *  real eigenvectors are pairwise orthogonal.\n\
+  *\n\
+  *  The spectrum may be computed either completely or partially by specifying\n\
+  *  either an interval (VL,VU] or a range of indices IL:IU for the desired\n\
+  *  eigenvalues.\n\
+  *\n\
+  *  Depending on the number of desired eigenvalues, these are computed either\n\
+  *  by bisection or the dqds algorithm. Numerically orthogonal eigenvectors are\n\
+  *  computed by the use of various suitable L D L^T factorizations near clusters\n\
+  *  of close eigenvalues (referred to as RRRs, Relatively Robust\n\
+  *  Representations). An informal sketch of the algorithm follows.\n\
+  *\n\
+  *  For each unreduced block (submatrix) of T,\n\
+  *     (a) Compute T - sigma I  = L D L^T, so that L and D\n\
+  *         define all the wanted eigenvalues to high relative accuracy.\n\
+  *         This means that small relative changes in the entries of D and L\n\
+  *         cause only small relative changes in the eigenvalues and\n\
+  *         eigenvectors. The standard (unfactored) representation of the\n\
+  *         tridiagonal matrix T does not have this property in general.\n\
+  *     (b) Compute the eigenvalues to suitable accuracy.\n\
+  *         If the eigenvectors are desired, the algorithm attains full\n\
+  *         accuracy of the computed eigenvalues only right before\n\
+  *         the corresponding vectors have to be computed, see steps c) and d).\n\
+  *     (c) For each cluster of close eigenvalues, select a new\n\
+  *         shift close to the cluster, find a new factorization, and refine\n\
+  *         the shifted eigenvalues to suitable accuracy.\n\
+  *     (d) For each eigenvalue with a large enough relative separation compute\n\
+  *         the corresponding eigenvector by forming a rank revealing twisted\n\
+  *         factorization. Go back to (c) for any clusters that remain.\n\
+  *\n\
+  *  For more details, see:\n\
+  *  - Inderjit S. Dhillon and Beresford N. Parlett: \"Multiple representations\n\
+  *    to compute orthogonal eigenvectors of symmetric tridiagonal matrices,\"\n\
+  *    Linear Algebra and its Applications, 387(1), pp. 1-28, August 2004.\n\
+  *  - Inderjit Dhillon and Beresford Parlett: \"Orthogonal Eigenvectors and\n\
+  *    Relative Gaps,\" SIAM Journal on Matrix Analysis and Applications, Vol. 25,\n\
+  *    2004.  Also LAPACK Working Note 154.\n\
+  *  - Inderjit Dhillon: \"A new O(n^2) algorithm for the symmetric\n\
+  *    tridiagonal eigenvalue/eigenvector problem\",\n\
+  *    Computer Science Division Technical Report No. UCB/CSD-97-971,\n\
+  *    UC Berkeley, May 1997.\n\
+  *\n\
+  *  Further Details\n\
+  *  1.ZSTEMR works only on machines which follow IEEE-754\n\
+  *  floating-point standard in their handling of infinities and NaNs.\n\
+  *  This permits the use of efficient inner loops avoiding a check for\n\
+  *  zero divisors.\n\
+  *\n\
+  *  2. LAPACK routines can be used to reduce a complex Hermitean matrix to\n\
+  *  real symmetric tridiagonal form.\n\
+  *\n\
+  *  (Any complex Hermitean tridiagonal matrix has real values on its diagonal\n\
+  *  and potentially complex numbers on its off-diagonals. By applying a\n\
+  *  similarity transform with an appropriate diagonal matrix\n\
+  *  diag(1,e^{i \\phy_1}, ... , e^{i \\phy_{n-1}}), the complex Hermitean\n\
+  *  matrix can be transformed into a real symmetric matrix and complex\n\
+  *  arithmetic can be entirely avoided.)\n\
+  *\n\
+  *  While the eigenvectors of the real symmetric tridiagonal matrix are real,\n\
+  *  the eigenvectors of original complex Hermitean matrix have complex entries\n\
+  *  in general.\n\
+  *  Since LAPACK drivers overwrite the matrix data with the eigenvectors,\n\
+  *  ZSTEMR accepts complex workspace to facilitate interoperability\n\
+  *  with ZUNMTR or ZUPMTR.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  JOBZ    (input) CHARACTER*1\n\
+  *          = 'N':  Compute eigenvalues only;\n\
+  *          = 'V':  Compute eigenvalues and eigenvectors.\n\
+  *\n\
+  *  RANGE   (input) CHARACTER*1\n\
+  *          = 'A': all eigenvalues will be found.\n\
+  *          = 'V': all eigenvalues in the half-open interval (VL,VU]\n\
+  *                 will be found.\n\
+  *          = 'I': the IL-th through IU-th eigenvalues will be found.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix.  N >= 0.\n\
+  *\n\
+  *  D       (input/output) DOUBLE PRECISION array, dimension (N)\n\
+  *          On entry, the N diagonal elements of the tridiagonal matrix\n\
+  *          T. On exit, D is overwritten.\n\
+  *\n\
+  *  E       (input/output) DOUBLE PRECISION array, dimension (N)\n\
+  *          On entry, the (N-1) subdiagonal elements of the tridiagonal\n\
+  *          matrix T in elements 1 to N-1 of E. E(N) need not be set on\n\
+  *          input, but is used internally as workspace.\n\
+  *          On exit, E is overwritten.\n\
+  *\n\
+  *  VL      (input) DOUBLE PRECISION\n\
+  *  VU      (input) DOUBLE PRECISION\n\
+  *          If RANGE='V', the lower and upper bounds of the interval to\n\
+  *          be searched for eigenvalues. VL < VU.\n\
+  *          Not referenced if RANGE = 'A' or 'I'.\n\
+  *\n\
+  *  IL      (input) INTEGER\n\
+  *  IU      (input) INTEGER\n\
+  *          If RANGE='I', the indices (in ascending order) of the\n\
+  *          smallest and largest eigenvalues to be returned.\n\
+  *          1 <= IL <= IU <= N, if N > 0.\n\
+  *          Not referenced if RANGE = 'A' or 'V'.\n\
+  *\n\
+  *  M       (output) INTEGER\n\
+  *          The total number of eigenvalues found.  0 <= M <= N.\n\
+  *          If RANGE = 'A', M = N, and if RANGE = 'I', M = IU-IL+1.\n\
+  *\n\
+  *  W       (output) DOUBLE PRECISION array, dimension (N)\n\
+  *          The first M elements contain the selected eigenvalues in\n\
+  *          ascending order.\n\
+  *\n\
+  *  Z       (output) COMPLEX*16 array, dimension (LDZ, max(1,M) )\n\
+  *          If JOBZ = 'V', and if INFO = 0, then the first M columns of Z\n\
+  *          contain the orthonormal eigenvectors of the matrix T\n\
+  *          corresponding to the selected eigenvalues, with the i-th\n\
+  *          column of Z holding the eigenvector associated with W(i).\n\
+  *          If JOBZ = 'N', then Z is not referenced.\n\
+  *          Note: the user must ensure that at least max(1,M) columns are\n\
+  *          supplied in the array Z; if RANGE = 'V', the exact value of M\n\
+  *          is not known in advance and can be computed with a workspace\n\
+  *          query by setting NZC = -1, see below.\n\
+  *\n\
+  *  LDZ     (input) INTEGER\n\
+  *          The leading dimension of the array Z.  LDZ >= 1, and if\n\
+  *          JOBZ = 'V', then LDZ >= max(1,N).\n\
+  *\n\
+  *  NZC     (input) INTEGER\n\
+  *          The number of eigenvectors to be held in the array Z.\n\
+  *          If RANGE = 'A', then NZC >= max(1,N).\n\
+  *          If RANGE = 'V', then NZC >= the number of eigenvalues in (VL,VU].\n\
+  *          If RANGE = 'I', then NZC >= IU-IL+1.\n\
+  *          If NZC = -1, then a workspace query is assumed; the\n\
+  *          routine calculates the number of columns of the array Z that\n\
+  *          are needed to hold the eigenvectors.\n\
+  *          This value is returned as the first entry of the Z array, and\n\
+  *          no error message related to NZC is issued by XERBLA.\n\
+  *\n\
+  *  ISUPPZ  (output) INTEGER ARRAY, dimension ( 2*max(1,M) )\n\
+  *          The support of the eigenvectors in Z, i.e., the indices\n\
+  *          indicating the nonzero elements in Z. The i-th computed eigenvector\n\
+  *          is nonzero only in elements ISUPPZ( 2*i-1 ) through\n\
+  *          ISUPPZ( 2*i ). This is relevant in the case when the matrix\n\
+  *          is split. ISUPPZ is only accessed when JOBZ is 'V' and N > 0.\n\
+  *\n\
+  *  TRYRAC  (input/output) LOGICAL\n\
+  *          If TRYRAC.EQ..TRUE., indicates that the code should check whether\n\
+  *          the tridiagonal matrix defines its eigenvalues to high relative\n\
+  *          accuracy.  If so, the code uses relative-accuracy preserving\n\
+  *          algorithms that might be (a bit) slower depending on the matrix.\n\
+  *          If the matrix does not define its eigenvalues to high relative\n\
+  *          accuracy, the code can uses possibly faster algorithms.\n\
+  *          If TRYRAC.EQ..FALSE., the code is not required to guarantee\n\
+  *          relatively accurate eigenvalues and can use the fastest possible\n\
+  *          techniques.\n\
+  *          On exit, a .TRUE. TRYRAC will be set to .FALSE. if the matrix\n\
+  *          does not define its eigenvalues to high relative accuracy.\n\
+  *\n\
+  *  WORK    (workspace/output) DOUBLE PRECISION array, dimension (LWORK)\n\
+  *          On exit, if INFO = 0, WORK(1) returns the optimal\n\
+  *          (and minimal) LWORK.\n\
+  *\n\
+  *  LWORK   (input) INTEGER\n\
+  *          The dimension of the array WORK. LWORK >= max(1,18*N)\n\
+  *          if JOBZ = 'V', and LWORK >= max(1,12*N) if JOBZ = 'N'.\n\
+  *          If LWORK = -1, then a workspace query is assumed; the routine\n\
+  *          only calculates the optimal size of the WORK array, returns\n\
+  *          this value as the first entry of the WORK array, and no error\n\
+  *          message related to LWORK is issued by XERBLA.\n\
+  *\n\
+  *  IWORK   (workspace/output) INTEGER array, dimension (LIWORK)\n\
+  *          On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.\n\
+  *\n\
+  *  LIWORK  (input) INTEGER\n\
+  *          The dimension of the array IWORK.  LIWORK >= max(1,10*N)\n\
+  *          if the eigenvectors are desired, and LIWORK >= max(1,8*N)\n\
+  *          if only the eigenvalues are to be computed.\n\
+  *          If LIWORK = -1, then a workspace query is assumed; the\n\
+  *          routine only calculates the optimal size of the IWORK array,\n\
+  *          returns this value as the first entry of the IWORK array, and\n\
+  *          no error message related to LIWORK is issued by XERBLA.\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          On exit, INFO\n\
+  *          = 0:  successful exit\n\
+  *          < 0:  if INFO = -i, the i-th argument had an illegal value\n\
+  *          > 0:  if INFO = 1X, internal error in DLARRE,\n\
+  *                if INFO = 2X, internal error in ZLARRV.\n\
+  *                Here, the digit X = ABS( IINFO ) < 10, where IINFO is\n\
+  *                the nonzero error code returned by DLARRE or\n\
+  *                ZLARRV, respectively.\n\
+  *\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  Based on contributions by\n\
+  *     Beresford Parlett, University of California, Berkeley, USA\n\
+  *     Jim Demmel, University of California, Berkeley, USA\n\
+  *     Inderjit Dhillon, University of Texas, Austin, USA\n\
+  *     Osni Marques, LBNL/NERSC, USA\n\
+  *     Christof Voemel, University of California, Berkeley, USA\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"