ruby-lapack 1.3

data/dev/defs/zhegvx

@@ -0,0 +1,270 @@
+--- 
+:name: zhegvx
+:md5sum: 7003398fac9b579afd4a69d0f774a610
+:category: :subroutine
+:arguments: 
+- itype: 
+    :type: integer
+    :intent: input
+- jobz: 
+    :type: char
+    :intent: input
+- range: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- b: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - ldb
+    - n
+- ldb: 
+    :type: integer
+    :intent: input
+- 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: 
+    - "lsame_(&jobz,\"N\") ? 0 : ldz"
+    - "lsame_(&jobz,\"N\") ? 0 : MAX(1,m)"
+- ldz: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: 2*n
+- rwork: 
+    :type: doublereal
+    :intent: workspace
+    :dims: 
+    - 7*n
+- iwork: 
+    :type: integer
+    :intent: workspace
+    :dims: 
+    - 5*n
+- ifail: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - n
+- 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 ZHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, LWORK, RWORK, IWORK, IFAIL, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZHEGVX computes selected eigenvalues, and optionally, eigenvectors\n\
+  *  of a complex generalized Hermitian-definite eigenproblem, of the form\n\
+  *  A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.  Here A and\n\
+  *  B are assumed to be Hermitian and B is also positive definite.\n\
+  *  Eigenvalues and eigenvectors can be selected by specifying either a\n\
+  *  range of values or a range of indices for the desired eigenvalues.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  ITYPE   (input) INTEGER\n\
+  *          Specifies the problem type to be solved:\n\
+  *          = 1:  A*x = (lambda)*B*x\n\
+  *          = 2:  A*B*x = (lambda)*x\n\
+  *          = 3:  B*A*x = (lambda)*x\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\
+  *  UPLO    (input) CHARACTER*1\n\
+  *          = 'U':  Upper triangles of A and B are stored;\n\
+  *          = 'L':  Lower triangles of A and B are stored.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrices A and B.  N >= 0.\n\
+  *\n\
+  *  A       (input/output) COMPLEX*16 array, dimension (LDA, N)\n\
+  *          On entry, the Hermitian matrix A.  If UPLO = 'U', the\n\
+  *          leading N-by-N upper triangular part of A contains the\n\
+  *          upper triangular part of the matrix A.  If UPLO = 'L',\n\
+  *          the leading N-by-N lower triangular part of A contains\n\
+  *          the lower triangular part of the matrix A.\n\
+  *\n\
+  *          On exit,  the lower triangle (if UPLO='L') or the upper\n\
+  *          triangle (if UPLO='U') of A, including the diagonal, is\n\
+  *          destroyed.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *  B       (input/output) COMPLEX*16 array, dimension (LDB, N)\n\
+  *          On entry, the Hermitian matrix B.  If UPLO = 'U', the\n\
+  *          leading N-by-N upper triangular part of B contains the\n\
+  *          upper triangular part of the matrix B.  If UPLO = 'L',\n\
+  *          the leading N-by-N lower triangular part of B contains\n\
+  *          the lower triangular part of the matrix B.\n\
+  *\n\
+  *          On exit, if INFO <= N, the part of B containing the matrix is\n\
+  *          overwritten by the triangular factor U or L from the Cholesky\n\
+  *          factorization B = U**H*U or B = L*L**H.\n\
+  *\n\
+  *  LDB     (input) INTEGER\n\
+  *          The leading dimension of the array B.  LDB >= max(1,N).\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; IL = 1 and IU = 0 if N = 0.\n\
+  *          Not referenced if RANGE = 'A' or 'V'.\n\
+  *\n\
+  *  ABSTOL  (input) DOUBLE PRECISION\n\
+  *          The absolute error tolerance for the eigenvalues.\n\
+  *          An approximate eigenvalue is accepted as converged\n\
+  *          when it is determined to lie in an interval [a,b]\n\
+  *          of width less than or equal to\n\
+  *\n\
+  *                  ABSTOL + EPS *   max( |a|,|b| ) ,\n\
+  *\n\
+  *          where EPS is the machine precision.  If ABSTOL is less than\n\
+  *          or equal to zero, then  EPS*|T|  will be used in its place,\n\
+  *          where |T| is the 1-norm of the tridiagonal matrix obtained\n\
+  *          by reducing A to tridiagonal form.\n\
+  *\n\
+  *          Eigenvalues will be computed most accurately when ABSTOL is\n\
+  *          set to twice the underflow threshold 2*DLAMCH('S'), not zero.\n\
+  *          If this routine returns with INFO>0, indicating that some\n\
+  *          eigenvectors did not converge, try setting ABSTOL to\n\
+  *          2*DLAMCH('S').\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\n\
+  *          eigenvalues in ascending order.\n\
+  *\n\
+  *  Z       (output) COMPLEX*16 array, dimension (LDZ, max(1,M))\n\
+  *          If JOBZ = 'N', then Z is not referenced.\n\
+  *          If JOBZ = 'V', then if INFO = 0, the first M columns of Z\n\
+  *          contain the orthonormal eigenvectors of the matrix A\n\
+  *          corresponding to the selected eigenvalues, with the i-th\n\
+  *          column of Z holding the eigenvector associated with W(i).\n\
+  *          The eigenvectors are normalized as follows:\n\
+  *          if ITYPE = 1 or 2, Z**T*B*Z = I;\n\
+  *          if ITYPE = 3, Z**T*inv(B)*Z = I.\n\
+  *\n\
+  *          If an eigenvector fails to converge, then that column of Z\n\
+  *          contains the latest approximation to the eigenvector, and the\n\
+  *          index of the eigenvector is returned in IFAIL.\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\
+  *\n\
+  *  LDZ     (input) INTEGER\n\
+  *          The leading dimension of the array Z.  LDZ >= 1, and if\n\
+  *          JOBZ = 'V', LDZ >= max(1,N).\n\
+  *\n\
+  *  WORK    (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))\n\
+  *          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n\
+  *\n\
+  *  LWORK   (input) INTEGER\n\
+  *          The length of the array WORK.  LWORK >= max(1,2*N).\n\
+  *          For optimal efficiency, LWORK >= (NB+1)*N,\n\
+  *          where NB is the blocksize for ZHETRD returned by ILAENV.\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\
+  *  RWORK   (workspace) DOUBLE PRECISION array, dimension (7*N)\n\
+  *\n\
+  *  IWORK   (workspace) INTEGER array, dimension (5*N)\n\
+  *\n\
+  *  IFAIL   (output) INTEGER array, dimension (N)\n\
+  *          If JOBZ = 'V', then if INFO = 0, the first M elements of\n\
+  *          IFAIL are zero.  If INFO > 0, then IFAIL contains the\n\
+  *          indices of the eigenvectors that failed to converge.\n\
+  *          If JOBZ = 'N', then IFAIL is not referenced.\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          = 0:  successful exit\n\
+  *          < 0:  if INFO = -i, the i-th argument had an illegal value\n\
+  *          > 0:  ZPOTRF or ZHEEVX returned an error code:\n\
+  *             <= N:  if INFO = i, ZHEEVX failed to converge;\n\
+  *                    i eigenvectors failed to converge.  Their indices\n\
+  *                    are stored in array IFAIL.\n\
+  *             > N:   if INFO = N + i, for 1 <= i <= N, then the leading\n\
+  *                    minor of order i of B is not positive definite.\n\
+  *                    The factorization of B could not be completed and\n\
+  *                    no eigenvalues or eigenvectors were computed.\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  Based on contributions by\n\
+  *     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/zherfs

@@ -0,0 +1,170 @@
+--- 
+:name: zherfs
+:md5sum: 5526aebb74609c66f4e00e60fd27abae
+:category: :subroutine
+:arguments: 
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- nrhs: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- af: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - ldaf
+    - n
+- ldaf: 
+    :type: integer
+    :intent: input
+- ipiv: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- b: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- x: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - ldx
+    - nrhs
+- ldx: 
+    :type: integer
+    :intent: input
+- ferr: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+- berr: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+- work: 
+    :type: doublecomplex
+    :intent: workspace
+    :dims: 
+    - 2*n
+- rwork: 
+    :type: doublereal
+    :intent: workspace
+    :dims: 
+    - n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE ZHERFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZHERFS improves the computed solution to a system of linear\n\
+  *  equations when the coefficient matrix is Hermitian indefinite, and\n\
+  *  provides error bounds and backward error estimates for the solution.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  UPLO    (input) CHARACTER*1\n\
+  *          = 'U':  Upper triangle of A is stored;\n\
+  *          = 'L':  Lower triangle of A is stored.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix A.  N >= 0.\n\
+  *\n\
+  *  NRHS    (input) INTEGER\n\
+  *          The number of right hand sides, i.e., the number of columns\n\
+  *          of the matrices B and X.  NRHS >= 0.\n\
+  *\n\
+  *  A       (input) COMPLEX*16 array, dimension (LDA,N)\n\
+  *          The Hermitian matrix A.  If UPLO = 'U', the leading N-by-N\n\
+  *          upper triangular part of A contains the upper triangular part\n\
+  *          of the matrix A, and the strictly lower triangular part of A\n\
+  *          is not referenced.  If UPLO = 'L', the leading N-by-N lower\n\
+  *          triangular part of A contains the lower triangular part of\n\
+  *          the matrix A, and the strictly upper triangular part of A is\n\
+  *          not referenced.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *  AF      (input) COMPLEX*16 array, dimension (LDAF,N)\n\
+  *          The factored form of the matrix A.  AF contains the block\n\
+  *          diagonal matrix D and the multipliers used to obtain the\n\
+  *          factor U or L from the factorization A = U*D*U**H or\n\
+  *          A = L*D*L**H as computed by ZHETRF.\n\
+  *\n\
+  *  LDAF    (input) INTEGER\n\
+  *          The leading dimension of the array AF.  LDAF >= max(1,N).\n\
+  *\n\
+  *  IPIV    (input) INTEGER array, dimension (N)\n\
+  *          Details of the interchanges and the block structure of D\n\
+  *          as determined by ZHETRF.\n\
+  *\n\
+  *  B       (input) COMPLEX*16 array, dimension (LDB,NRHS)\n\
+  *          The right hand side matrix B.\n\
+  *\n\
+  *  LDB     (input) INTEGER\n\
+  *          The leading dimension of the array B.  LDB >= max(1,N).\n\
+  *\n\
+  *  X       (input/output) COMPLEX*16 array, dimension (LDX,NRHS)\n\
+  *          On entry, the solution matrix X, as computed by ZHETRS.\n\
+  *          On exit, the improved solution matrix X.\n\
+  *\n\
+  *  LDX     (input) INTEGER\n\
+  *          The leading dimension of the array X.  LDX >= max(1,N).\n\
+  *\n\
+  *  FERR    (output) DOUBLE PRECISION array, dimension (NRHS)\n\
+  *          The estimated forward error bound for each solution vector\n\
+  *          X(j) (the j-th column of the solution matrix X).\n\
+  *          If XTRUE is the true solution corresponding to X(j), FERR(j)\n\
+  *          is an estimated upper bound for the magnitude of the largest\n\
+  *          element in (X(j) - XTRUE) divided by the magnitude of the\n\
+  *          largest element in X(j).  The estimate is as reliable as\n\
+  *          the estimate for RCOND, and is almost always a slight\n\
+  *          overestimate of the true error.\n\
+  *\n\
+  *  BERR    (output) DOUBLE PRECISION array, dimension (NRHS)\n\
+  *          The componentwise relative backward error of each solution\n\
+  *          vector X(j) (i.e., the smallest relative change in\n\
+  *          any element of A or B that makes X(j) an exact solution).\n\
+  *\n\
+  *  WORK    (workspace) COMPLEX*16 array, dimension (2*N)\n\
+  *\n\
+  *  RWORK   (workspace) DOUBLE PRECISION array, dimension (N)\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          = 0:  successful exit\n\
+  *          < 0:  if INFO = -i, the i-th argument had an illegal value\n\
+  *\n\
+  *  Internal Parameters\n\
+  *  ===================\n\
+  *\n\
+  *  ITMAX is the maximum number of steps of iterative refinement.\n\
+  *\n\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/zherfsx

@@ -0,0 +1,380 @@
+--- 
+:name: zherfsx
+:md5sum: c5087f3ef812132fa16bb2e388fa2bc3
+:category: :subroutine
+:arguments: 
+- uplo: 
+    :type: char
+    :intent: input
+- equed: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- nrhs: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- af: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - ldaf
+    - n
+- ldaf: 
+    :type: integer
+    :intent: input
+- ipiv: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- s: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- b: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- x: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - ldx
+    - nrhs
+- ldx: 
+    :type: integer
+    :intent: input
+- rcond: 
+    :type: doublereal
+    :intent: output
+- berr: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+- n_err_bnds: 
+    :type: integer
+    :intent: input
+- err_bnds_norm: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+    - n_err_bnds
+- err_bnds_comp: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+    - n_err_bnds
+- nparams: 
+    :type: integer
+    :intent: input
+- params: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - nparams
+- work: 
+    :type: doublecomplex
+    :intent: workspace
+    :dims: 
+    - 2*n
+- rwork: 
+    :type: doublereal
+    :intent: workspace
+    :dims: 
+    - 2*n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  n_err_bnds: "3"
+:fortran_help: "      SUBROUTINE ZHERFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, ERR_BNDS_NORM, ERR_BNDS_COMP, NPARAMS, PARAMS, WORK, RWORK, INFO )\n\n\
+  *     Purpose\n\
+  *     =======\n\
+  *\n\
+  *     ZHERFSX improves the computed solution to a system of linear\n\
+  *     equations when the coefficient matrix is Hermitian indefinite, and\n\
+  *     provides error bounds and backward error estimates for the\n\
+  *     solution.  In addition to normwise error bound, the code provides\n\
+  *     maximum componentwise error bound if possible.  See comments for\n\
+  *     ERR_BNDS_NORM and ERR_BNDS_COMP for details of the error bounds.\n\
+  *\n\
+  *     The original system of linear equations may have been equilibrated\n\
+  *     before calling this routine, as described by arguments EQUED and S\n\
+  *     below. In this case, the solution and error bounds returned are\n\
+  *     for the original unequilibrated system.\n\
+  *\n\n\
+  *     Arguments\n\
+  *     =========\n\
+  *\n\
+  *     Some optional parameters are bundled in the PARAMS array.  These\n\
+  *     settings determine how refinement is performed, but often the\n\
+  *     defaults are acceptable.  If the defaults are acceptable, users\n\
+  *     can pass NPARAMS = 0 which prevents the source code from accessing\n\
+  *     the PARAMS argument.\n\
+  *\n\
+  *     UPLO    (input) CHARACTER*1\n\
+  *       = 'U':  Upper triangle of A is stored;\n\
+  *       = 'L':  Lower triangle of A is stored.\n\
+  *\n\
+  *     EQUED   (input) CHARACTER*1\n\
+  *     Specifies the form of equilibration that was done to A\n\
+  *     before calling this routine. This is needed to compute\n\
+  *     the solution and error bounds correctly.\n\
+  *       = 'N':  No equilibration\n\
+  *       = 'Y':  Both row and column equilibration, i.e., A has been\n\
+  *               replaced by diag(S) * A * diag(S).\n\
+  *               The right hand side B has been changed accordingly.\n\
+  *\n\
+  *     N       (input) INTEGER\n\
+  *     The order of the matrix A.  N >= 0.\n\
+  *\n\
+  *     NRHS    (input) INTEGER\n\
+  *     The number of right hand sides, i.e., the number of columns\n\
+  *     of the matrices B and X.  NRHS >= 0.\n\
+  *\n\
+  *     A       (input) COMPLEX*16 array, dimension (LDA,N)\n\
+  *     The symmetric matrix A.  If UPLO = 'U', the leading N-by-N\n\
+  *     upper triangular part of A contains the upper triangular\n\
+  *     part of the matrix A, and the strictly lower triangular\n\
+  *     part of A is not referenced.  If UPLO = 'L', the leading\n\
+  *     N-by-N lower triangular part of A contains the lower\n\
+  *     triangular part of the matrix A, and the strictly upper\n\
+  *     triangular part of A is not referenced.\n\
+  *\n\
+  *     LDA     (input) INTEGER\n\
+  *     The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *     AF      (input) COMPLEX*16 array, dimension (LDAF,N)\n\
+  *     The factored form of the matrix A.  AF contains the block\n\
+  *     diagonal matrix D and the multipliers used to obtain the\n\
+  *     factor U or L from the factorization A = U*D*U**T or A =\n\
+  *     L*D*L**T as computed by DSYTRF.\n\
+  *\n\
+  *     LDAF    (input) INTEGER\n\
+  *     The leading dimension of the array AF.  LDAF >= max(1,N).\n\
+  *\n\
+  *     IPIV    (input) INTEGER array, dimension (N)\n\
+  *     Details of the interchanges and the block structure of D\n\
+  *     as determined by DSYTRF.\n\
+  *\n\
+  *     S       (input or output) DOUBLE PRECISION array, dimension (N)\n\
+  *     The scale factors for A.  If EQUED = 'Y', A is multiplied on\n\
+  *     the left and right by diag(S).  S is an input argument if FACT =\n\
+  *     'F'; otherwise, S is an output argument.  If FACT = 'F' and EQUED\n\
+  *     = 'Y', each element of S must be positive.  If S is output, each\n\
+  *     element of S is a power of the radix. If S is input, each element\n\
+  *     of S should be a power of the radix to ensure a reliable solution\n\
+  *     and error estimates. Scaling by powers of the radix does not cause\n\
+  *     rounding errors unless the result underflows or overflows.\n\
+  *     Rounding errors during scaling lead to refining with a matrix that\n\
+  *     is not equivalent to the input matrix, producing error estimates\n\
+  *     that may not be reliable.\n\
+  *\n\
+  *     B       (input) COMPLEX*16 array, dimension (LDB,NRHS)\n\
+  *     The right hand side matrix B.\n\
+  *\n\
+  *     LDB     (input) INTEGER\n\
+  *     The leading dimension of the array B.  LDB >= max(1,N).\n\
+  *\n\
+  *     X       (input/output) COMPLEX*16 array, dimension (LDX,NRHS)\n\
+  *     On entry, the solution matrix X, as computed by DGETRS.\n\
+  *     On exit, the improved solution matrix X.\n\
+  *\n\
+  *     LDX     (input) INTEGER\n\
+  *     The leading dimension of the array X.  LDX >= max(1,N).\n\
+  *\n\
+  *     RCOND   (output) DOUBLE PRECISION\n\
+  *     Reciprocal scaled condition number.  This is an estimate of the\n\
+  *     reciprocal Skeel condition number of the matrix A after\n\
+  *     equilibration (if done).  If this is less than the machine\n\
+  *     precision (in particular, if it is zero), the matrix is singular\n\
+  *     to working precision.  Note that the error may still be small even\n\
+  *     if this number is very small and the matrix appears ill-\n\
+  *     conditioned.\n\
+  *\n\
+  *     BERR    (output) DOUBLE PRECISION array, dimension (NRHS)\n\
+  *     Componentwise relative backward error.  This is the\n\
+  *     componentwise relative backward error of each solution vector X(j)\n\
+  *     (i.e., the smallest relative change in any element of A or B that\n\
+  *     makes X(j) an exact solution).\n\
+  *\n\
+  *     N_ERR_BNDS (input) INTEGER\n\
+  *     Number of error bounds to return for each right hand side\n\
+  *     and each type (normwise or componentwise).  See ERR_BNDS_NORM and\n\
+  *     ERR_BNDS_COMP below.\n\
+  *\n\
+  *     ERR_BNDS_NORM  (output) DOUBLE PRECISION array, dimension (NRHS, N_ERR_BNDS)\n\
+  *     For each right-hand side, this array contains information about\n\
+  *     various error bounds and condition numbers corresponding to the\n\
+  *     normwise relative error, which is defined as follows:\n\
+  *\n\
+  *     Normwise relative error in the ith solution vector:\n\
+  *             max_j (abs(XTRUE(j,i) - X(j,i)))\n\
+  *            ------------------------------\n\
+  *                  max_j abs(X(j,i))\n\
+  *\n\
+  *     The array is indexed by the type of error information as described\n\
+  *     below. There currently are up to three pieces of information\n\
+  *     returned.\n\
+  *\n\
+  *     The first index in ERR_BNDS_NORM(i,:) corresponds to the ith\n\
+  *     right-hand side.\n\
+  *\n\
+  *     The second index in ERR_BNDS_NORM(:,err) contains the following\n\
+  *     three fields:\n\
+  *     err = 1 \"Trust/don't trust\" boolean. Trust the answer if the\n\
+  *              reciprocal condition number is less than the threshold\n\
+  *              sqrt(n) * dlamch('Epsilon').\n\
+  *\n\
+  *     err = 2 \"Guaranteed\" error bound: The estimated forward error,\n\
+  *              almost certainly within a factor of 10 of the true error\n\
+  *              so long as the next entry is greater than the threshold\n\
+  *              sqrt(n) * dlamch('Epsilon'). This error bound should only\n\
+  *              be trusted if the previous boolean is true.\n\
+  *\n\
+  *     err = 3  Reciprocal condition number: Estimated normwise\n\
+  *              reciprocal condition number.  Compared with the threshold\n\
+  *              sqrt(n) * dlamch('Epsilon') to determine if the error\n\
+  *              estimate is \"guaranteed\". These reciprocal condition\n\
+  *              numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some\n\
+  *              appropriately scaled matrix Z.\n\
+  *              Let Z = S*A, where S scales each row by a power of the\n\
+  *              radix so all absolute row sums of Z are approximately 1.\n\
+  *\n\
+  *     See Lapack Working Note 165 for further details and extra\n\
+  *     cautions.\n\
+  *\n\
+  *     ERR_BNDS_COMP  (output) DOUBLE PRECISION array, dimension (NRHS, N_ERR_BNDS)\n\
+  *     For each right-hand side, this array contains information about\n\
+  *     various error bounds and condition numbers corresponding to the\n\
+  *     componentwise relative error, which is defined as follows:\n\
+  *\n\
+  *     Componentwise relative error in the ith solution vector:\n\
+  *                    abs(XTRUE(j,i) - X(j,i))\n\
+  *             max_j ----------------------\n\
+  *                         abs(X(j,i))\n\
+  *\n\
+  *     The array is indexed by the right-hand side i (on which the\n\
+  *     componentwise relative error depends), and the type of error\n\
+  *     information as described below. There currently are up to three\n\
+  *     pieces of information returned for each right-hand side. If\n\
+  *     componentwise accuracy is not requested (PARAMS(3) = 0.0), then\n\
+  *     ERR_BNDS_COMP is not accessed.  If N_ERR_BNDS .LT. 3, then at most\n\
+  *     the first (:,N_ERR_BNDS) entries are returned.\n\
+  *\n\
+  *     The first index in ERR_BNDS_COMP(i,:) corresponds to the ith\n\
+  *     right-hand side.\n\
+  *\n\
+  *     The second index in ERR_BNDS_COMP(:,err) contains the following\n\
+  *     three fields:\n\
+  *     err = 1 \"Trust/don't trust\" boolean. Trust the answer if the\n\
+  *              reciprocal condition number is less than the threshold\n\
+  *              sqrt(n) * dlamch('Epsilon').\n\
+  *\n\
+  *     err = 2 \"Guaranteed\" error bound: The estimated forward error,\n\
+  *              almost certainly within a factor of 10 of the true error\n\
+  *              so long as the next entry is greater than the threshold\n\
+  *              sqrt(n) * dlamch('Epsilon'). This error bound should only\n\
+  *              be trusted if the previous boolean is true.\n\
+  *\n\
+  *     err = 3  Reciprocal condition number: Estimated componentwise\n\
+  *              reciprocal condition number.  Compared with the threshold\n\
+  *              sqrt(n) * dlamch('Epsilon') to determine if the error\n\
+  *              estimate is \"guaranteed\". These reciprocal condition\n\
+  *              numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some\n\
+  *              appropriately scaled matrix Z.\n\
+  *              Let Z = S*(A*diag(x)), where x is the solution for the\n\
+  *              current right-hand side and S scales each row of\n\
+  *              A*diag(x) by a power of the radix so all absolute row\n\
+  *              sums of Z are approximately 1.\n\
+  *\n\
+  *     See Lapack Working Note 165 for further details and extra\n\
+  *     cautions.\n\
+  *\n\
+  *     NPARAMS (input) INTEGER\n\
+  *     Specifies the number of parameters set in PARAMS.  If .LE. 0, the\n\
+  *     PARAMS array is never referenced and default values are used.\n\
+  *\n\
+  *     PARAMS  (input / output) DOUBLE PRECISION array, dimension NPARAMS\n\
+  *     Specifies algorithm parameters.  If an entry is .LT. 0.0, then\n\
+  *     that entry will be filled with default value used for that\n\
+  *     parameter.  Only positions up to NPARAMS are accessed; defaults\n\
+  *     are used for higher-numbered parameters.\n\
+  *\n\
+  *       PARAMS(LA_LINRX_ITREF_I = 1) : Whether to perform iterative\n\
+  *            refinement or not.\n\
+  *         Default: 1.0D+0\n\
+  *            = 0.0 : No refinement is performed, and no error bounds are\n\
+  *                    computed.\n\
+  *            = 1.0 : Use the double-precision refinement algorithm,\n\
+  *                    possibly with doubled-single computations if the\n\
+  *                    compilation environment does not support DOUBLE\n\
+  *                    PRECISION.\n\
+  *              (other values are reserved for future use)\n\
+  *\n\
+  *       PARAMS(LA_LINRX_ITHRESH_I = 2) : Maximum number of residual\n\
+  *            computations allowed for refinement.\n\
+  *         Default: 10\n\
+  *         Aggressive: Set to 100 to permit convergence using approximate\n\
+  *                     factorizations or factorizations other than LU. If\n\
+  *                     the factorization uses a technique other than\n\
+  *                     Gaussian elimination, the guarantees in\n\
+  *                     err_bnds_norm and err_bnds_comp may no longer be\n\
+  *                     trustworthy.\n\
+  *\n\
+  *       PARAMS(LA_LINRX_CWISE_I = 3) : Flag determining if the code\n\
+  *            will attempt to find a solution with small componentwise\n\
+  *            relative error in the double-precision algorithm.  Positive\n\
+  *            is true, 0.0 is false.\n\
+  *         Default: 1.0 (attempt componentwise convergence)\n\
+  *\n\
+  *     WORK    (workspace) COMPLEX*16 array, dimension (2*N)\n\
+  *\n\
+  *     RWORK   (workspace) DOUBLE PRECISION array, dimension (2*N)\n\
+  *\n\
+  *     INFO    (output) INTEGER\n\
+  *       = 0:  Successful exit. The solution to every right-hand side is\n\
+  *         guaranteed.\n\
+  *       < 0:  If INFO = -i, the i-th argument had an illegal value\n\
+  *       > 0 and <= N:  U(INFO,INFO) is exactly zero.  The factorization\n\
+  *         has been completed, but the factor U is exactly singular, so\n\
+  *         the solution and error bounds could not be computed. RCOND = 0\n\
+  *         is returned.\n\
+  *       = N+J: The solution corresponding to the Jth right-hand side is\n\
+  *         not guaranteed. The solutions corresponding to other right-\n\
+  *         hand sides K with K > J may not be guaranteed as well, but\n\
+  *         only the first such right-hand side is reported. If a small\n\
+  *         componentwise error is not requested (PARAMS(3) = 0.0) then\n\
+  *         the Jth right-hand side is the first with a normwise error\n\
+  *         bound that is not guaranteed (the smallest J such\n\
+  *         that ERR_BNDS_NORM(J,1) = 0.0). By default (PARAMS(3) = 1.0)\n\
+  *         the Jth right-hand side is the first with either a normwise or\n\
+  *         componentwise error bound that is not guaranteed (the smallest\n\
+  *         J such that either ERR_BNDS_NORM(J,1) = 0.0 or\n\
+  *         ERR_BNDS_COMP(J,1) = 0.0). See the definition of\n\
+  *         ERR_BNDS_NORM(:,1) and ERR_BNDS_COMP(:,1). To get information\n\
+  *         about all of the right-hand sides check ERR_BNDS_NORM or\n\
+  *         ERR_BNDS_COMP.\n\
+  *\n\n\
+  *     ==================================================================\n\
+  *\n"