ruby-lapack 1.7 → 1.7.1

data/ext/claed7.c

@@ -0,0 +1,247 @@
+#include "rb_lapack.h"
+
+extern VOID claed7_(integer* n, integer* cutpnt, integer* qsiz, integer* tlvls, integer* curlvl, integer* curpbm, real* d, complex* q, integer* ldq, real* rho, integer* indxq, real* qstore, integer* qptr, integer* prmptr, integer* perm, integer* givptr, integer* givcol, real* givnum, complex* work, real* rwork, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_claed7(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_cutpnt;
+  integer cutpnt; 
+  VALUE rblapack_qsiz;
+  integer qsiz; 
+  VALUE rblapack_tlvls;
+  integer tlvls; 
+  VALUE rblapack_curlvl;
+  integer curlvl; 
+  VALUE rblapack_curpbm;
+  integer curpbm; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_q;
+  complex *q; 
+  VALUE rblapack_rho;
+  real rho; 
+  VALUE rblapack_qstore;
+  real *qstore; 
+  VALUE rblapack_qptr;
+  integer *qptr; 
+  VALUE rblapack_prmptr;
+  integer *prmptr; 
+  VALUE rblapack_perm;
+  integer *perm; 
+  VALUE rblapack_givptr;
+  integer *givptr; 
+  VALUE rblapack_givcol;
+  integer *givcol; 
+  VALUE rblapack_givnum;
+  real *givnum; 
+  VALUE rblapack_indxq;
+  integer *indxq; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_q_out__;
+  complex *q_out__;
+  VALUE rblapack_qstore_out__;
+  real *qstore_out__;
+  VALUE rblapack_qptr_out__;
+  integer *qptr_out__;
+  complex *work;
+  real *rwork;
+  integer *iwork;
+
+  integer n;
+  integer ldq;
+
+  VALUE rblapack_options;
+  if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
+    argc--;
+    rblapack_options = argv[argc];
+    if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
+      printf("%s\n", "USAGE:\n  indxq, info, d, q, qstore, qptr = NumRu::Lapack.claed7( cutpnt, qsiz, tlvls, curlvl, curpbm, d, q, rho, qstore, qptr, prmptr, perm, givptr, givcol, givnum, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, LDQ, RHO, INDXQ, QSTORE, QPTR, PRMPTR, PERM, GIVPTR, GIVCOL, GIVNUM, WORK, RWORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLAED7 computes the updated eigensystem of a diagonal\n*  matrix after modification by a rank-one symmetric matrix. This\n*  routine is used only for the eigenproblem which requires all\n*  eigenvalues and optionally eigenvectors of a dense or banded\n*  Hermitian matrix that has been reduced to tridiagonal form.\n*\n*    T = Q(in) ( D(in) + RHO * Z*Z' ) Q'(in) = Q(out) * D(out) * Q'(out)\n*\n*    where Z = Q'u, u is a vector of length N with ones in the\n*    CUTPNT and CUTPNT + 1 th elements and zeros elsewhere.\n*\n*     The eigenvectors of the original matrix are stored in Q, and the\n*     eigenvalues are in D.  The algorithm consists of three stages:\n*\n*        The first stage consists of deflating the size of the problem\n*        when there are multiple eigenvalues or if there is a zero in\n*        the Z vector.  For each such occurence the dimension of the\n*        secular equation problem is reduced by one.  This stage is\n*        performed by the routine SLAED2.\n*\n*        The second stage consists of calculating the updated\n*        eigenvalues. This is done by finding the roots of the secular\n*        equation via the routine SLAED4 (as called by SLAED3).\n*        This routine also calculates the eigenvectors of the current\n*        problem.\n*\n*        The final stage consists of computing the updated eigenvectors\n*        directly using the updated eigenvalues.  The eigenvectors for\n*        the current problem are multiplied with the eigenvectors from\n*        the overall problem.\n*\n\n*  Arguments\n*  =========\n*\n*  N      (input) INTEGER\n*         The dimension of the symmetric tridiagonal matrix.  N >= 0.\n*\n*  CUTPNT (input) INTEGER\n*         Contains the location of the last eigenvalue in the leading\n*         sub-matrix.  min(1,N) <= CUTPNT <= N.\n*\n*  QSIZ   (input) INTEGER\n*         The dimension of the unitary matrix used to reduce\n*         the full matrix to tridiagonal form.  QSIZ >= N.\n*\n*  TLVLS  (input) INTEGER\n*         The total number of merging levels in the overall divide and\n*         conquer tree.\n*\n*  CURLVL (input) INTEGER\n*         The current level in the overall merge routine,\n*         0 <= curlvl <= tlvls.\n*\n*  CURPBM (input) INTEGER\n*         The current problem in the current level in the overall\n*         merge routine (counting from upper left to lower right).\n*\n*  D      (input/output) REAL array, dimension (N)\n*         On entry, the eigenvalues of the rank-1-perturbed matrix.\n*         On exit, the eigenvalues of the repaired matrix.\n*\n*  Q      (input/output) COMPLEX array, dimension (LDQ,N)\n*         On entry, the eigenvectors of the rank-1-perturbed matrix.\n*         On exit, the eigenvectors of the repaired tridiagonal matrix.\n*\n*  LDQ    (input) INTEGER\n*         The leading dimension of the array Q.  LDQ >= max(1,N).\n*\n*  RHO    (input) REAL\n*         Contains the subdiagonal element used to create the rank-1\n*         modification.\n*\n*  INDXQ  (output) INTEGER array, dimension (N)\n*         This contains the permutation which will reintegrate the\n*         subproblem just solved back into sorted order,\n*         ie. D( INDXQ( I = 1, N ) ) will be in ascending order.\n*\n*  IWORK  (workspace) INTEGER array, dimension (4*N)\n*\n*  RWORK  (workspace) REAL array,\n*                                 dimension (3*N+2*QSIZ*N)\n*\n*  WORK   (workspace) COMPLEX array, dimension (QSIZ*N)\n*\n*  QSTORE (input/output) REAL array, dimension (N**2+1)\n*         Stores eigenvectors of submatrices encountered during\n*         divide and conquer, packed together. QPTR points to\n*         beginning of the submatrices.\n*\n*  QPTR   (input/output) INTEGER array, dimension (N+2)\n*         List of indices pointing to beginning of submatrices stored\n*         in QSTORE. The submatrices are numbered starting at the\n*         bottom left of the divide and conquer tree, from left to\n*         right and bottom to top.\n*\n*  PRMPTR (input) INTEGER array, dimension (N lg N)\n*         Contains a list of pointers which indicate where in PERM a\n*         level's permutation is stored.  PRMPTR(i+1) - PRMPTR(i)\n*         indicates the size of the permutation and also the size of\n*         the full, non-deflated problem.\n*\n*  PERM   (input) INTEGER array, dimension (N lg N)\n*         Contains the permutations (from deflation and sorting) to be\n*         applied to each eigenblock.\n*\n*  GIVPTR (input) INTEGER array, dimension (N lg N)\n*         Contains a list of pointers which indicate where in GIVCOL a\n*         level's Givens rotations are stored.  GIVPTR(i+1) - GIVPTR(i)\n*         indicates the number of Givens rotations.\n*\n*  GIVCOL (input) INTEGER array, dimension (2, N lg N)\n*         Each pair of numbers indicates a pair of columns to take place\n*         in a Givens rotation.\n*\n*  GIVNUM (input) REAL array, dimension (2, N lg N)\n*         Each number indicates the S value to be used in the\n*         corresponding Givens rotation.\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 = 1, an eigenvalue did not converge\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            COLTYP, CURR, I, IDLMDA, INDX,\n     $                   INDXC, INDXP, IQ, IW, IZ, K, N1, N2, PTR\n*     ..\n*     .. External Subroutines ..\n      EXTERNAL           CLACRM, CLAED8, SLAED9, SLAEDA, SLAMRG, XERBLA\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          MAX, MIN\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  indxq, info, d, q, qstore, qptr = NumRu::Lapack.claed7( cutpnt, qsiz, tlvls, curlvl, curpbm, d, q, rho, qstore, qptr, prmptr, perm, givptr, givcol, givnum, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 15 && argc != 15)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 15)", argc);
+  rblapack_cutpnt = argv[0];
+  rblapack_qsiz = argv[1];
+  rblapack_tlvls = argv[2];
+  rblapack_curlvl = argv[3];
+  rblapack_curpbm = argv[4];
+  rblapack_d = argv[5];
+  rblapack_q = argv[6];
+  rblapack_rho = argv[7];
+  rblapack_qstore = argv[8];
+  rblapack_qptr = argv[9];
+  rblapack_prmptr = argv[10];
+  rblapack_perm = argv[11];
+  rblapack_givptr = argv[12];
+  rblapack_givcol = argv[13];
+  rblapack_givnum = argv[14];
+  if (argc == 15) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  cutpnt = NUM2INT(rblapack_cutpnt);
+  tlvls = NUM2INT(rblapack_tlvls);
+  curpbm = NUM2INT(rblapack_curpbm);
+  if (!NA_IsNArray(rblapack_q))
+    rb_raise(rb_eArgError, "q (7th argument) must be NArray");
+  if (NA_RANK(rblapack_q) != 2)
+    rb_raise(rb_eArgError, "rank of q (7th argument) must be %d", 2);
+  ldq = NA_SHAPE0(rblapack_q);
+  n = NA_SHAPE1(rblapack_q);
+  if (NA_TYPE(rblapack_q) != NA_SCOMPLEX)
+    rblapack_q = na_change_type(rblapack_q, NA_SCOMPLEX);
+  q = NA_PTR_TYPE(rblapack_q, complex*);
+  qsiz = NUM2INT(rblapack_qsiz);
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (6th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_d) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of d must be the same as shape 1 of q");
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  if (!NA_IsNArray(rblapack_qstore))
+    rb_raise(rb_eArgError, "qstore (9th argument) must be NArray");
+  if (NA_RANK(rblapack_qstore) != 1)
+    rb_raise(rb_eArgError, "rank of qstore (9th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_qstore) != (pow(n,2)+1))
+    rb_raise(rb_eRuntimeError, "shape 0 of qstore must be %d", pow(n,2)+1);
+  if (NA_TYPE(rblapack_qstore) != NA_SFLOAT)
+    rblapack_qstore = na_change_type(rblapack_qstore, NA_SFLOAT);
+  qstore = NA_PTR_TYPE(rblapack_qstore, real*);
+  if (!NA_IsNArray(rblapack_prmptr))
+    rb_raise(rb_eArgError, "prmptr (11th argument) must be NArray");
+  if (NA_RANK(rblapack_prmptr) != 1)
+    rb_raise(rb_eArgError, "rank of prmptr (11th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_prmptr) != (n*LG(n)))
+    rb_raise(rb_eRuntimeError, "shape 0 of prmptr must be %d", n*LG(n));
+  if (NA_TYPE(rblapack_prmptr) != NA_LINT)
+    rblapack_prmptr = na_change_type(rblapack_prmptr, NA_LINT);
+  prmptr = NA_PTR_TYPE(rblapack_prmptr, integer*);
+  if (!NA_IsNArray(rblapack_givptr))
+    rb_raise(rb_eArgError, "givptr (13th argument) must be NArray");
+  if (NA_RANK(rblapack_givptr) != 1)
+    rb_raise(rb_eArgError, "rank of givptr (13th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_givptr) != (n*LG(n)))
+    rb_raise(rb_eRuntimeError, "shape 0 of givptr must be %d", n*LG(n));
+  if (NA_TYPE(rblapack_givptr) != NA_LINT)
+    rblapack_givptr = na_change_type(rblapack_givptr, NA_LINT);
+  givptr = NA_PTR_TYPE(rblapack_givptr, integer*);
+  if (!NA_IsNArray(rblapack_givnum))
+    rb_raise(rb_eArgError, "givnum (15th argument) must be NArray");
+  if (NA_RANK(rblapack_givnum) != 2)
+    rb_raise(rb_eArgError, "rank of givnum (15th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_givnum) != (2))
+    rb_raise(rb_eRuntimeError, "shape 0 of givnum must be %d", 2);
+  if (NA_SHAPE1(rblapack_givnum) != (n*LG(n)))
+    rb_raise(rb_eRuntimeError, "shape 1 of givnum must be %d", n*LG(n));
+  if (NA_TYPE(rblapack_givnum) != NA_SFLOAT)
+    rblapack_givnum = na_change_type(rblapack_givnum, NA_SFLOAT);
+  givnum = NA_PTR_TYPE(rblapack_givnum, real*);
+  curlvl = NUM2INT(rblapack_curlvl);
+  if (!NA_IsNArray(rblapack_qptr))
+    rb_raise(rb_eArgError, "qptr (10th argument) must be NArray");
+  if (NA_RANK(rblapack_qptr) != 1)
+    rb_raise(rb_eArgError, "rank of qptr (10th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_qptr) != (n+2))
+    rb_raise(rb_eRuntimeError, "shape 0 of qptr must be %d", n+2);
+  if (NA_TYPE(rblapack_qptr) != NA_LINT)
+    rblapack_qptr = na_change_type(rblapack_qptr, NA_LINT);
+  qptr = NA_PTR_TYPE(rblapack_qptr, integer*);
+  if (!NA_IsNArray(rblapack_givcol))
+    rb_raise(rb_eArgError, "givcol (14th argument) must be NArray");
+  if (NA_RANK(rblapack_givcol) != 2)
+    rb_raise(rb_eArgError, "rank of givcol (14th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_givcol) != (2))
+    rb_raise(rb_eRuntimeError, "shape 0 of givcol must be %d", 2);
+  if (NA_SHAPE1(rblapack_givcol) != (n*LG(n)))
+    rb_raise(rb_eRuntimeError, "shape 1 of givcol must be %d", n*LG(n));
+  if (NA_TYPE(rblapack_givcol) != NA_LINT)
+    rblapack_givcol = na_change_type(rblapack_givcol, NA_LINT);
+  givcol = NA_PTR_TYPE(rblapack_givcol, integer*);
+  rho = (real)NUM2DBL(rblapack_rho);
+  if (!NA_IsNArray(rblapack_perm))
+    rb_raise(rb_eArgError, "perm (12th argument) must be NArray");
+  if (NA_RANK(rblapack_perm) != 1)
+    rb_raise(rb_eArgError, "rank of perm (12th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_perm) != (n*LG(n)))
+    rb_raise(rb_eRuntimeError, "shape 0 of perm must be %d", n*LG(n));
+  if (NA_TYPE(rblapack_perm) != NA_LINT)
+    rblapack_perm = na_change_type(rblapack_perm, NA_LINT);
+  perm = NA_PTR_TYPE(rblapack_perm, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_indxq = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  indxq = NA_PTR_TYPE(rblapack_indxq, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_d_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  d_out__ = NA_PTR_TYPE(rblapack_d_out__, real*);
+  MEMCPY(d_out__, d, real, NA_TOTAL(rblapack_d));
+  rblapack_d = rblapack_d_out__;
+  d = d_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldq;
+    shape[1] = n;
+    rblapack_q_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  q_out__ = NA_PTR_TYPE(rblapack_q_out__, complex*);
+  MEMCPY(q_out__, q, complex, NA_TOTAL(rblapack_q));
+  rblapack_q = rblapack_q_out__;
+  q = q_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = pow(n,2)+1;
+    rblapack_qstore_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  qstore_out__ = NA_PTR_TYPE(rblapack_qstore_out__, real*);
+  MEMCPY(qstore_out__, qstore, real, NA_TOTAL(rblapack_qstore));
+  rblapack_qstore = rblapack_qstore_out__;
+  qstore = qstore_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n+2;
+    rblapack_qptr_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  qptr_out__ = NA_PTR_TYPE(rblapack_qptr_out__, integer*);
+  MEMCPY(qptr_out__, qptr, integer, NA_TOTAL(rblapack_qptr));
+  rblapack_qptr = rblapack_qptr_out__;
+  qptr = qptr_out__;
+  work = ALLOC_N(complex, (qsiz*n));
+  rwork = ALLOC_N(real, (3*n+2*qsiz*n));
+  iwork = ALLOC_N(integer, (4*n));
+
+  claed7_(&n, &cutpnt, &qsiz, &tlvls, &curlvl, &curpbm, d, q, &ldq, &rho, indxq, qstore, qptr, prmptr, perm, givptr, givcol, givnum, work, rwork, iwork, &info);
+
+  free(work);
+  free(rwork);
+  free(iwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(6, rblapack_indxq, rblapack_info, rblapack_d, rblapack_q, rblapack_qstore, rblapack_qptr);
+}
+
+void
+init_lapack_claed7(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claed7", rblapack_claed7, -1);
+}

data/ext/claed8.c

@@ -0,0 +1,198 @@
+#include "rb_lapack.h"
+
+extern VOID claed8_(integer* k, integer* n, integer* qsiz, complex* q, integer* ldq, real* d, real* rho, integer* cutpnt, real* z, real* dlamda, complex* q2, integer* ldq2, real* w, integer* indxp, integer* indx, integer* indxq, integer* perm, integer* givptr, integer* givcol, real* givnum, integer* info);
+
+
+static VALUE
+rblapack_claed8(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_qsiz;
+  integer qsiz; 
+  VALUE rblapack_q;
+  complex *q; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_rho;
+  real rho; 
+  VALUE rblapack_cutpnt;
+  integer cutpnt; 
+  VALUE rblapack_z;
+  real *z; 
+  VALUE rblapack_indxq;
+  integer *indxq; 
+  VALUE rblapack_k;
+  integer k; 
+  VALUE rblapack_dlamda;
+  real *dlamda; 
+  VALUE rblapack_q2;
+  complex *q2; 
+  VALUE rblapack_w;
+  real *w; 
+  VALUE rblapack_perm;
+  integer *perm; 
+  VALUE rblapack_givptr;
+  integer givptr; 
+  VALUE rblapack_givcol;
+  integer *givcol; 
+  VALUE rblapack_givnum;
+  real *givnum; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_q_out__;
+  complex *q_out__;
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  integer *indxp;
+  integer *indx;
+
+  integer ldq;
+  integer n;
+  integer ldq2;
+
+  VALUE rblapack_options;
+  if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
+    argc--;
+    rblapack_options = argv[argc];
+    if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
+      printf("%s\n", "USAGE:\n  k, dlamda, q2, w, perm, givptr, givcol, givnum, info, q, d, rho = NumRu::Lapack.claed8( qsiz, q, d, rho, cutpnt, z, indxq, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAED8( K, N, QSIZ, Q, LDQ, D, RHO, CUTPNT, Z, DLAMDA, Q2, LDQ2, W, INDXP, INDX, INDXQ, PERM, GIVPTR, GIVCOL, GIVNUM, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLAED8 merges the two sets of eigenvalues together into a single\n*  sorted set.  Then it tries to deflate the size of the problem.\n*  There are two ways in which deflation can occur:  when two or more\n*  eigenvalues are close together or if there is a tiny element in the\n*  Z vector.  For each such occurrence the order of the related secular\n*  equation problem is reduced by one.\n*\n\n*  Arguments\n*  =========\n*\n*  K      (output) INTEGER\n*         Contains the number of non-deflated eigenvalues.\n*         This is the order of the related secular equation.\n*\n*  N      (input) INTEGER\n*         The dimension of the symmetric tridiagonal matrix.  N >= 0.\n*\n*  QSIZ   (input) INTEGER\n*         The dimension of the unitary matrix used to reduce\n*         the dense or band matrix to tridiagonal form.\n*         QSIZ >= N if ICOMPQ = 1.\n*\n*  Q      (input/output) COMPLEX array, dimension (LDQ,N)\n*         On entry, Q contains the eigenvectors of the partially solved\n*         system which has been previously updated in matrix\n*         multiplies with other partially solved eigensystems.\n*         On exit, Q contains the trailing (N-K) updated eigenvectors\n*         (those which were deflated) in its last N-K columns.\n*\n*  LDQ    (input) INTEGER\n*         The leading dimension of the array Q.  LDQ >= max( 1, N ).\n*\n*  D      (input/output) REAL array, dimension (N)\n*         On entry, D contains the eigenvalues of the two submatrices to\n*         be combined.  On exit, D contains the trailing (N-K) updated\n*         eigenvalues (those which were deflated) sorted into increasing\n*         order.\n*\n*  RHO    (input/output) REAL\n*         Contains the off diagonal element associated with the rank-1\n*         cut which originally split the two submatrices which are now\n*         being recombined. RHO is modified during the computation to\n*         the value required by SLAED3.\n*\n*  CUTPNT (input) INTEGER\n*         Contains the location of the last eigenvalue in the leading\n*         sub-matrix.  MIN(1,N) <= CUTPNT <= N.\n*\n*  Z      (input) REAL array, dimension (N)\n*         On input this vector contains the updating vector (the last\n*         row of the first sub-eigenvector matrix and the first row of\n*         the second sub-eigenvector matrix).  The contents of Z are\n*         destroyed during the updating process.\n*\n*  DLAMDA (output) REAL array, dimension (N)\n*         Contains a copy of the first K eigenvalues which will be used\n*         by SLAED3 to form the secular equation.\n*\n*  Q2     (output) COMPLEX array, dimension (LDQ2,N)\n*         If ICOMPQ = 0, Q2 is not referenced.  Otherwise,\n*         Contains a copy of the first K eigenvectors which will be used\n*         by SLAED7 in a matrix multiply (SGEMM) to update the new\n*         eigenvectors.\n*\n*  LDQ2   (input) INTEGER\n*         The leading dimension of the array Q2.  LDQ2 >= max( 1, N ).\n*\n*  W      (output) REAL array, dimension (N)\n*         This will hold the first k values of the final\n*         deflation-altered z-vector and will be passed to SLAED3.\n*\n*  INDXP  (workspace) INTEGER array, dimension (N)\n*         This will contain the permutation used to place deflated\n*         values of D at the end of the array. On output INDXP(1:K)\n*         points to the nondeflated D-values and INDXP(K+1:N)\n*         points to the deflated eigenvalues.\n*\n*  INDX   (workspace) INTEGER array, dimension (N)\n*         This will contain the permutation used to sort the contents of\n*         D into ascending order.\n*\n*  INDXQ  (input) INTEGER array, dimension (N)\n*         This contains the permutation which separately sorts the two\n*         sub-problems in D into ascending order.  Note that elements in\n*         the second half of this permutation must first have CUTPNT\n*         added to their values in order to be accurate.\n*\n*  PERM   (output) INTEGER array, dimension (N)\n*         Contains the permutations (from deflation and sorting) to be\n*         applied to each eigenblock.\n*\n*  GIVPTR (output) INTEGER\n*         Contains the number of Givens rotations which took place in\n*         this subproblem.\n*\n*  GIVCOL (output) INTEGER array, dimension (2, N)\n*         Each pair of numbers indicates a pair of columns to take place\n*         in a Givens rotation.\n*\n*  GIVNUM (output) REAL array, dimension (2, N)\n*         Each number indicates the S value to be used in the\n*         corresponding Givens rotation.\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\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  k, dlamda, q2, w, perm, givptr, givcol, givnum, info, q, d, rho = NumRu::Lapack.claed8( qsiz, q, d, rho, cutpnt, z, indxq, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 7 && argc != 7)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 7)", argc);
+  rblapack_qsiz = argv[0];
+  rblapack_q = argv[1];
+  rblapack_d = argv[2];
+  rblapack_rho = argv[3];
+  rblapack_cutpnt = argv[4];
+  rblapack_z = argv[5];
+  rblapack_indxq = argv[6];
+  if (argc == 7) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  qsiz = NUM2INT(rblapack_qsiz);
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (3th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (3th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_d);
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  cutpnt = NUM2INT(rblapack_cutpnt);
+  if (!NA_IsNArray(rblapack_indxq))
+    rb_raise(rb_eArgError, "indxq (7th argument) must be NArray");
+  if (NA_RANK(rblapack_indxq) != 1)
+    rb_raise(rb_eArgError, "rank of indxq (7th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_indxq) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of indxq must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_indxq) != NA_LINT)
+    rblapack_indxq = na_change_type(rblapack_indxq, NA_LINT);
+  indxq = NA_PTR_TYPE(rblapack_indxq, integer*);
+  if (!NA_IsNArray(rblapack_q))
+    rb_raise(rb_eArgError, "q (2th argument) must be NArray");
+  if (NA_RANK(rblapack_q) != 2)
+    rb_raise(rb_eArgError, "rank of q (2th argument) must be %d", 2);
+  ldq = NA_SHAPE0(rblapack_q);
+  if (NA_SHAPE1(rblapack_q) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of q must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_q) != NA_SCOMPLEX)
+    rblapack_q = na_change_type(rblapack_q, NA_SCOMPLEX);
+  q = NA_PTR_TYPE(rblapack_q, complex*);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (6th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 1)
+    rb_raise(rb_eArgError, "rank of z (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_z) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of z must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_z) != NA_SFLOAT)
+    rblapack_z = na_change_type(rblapack_z, NA_SFLOAT);
+  z = NA_PTR_TYPE(rblapack_z, real*);
+  rho = (real)NUM2DBL(rblapack_rho);
+  ldq2 = MAX( 1, n );
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_dlamda = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  dlamda = NA_PTR_TYPE(rblapack_dlamda, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldq2;
+    shape[1] = n;
+    rblapack_q2 = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  q2 = NA_PTR_TYPE(rblapack_q2, complex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_w = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  w = NA_PTR_TYPE(rblapack_w, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_perm = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  perm = NA_PTR_TYPE(rblapack_perm, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = 2;
+    shape[1] = n;
+    rblapack_givcol = na_make_object(NA_LINT, 2, shape, cNArray);
+  }
+  givcol = NA_PTR_TYPE(rblapack_givcol, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = 2;
+    shape[1] = n;
+    rblapack_givnum = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  givnum = NA_PTR_TYPE(rblapack_givnum, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldq;
+    shape[1] = n;
+    rblapack_q_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  q_out__ = NA_PTR_TYPE(rblapack_q_out__, complex*);
+  MEMCPY(q_out__, q, complex, NA_TOTAL(rblapack_q));
+  rblapack_q = rblapack_q_out__;
+  q = q_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_d_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  d_out__ = NA_PTR_TYPE(rblapack_d_out__, real*);
+  MEMCPY(d_out__, d, real, NA_TOTAL(rblapack_d));
+  rblapack_d = rblapack_d_out__;
+  d = d_out__;
+  indxp = ALLOC_N(integer, (n));
+  indx = ALLOC_N(integer, (n));
+
+  claed8_(&k, &n, &qsiz, q, &ldq, d, &rho, &cutpnt, z, dlamda, q2, &ldq2, w, indxp, indx, indxq, perm, &givptr, givcol, givnum, &info);
+
+  free(indxp);
+  free(indx);
+  rblapack_k = INT2NUM(k);
+  rblapack_givptr = INT2NUM(givptr);
+  rblapack_info = INT2NUM(info);
+  rblapack_rho = rb_float_new((double)rho);
+  return rb_ary_new3(12, rblapack_k, rblapack_dlamda, rblapack_q2, rblapack_w, rblapack_perm, rblapack_givptr, rblapack_givcol, rblapack_givnum, rblapack_info, rblapack_q, rblapack_d, rblapack_rho);
+}
+
+void
+init_lapack_claed8(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claed8", rblapack_claed8, -1);
+}

data/ext/claein.c

@@ -0,0 +1,113 @@
+#include "rb_lapack.h"
+
+extern VOID claein_(logical* rightv, logical* noinit, integer* n, complex* h, integer* ldh, complex* w, complex* v, complex* b, integer* ldb, real* rwork, real* eps3, real* smlnum, integer* info);
+
+
+static VALUE
+rblapack_claein(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_rightv;
+  logical rightv; 
+  VALUE rblapack_noinit;
+  logical noinit; 
+  VALUE rblapack_h;
+  complex *h; 
+  VALUE rblapack_w;
+  complex w; 
+  VALUE rblapack_v;
+  complex *v; 
+  VALUE rblapack_eps3;
+  real eps3; 
+  VALUE rblapack_smlnum;
+  real smlnum; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_v_out__;
+  complex *v_out__;
+  complex *b;
+  real *rwork;
+
+  integer ldh;
+  integer n;
+  integer ldb;
+
+  VALUE rblapack_options;
+  if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
+    argc--;
+    rblapack_options = argv[argc];
+    if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, v = NumRu::Lapack.claein( rightv, noinit, h, w, v, eps3, smlnum, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAEIN( RIGHTV, NOINIT, N, H, LDH, W, V, B, LDB, RWORK, EPS3, SMLNUM, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLAEIN uses inverse iteration to find a right or left eigenvector\n*  corresponding to the eigenvalue W of a complex upper Hessenberg\n*  matrix H.\n*\n\n*  Arguments\n*  =========\n*\n*  RIGHTV   (input) LOGICAL\n*          = .TRUE. : compute right eigenvector;\n*          = .FALSE.: compute left eigenvector.\n*\n*  NOINIT   (input) LOGICAL\n*          = .TRUE. : no initial vector supplied in V\n*          = .FALSE.: initial vector supplied in V.\n*\n*  N       (input) INTEGER\n*          The order of the matrix H.  N >= 0.\n*\n*  H       (input) COMPLEX array, dimension (LDH,N)\n*          The upper Hessenberg matrix H.\n*\n*  LDH     (input) INTEGER\n*          The leading dimension of the array H.  LDH >= max(1,N).\n*\n*  W       (input) COMPLEX\n*          The eigenvalue of H whose corresponding right or left\n*          eigenvector is to be computed.\n*\n*  V       (input/output) COMPLEX array, dimension (N)\n*          On entry, if NOINIT = .FALSE., V must contain a starting\n*          vector for inverse iteration; otherwise V need not be set.\n*          On exit, V contains the computed eigenvector, normalized so\n*          that the component of largest magnitude has magnitude 1; here\n*          the magnitude of a complex number (x,y) is taken to be\n*          |x| + |y|.\n*\n*  B       (workspace) COMPLEX array, dimension (LDB,N)\n*\n*  LDB     (input) INTEGER\n*          The leading dimension of the array B.  LDB >= max(1,N).\n*\n*  RWORK   (workspace) REAL array, dimension (N)\n*\n*  EPS3    (input) REAL\n*          A small machine-dependent value which is used to perturb\n*          close eigenvalues, and to replace zero pivots.\n*\n*  SMLNUM  (input) REAL\n*          A machine-dependent value close to the underflow threshold.\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*          = 1:  inverse iteration did not converge; V is set to the\n*                last iterate.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, v = NumRu::Lapack.claein( rightv, noinit, h, w, v, eps3, smlnum, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 7 && argc != 7)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 7)", argc);
+  rblapack_rightv = argv[0];
+  rblapack_noinit = argv[1];
+  rblapack_h = argv[2];
+  rblapack_w = argv[3];
+  rblapack_v = argv[4];
+  rblapack_eps3 = argv[5];
+  rblapack_smlnum = argv[6];
+  if (argc == 7) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  rightv = (rblapack_rightv == Qtrue);
+  if (!NA_IsNArray(rblapack_h))
+    rb_raise(rb_eArgError, "h (3th argument) must be NArray");
+  if (NA_RANK(rblapack_h) != 2)
+    rb_raise(rb_eArgError, "rank of h (3th argument) must be %d", 2);
+  ldh = NA_SHAPE0(rblapack_h);
+  n = NA_SHAPE1(rblapack_h);
+  if (NA_TYPE(rblapack_h) != NA_SCOMPLEX)
+    rblapack_h = na_change_type(rblapack_h, NA_SCOMPLEX);
+  h = NA_PTR_TYPE(rblapack_h, complex*);
+  if (!NA_IsNArray(rblapack_v))
+    rb_raise(rb_eArgError, "v (5th argument) must be NArray");
+  if (NA_RANK(rblapack_v) != 1)
+    rb_raise(rb_eArgError, "rank of v (5th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_v) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of v must be the same as shape 1 of h");
+  if (NA_TYPE(rblapack_v) != NA_SCOMPLEX)
+    rblapack_v = na_change_type(rblapack_v, NA_SCOMPLEX);
+  v = NA_PTR_TYPE(rblapack_v, complex*);
+  smlnum = (real)NUM2DBL(rblapack_smlnum);
+  noinit = (rblapack_noinit == Qtrue);
+  eps3 = (real)NUM2DBL(rblapack_eps3);
+  w.r = (real)NUM2DBL(rb_funcall(rblapack_w, rb_intern("real"), 0));
+  w.i = (real)NUM2DBL(rb_funcall(rblapack_w, rb_intern("imag"), 0));
+  ldb = MAX(1,n);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_v_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  v_out__ = NA_PTR_TYPE(rblapack_v_out__, complex*);
+  MEMCPY(v_out__, v, complex, NA_TOTAL(rblapack_v));
+  rblapack_v = rblapack_v_out__;
+  v = v_out__;
+  b = ALLOC_N(complex, (ldb)*(n));
+  rwork = ALLOC_N(real, (n));
+
+  claein_(&rightv, &noinit, &n, h, &ldh, &w, v, b, &ldb, rwork, &eps3, &smlnum, &info);
+
+  free(b);
+  free(rwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(2, rblapack_info, rblapack_v);
+}
+
+void
+init_lapack_claein(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claein", rblapack_claein, -1);
+}