ruby-lapack 1.7 → 1.7.1

data/ext/slarrc.c

@@ -0,0 +1,96 @@
+#include "rb_lapack.h"
+
+extern VOID slarrc_(char* jobt, integer* n, real* vl, real* vu, real* d, real* e, real* pivmin, integer* eigcnt, integer* lcnt, integer* rcnt, integer* info);
+
+
+static VALUE
+rblapack_slarrc(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_jobt;
+  char jobt; 
+  VALUE rblapack_vl;
+  real vl; 
+  VALUE rblapack_vu;
+  real vu; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_e;
+  real *e; 
+  VALUE rblapack_pivmin;
+  real pivmin; 
+  VALUE rblapack_eigcnt;
+  integer eigcnt; 
+  VALUE rblapack_lcnt;
+  integer lcnt; 
+  VALUE rblapack_rcnt;
+  integer rcnt; 
+  VALUE rblapack_info;
+  integer info; 
+
+  integer n;
+
+  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  eigcnt, lcnt, rcnt, info = NumRu::Lapack.slarrc( jobt, vl, vu, d, e, pivmin, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLARRC( JOBT, N, VL, VU, D, E, PIVMIN, EIGCNT, LCNT, RCNT, INFO )\n\n*  Purpose\n*  =======\n*\n*  Find the number of eigenvalues of the symmetric tridiagonal matrix T\n*  that are in the interval (VL,VU] if JOBT = 'T', and of L D L^T\n*  if JOBT = 'L'.\n*\n\n*  Arguments\n*  =========\n*\n*  JOBT    (input) CHARACTER*1\n*          = 'T':  Compute Sturm count for matrix T.\n*          = 'L':  Compute Sturm count for matrix L D L^T.\n*\n*  N       (input) INTEGER\n*          The order of the matrix. N > 0.\n*\n*  VL      (input) DOUBLE PRECISION\n*  VU      (input) DOUBLE PRECISION\n*          The lower and upper bounds for the eigenvalues.\n*\n*  D       (input) DOUBLE PRECISION array, dimension (N)\n*          JOBT = 'T': The N diagonal elements of the tridiagonal matrix T.\n*          JOBT = 'L': The N diagonal elements of the diagonal matrix D.\n*\n*  E       (input) DOUBLE PRECISION array, dimension (N)\n*          JOBT = 'T': The N-1 offdiagonal elements of the matrix T.\n*          JOBT = 'L': The N-1 offdiagonal elements of the matrix L.\n*\n*  PIVMIN  (input) REAL\n*          The minimum pivot in the Sturm sequence for T.\n*\n*  EIGCNT  (output) INTEGER\n*          The number of eigenvalues of the symmetric tridiagonal matrix T\n*          that are in the interval (VL,VU]\n*\n*  LCNT    (output) INTEGER\n*  RCNT    (output) INTEGER\n*          The left and right negcounts of the interval.\n*\n*  INFO    (output) INTEGER\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*     Beresford Parlett, University of California, Berkeley, USA\n*     Jim Demmel, University of California, Berkeley, USA\n*     Inderjit Dhillon, University of Texas, Austin, USA\n*     Osni Marques, LBNL/NERSC, USA\n*     Christof Voemel, University of California, Berkeley, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  eigcnt, lcnt, rcnt, info = NumRu::Lapack.slarrc( jobt, vl, vu, d, e, pivmin, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 6 && argc != 6)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 6)", argc);
+  rblapack_jobt = argv[0];
+  rblapack_vl = argv[1];
+  rblapack_vu = argv[2];
+  rblapack_d = argv[3];
+  rblapack_e = argv[4];
+  rblapack_pivmin = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  jobt = StringValueCStr(rblapack_jobt)[0];
+  vu = (real)NUM2DBL(rblapack_vu);
+  if (!NA_IsNArray(rblapack_e))
+    rb_raise(rb_eArgError, "e (5th argument) must be NArray");
+  if (NA_RANK(rblapack_e) != 1)
+    rb_raise(rb_eArgError, "rank of e (5th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_e);
+  if (NA_TYPE(rblapack_e) != NA_SFLOAT)
+    rblapack_e = na_change_type(rblapack_e, NA_SFLOAT);
+  e = NA_PTR_TYPE(rblapack_e, real*);
+  vl = (real)NUM2DBL(rblapack_vl);
+  pivmin = (real)NUM2DBL(rblapack_pivmin);
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (4th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (4th 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 0 of e");
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+
+  slarrc_(&jobt, &n, &vl, &vu, d, e, &pivmin, &eigcnt, &lcnt, &rcnt, &info);
+
+  rblapack_eigcnt = INT2NUM(eigcnt);
+  rblapack_lcnt = INT2NUM(lcnt);
+  rblapack_rcnt = INT2NUM(rcnt);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(4, rblapack_eigcnt, rblapack_lcnt, rblapack_rcnt, rblapack_info);
+}
+
+void
+init_lapack_slarrc(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slarrc", rblapack_slarrc, -1);
+}

data/ext/slarrd.c

@@ -0,0 +1,190 @@
+#include "rb_lapack.h"
+
+extern VOID slarrd_(char* range, char* order, integer* n, real* vl, real* vu, integer* il, integer* iu, real* gers, real* reltol, real* d, real* e, real* e2, real* pivmin, integer* nsplit, integer* isplit, integer* m, real* w, real* werr, real* wl, real* wu, integer* iblock, integer* indexw, real* work, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_slarrd(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_range;
+  char range; 
+  VALUE rblapack_order;
+  char order; 
+  VALUE rblapack_vl;
+  real vl; 
+  VALUE rblapack_vu;
+  real vu; 
+  VALUE rblapack_il;
+  integer il; 
+  VALUE rblapack_iu;
+  integer iu; 
+  VALUE rblapack_gers;
+  real *gers; 
+  VALUE rblapack_reltol;
+  real reltol; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_e;
+  real *e; 
+  VALUE rblapack_e2;
+  real *e2; 
+  VALUE rblapack_pivmin;
+  real pivmin; 
+  VALUE rblapack_nsplit;
+  integer nsplit; 
+  VALUE rblapack_isplit;
+  integer *isplit; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_w;
+  real *w; 
+  VALUE rblapack_werr;
+  real *werr; 
+  VALUE rblapack_wl;
+  real wl; 
+  VALUE rblapack_wu;
+  real wu; 
+  VALUE rblapack_iblock;
+  integer *iblock; 
+  VALUE rblapack_indexw;
+  integer *indexw; 
+  VALUE rblapack_info;
+  integer info; 
+  real *work;
+  integer *iwork;
+
+  integer n;
+
+  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  m, w, werr, wl, wu, iblock, indexw, info = NumRu::Lapack.slarrd( range, order, vl, vu, il, iu, gers, reltol, d, e, e2, pivmin, nsplit, isplit, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLARRD( RANGE, ORDER, N, VL, VU, IL, IU, GERS, RELTOL, D, E, E2, PIVMIN, NSPLIT, ISPLIT, M, W, WERR, WL, WU, IBLOCK, INDEXW, WORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SLARRD computes the eigenvalues of a symmetric tridiagonal\n*  matrix T to suitable accuracy. This is an auxiliary code to be\n*  called from SSTEMR.\n*  The user may ask for all eigenvalues, all eigenvalues\n*  in the half-open interval (VL, VU], or the IL-th through IU-th\n*  eigenvalues.\n*\n*  To avoid overflow, the matrix must be scaled so that its\n*  largest element is no greater than overflow**(1/2) *\n*  underflow**(1/4) in absolute value, and for greatest\n*  accuracy, it should not be much smaller than that.\n*\n*  See W. Kahan \"Accurate Eigenvalues of a Symmetric Tridiagonal\n*  Matrix\", Report CS41, Computer Science Dept., Stanford\n*  University, July 21, 1966.\n*\n\n*  Arguments\n*  =========\n*\n*  RANGE   (input) CHARACTER*1\n*          = 'A': (\"All\")   all eigenvalues will be found.\n*          = 'V': (\"Value\") all eigenvalues in the half-open interval\n*                           (VL, VU] will be found.\n*          = 'I': (\"Index\") the IL-th through IU-th eigenvalues (of the\n*                           entire matrix) will be found.\n*\n*  ORDER   (input) CHARACTER*1\n*          = 'B': (\"By Block\") the eigenvalues will be grouped by\n*                              split-off block (see IBLOCK, ISPLIT) and\n*                              ordered from smallest to largest within\n*                              the block.\n*          = 'E': (\"Entire matrix\")\n*                              the eigenvalues for the entire matrix\n*                              will be ordered from smallest to\n*                              largest.\n*\n*  N       (input) INTEGER\n*          The order of the tridiagonal matrix T.  N >= 0.\n*\n*  VL      (input) REAL            \n*  VU      (input) REAL            \n*          If RANGE='V', the lower and upper bounds of the interval to\n*          be searched for eigenvalues.  Eigenvalues less than or equal\n*          to VL, or greater than VU, will not be returned.  VL < VU.\n*          Not referenced if RANGE = 'A' or 'I'.\n*\n*  IL      (input) INTEGER\n*  IU      (input) INTEGER\n*          If RANGE='I', the indices (in ascending order) of the\n*          smallest and largest eigenvalues to be returned.\n*          1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0.\n*          Not referenced if RANGE = 'A' or 'V'.\n*\n*  GERS    (input) REAL             array, dimension (2*N)\n*          The N Gerschgorin intervals (the i-th Gerschgorin interval\n*          is (GERS(2*i-1), GERS(2*i)).\n*\n*  RELTOL  (input) REAL            \n*          The minimum relative width of an interval.  When an interval\n*          is narrower than RELTOL times the larger (in\n*          magnitude) endpoint, then it is considered to be\n*          sufficiently small, i.e., converged.  Note: this should\n*          always be at least radix*machine epsilon.\n*\n*  D       (input) REAL             array, dimension (N)\n*          The n diagonal elements of the tridiagonal matrix T.\n*\n*  E       (input) REAL             array, dimension (N-1)\n*          The (n-1) off-diagonal elements of the tridiagonal matrix T.\n*\n*  E2      (input) REAL             array, dimension (N-1)\n*          The (n-1) squared off-diagonal elements of the tridiagonal matrix T.\n*\n*  PIVMIN  (input) REAL            \n*          The minimum pivot allowed in the Sturm sequence for T.\n*\n*  NSPLIT  (input) INTEGER\n*          The number of diagonal blocks in the matrix T.\n*          1 <= NSPLIT <= N.\n*\n*  ISPLIT  (input) INTEGER array, dimension (N)\n*          The splitting points, at which T breaks up into submatrices.\n*          The first submatrix consists of rows/columns 1 to ISPLIT(1),\n*          the second of rows/columns ISPLIT(1)+1 through ISPLIT(2),\n*          etc., and the NSPLIT-th consists of rows/columns\n*          ISPLIT(NSPLIT-1)+1 through ISPLIT(NSPLIT)=N.\n*          (Only the first NSPLIT elements will actually be used, but\n*          since the user cannot know a priori what value NSPLIT will\n*          have, N words must be reserved for ISPLIT.)\n*\n*  M       (output) INTEGER\n*          The actual number of eigenvalues found. 0 <= M <= N.\n*          (See also the description of INFO=2,3.)\n*\n*  W       (output) REAL             array, dimension (N)\n*          On exit, the first M elements of W will contain the\n*          eigenvalue approximations. SLARRD computes an interval\n*          I_j = (a_j, b_j] that includes eigenvalue j. The eigenvalue\n*          approximation is given as the interval midpoint\n*          W(j)= ( a_j + b_j)/2. The corresponding error is bounded by\n*          WERR(j) = abs( a_j - b_j)/2\n*\n*  WERR    (output) REAL             array, dimension (N)\n*          The error bound on the corresponding eigenvalue approximation\n*          in W.\n*\n*  WL      (output) REAL            \n*  WU      (output) REAL            \n*          The interval (WL, WU] contains all the wanted eigenvalues.\n*          If RANGE='V', then WL=VL and WU=VU.\n*          If RANGE='A', then WL and WU are the global Gerschgorin bounds\n*                        on the spectrum.\n*          If RANGE='I', then WL and WU are computed by SLAEBZ from the\n*                        index range specified.\n*\n*  IBLOCK  (output) INTEGER array, dimension (N)\n*          At each row/column j where E(j) is zero or small, the\n*          matrix T is considered to split into a block diagonal\n*          matrix.  On exit, if INFO = 0, IBLOCK(i) specifies to which\n*          block (from 1 to the number of blocks) the eigenvalue W(i)\n*          belongs.  (SLARRD may use the remaining N-M elements as\n*          workspace.)\n*\n*  INDEXW  (output) INTEGER array, dimension (N)\n*          The indices of the eigenvalues within each block (submatrix);\n*          for example, INDEXW(i)= j and IBLOCK(i)=k imply that the\n*          i-th eigenvalue W(i) is the j-th eigenvalue in block k.\n*\n*  WORK    (workspace) REAL             array, dimension (4*N)\n*\n*  IWORK   (workspace) INTEGER 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:  some or all of the eigenvalues failed to converge or\n*                were not computed:\n*                =1 or 3: Bisection failed to converge for some\n*                        eigenvalues; these eigenvalues are flagged by a\n*                        negative block number.  The effect is that the\n*                        eigenvalues may not be as accurate as the\n*                        absolute and relative tolerances.  This is\n*                        generally caused by unexpectedly inaccurate\n*                        arithmetic.\n*                =2 or 3: RANGE='I' only: Not all of the eigenvalues\n*                        IL:IU were found.\n*                        Effect: M < IU+1-IL\n*                        Cause:  non-monotonic arithmetic, causing the\n*                                Sturm sequence to be non-monotonic.\n*                        Cure:   recalculate, using RANGE='A', and pick\n*                                out eigenvalues IL:IU.  In some cases,\n*                                increasing the PARAMETER \"FUDGE\" may\n*                                make things work.\n*                = 4:    RANGE='I', and the Gershgorin interval\n*                        initially used was too small.  No eigenvalues\n*                        were computed.\n*                        Probable cause: your machine has sloppy\n*                                        floating-point arithmetic.\n*                        Cure: Increase the PARAMETER \"FUDGE\",\n*                              recompile, and try again.\n*\n*  Internal Parameters\n*  ===================\n*\n*  FUDGE   REAL            , default = 2\n*          A \"fudge factor\" to widen the Gershgorin intervals.  Ideally,\n*          a value of 1 should work, but on machines with sloppy\n*          arithmetic, this needs to be larger.  The default for\n*          publicly released versions should be large enough to handle\n*          the worst machine around.  Note that this has no effect\n*          on accuracy of the solution.\n*\n*  Based on contributions by\n*     W. Kahan, University of California, Berkeley, USA\n*     Beresford Parlett, University of California, Berkeley, USA\n*     Jim Demmel, University of California, Berkeley, USA\n*     Inderjit Dhillon, University of Texas, Austin, USA\n*     Osni Marques, LBNL/NERSC, USA\n*     Christof Voemel, University of California, Berkeley, USA\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  m, w, werr, wl, wu, iblock, indexw, info = NumRu::Lapack.slarrd( range, order, vl, vu, il, iu, gers, reltol, d, e, e2, pivmin, nsplit, isplit, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 14 && argc != 14)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 14)", argc);
+  rblapack_range = argv[0];
+  rblapack_order = argv[1];
+  rblapack_vl = argv[2];
+  rblapack_vu = argv[3];
+  rblapack_il = argv[4];
+  rblapack_iu = argv[5];
+  rblapack_gers = argv[6];
+  rblapack_reltol = argv[7];
+  rblapack_d = argv[8];
+  rblapack_e = argv[9];
+  rblapack_e2 = argv[10];
+  rblapack_pivmin = argv[11];
+  rblapack_nsplit = argv[12];
+  rblapack_isplit = argv[13];
+  if (argc == 14) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  range = StringValueCStr(rblapack_range)[0];
+  vl = (real)NUM2DBL(rblapack_vl);
+  il = NUM2INT(rblapack_il);
+  reltol = (real)NUM2DBL(rblapack_reltol);
+  pivmin = (real)NUM2DBL(rblapack_pivmin);
+  if (!NA_IsNArray(rblapack_isplit))
+    rb_raise(rb_eArgError, "isplit (14th argument) must be NArray");
+  if (NA_RANK(rblapack_isplit) != 1)
+    rb_raise(rb_eArgError, "rank of isplit (14th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_isplit);
+  if (NA_TYPE(rblapack_isplit) != NA_LINT)
+    rblapack_isplit = na_change_type(rblapack_isplit, NA_LINT);
+  isplit = NA_PTR_TYPE(rblapack_isplit, integer*);
+  order = StringValueCStr(rblapack_order)[0];
+  iu = NUM2INT(rblapack_iu);
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (9th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (9th 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 0 of isplit");
+  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_e2))
+    rb_raise(rb_eArgError, "e2 (11th argument) must be NArray");
+  if (NA_RANK(rblapack_e2) != 1)
+    rb_raise(rb_eArgError, "rank of e2 (11th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_e2) != (n-1))
+    rb_raise(rb_eRuntimeError, "shape 0 of e2 must be %d", n-1);
+  if (NA_TYPE(rblapack_e2) != NA_SFLOAT)
+    rblapack_e2 = na_change_type(rblapack_e2, NA_SFLOAT);
+  e2 = NA_PTR_TYPE(rblapack_e2, real*);
+  vu = (real)NUM2DBL(rblapack_vu);
+  if (!NA_IsNArray(rblapack_e))
+    rb_raise(rb_eArgError, "e (10th argument) must be NArray");
+  if (NA_RANK(rblapack_e) != 1)
+    rb_raise(rb_eArgError, "rank of e (10th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_e) != (n-1))
+    rb_raise(rb_eRuntimeError, "shape 0 of e must be %d", n-1);
+  if (NA_TYPE(rblapack_e) != NA_SFLOAT)
+    rblapack_e = na_change_type(rblapack_e, NA_SFLOAT);
+  e = NA_PTR_TYPE(rblapack_e, real*);
+  if (!NA_IsNArray(rblapack_gers))
+    rb_raise(rb_eArgError, "gers (7th argument) must be NArray");
+  if (NA_RANK(rblapack_gers) != 1)
+    rb_raise(rb_eArgError, "rank of gers (7th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_gers) != (2*n))
+    rb_raise(rb_eRuntimeError, "shape 0 of gers must be %d", 2*n);
+  if (NA_TYPE(rblapack_gers) != NA_SFLOAT)
+    rblapack_gers = na_change_type(rblapack_gers, NA_SFLOAT);
+  gers = NA_PTR_TYPE(rblapack_gers, real*);
+  nsplit = NUM2INT(rblapack_nsplit);
+  {
+    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_werr = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  werr = NA_PTR_TYPE(rblapack_werr, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_iblock = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  iblock = NA_PTR_TYPE(rblapack_iblock, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_indexw = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  indexw = NA_PTR_TYPE(rblapack_indexw, integer*);
+  work = ALLOC_N(real, (4*n));
+  iwork = ALLOC_N(integer, (3*n));
+
+  slarrd_(&range, &order, &n, &vl, &vu, &il, &iu, gers, &reltol, d, e, e2, &pivmin, &nsplit, isplit, &m, w, werr, &wl, &wu, iblock, indexw, work, iwork, &info);
+
+  free(work);
+  free(iwork);
+  rblapack_m = INT2NUM(m);
+  rblapack_wl = rb_float_new((double)wl);
+  rblapack_wu = rb_float_new((double)wu);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(8, rblapack_m, rblapack_w, rblapack_werr, rblapack_wl, rblapack_wu, rblapack_iblock, rblapack_indexw, rblapack_info);
+}
+
+void
+init_lapack_slarrd(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slarrd", rblapack_slarrd, -1);
+}

data/ext/slarre.c

@@ -0,0 +1,221 @@
+#include "rb_lapack.h"
+
+extern VOID slarre_(char* range, integer* n, real* vl, real* vu, integer* il, integer* iu, real* d, real* e, real* e2, real* rtol1, real* rtol2, real* spltol, integer* nsplit, integer* isplit, integer* m, real* w, real* werr, real* wgap, integer* iblock, integer* indexw, real* gers, real* pivmin, real* work, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_slarre(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_range;
+  char range; 
+  VALUE rblapack_vl;
+  real vl; 
+  VALUE rblapack_vu;
+  real vu; 
+  VALUE rblapack_il;
+  integer il; 
+  VALUE rblapack_iu;
+  integer iu; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_e;
+  real *e; 
+  VALUE rblapack_e2;
+  real *e2; 
+  VALUE rblapack_rtol1;
+  real rtol1; 
+  VALUE rblapack_rtol2;
+  real rtol2; 
+  VALUE rblapack_spltol;
+  real spltol; 
+  VALUE rblapack_nsplit;
+  integer nsplit; 
+  VALUE rblapack_isplit;
+  integer *isplit; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_w;
+  real *w; 
+  VALUE rblapack_werr;
+  real *werr; 
+  VALUE rblapack_wgap;
+  real *wgap; 
+  VALUE rblapack_iblock;
+  integer *iblock; 
+  VALUE rblapack_indexw;
+  integer *indexw; 
+  VALUE rblapack_gers;
+  real *gers; 
+  VALUE rblapack_pivmin;
+  real pivmin; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_e_out__;
+  real *e_out__;
+  VALUE rblapack_e2_out__;
+  real *e2_out__;
+  real *work;
+  integer *iwork;
+
+  integer n;
+
+  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  nsplit, isplit, m, w, werr, wgap, iblock, indexw, gers, pivmin, info, vl, vu, d, e, e2 = NumRu::Lapack.slarre( range, vl, vu, il, iu, d, e, e2, rtol1, rtol2, spltol, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2, RTOL1, RTOL2, SPLTOL, NSPLIT, ISPLIT, M, W, WERR, WGAP, IBLOCK, INDEXW, GERS, PIVMIN, WORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  To find the desired eigenvalues of a given real symmetric\n*  tridiagonal matrix T, SLARRE sets any \"small\" off-diagonal\n*  elements to zero, and for each unreduced block T_i, it finds\n*  (a) a suitable shift at one end of the block's spectrum,\n*  (b) the base representation, T_i - sigma_i I = L_i D_i L_i^T, and\n*  (c) eigenvalues of each L_i D_i L_i^T.\n*  The representations and eigenvalues found are then used by\n*  SSTEMR to compute the eigenvectors of T.\n*  The accuracy varies depending on whether bisection is used to\n*  find a few eigenvalues or the dqds algorithm (subroutine SLASQ2) to\n*  conpute all and then discard any unwanted one.\n*  As an added benefit, SLARRE also outputs the n\n*  Gerschgorin intervals for the matrices L_i D_i L_i^T.\n*\n\n*  Arguments\n*  =========\n*\n*  RANGE   (input) CHARACTER*1\n*          = 'A': (\"All\")   all eigenvalues will be found.\n*          = 'V': (\"Value\") all eigenvalues in the half-open interval\n*                           (VL, VU] will be found.\n*          = 'I': (\"Index\") the IL-th through IU-th eigenvalues (of the\n*                           entire matrix) will be found.\n*\n*  N       (input) INTEGER\n*          The order of the matrix. N > 0.\n*\n*  VL      (input/output) REAL            \n*  VU      (input/output) REAL            \n*          If RANGE='V', the lower and upper bounds for the eigenvalues.\n*          Eigenvalues less than or equal to VL, or greater than VU,\n*          will not be returned.  VL < VU.\n*          If RANGE='I' or ='A', SLARRE computes bounds on the desired\n*          part of the spectrum.\n*\n*  IL      (input) INTEGER\n*  IU      (input) INTEGER\n*          If RANGE='I', the indices (in ascending order) of the\n*          smallest and largest eigenvalues to be returned.\n*          1 <= IL <= IU <= N.\n*\n*  D       (input/output) REAL             array, dimension (N)\n*          On entry, the N diagonal elements of the tridiagonal\n*          matrix T.\n*          On exit, the N diagonal elements of the diagonal\n*          matrices D_i.\n*\n*  E       (input/output) REAL             array, dimension (N)\n*          On entry, the first (N-1) entries contain the subdiagonal\n*          elements of the tridiagonal matrix T; E(N) need not be set.\n*          On exit, E contains the subdiagonal elements of the unit\n*          bidiagonal matrices L_i. The entries E( ISPLIT( I ) ),\n*          1 <= I <= NSPLIT, contain the base points sigma_i on output.\n*\n*  E2      (input/output) REAL             array, dimension (N)\n*          On entry, the first (N-1) entries contain the SQUARES of the\n*          subdiagonal elements of the tridiagonal matrix T;\n*          E2(N) need not be set.\n*          On exit, the entries E2( ISPLIT( I ) ),\n*          1 <= I <= NSPLIT, have been set to zero\n*\n*  RTOL1   (input) REAL            \n*  RTOL2   (input) REAL            \n*           Parameters for bisection.\n*           An interval [LEFT,RIGHT] has converged if\n*           RIGHT-LEFT.LT.MAX( RTOL1*GAP, RTOL2*MAX(|LEFT|,|RIGHT|) )\n*\n*  SPLTOL (input) REAL            \n*          The threshold for splitting.\n*\n*  NSPLIT  (output) INTEGER\n*          The number of blocks T splits into. 1 <= NSPLIT <= N.\n*\n*  ISPLIT  (output) INTEGER array, dimension (N)\n*          The splitting points, at which T breaks up into blocks.\n*          The first block consists of rows/columns 1 to ISPLIT(1),\n*          the second of rows/columns ISPLIT(1)+1 through ISPLIT(2),\n*          etc., and the NSPLIT-th consists of rows/columns\n*          ISPLIT(NSPLIT-1)+1 through ISPLIT(NSPLIT)=N.\n*\n*  M       (output) INTEGER\n*          The total number of eigenvalues (of all L_i D_i L_i^T)\n*          found.\n*\n*  W       (output) REAL             array, dimension (N)\n*          The first M elements contain the eigenvalues. The\n*          eigenvalues of each of the blocks, L_i D_i L_i^T, are\n*          sorted in ascending order ( SLARRE may use the\n*          remaining N-M elements as workspace).\n*\n*  WERR    (output) REAL             array, dimension (N)\n*          The error bound on the corresponding eigenvalue in W.\n*\n*  WGAP    (output) REAL             array, dimension (N)\n*          The separation from the right neighbor eigenvalue in W.\n*          The gap is only with respect to the eigenvalues of the same block\n*          as each block has its own representation tree.\n*          Exception: at the right end of a block we store the left gap\n*\n*  IBLOCK  (output) INTEGER array, dimension (N)\n*          The indices of the blocks (submatrices) associated with the\n*          corresponding eigenvalues in W; IBLOCK(i)=1 if eigenvalue\n*          W(i) belongs to the first block from the top, =2 if W(i)\n*          belongs to the second block, etc.\n*\n*  INDEXW  (output) INTEGER array, dimension (N)\n*          The indices of the eigenvalues within each block (submatrix);\n*          for example, INDEXW(i)= 10 and IBLOCK(i)=2 imply that the\n*          i-th eigenvalue W(i) is the 10-th eigenvalue in block 2\n*\n*  GERS    (output) REAL             array, dimension (2*N)\n*          The N Gerschgorin intervals (the i-th Gerschgorin interval\n*          is (GERS(2*i-1), GERS(2*i)).\n*\n*  PIVMIN  (output) REAL\n*          The minimum pivot in the Sturm sequence for T.\n*\n*  WORK    (workspace) REAL             array, dimension (6*N)\n*          Workspace.\n*\n*  IWORK   (workspace) INTEGER array, dimension (5*N)\n*          Workspace.\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*          > 0:  A problem occured in SLARRE.\n*          < 0:  One of the called subroutines signaled an internal problem.\n*                Needs inspection of the corresponding parameter IINFO\n*                for further information.\n*\n*          =-1:  Problem in SLARRD.\n*          = 2:  No base representation could be found in MAXTRY iterations.\n*                Increasing MAXTRY and recompilation might be a remedy.\n*          =-3:  Problem in SLARRB when computing the refined root\n*                representation for SLASQ2.\n*          =-4:  Problem in SLARRB when preforming bisection on the\n*                desired part of the spectrum.\n*          =-5:  Problem in SLASQ2.\n*          =-6:  Problem in SLASQ2.\n*\n\n*  Further Details\n*  The base representations are required to suffer very little\n*  element growth and consequently define all their eigenvalues to\n*  high relative accuracy.\n*  ===============\n*\n*  Based on contributions by\n*     Beresford Parlett, University of California, Berkeley, USA\n*     Jim Demmel, University of California, Berkeley, USA\n*     Inderjit Dhillon, University of Texas, Austin, USA\n*     Osni Marques, LBNL/NERSC, USA\n*     Christof Voemel, University of California, Berkeley, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  nsplit, isplit, m, w, werr, wgap, iblock, indexw, gers, pivmin, info, vl, vu, d, e, e2 = NumRu::Lapack.slarre( range, vl, vu, il, iu, d, e, e2, rtol1, rtol2, spltol, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 11 && argc != 11)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 11)", argc);
+  rblapack_range = argv[0];
+  rblapack_vl = argv[1];
+  rblapack_vu = argv[2];
+  rblapack_il = argv[3];
+  rblapack_iu = argv[4];
+  rblapack_d = argv[5];
+  rblapack_e = argv[6];
+  rblapack_e2 = argv[7];
+  rblapack_rtol1 = argv[8];
+  rblapack_rtol2 = argv[9];
+  rblapack_spltol = argv[10];
+  if (argc == 11) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  range = StringValueCStr(rblapack_range)[0];
+  vu = (real)NUM2DBL(rblapack_vu);
+  iu = NUM2INT(rblapack_iu);
+  if (!NA_IsNArray(rblapack_e))
+    rb_raise(rb_eArgError, "e (7th argument) must be NArray");
+  if (NA_RANK(rblapack_e) != 1)
+    rb_raise(rb_eArgError, "rank of e (7th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_e);
+  if (NA_TYPE(rblapack_e) != NA_SFLOAT)
+    rblapack_e = na_change_type(rblapack_e, NA_SFLOAT);
+  e = NA_PTR_TYPE(rblapack_e, real*);
+  rtol1 = (real)NUM2DBL(rblapack_rtol1);
+  spltol = (real)NUM2DBL(rblapack_spltol);
+  vl = (real)NUM2DBL(rblapack_vl);
+  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 0 of e");
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  rtol2 = (real)NUM2DBL(rblapack_rtol2);
+  il = NUM2INT(rblapack_il);
+  if (!NA_IsNArray(rblapack_e2))
+    rb_raise(rb_eArgError, "e2 (8th argument) must be NArray");
+  if (NA_RANK(rblapack_e2) != 1)
+    rb_raise(rb_eArgError, "rank of e2 (8th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_e2) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of e2 must be the same as shape 0 of e");
+  if (NA_TYPE(rblapack_e2) != NA_SFLOAT)
+    rblapack_e2 = na_change_type(rblapack_e2, NA_SFLOAT);
+  e2 = NA_PTR_TYPE(rblapack_e2, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_isplit = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  isplit = NA_PTR_TYPE(rblapack_isplit, integer*);
+  {
+    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_werr = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  werr = NA_PTR_TYPE(rblapack_werr, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_wgap = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  wgap = NA_PTR_TYPE(rblapack_wgap, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_iblock = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  iblock = NA_PTR_TYPE(rblapack_iblock, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_indexw = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  indexw = NA_PTR_TYPE(rblapack_indexw, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 2*n;
+    rblapack_gers = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  gers = NA_PTR_TYPE(rblapack_gers, real*);
+  {
+    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[1];
+    shape[0] = n;
+    rblapack_e_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  e_out__ = NA_PTR_TYPE(rblapack_e_out__, real*);
+  MEMCPY(e_out__, e, real, NA_TOTAL(rblapack_e));
+  rblapack_e = rblapack_e_out__;
+  e = e_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_e2_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  e2_out__ = NA_PTR_TYPE(rblapack_e2_out__, real*);
+  MEMCPY(e2_out__, e2, real, NA_TOTAL(rblapack_e2));
+  rblapack_e2 = rblapack_e2_out__;
+  e2 = e2_out__;
+  work = ALLOC_N(real, (6*n));
+  iwork = ALLOC_N(integer, (5*n));
+
+  slarre_(&range, &n, &vl, &vu, &il, &iu, d, e, e2, &rtol1, &rtol2, &spltol, &nsplit, isplit, &m, w, werr, wgap, iblock, indexw, gers, &pivmin, work, iwork, &info);
+
+  free(work);
+  free(iwork);
+  rblapack_nsplit = INT2NUM(nsplit);
+  rblapack_m = INT2NUM(m);
+  rblapack_pivmin = rb_float_new((double)pivmin);
+  rblapack_info = INT2NUM(info);
+  rblapack_vl = rb_float_new((double)vl);
+  rblapack_vu = rb_float_new((double)vu);
+  return rb_ary_new3(16, rblapack_nsplit, rblapack_isplit, rblapack_m, rblapack_w, rblapack_werr, rblapack_wgap, rblapack_iblock, rblapack_indexw, rblapack_gers, rblapack_pivmin, rblapack_info, rblapack_vl, rblapack_vu, rblapack_d, rblapack_e, rblapack_e2);
+}
+
+void
+init_lapack_slarre(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slarre", rblapack_slarre, -1);
+}