ruby-lapack 1.3

data/dev/defs/ssbtrd

@@ -0,0 +1,132 @@
+--- 
+:name: ssbtrd
+:md5sum: 4d2b2c94a4720f12c22cbd1420997ff4
+:category: :subroutine
+:arguments: 
+- vect: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- kd: 
+    :type: integer
+    :intent: input
+- ab: 
+    :type: real
+    :intent: input/output
+    :dims: 
+    - ldab
+    - n
+- ldab: 
+    :type: integer
+    :intent: input
+- d: 
+    :type: real
+    :intent: output
+    :dims: 
+    - n
+- e: 
+    :type: real
+    :intent: output
+    :dims: 
+    - n-1
+- q: 
+    :type: real
+    :intent: input/output
+    :dims: 
+    - ldq
+    - n
+- ldq: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: real
+    :intent: workspace
+    :dims: 
+    - n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE SSBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ, WORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  SSBTRD reduces a real symmetric band matrix A to symmetric\n\
+  *  tridiagonal form T by an orthogonal similarity transformation:\n\
+  *  Q**T * A * Q = T.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  VECT    (input) CHARACTER*1\n\
+  *          = 'N':  do not form Q;\n\
+  *          = 'V':  form Q;\n\
+  *          = 'U':  update a matrix X, by forming X*Q.\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\
+  *  KD      (input) INTEGER\n\
+  *          The number of superdiagonals of the matrix A if UPLO = 'U',\n\
+  *          or the number of subdiagonals if UPLO = 'L'.  KD >= 0.\n\
+  *\n\
+  *  AB      (input/output) REAL array, dimension (LDAB,N)\n\
+  *          On entry, the upper or lower triangle of the symmetric band\n\
+  *          matrix A, stored in the first KD+1 rows of the array.  The\n\
+  *          j-th column of A is stored in the j-th column of the array AB\n\
+  *          as follows:\n\
+  *          if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for max(1,j-kd)<=i<=j;\n\
+  *          if UPLO = 'L', AB(1+i-j,j)    = A(i,j) for j<=i<=min(n,j+kd).\n\
+  *          On exit, the diagonal elements of AB are overwritten by the\n\
+  *          diagonal elements of the tridiagonal matrix T; if KD > 0, the\n\
+  *          elements on the first superdiagonal (if UPLO = 'U') or the\n\
+  *          first subdiagonal (if UPLO = 'L') are overwritten by the\n\
+  *          off-diagonal elements of T; the rest of AB is overwritten by\n\
+  *          values generated during the reduction.\n\
+  *\n\
+  *  LDAB    (input) INTEGER\n\
+  *          The leading dimension of the array AB.  LDAB >= KD+1.\n\
+  *\n\
+  *  D       (output) REAL array, dimension (N)\n\
+  *          The diagonal elements of the tridiagonal matrix T.\n\
+  *\n\
+  *  E       (output) REAL array, dimension (N-1)\n\
+  *          The off-diagonal elements of the tridiagonal matrix T:\n\
+  *          E(i) = T(i,i+1) if UPLO = 'U'; E(i) = T(i+1,i) if UPLO = 'L'.\n\
+  *\n\
+  *  Q       (input/output) REAL array, dimension (LDQ,N)\n\
+  *          On entry, if VECT = 'U', then Q must contain an N-by-N\n\
+  *          matrix X; if VECT = 'N' or 'V', then Q need not be set.\n\
+  *\n\
+  *          On exit:\n\
+  *          if VECT = 'V', Q contains the N-by-N orthogonal matrix Q;\n\
+  *          if VECT = 'U', Q contains the product X*Q;\n\
+  *          if VECT = 'N', the array Q is not referenced.\n\
+  *\n\
+  *  LDQ     (input) INTEGER\n\
+  *          The leading dimension of the array Q.\n\
+  *          LDQ >= 1, and LDQ >= N if VECT = 'V' or 'U'.\n\
+  *\n\
+  *  WORK    (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\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  Modified by Linda Kaufman, Bell Labs.\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/ssfrk

@@ -0,0 +1,134 @@
+--- 
+:name: ssfrk
+:md5sum: 5b5f4cafc518b82b9b7304e9cd5c0721
+:category: :subroutine
+:arguments: 
+- transr: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- trans: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- k: 
+    :type: integer
+    :intent: input
+- alpha: 
+    :type: real
+    :intent: input
+- a: 
+    :type: real
+    :intent: input
+    :dims: 
+    - lda
+    - "(lsame_(&trans,\"N\") || lsame_(&trans,\"n\")) ? k : n"
+- lda: 
+    :type: integer
+    :intent: input
+- beta: 
+    :type: real
+    :intent: input
+- c: 
+    :type: real
+    :intent: input/output
+    :dims: 
+    - nt
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE SSFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, C )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  Level 3 BLAS like routine for C in RFP Format.\n\
+  *\n\
+  *  SSFRK performs one of the symmetric rank--k operations\n\
+  *\n\
+  *     C := alpha*A*A' + beta*C,\n\
+  *\n\
+  *  or\n\
+  *\n\
+  *     C := alpha*A'*A + beta*C,\n\
+  *\n\
+  *  where alpha and beta are real scalars, C is an n--by--n symmetric\n\
+  *  matrix and A is an n--by--k matrix in the first case and a k--by--n\n\
+  *  matrix in the second case.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  ==========\n\
+  *\n\
+  *  TRANSR   (input) CHARACTER*1\n\
+  *          = 'N':  The Normal Form of RFP A is stored;\n\
+  *          = 'T':  The Transpose Form of RFP A is stored.\n\
+  *\n\
+  *  UPLO     (input) CHARACTER*1\n\
+  *           On  entry, UPLO specifies whether the upper or lower\n\
+  *           triangular part of the array C is to be referenced as\n\
+  *           follows:\n\
+  *\n\
+  *              UPLO = 'U' or 'u'   Only the upper triangular part of C\n\
+  *                                  is to be referenced.\n\
+  *\n\
+  *              UPLO = 'L' or 'l'   Only the lower triangular part of C\n\
+  *                                  is to be referenced.\n\
+  *\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  TRANS    (input) CHARACTER*1\n\
+  *           On entry, TRANS specifies the operation to be performed as\n\
+  *           follows:\n\
+  *\n\
+  *              TRANS = 'N' or 'n'   C := alpha*A*A' + beta*C.\n\
+  *\n\
+  *              TRANS = 'T' or 't'   C := alpha*A'*A + beta*C.\n\
+  *\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *           On entry, N specifies the order of the matrix C. N must be\n\
+  *           at least zero.\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  K       (input) INTEGER\n\
+  *           On entry with TRANS = 'N' or 'n', K specifies the number\n\
+  *           of  columns of the matrix A, and on entry with TRANS = 'T'\n\
+  *           or 't', K specifies the number of rows of the matrix A. K\n\
+  *           must be at least zero.\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  ALPHA   (input) REAL\n\
+  *           On entry, ALPHA specifies the scalar alpha.\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  A       (input) REAL array of DIMENSION (LDA,ka)\n\
+  *           where KA\n\
+  *           is K  when TRANS = 'N' or 'n', and is N otherwise. Before\n\
+  *           entry with TRANS = 'N' or 'n', the leading N--by--K part of\n\
+  *           the array A must contain the matrix A, otherwise the leading\n\
+  *           K--by--N part of the array A must contain the matrix A.\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *           On entry, LDA specifies the first dimension of A as declared\n\
+  *           in  the  calling  (sub)  program.   When  TRANS = 'N' or 'n'\n\
+  *           then  LDA must be at least  max( 1, n ), otherwise  LDA must\n\
+  *           be at least  max( 1, k ).\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *  BETA    (input) REAL\n\
+  *           On entry, BETA specifies the scalar beta.\n\
+  *           Unchanged on exit.\n\
+  *\n\
+  *\n\
+  *  C       (input/output) REAL array, dimension (NT)\n\
+  *           NT = N*(N+1)/2. On entry, the symmetric matrix C in RFP\n\
+  *           Format. RFP Format is described by TRANSR, UPLO and N.\n\
+  *\n\
+  *  Arguments\n\
+  *  ==========\n\
+  *\n\
+  *     ..\n"

data/dev/defs/sspcon

@@ -0,0 +1,92 @@
+--- 
+:name: sspcon
+:md5sum: be9e7176a45065d4328b9ed8b007eba9
+:category: :subroutine
+:arguments: 
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- ap: 
+    :type: real
+    :intent: input
+    :dims: 
+    - n*(n+1)/2
+- ipiv: 
+    :type: integer
+    :intent: input
+    :dims: 
+    - n
+- anorm: 
+    :type: real
+    :intent: input
+- rcond: 
+    :type: real
+    :intent: output
+- work: 
+    :type: real
+    :intent: workspace
+    :dims: 
+    - 2*n
+- iwork: 
+    :type: integer
+    :intent: workspace
+    :dims: 
+    - n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE SSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, IWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  SSPCON estimates the reciprocal of the condition number (in the\n\
+  *  1-norm) of a real symmetric packed matrix A using the factorization\n\
+  *  A = U*D*U**T or A = L*D*L**T computed by SSPTRF.\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\
+  *          Specifies whether the details of the factorization are stored\n\
+  *          as an upper or lower triangular matrix.\n\
+  *          = 'U':  Upper triangular, form is A = U*D*U**T;\n\
+  *          = 'L':  Lower triangular, form is A = L*D*L**T.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the matrix A.  N >= 0.\n\
+  *\n\
+  *  AP      (input) REAL array, dimension (N*(N+1)/2)\n\
+  *          The block diagonal matrix D and the multipliers used to\n\
+  *          obtain the factor U or L as computed by SSPTRF, stored as a\n\
+  *          packed triangular matrix.\n\
+  *\n\
+  *  IPIV    (input) INTEGER array, dimension (N)\n\
+  *          Details of the interchanges and the block structure of D\n\
+  *          as determined by SSPTRF.\n\
+  *\n\
+  *  ANORM   (input) REAL\n\
+  *          The 1-norm of the original 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) REAL array, dimension (2*N)\n\
+  *\n\
+  *  IWORK    (workspace) INTEGER 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/sspev

@@ -0,0 +1,103 @@
+--- 
+:name: sspev
+:md5sum: 190815c126e8cc58da7d9d497f9d0050
+:category: :subroutine
+:arguments: 
+- jobz: 
+    :type: char
+    :intent: input
+- uplo: 
+    :type: char
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- ap: 
+    :type: real
+    :intent: input/output
+    :dims: 
+    - ldap
+- w: 
+    :type: real
+    :intent: output
+    :dims: 
+    - n
+- z: 
+    :type: real
+    :intent: output
+    :dims: 
+    - ldz
+    - n
+- ldz: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: real
+    :intent: workspace
+    :dims: 
+    - 3*n
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  ldz: "lsame_(&jobz,\"V\") ? MAX(1,n) : 1"
+  n: ((int)sqrtf(ldap*8+1.0f)-1)/2
+:fortran_help: "      SUBROUTINE SSPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  SSPEV computes all the eigenvalues and, optionally, eigenvectors of a\n\
+  *  real symmetric matrix A in packed storage.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  JOBZ    (input) CHARACTER*1\n\
+  *          = 'N':  Compute eigenvalues only;\n\
+  *          = 'V':  Compute eigenvalues and eigenvectors.\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\
+  *  AP      (input/output) REAL array, dimension (N*(N+1)/2)\n\
+  *          On entry, the upper or lower triangle of the symmetric matrix\n\
+  *          A, packed columnwise in a linear array.  The j-th column of A\n\
+  *          is stored in the array AP as follows:\n\
+  *          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;\n\
+  *          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n.\n\
+  *\n\
+  *          On exit, AP is overwritten by values generated during the\n\
+  *          reduction to tridiagonal form.  If UPLO = 'U', the diagonal\n\
+  *          and first superdiagonal of the tridiagonal matrix T overwrite\n\
+  *          the corresponding elements of A, and if UPLO = 'L', the\n\
+  *          diagonal and first subdiagonal of T overwrite the\n\
+  *          corresponding elements of A.\n\
+  *\n\
+  *  W       (output) REAL array, dimension (N)\n\
+  *          If INFO = 0, the eigenvalues in ascending order.\n\
+  *\n\
+  *  Z       (output) REAL array, dimension (LDZ, N)\n\
+  *          If JOBZ = 'V', then if INFO = 0, Z contains the orthonormal\n\
+  *          eigenvectors of the matrix A, with the i-th column of Z\n\
+  *          holding the eigenvector associated with W(i).\n\
+  *          If JOBZ = 'N', then Z is not referenced.\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) REAL array, dimension (3*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, the algorithm failed to converge; i\n\
+  *                off-diagonal elements of an intermediate tridiagonal\n\
+  *                form did not converge to zero.\n\
+  *\n\n\
+  *  =====================================================================\n\
+  *\n"