ruby-lapack 1.3

data/dev/defs/dgerqf

@@ -0,0 +1,116 @@
+--- 
+:name: dgerqf
+:md5sum: 522daeb5235e5276cf26a8dc9440df57
+:category: :subroutine
+:arguments: 
+- m: 
+    :type: integer
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- tau: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MIN(m,n)
+- work: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: m
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE DGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  DGERQF computes an RQ factorization of a real M-by-N matrix A:\n\
+  *  A = R * Q.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  M       (input) INTEGER\n\
+  *          The number of rows of the matrix A.  M >= 0.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The number of columns of the matrix A.  N >= 0.\n\
+  *\n\
+  *  A       (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n\
+  *          On entry, the M-by-N matrix A.\n\
+  *          On exit,\n\
+  *          if m <= n, the upper triangle of the subarray\n\
+  *          A(1:m,n-m+1:n) contains the M-by-M upper triangular matrix R;\n\
+  *          if m >= n, the elements on and above the (m-n)-th subdiagonal\n\
+  *          contain the M-by-N upper trapezoidal matrix R;\n\
+  *          the remaining elements, with the array TAU, represent the\n\
+  *          orthogonal matrix Q as a product of min(m,n) elementary\n\
+  *          reflectors (see Further Details).\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,M).\n\
+  *\n\
+  *  TAU     (output) DOUBLE PRECISION array, dimension (min(M,N))\n\
+  *          The scalar factors of the elementary reflectors (see Further\n\
+  *          Details).\n\
+  *\n\
+  *  WORK    (workspace/output) DOUBLE PRECISION array, dimension (MAX(1,LWORK))\n\
+  *          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n\
+  *\n\
+  *  LWORK   (input) INTEGER\n\
+  *          The dimension of the array WORK.  LWORK >= max(1,M).\n\
+  *          For optimum performance LWORK >= M*NB, where NB is\n\
+  *          the optimal blocksize.\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\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  The matrix Q is represented as a product of elementary reflectors\n\
+  *\n\
+  *     Q = H(1) H(2) . . . H(k), where k = min(m,n).\n\
+  *\n\
+  *  Each H(i) has the form\n\
+  *\n\
+  *     H(i) = I - tau * v * v'\n\
+  *\n\
+  *  where tau is a real scalar, and v is a real vector with\n\
+  *  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in\n\
+  *  A(m-k+i,1:n-k+i-1), and tau in TAU(i).\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n\
+  *     .. Local Scalars ..\n      LOGICAL            LQUERY\n      INTEGER            I, IB, IINFO, IWS, K, KI, KK, LDWORK, LWKOPT,\n     $                   MU, NB, NBMIN, NU, NX\n\
+  *     ..\n\
+  *     .. External Subroutines ..\n      EXTERNAL           DGERQ2, DLARFB, DLARFT, XERBLA\n\
+  *     ..\n\
+  *     .. Intrinsic Functions ..\n      INTRINSIC          MAX, MIN\n\
+  *     ..\n\
+  *     .. External Functions ..\n      INTEGER            ILAENV\n      EXTERNAL           ILAENV\n\
+  *     ..\n"

data/dev/defs/dgesc2

@@ -0,0 +1,86 @@
+--- 
+:name: dgesc2
+:md5sum: 2545d85fa9c437128db2590785846062
+:category: :subroutine
+:arguments: 
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- rhs: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - n
+- ipiv: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- jpiv: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- scale: 
+    :type: doublereal
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE DGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  DGESC2 solves a system of linear equations\n\
+  *\n\
+  *            A * X = scale* RHS\n\
+  *\n\
+  *  with a general N-by-N matrix A using the LU factorization with\n\
+  *  complete pivoting computed by DGETC2.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix A.\n\
+  *\n\
+  *  A       (input) DOUBLE PRECISION array, dimension (LDA,N)\n\
+  *          On entry, the  LU part of the factorization of the n-by-n\n\
+  *          matrix A computed by DGETC2:  A = P * L * U * Q\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1, N).\n\
+  *\n\
+  *  RHS     (input/output) DOUBLE PRECISION array, dimension (N).\n\
+  *          On entry, the right hand side vector b.\n\
+  *          On exit, the solution vector X.\n\
+  *\n\
+  *  IPIV    (input) INTEGER array, dimension (N).\n\
+  *          The pivot indices; for 1 <= i <= N, row i of the\n\
+  *          matrix has been interchanged with row IPIV(i).\n\
+  *\n\
+  *  JPIV    (input) INTEGER array, dimension (N).\n\
+  *          The pivot indices; for 1 <= j <= N, column j of the\n\
+  *          matrix has been interchanged with column JPIV(j).\n\
+  *\n\
+  *  SCALE   (output) DOUBLE PRECISION\n\
+  *          On exit, SCALE contains the scale factor. SCALE is chosen\n\
+  *          0 <= SCALE <= 1 to prevent owerflow in the solution.\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  Based on contributions by\n\
+  *     Bo Kagstrom and Peter Poromaa, Department of Computing Science,\n\
+  *     Umea University, S-901 87 Umea, Sweden.\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/dgesdd

@@ -0,0 +1,197 @@
+--- 
+:name: dgesdd
+:md5sum: 31309f179f21f12ed15aae51ac120086
+:category: :subroutine
+:arguments: 
+- jobz: 
+    :type: char
+    :intent: input
+- m: 
+    :type: integer
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- s: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MIN(m,n)
+- u: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - ldu
+    - ucol
+- ldu: 
+    :type: integer
+    :intent: input
+- vt: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - ldvt
+    - n
+- ldvt: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: "lsame_(&jobz,\"N\") ? 3*MIN(m,n)+MAX(MAX(m,n),7*MIN(m,n)) : lsame_(&jobz,\"O\") ? 3*MIN(m,n)+MAX(MAX(m,n),5*MIN(m,n)*MIN(m,n)+4*MIN(m,n)) : (lsame_(&jobz,\"S\")||lsame_(&jobz,\"A\")) ? 3*MIN(m,n)+MAX(MAX(m,n),4*MIN(m,n)*MIN(m,n)+4*MIN(m,n)) : 0"
+- iwork: 
+    :type: integer
+    :intent: workspace
+    :dims: 
+    - 8*MIN(m,n)
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  m: lda
+  ucol: "((lsame_(&jobz,\"A\")) || (((lsame_(&jobz,\"O\")) && (m < n)))) ? m : lsame_(&jobz,\"S\") ? MIN(m,n) : 0"
+  ldvt: "((lsame_(&jobz,\"A\")) || (((lsame_(&jobz,\"O\")) && (m >= n)))) ? n : lsame_(&jobz,\"S\") ? MIN(m,n) : 1"
+  ldu: "(lsame_(&jobz,\"S\") || lsame_(&jobz,\"A\") || (lsame_(&jobz,\"O\") && m < n)) ? m : 1"
+:fortran_help: "      SUBROUTINE DGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, LWORK, IWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  DGESDD computes the singular value decomposition (SVD) of a real\n\
+  *  M-by-N matrix A, optionally computing the left and right singular\n\
+  *  vectors.  If singular vectors are desired, it uses a\n\
+  *  divide-and-conquer algorithm.\n\
+  *\n\
+  *  The SVD is written\n\
+  *\n\
+  *       A = U * SIGMA * transpose(V)\n\
+  *\n\
+  *  where SIGMA is an M-by-N matrix which is zero except for its\n\
+  *  min(m,n) diagonal elements, U is an M-by-M orthogonal matrix, and\n\
+  *  V is an N-by-N orthogonal matrix.  The diagonal elements of SIGMA\n\
+  *  are the singular values of A; they are real and non-negative, and\n\
+  *  are returned in descending order.  The first min(m,n) columns of\n\
+  *  U and V are the left and right singular vectors of A.\n\
+  *\n\
+  *  Note that the routine returns VT = V**T, not V.\n\
+  *\n\
+  *  The divide and conquer algorithm makes very mild assumptions about\n\
+  *  floating point arithmetic. It will work on machines with a guard\n\
+  *  digit in add/subtract, or on those binary machines without guard\n\
+  *  digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or\n\
+  *  Cray-2. It could conceivably fail on hexadecimal or decimal machines\n\
+  *  without guard digits, but we know of none.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  JOBZ    (input) CHARACTER*1\n\
+  *          Specifies options for computing all or part of the matrix U:\n\
+  *          = 'A':  all M columns of U and all N rows of V**T are\n\
+  *                  returned in the arrays U and VT;\n\
+  *          = 'S':  the first min(M,N) columns of U and the first\n\
+  *                  min(M,N) rows of V**T are returned in the arrays U\n\
+  *                  and VT;\n\
+  *          = 'O':  If M >= N, the first N columns of U are overwritten\n\
+  *                  on the array A and all rows of V**T are returned in\n\
+  *                  the array VT;\n\
+  *                  otherwise, all columns of U are returned in the\n\
+  *                  array U and the first M rows of V**T are overwritten\n\
+  *                  in the array A;\n\
+  *          = 'N':  no columns of U or rows of V**T are computed.\n\
+  *\n\
+  *  M       (input) INTEGER\n\
+  *          The number of rows of the input matrix A.  M >= 0.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The number of columns of the input matrix A.  N >= 0.\n\
+  *\n\
+  *  A       (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n\
+  *          On entry, the M-by-N matrix A.\n\
+  *          On exit,\n\
+  *          if JOBZ = 'O',  A is overwritten with the first N columns\n\
+  *                          of U (the left singular vectors, stored\n\
+  *                          columnwise) if M >= N;\n\
+  *                          A is overwritten with the first M rows\n\
+  *                          of V**T (the right singular vectors, stored\n\
+  *                          rowwise) otherwise.\n\
+  *          if JOBZ .ne. 'O', the contents of A are destroyed.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,M).\n\
+  *\n\
+  *  S       (output) DOUBLE PRECISION array, dimension (min(M,N))\n\
+  *          The singular values of A, sorted so that S(i) >= S(i+1).\n\
+  *\n\
+  *  U       (output) DOUBLE PRECISION array, dimension (LDU,UCOL)\n\
+  *          UCOL = M if JOBZ = 'A' or JOBZ = 'O' and M < N;\n\
+  *          UCOL = min(M,N) if JOBZ = 'S'.\n\
+  *          If JOBZ = 'A' or JOBZ = 'O' and M < N, U contains the M-by-M\n\
+  *          orthogonal matrix U;\n\
+  *          if JOBZ = 'S', U contains the first min(M,N) columns of U\n\
+  *          (the left singular vectors, stored columnwise);\n\
+  *          if JOBZ = 'O' and M >= N, or JOBZ = 'N', U is not referenced.\n\
+  *\n\
+  *  LDU     (input) INTEGER\n\
+  *          The leading dimension of the array U.  LDU >= 1; if\n\
+  *          JOBZ = 'S' or 'A' or JOBZ = 'O' and M < N, LDU >= M.\n\
+  *\n\
+  *  VT      (output) DOUBLE PRECISION array, dimension (LDVT,N)\n\
+  *          If JOBZ = 'A' or JOBZ = 'O' and M >= N, VT contains the\n\
+  *          N-by-N orthogonal matrix V**T;\n\
+  *          if JOBZ = 'S', VT contains the first min(M,N) rows of\n\
+  *          V**T (the right singular vectors, stored rowwise);\n\
+  *          if JOBZ = 'O' and M < N, or JOBZ = 'N', VT is not referenced.\n\
+  *\n\
+  *  LDVT    (input) INTEGER\n\
+  *          The leading dimension of the array VT.  LDVT >= 1; if\n\
+  *          JOBZ = 'A' or JOBZ = 'O' and M >= N, LDVT >= N;\n\
+  *          if JOBZ = 'S', LDVT >= min(M,N).\n\
+  *\n\
+  *  WORK    (workspace/output) DOUBLE PRECISION array, dimension (MAX(1,LWORK))\n\
+  *          On exit, if INFO = 0, WORK(1) returns the optimal LWORK;\n\
+  *\n\
+  *  LWORK   (input) INTEGER\n\
+  *          The dimension of the array WORK. LWORK >= 1.\n\
+  *          If JOBZ = 'N',\n\
+  *            LWORK >= 3*min(M,N) + max(max(M,N),7*min(M,N)).\n\
+  *          If JOBZ = 'O',\n\
+  *            LWORK >= 3*min(M,N) + \n\
+  *                     max(max(M,N),5*min(M,N)*min(M,N)+4*min(M,N)).\n\
+  *          If JOBZ = 'S' or 'A'\n\
+  *            LWORK >= 3*min(M,N) +\n\
+  *                     max(max(M,N),4*min(M,N)*min(M,N)+4*min(M,N)).\n\
+  *          For good performance, LWORK should generally be larger.\n\
+  *          If LWORK = -1 but other input arguments are legal, WORK(1)\n\
+  *          returns the optimal LWORK.\n\
+  *\n\
+  *  IWORK   (workspace) INTEGER array, dimension (8*min(M,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:  DBDSDC did not converge, updating process failed.\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  Based on contributions by\n\
+  *     Ming Gu and Huan Ren, Computer Science Division, University of\n\
+  *     California at Berkeley, USA\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/dgesv

@@ -0,0 +1,97 @@
+--- 
+:name: dgesv
+:md5sum: 8ab66d02ed18d053ba3faf7a6a1d1ad2
+:category: :subroutine
+:arguments: 
+- n: 
+    :type: integer
+    :intent: input
+- nrhs: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- ipiv: 
+    :type: integer
+    :intent: output
+    :dims: 
+    - n
+- b: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE DGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  DGESV computes the solution to a real system of linear equations\n\
+  *     A * X = B,\n\
+  *  where A is an N-by-N matrix and X and B are N-by-NRHS matrices.\n\
+  *\n\
+  *  The LU decomposition with partial pivoting and row interchanges is\n\
+  *  used to factor A as\n\
+  *     A = P * L * U,\n\
+  *  where P is a permutation matrix, L is unit lower triangular, and U is\n\
+  *  upper triangular.  The factored form of A is then used to solve the\n\
+  *  system of equations A * X = B.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\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) DOUBLE PRECISION array, dimension (LDA,N)\n\
+  *          On entry, the N-by-N coefficient matrix A.\n\
+  *          On exit, the factors L and U from the factorization\n\
+  *          A = P*L*U; the unit diagonal elements of L are not stored.\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\
+  *          The pivot indices that define the permutation matrix P;\n\
+  *          row i of the matrix was interchanged with row IPIV(i).\n\
+  *\n\
+  *  B       (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS)\n\
+  *          On entry, the N-by-NRHS matrix of 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\
+  *  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, U(i,i) is exactly zero.  The factorization\n\
+  *                has been completed, but the factor U is exactly\n\
+  *                singular, so the solution could not be computed.\n\
+  *\n\n\
+  *  =====================================================================\n\
+  *\n\
+  *     .. External Subroutines ..\n      EXTERNAL           DGETRF, DGETRS, XERBLA\n\
+  *     ..\n\
+  *     .. Intrinsic Functions ..\n      INTRINSIC          MAX\n\
+  *     ..\n"