ruby-lapack 1.3

data/dev/defs/cpftri

@@ -0,0 +1,175 @@
+--- 
+:name: cpftri
+:md5sum: 628346e3f91d7dfc0bb02666b752fd84
+:category: :subroutine
+:arguments: 
+- transr: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: complex
+    :intent: input/output
+    :dims: 
+    - n*(n+1)/2
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE CPFTRI( TRANSR, UPLO, N, A, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  CPFTRI computes the inverse of a complex Hermitian positive definite\n\
+  *  matrix A using the Cholesky factorization A = U**H*U or A = L*L**H\n\
+  *  computed by CPFTRF.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  TRANSR    (input) CHARACTER*1\n\
+  *          = 'N':  The Normal TRANSR of RFP A is stored;\n\
+  *          = 'C':  The Conjugate-transpose TRANSR of RFP A is stored.\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\
+  *  A       (input/output) COMPLEX array, dimension ( N*(N+1)/2 );\n\
+  *          On entry, the Hermitian matrix A in RFP format. RFP format is\n\
+  *          described by TRANSR, UPLO, and N as follows: If TRANSR = 'N'\n\
+  *          then RFP A is (0:N,0:k-1) when N is even; k=N/2. RFP A is\n\
+  *          (0:N-1,0:k) when N is odd; k=N/2. IF TRANSR = 'C' then RFP is\n\
+  *          the Conjugate-transpose of RFP A as defined when\n\
+  *          TRANSR = 'N'. The contents of RFP A are defined by UPLO as\n\
+  *          follows: If UPLO = 'U' the RFP A contains the nt elements of\n\
+  *          upper packed A. If UPLO = 'L' the RFP A contains the elements\n\
+  *          of lower packed A. The LDA of RFP A is (N+1)/2 when TRANSR =\n\
+  *          'C'. When TRANSR is 'N' the LDA is N+1 when N is even and N\n\
+  *          is odd. See the Note below for more details.\n\
+  *\n\
+  *          On exit, the Hermitian inverse of the original matrix, in the\n\
+  *          same storage format.\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, the (i,i) element of the factor U or L is\n\
+  *                zero, and the inverse could not be computed.\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  We first consider Standard Packed Format when N is even.\n\
+  *  We give an example where N = 6.\n\
+  *\n\
+  *      AP is Upper             AP is Lower\n\
+  *\n\
+  *   00 01 02 03 04 05       00\n\
+  *      11 12 13 14 15       10 11\n\
+  *         22 23 24 25       20 21 22\n\
+  *            33 34 35       30 31 32 33\n\
+  *               44 45       40 41 42 43 44\n\
+  *                  55       50 51 52 53 54 55\n\
+  *\n\
+  *\n\
+  *  Let TRANSR = 'N'. RFP holds AP as follows:\n\
+  *  For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last\n\
+  *  three columns of AP upper. The lower triangle A(4:6,0:2) consists of\n\
+  *  conjugate-transpose of the first three columns of AP upper.\n\
+  *  For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first\n\
+  *  three columns of AP lower. The upper triangle A(0:2,0:2) consists of\n\
+  *  conjugate-transpose of the last three columns of AP lower.\n\
+  *  To denote conjugate we place -- above the element. This covers the\n\
+  *  case N even and TRANSR = 'N'.\n\
+  *\n\
+  *         RFP A                   RFP A\n\
+  *\n\
+  *                                -- -- --\n\
+  *        03 04 05                33 43 53\n\
+  *                                   -- --\n\
+  *        13 14 15                00 44 54\n\
+  *                                      --\n\
+  *        23 24 25                10 11 55\n\
+  *\n\
+  *        33 34 35                20 21 22\n\
+  *        --\n\
+  *        00 44 45                30 31 32\n\
+  *        -- --\n\
+  *        01 11 55                40 41 42\n\
+  *        -- -- --\n\
+  *        02 12 22                50 51 52\n\
+  *\n\
+  *  Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate-\n\
+  *  transpose of RFP A above. One therefore gets:\n\
+  *\n\
+  *\n\
+  *           RFP A                   RFP A\n\
+  *\n\
+  *     -- -- -- --                -- -- -- -- -- --\n\
+  *     03 13 23 33 00 01 02    33 00 10 20 30 40 50\n\
+  *     -- -- -- -- --                -- -- -- -- --\n\
+  *     04 14 24 34 44 11 12    43 44 11 21 31 41 51\n\
+  *     -- -- -- -- -- --                -- -- -- --\n\
+  *     05 15 25 35 45 55 22    53 54 55 22 32 42 52\n\
+  *\n\
+  *\n\
+  *  We next  consider Standard Packed Format when N is odd.\n\
+  *  We give an example where N = 5.\n\
+  *\n\
+  *     AP is Upper                 AP is Lower\n\
+  *\n\
+  *   00 01 02 03 04              00\n\
+  *      11 12 13 14              10 11\n\
+  *         22 23 24              20 21 22\n\
+  *            33 34              30 31 32 33\n\
+  *               44              40 41 42 43 44\n\
+  *\n\
+  *\n\
+  *  Let TRANSR = 'N'. RFP holds AP as follows:\n\
+  *  For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last\n\
+  *  three columns of AP upper. The lower triangle A(3:4,0:1) consists of\n\
+  *  conjugate-transpose of the first two   columns of AP upper.\n\
+  *  For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first\n\
+  *  three columns of AP lower. The upper triangle A(0:1,1:2) consists of\n\
+  *  conjugate-transpose of the last two   columns of AP lower.\n\
+  *  To denote conjugate we place -- above the element. This covers the\n\
+  *  case N odd  and TRANSR = 'N'.\n\
+  *\n\
+  *         RFP A                   RFP A\n\
+  *\n\
+  *                                   -- --\n\
+  *        02 03 04                00 33 43\n\
+  *                                      --\n\
+  *        12 13 14                10 11 44\n\
+  *\n\
+  *        22 23 24                20 21 22\n\
+  *        --\n\
+  *        00 33 34                30 31 32\n\
+  *        -- --\n\
+  *        01 11 44                40 41 42\n\
+  *\n\
+  *  Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate-\n\
+  *  transpose of RFP A above. One therefore gets:\n\
+  *\n\
+  *\n\
+  *           RFP A                   RFP A\n\
+  *\n\
+  *     -- -- --                   -- -- -- -- -- --\n\
+  *     02 12 22 00 01             00 10 20 30 40 50\n\
+  *     -- -- -- --                   -- -- -- -- --\n\
+  *     03 13 23 33 11             33 11 21 31 41 51\n\
+  *     -- -- -- -- --                   -- -- -- --\n\
+  *     04 14 24 34 44             43 44 22 32 42 52\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/cpftrs

@@ -0,0 +1,185 @@
+--- 
+:name: cpftrs
+:md5sum: ccd62c87dcf766b816524a7c639bb28b
+:category: :subroutine
+:arguments: 
+- transr: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- nrhs: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: complex
+    :intent: input
+    :dims: 
+    - n*(n+1)/2
+- b: 
+    :type: complex
+    :intent: input/output
+    :dims: 
+    - ldb
+    - nrhs
+- ldb: 
+    :type: integer
+    :intent: input
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE CPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  CPFTRS solves a system of linear equations A*X = B with a Hermitian\n\
+  *  positive definite matrix A using the Cholesky factorization\n\
+  *  A = U**H*U or A = L*L**H computed by CPFTRF.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  TRANSR    (input) CHARACTER*1\n\
+  *          = 'N':  The Normal TRANSR of RFP A is stored;\n\
+  *          = 'C':  The Conjugate-transpose TRANSR of RFP A is stored.\n\
+  *\n\
+  *  UPLO    (input) CHARACTER*1\n\
+  *          = 'U':  Upper triangle of RFP A is stored;\n\
+  *          = 'L':  Lower triangle of RFP 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 matrix B.  NRHS >= 0.\n\
+  *\n\
+  *  A       (input) COMPLEX array, dimension ( N*(N+1)/2 );\n\
+  *          The triangular factor U or L from the Cholesky factorization\n\
+  *          of RFP A = U**H*U or RFP A = L*L**H, as computed by CPFTRF.\n\
+  *          See note below for more details about RFP A.\n\
+  *\n\
+  *  B       (input/output) COMPLEX array, dimension (LDB,NRHS)\n\
+  *          On entry, the right hand side matrix B.\n\
+  *          On exit, the 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\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  We first consider Standard Packed Format when N is even.\n\
+  *  We give an example where N = 6.\n\
+  *\n\
+  *      AP is Upper             AP is Lower\n\
+  *\n\
+  *   00 01 02 03 04 05       00\n\
+  *      11 12 13 14 15       10 11\n\
+  *         22 23 24 25       20 21 22\n\
+  *            33 34 35       30 31 32 33\n\
+  *               44 45       40 41 42 43 44\n\
+  *                  55       50 51 52 53 54 55\n\
+  *\n\
+  *\n\
+  *  Let TRANSR = 'N'. RFP holds AP as follows:\n\
+  *  For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last\n\
+  *  three columns of AP upper. The lower triangle A(4:6,0:2) consists of\n\
+  *  conjugate-transpose of the first three columns of AP upper.\n\
+  *  For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first\n\
+  *  three columns of AP lower. The upper triangle A(0:2,0:2) consists of\n\
+  *  conjugate-transpose of the last three columns of AP lower.\n\
+  *  To denote conjugate we place -- above the element. This covers the\n\
+  *  case N even and TRANSR = 'N'.\n\
+  *\n\
+  *         RFP A                   RFP A\n\
+  *\n\
+  *                                -- -- --\n\
+  *        03 04 05                33 43 53\n\
+  *                                   -- --\n\
+  *        13 14 15                00 44 54\n\
+  *                                      --\n\
+  *        23 24 25                10 11 55\n\
+  *\n\
+  *        33 34 35                20 21 22\n\
+  *        --\n\
+  *        00 44 45                30 31 32\n\
+  *        -- --\n\
+  *        01 11 55                40 41 42\n\
+  *        -- -- --\n\
+  *        02 12 22                50 51 52\n\
+  *\n\
+  *  Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate-\n\
+  *  transpose of RFP A above. One therefore gets:\n\
+  *\n\
+  *\n\
+  *           RFP A                   RFP A\n\
+  *\n\
+  *     -- -- -- --                -- -- -- -- -- --\n\
+  *     03 13 23 33 00 01 02    33 00 10 20 30 40 50\n\
+  *     -- -- -- -- --                -- -- -- -- --\n\
+  *     04 14 24 34 44 11 12    43 44 11 21 31 41 51\n\
+  *     -- -- -- -- -- --                -- -- -- --\n\
+  *     05 15 25 35 45 55 22    53 54 55 22 32 42 52\n\
+  *\n\
+  *\n\
+  *  We next  consider Standard Packed Format when N is odd.\n\
+  *  We give an example where N = 5.\n\
+  *\n\
+  *     AP is Upper                 AP is Lower\n\
+  *\n\
+  *   00 01 02 03 04              00\n\
+  *      11 12 13 14              10 11\n\
+  *         22 23 24              20 21 22\n\
+  *            33 34              30 31 32 33\n\
+  *               44              40 41 42 43 44\n\
+  *\n\
+  *\n\
+  *  Let TRANSR = 'N'. RFP holds AP as follows:\n\
+  *  For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last\n\
+  *  three columns of AP upper. The lower triangle A(3:4,0:1) consists of\n\
+  *  conjugate-transpose of the first two   columns of AP upper.\n\
+  *  For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first\n\
+  *  three columns of AP lower. The upper triangle A(0:1,1:2) consists of\n\
+  *  conjugate-transpose of the last two   columns of AP lower.\n\
+  *  To denote conjugate we place -- above the element. This covers the\n\
+  *  case N odd  and TRANSR = 'N'.\n\
+  *\n\
+  *         RFP A                   RFP A\n\
+  *\n\
+  *                                   -- --\n\
+  *        02 03 04                00 33 43\n\
+  *                                      --\n\
+  *        12 13 14                10 11 44\n\
+  *\n\
+  *        22 23 24                20 21 22\n\
+  *        --\n\
+  *        00 33 34                30 31 32\n\
+  *        -- --\n\
+  *        01 11 44                40 41 42\n\
+  *\n\
+  *  Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate-\n\
+  *  transpose of RFP A above. One therefore gets:\n\
+  *\n\
+  *\n\
+  *           RFP A                   RFP A\n\
+  *\n\
+  *     -- -- --                   -- -- -- -- -- --\n\
+  *     02 12 22 00 01             00 10 20 30 40 50\n\
+  *     -- -- -- --                   -- -- -- -- --\n\
+  *     03 13 23 33 11             33 11 21 31 41 51\n\
+  *     -- -- -- -- --                   -- -- -- --\n\
+  *     04 14 24 34 44             43 44 22 32 42 52\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/cpocon

@@ -0,0 +1,87 @@
+--- 
+:name: cpocon
+:md5sum: 0582d260e85edffd69e2b598d76d7f02
+:category: :subroutine
+:arguments: 
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: complex
+    :intent: input
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- anorm: 
+    :type: real
+    :intent: input
+- rcond: 
+    :type: real
+    :intent: output
+- work: 
+    :type: complex
+    :intent: workspace
+    :dims: 
+    - 2*n
+- rwork: 
+    :type: real
+    :intent: workspace
+    :dims: 
+    - n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE CPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, RWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  CPOCON estimates the reciprocal of the condition number (in the\n\
+  *  1-norm) of a complex Hermitian positive definite matrix using the\n\
+  *  Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF.\n\
+  *\n\
+  *  An estimate is obtained for norm(inv(A)), and the reciprocal of the\n\
+  *  condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).\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\
+  *  A       (input) COMPLEX array, dimension (LDA,N)\n\
+  *          The triangular factor U or L from the Cholesky factorization\n\
+  *          A = U**H*U or A = L*L**H, as computed by CPOTRF.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *  ANORM   (input) REAL\n\
+  *          The 1-norm (or infinity-norm) of the Hermitian matrix A.\n\
+  *\n\
+  *  RCOND   (output) REAL\n\
+  *          The reciprocal of the condition number of the matrix A,\n\
+  *          computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an\n\
+  *          estimate of the 1-norm of inv(A) computed in this routine.\n\
+  *\n\
+  *  WORK    (workspace) COMPLEX array, dimension (2*N)\n\
+  *\n\
+  *  RWORK   (workspace) REAL 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\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/cpoequ

@@ -0,0 +1,80 @@
+--- 
+:name: cpoequ
+:md5sum: 682ec464ccfd2c44926755219357888c
+:category: :subroutine
+:arguments: 
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: complex
+    :intent: input
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- s: 
+    :type: real
+    :intent: output
+    :dims: 
+    - n
+- scond: 
+    :type: real
+    :intent: output
+- amax: 
+    :type: real
+    :intent: output
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE CPOEQU( N, A, LDA, S, SCOND, AMAX, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  CPOEQU computes row and column scalings intended to equilibrate a\n\
+  *  Hermitian positive definite matrix A and reduce its condition number\n\
+  *  (with respect to the two-norm).  S contains the scale factors,\n\
+  *  S(i) = 1/sqrt(A(i,i)), chosen so that the scaled matrix B with\n\
+  *  elements B(i,j) = S(i)*A(i,j)*S(j) has ones on the diagonal.  This\n\
+  *  choice of S puts the condition number of B within a factor N of the\n\
+  *  smallest possible condition number over all possible diagonal\n\
+  *  scalings.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix A.  N >= 0.\n\
+  *\n\
+  *  A       (input) COMPLEX array, dimension (LDA,N)\n\
+  *          The N-by-N Hermitian positive definite matrix whose scaling\n\
+  *          factors are to be computed.  Only the diagonal elements of A\n\
+  *          are referenced.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A.  LDA >= max(1,N).\n\
+  *\n\
+  *  S       (output) REAL array, dimension (N)\n\
+  *          If INFO = 0, S contains the scale factors for A.\n\
+  *\n\
+  *  SCOND   (output) REAL\n\
+  *          If INFO = 0, S contains the ratio of the smallest S(i) to\n\
+  *          the largest S(i).  If SCOND >= 0.1 and AMAX is neither too\n\
+  *          large nor too small, it is not worth scaling by S.\n\
+  *\n\
+  *  AMAX    (output) REAL\n\
+  *          Absolute value of largest matrix element.  If AMAX is very\n\
+  *          close to overflow or very close to underflow, the matrix\n\
+  *          should be scaled.\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, the i-th diagonal element is nonpositive.\n\
+  *\n\n\
+  *  =====================================================================\n\
+  *\n"