ruby-lapack 1.3

data/dev/defs/zsysv

@@ -0,0 +1,149 @@
+--- 
+:name: zsysv
+:md5sum: d9c87655fe579731fe5a3d20af290357
+:category: :subroutine
+:arguments: 
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- nrhs: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- ipiv: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - n
+- b: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE ZSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, LWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZSYSV computes the solution to a complex system of linear equations\n\
+  *     A * X = B,\n\
+  *  where A is an N-by-N symmetric matrix and X and B are N-by-NRHS\n\
+  *  matrices.\n\
+  *\n\
+  *  The diagonal pivoting method is used to factor A as\n\
+  *     A = U * D * U**T,  if UPLO = 'U', or\n\
+  *     A = L * D * L**T,  if UPLO = 'L',\n\
+  *  where U (or L) is a product of permutation and unit upper (lower)\n\
+  *  triangular matrices, and D is symmetric and block diagonal with\n\
+  *  1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then\n\
+  *  used to solve the system of equations A * X = B.\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 number of linear equations, i.e., the order of the\n\
+  *          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 matrix B.  NRHS >= 0.\n\
+  *\n\
+  *  A       (input/output) COMPLEX*16 array, dimension (LDA,N)\n\
+  *          On entry, the symmetric matrix A.  If UPLO = 'U', the leading\n\
+  *          N-by-N upper triangular part of A contains the upper\n\
+  *          triangular part of the matrix A, and the strictly lower\n\
+  *          triangular part of A is not referenced.  If UPLO = 'L', the\n\
+  *          leading 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\
+  *          On exit, if INFO = 0, the block diagonal matrix D and the\n\
+  *          multipliers used to obtain the factor U or L from the\n\
+  *          factorization A = U*D*U**T or A = L*D*L**T as computed by\n\
+  *          ZSYTRF.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *  IPIV    (output) INTEGER array, dimension (N)\n\
+  *          Details of the interchanges and the block structure of D, as\n\
+  *          determined by ZSYTRF.  If IPIV(k) > 0, then rows and columns\n\
+  *          k and IPIV(k) were interchanged, and D(k,k) is a 1-by-1\n\
+  *          diagonal block.  If UPLO = 'U' and IPIV(k) = IPIV(k-1) < 0,\n\
+  *          then rows and columns k-1 and -IPIV(k) were interchanged and\n\
+  *          D(k-1:k,k-1:k) is a 2-by-2 diagonal block.  If UPLO = 'L' and\n\
+  *          IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and\n\
+  *          -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2\n\
+  *          diagonal block.\n\
+  *\n\
+  *  B       (input/output) COMPLEX*16 array, dimension (LDB,NRHS)\n\
+  *          On entry, the N-by-NRHS right hand side matrix B.\n\
+  *          On exit, if INFO = 0, the N-by-NRHS solution matrix X.\n\
+  *\n\
+  *  LDB     (input) INTEGER\n\
+  *          The leading dimension of the array B.  LDB >= 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 WORK.  LWORK >= 1, and for best performance\n\
+  *          LWORK >= max(1,N*NB), where NB is the optimal blocksize for\n\
+  *          ZSYTRF.\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\
+  *  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, D(i,i) is exactly zero.  The factorization\n\
+  *               has been completed, but the block diagonal matrix D is\n\
+  *               exactly singular, so the solution could not be computed.\n\
+  *\n\n\
+  *  =====================================================================\n\
+  *\n\
+  *     .. Local Scalars ..\n      LOGICAL            LQUERY\n      INTEGER            LWKOPT, NB\n\
+  *     ..\n\
+  *     .. External Functions ..\n      LOGICAL            LSAME\n      INTEGER            ILAENV\n      EXTERNAL           LSAME, ILAENV\n\
+  *     ..\n\
+  *     .. External Subroutines ..\n      EXTERNAL           XERBLA, ZSYTRF, ZSYTRS2\n\
+  *     ..\n\
+  *     .. Intrinsic Functions ..\n      INTRINSIC          MAX\n\
+  *     ..\n"

data/dev/defs/zsysvx

@@ -0,0 +1,261 @@
+--- 
+:name: zsysvx
+:md5sum: 656a5f89da3c81bca3d7d209e7e5939a
+:category: :subroutine
+:arguments: 
+- fact: 
+    :type: char
+    :intent: input
+- 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/output
+    :dims: 
+    - ldaf
+    - n
+- ldaf: 
+    :type: integer
+    :intent: input
+- ipiv: 
+    :type: integer
+    :intent: input/output
+    :dims: 
+    - n
+- b: 
+    :type: doublecomplex
+    :intent: input
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- x: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - ldx
+    - nrhs
+- ldx: 
+    :type: integer
+    :intent: input
+- rcond: 
+    :type: doublereal
+    :intent: output
+- ferr: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+- berr: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - nrhs
+- work: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: 3*n
+- rwork: 
+    :type: doublereal
+    :intent: workspace
+    :dims: 
+    - n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  ldx: MAX(1,n)
+:fortran_help: "      SUBROUTINE ZSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, RWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  ZSYSVX uses the diagonal pivoting factorization to compute the\n\
+  *  solution to a complex system of linear equations A * X = B,\n\
+  *  where A is an N-by-N symmetric matrix and X and B are N-by-NRHS\n\
+  *  matrices.\n\
+  *\n\
+  *  Error bounds on the solution and a condition estimate are also\n\
+  *  provided.\n\
+  *\n\
+  *  Description\n\
+  *  ===========\n\
+  *\n\
+  *  The following steps are performed:\n\
+  *\n\
+  *  1. If FACT = 'N', the diagonal pivoting method is used to factor A.\n\
+  *     The form of the factorization is\n\
+  *        A = U * D * U**T,  if UPLO = 'U', or\n\
+  *        A = L * D * L**T,  if UPLO = 'L',\n\
+  *     where U (or L) is a product of permutation and unit upper (lower)\n\
+  *     triangular matrices, and D is symmetric and block diagonal with\n\
+  *     1-by-1 and 2-by-2 diagonal blocks.\n\
+  *\n\
+  *  2. If some D(i,i)=0, so that D is exactly singular, then the routine\n\
+  *     returns with INFO = i. Otherwise, the factored form of A is used\n\
+  *     to estimate the condition number of the matrix A.  If the\n\
+  *     reciprocal of the condition number is less than machine precision,\n\
+  *     INFO = N+1 is returned as a warning, but the routine still goes on\n\
+  *     to solve for X and compute error bounds as described below.\n\
+  *\n\
+  *  3. The system of equations is solved for X using the factored form\n\
+  *     of A.\n\
+  *\n\
+  *  4. Iterative refinement is applied to improve the computed solution\n\
+  *     matrix and calculate error bounds and backward error estimates\n\
+  *     for it.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  FACT    (input) CHARACTER*1\n\
+  *          Specifies whether or not the factored form of A has been\n\
+  *          supplied on entry.\n\
+  *          = 'F':  On entry, AF and IPIV contain the factored form\n\
+  *                  of A.  A, AF and IPIV will not be modified.\n\
+  *          = 'N':  The matrix A will be copied to AF and factored.\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 number of linear equations, i.e., the order of the\n\
+  *          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 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 or output) COMPLEX*16 array, dimension (LDAF,N)\n\
+  *          If FACT = 'F', then AF is an input argument and on entry\n\
+  *          contains the block diagonal matrix D and the multipliers used\n\
+  *          to obtain the factor U or L from the factorization\n\
+  *          A = U*D*U**T or A = L*D*L**T as computed by ZSYTRF.\n\
+  *\n\
+  *          If FACT = 'N', then AF is an output argument and on exit\n\
+  *          returns the block diagonal matrix D and the multipliers used\n\
+  *          to obtain the factor U or L from the factorization\n\
+  *          A = U*D*U**T or A = L*D*L**T.\n\
+  *\n\
+  *  LDAF    (input) INTEGER\n\
+  *          The leading dimension of the array AF.  LDAF >= max(1,N).\n\
+  *\n\
+  *  IPIV    (input or output) INTEGER array, dimension (N)\n\
+  *          If FACT = 'F', then IPIV is an input argument and on entry\n\
+  *          contains details of the interchanges and the block structure\n\
+  *          of D, as determined by ZSYTRF.\n\
+  *          If IPIV(k) > 0, then rows and columns k and IPIV(k) were\n\
+  *          interchanged and D(k,k) is a 1-by-1 diagonal block.\n\
+  *          If UPLO = 'U' and IPIV(k) = IPIV(k-1) < 0, then rows and\n\
+  *          columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k)\n\
+  *          is a 2-by-2 diagonal block.  If UPLO = 'L' and IPIV(k) =\n\
+  *          IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were\n\
+  *          interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.\n\
+  *\n\
+  *          If FACT = 'N', then IPIV is an output argument and on exit\n\
+  *          contains details of the interchanges and the block structure\n\
+  *          of D, as determined by ZSYTRF.\n\
+  *\n\
+  *  B       (input) COMPLEX*16 array, dimension (LDB,NRHS)\n\
+  *          The N-by-NRHS 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       (output) COMPLEX*16 array, dimension (LDX,NRHS)\n\
+  *          If INFO = 0 or INFO = N+1, the N-by-NRHS 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\
+  *          The estimate of the reciprocal condition number of the matrix\n\
+  *          A.  If RCOND is less than the machine precision (in\n\
+  *          particular, if RCOND = 0), the matrix is singular to working\n\
+  *          precision.  This condition is indicated by a return code of\n\
+  *          INFO > 0.\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/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 WORK.  LWORK >= max(1,2*N), and for best\n\
+  *          performance, when FACT = 'N', LWORK >= max(1,2*N,N*NB), where\n\
+  *          NB is the optimal blocksize for ZSYTRF.\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 (N)\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, and i is\n\
+  *                <= N:  D(i,i) is exactly zero.  The factorization\n\
+  *                       has been completed but the factor D is exactly\n\
+  *                       singular, so the solution and error bounds could\n\
+  *                       not be computed. RCOND = 0 is returned.\n\
+  *                = N+1: D is nonsingular, but RCOND is less than machine\n\
+  *                       precision, meaning that the matrix is singular\n\
+  *                       to working precision.  Nevertheless, the\n\
+  *                       solution and error bounds are computed because\n\
+  *                       there are a number of situations where the\n\
+  *                       computed solution can be more accurate than the\n\
+  *                       value of RCOND would suggest.\n\
+  *\n\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/zsysvxx

@@ -0,0 +1,482 @@
+--- 
+:name: zsysvxx
+:md5sum: 3f3062455b8eddc6564c8ef135aac476
+:category: :subroutine
+:arguments: 
+- fact: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- nrhs: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- af: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - ldaf
+    - n
+- ldaf: 
+    :type: integer
+    :intent: input
+- ipiv: 
+    :type: integer
+    :intent: input/output
+    :dims: 
+    - n
+- equed: 
+    :type: char
+    :intent: input/output
+- s: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- b: 
+    :type: doublecomplex
+    :intent: input/output
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- x: 
+    :type: doublecomplex
+    :intent: output
+    :dims: 
+    - ldx
+    - nrhs
+- ldx: 
+    :type: integer
+    :intent: input
+- rcond: 
+    :type: doublereal
+    :intent: output
+- rpvgrw: 
+    :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: 
+  ldx: MAX(1,n)
+  n_err_bnds: "3"
+:fortran_help: "      SUBROUTINE ZSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, N_ERR_BNDS, ERR_BNDS_NORM, ERR_BNDS_COMP, NPARAMS, PARAMS, WORK, RWORK, INFO )\n\n\
+  *     Purpose\n\
+  *     =======\n\
+  *\n\
+  *     ZSYSVXX uses the diagonal pivoting factorization to compute the\n\
+  *     solution to a complex*16 system of linear equations A * X = B, where\n\
+  *     A is an N-by-N symmetric matrix and X and B are N-by-NRHS\n\
+  *     matrices.\n\
+  *\n\
+  *     If requested, both normwise and maximum componentwise error bounds\n\
+  *     are returned. ZSYSVXX will return a solution with a tiny\n\
+  *     guaranteed error (O(eps) where eps is the working machine\n\
+  *     precision) unless the matrix is very ill-conditioned, in which\n\
+  *     case a warning is returned. Relevant condition numbers also are\n\
+  *     calculated and returned.\n\
+  *\n\
+  *     ZSYSVXX accepts user-provided factorizations and equilibration\n\
+  *     factors; see the definitions of the FACT and EQUED options.\n\
+  *     Solving with refinement and using a factorization from a previous\n\
+  *     ZSYSVXX call will also produce a solution with either O(eps)\n\
+  *     errors or warnings, but we cannot make that claim for general\n\
+  *     user-provided factorizations and equilibration factors if they\n\
+  *     differ from what ZSYSVXX would itself produce.\n\
+  *\n\
+  *     Description\n\
+  *     ===========\n\
+  *\n\
+  *     The following steps are performed:\n\
+  *\n\
+  *     1. If FACT = 'E', double precision scaling factors are computed to equilibrate\n\
+  *     the system:\n\
+  *\n\
+  *       diag(S)*A*diag(S)     *inv(diag(S))*X = diag(S)*B\n\
+  *\n\
+  *     Whether or not the system will be equilibrated depends on the\n\
+  *     scaling of the matrix A, but if equilibration is used, A is\n\
+  *     overwritten by diag(S)*A*diag(S) and B by diag(S)*B.\n\
+  *\n\
+  *     2. If FACT = 'N' or 'E', the LU decomposition is used to factor\n\
+  *     the matrix A (after equilibration if FACT = 'E') as\n\
+  *\n\
+  *        A = U * D * U**T,  if UPLO = 'U', or\n\
+  *        A = L * D * L**T,  if UPLO = 'L',\n\
+  *\n\
+  *     where U (or L) is a product of permutation and unit upper (lower)\n\
+  *     triangular matrices, and D is symmetric and block diagonal with\n\
+  *     1-by-1 and 2-by-2 diagonal blocks.\n\
+  *\n\
+  *     3. If some D(i,i)=0, so that D is exactly singular, then the\n\
+  *     routine returns with INFO = i. Otherwise, the factored form of A\n\
+  *     is used to estimate the condition number of the matrix A (see\n\
+  *     argument RCOND).  If the reciprocal of the condition number is\n\
+  *     less than machine precision, the routine still goes on to solve\n\
+  *     for X and compute error bounds as described below.\n\
+  *\n\
+  *     4. The system of equations is solved for X using the factored form\n\
+  *     of A.\n\
+  *\n\
+  *     5. By default (unless PARAMS(LA_LINRX_ITREF_I) is set to zero),\n\
+  *     the routine will use iterative refinement to try to get a small\n\
+  *     error and error bounds.  Refinement calculates the residual to at\n\
+  *     least twice the working precision.\n\
+  *\n\
+  *     6. If equilibration was used, the matrix X is premultiplied by\n\
+  *     diag(R) so that it solves the original system before\n\
+  *     equilibration.\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\
+  *     FACT    (input) CHARACTER*1\n\
+  *     Specifies whether or not the factored form of the matrix A is\n\
+  *     supplied on entry, and if not, whether the matrix A should be\n\
+  *     equilibrated before it is factored.\n\
+  *       = 'F':  On entry, AF and IPIV contain the factored form of A.\n\
+  *               If EQUED is not 'N', the matrix A has been\n\
+  *               equilibrated with scaling factors given by S.\n\
+  *               A, AF, and IPIV are not modified.\n\
+  *       = 'N':  The matrix A will be copied to AF and factored.\n\
+  *       = 'E':  The matrix A will be equilibrated if necessary, then\n\
+  *               copied to AF and factored.\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 number of linear equations, i.e., the order of the\n\
+  *     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/output) 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\
+  *     On exit, if FACT = 'E' and EQUED = 'Y', A is overwritten by\n\
+  *     diag(S)*A*diag(S).\n\
+  *\n\
+  *     LDA     (input) INTEGER\n\
+  *     The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *     AF      (input or output) COMPLEX*16 array, dimension (LDAF,N)\n\
+  *     If FACT = 'F', then AF is an input argument and on entry\n\
+  *     contains the block diagonal matrix D and the multipliers\n\
+  *     used to obtain the factor U or L from the factorization A =\n\
+  *     U*D*U**T or A = L*D*L**T as computed by DSYTRF.\n\
+  *\n\
+  *     If FACT = 'N', then AF is an output argument and on exit\n\
+  *     returns the block diagonal matrix D and the multipliers\n\
+  *     used to obtain the factor U or L from the factorization A =\n\
+  *     U*D*U**T or A = L*D*L**T.\n\
+  *\n\
+  *     LDAF    (input) INTEGER\n\
+  *     The leading dimension of the array AF.  LDAF >= max(1,N).\n\
+  *\n\
+  *     IPIV    (input or output) INTEGER array, dimension (N)\n\
+  *     If FACT = 'F', then IPIV is an input argument and on entry\n\
+  *     contains details of the interchanges and the block\n\
+  *     structure of D, as determined by DSYTRF.  If IPIV(k) > 0,\n\
+  *     then rows and columns k and IPIV(k) were interchanged and\n\
+  *     D(k,k) is a 1-by-1 diagonal block.  If UPLO = 'U' and\n\
+  *     IPIV(k) = IPIV(k-1) < 0, then rows and columns k-1 and\n\
+  *     -IPIV(k) were interchanged and D(k-1:k,k-1:k) is a 2-by-2\n\
+  *     diagonal block.  If UPLO = 'L' and IPIV(k) = IPIV(k+1) < 0,\n\
+  *     then rows and columns k+1 and -IPIV(k) were interchanged\n\
+  *     and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.\n\
+  *\n\
+  *     If FACT = 'N', then IPIV is an output argument and on exit\n\
+  *     contains details of the interchanges and the block\n\
+  *     structure of D, as determined by DSYTRF.\n\
+  *\n\
+  *     EQUED   (input or output) CHARACTER*1\n\
+  *     Specifies the form of equilibration that was done.\n\
+  *       = 'N':  No equilibration (always true if FACT = 'N').\n\
+  *       = 'Y':  Both row and column equilibration, i.e., A has been\n\
+  *               replaced by diag(S) * A * diag(S).\n\
+  *     EQUED is an input argument if FACT = 'F'; otherwise, it is an\n\
+  *     output argument.\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/output) COMPLEX*16 array, dimension (LDB,NRHS)\n\
+  *     On entry, the N-by-NRHS right hand side matrix B.\n\
+  *     On exit,\n\
+  *     if EQUED = 'N', B is not modified;\n\
+  *     if EQUED = 'Y', B is overwritten by diag(S)*B;\n\
+  *\n\
+  *     LDB     (input) INTEGER\n\
+  *     The leading dimension of the array B.  LDB >= max(1,N).\n\
+  *\n\
+  *     X       (output) COMPLEX*16 array, dimension (LDX,NRHS)\n\
+  *     If INFO = 0, the N-by-NRHS solution matrix X to the original\n\
+  *     system of equations.  Note that A and B are modified on exit if\n\
+  *     EQUED .ne. 'N', and the solution to the equilibrated system is\n\
+  *     inv(diag(S))*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\
+  *     RPVGRW  (output) DOUBLE PRECISION\n\
+  *     Reciprocal pivot growth.  On exit, this contains the reciprocal\n\
+  *     pivot growth factor norm(A)/norm(U). The \"max absolute element\"\n\
+  *     norm is used.  If this is much less than 1, then the stability of\n\
+  *     the LU factorization of the (equilibrated) matrix A could be poor.\n\
+  *     This also means that the solution X, estimated condition numbers,\n\
+  *     and error bounds could be unreliable. If factorization fails with\n\
+  *     0<INFO<=N, then this contains the reciprocal pivot growth factor\n\
+  *     for the leading INFO columns of A.\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 extra-precise refinement algorithm.\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"