ruby-lapack 1.7 → 1.7.1

data/ext/clarfx.c

@@ -0,0 +1,94 @@
+#include "rb_lapack.h"
+
+extern VOID clarfx_(char* side, integer* m, integer* n, complex* v, complex* tau, complex* c, integer* ldc, complex* work);
+
+
+static VALUE
+rblapack_clarfx(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_side;
+  char side; 
+  VALUE rblapack_v;
+  complex *v; 
+  VALUE rblapack_tau;
+  complex tau; 
+  VALUE rblapack_c;
+  complex *c; 
+  VALUE rblapack_c_out__;
+  complex *c_out__;
+  complex *work;
+
+  integer m;
+  integer ldc;
+  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  c = NumRu::Lapack.clarfx( side, v, tau, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARFX( SIDE, M, N, V, TAU, C, LDC, WORK )\n\n*  Purpose\n*  =======\n*\n*  CLARFX applies a complex elementary reflector H to a complex m by n\n*  matrix C, from either the left or the right. H is represented in the\n*  form\n*\n*        H = I - tau * v * v'\n*\n*  where tau is a complex scalar and v is a complex vector.\n*\n*  If tau = 0, then H is taken to be the unit matrix\n*\n*  This version uses inline code if H has order < 11.\n*\n\n*  Arguments\n*  =========\n*\n*  SIDE    (input) CHARACTER*1\n*          = 'L': form  H * C\n*          = 'R': form  C * H\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix C.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix C.\n*\n*  V       (input) COMPLEX array, dimension (M) if SIDE = 'L'\n*                                        or (N) if SIDE = 'R'\n*          The vector v in the representation of H.\n*\n*  TAU     (input) COMPLEX\n*          The value tau in the representation of H.\n*\n*  C       (input/output) COMPLEX array, dimension (LDC,N)\n*          On entry, the m by n matrix C.\n*          On exit, C is overwritten by the matrix H * C if SIDE = 'L',\n*          or C * H if SIDE = 'R'.\n*\n*  LDC     (input) INTEGER\n*          The leading dimension of the array C. LDA >= max(1,M).\n*\n*  WORK    (workspace) COMPLEX array, dimension (N) if SIDE = 'L'\n*                                            or (M) if SIDE = 'R'\n*          WORK is not referenced if H has order < 11.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  c = NumRu::Lapack.clarfx( side, v, tau, c, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 4 && argc != 4)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 4)", argc);
+  rblapack_side = argv[0];
+  rblapack_v = argv[1];
+  rblapack_tau = argv[2];
+  rblapack_c = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  side = StringValueCStr(rblapack_side)[0];
+  tau.r = (real)NUM2DBL(rb_funcall(rblapack_tau, rb_intern("real"), 0));
+  tau.i = (real)NUM2DBL(rb_funcall(rblapack_tau, rb_intern("imag"), 0));
+  if (!NA_IsNArray(rblapack_v))
+    rb_raise(rb_eArgError, "v (2th argument) must be NArray");
+  if (NA_RANK(rblapack_v) != 1)
+    rb_raise(rb_eArgError, "rank of v (2th argument) must be %d", 1);
+  m = NA_SHAPE0(rblapack_v);
+  if (NA_TYPE(rblapack_v) != NA_SCOMPLEX)
+    rblapack_v = na_change_type(rblapack_v, NA_SCOMPLEX);
+  v = NA_PTR_TYPE(rblapack_v, complex*);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (4th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 2)
+    rb_raise(rb_eArgError, "rank of c (4th argument) must be %d", 2);
+  ldc = NA_SHAPE0(rblapack_c);
+  n = NA_SHAPE1(rblapack_c);
+  if (NA_TYPE(rblapack_c) != NA_SCOMPLEX)
+    rblapack_c = na_change_type(rblapack_c, NA_SCOMPLEX);
+  c = NA_PTR_TYPE(rblapack_c, complex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldc;
+    shape[1] = n;
+    rblapack_c_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  c_out__ = NA_PTR_TYPE(rblapack_c_out__, complex*);
+  MEMCPY(c_out__, c, complex, NA_TOTAL(rblapack_c));
+  rblapack_c = rblapack_c_out__;
+  c = c_out__;
+  work = ALLOC_N(complex, (lsame_(&side,"L") ? n : lsame_(&side,"R") ? m : 0));
+
+  clarfx_(&side, &m, &n, v, &tau, c, &ldc, work);
+
+  free(work);
+  return rblapack_c;
+}
+
+void
+init_lapack_clarfx(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "clarfx", rblapack_clarfx, -1);
+}

data/ext/clargv.c

@@ -0,0 +1,114 @@
+#include "rb_lapack.h"
+
+extern VOID clargv_(integer* n, complex* x, integer* incx, complex* y, integer* incy, real* c, integer* incc);
+
+
+static VALUE
+rblapack_clargv(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_n;
+  integer n; 
+  VALUE rblapack_x;
+  complex *x; 
+  VALUE rblapack_incx;
+  integer incx; 
+  VALUE rblapack_y;
+  complex *y; 
+  VALUE rblapack_incy;
+  integer incy; 
+  VALUE rblapack_incc;
+  integer incc; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_x_out__;
+  complex *x_out__;
+  VALUE rblapack_y_out__;
+  complex *y_out__;
+
+
+  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  c, x, y = NumRu::Lapack.clargv( n, x, incx, y, incy, incc, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARGV( N, X, INCX, Y, INCY, C, INCC )\n\n*  Purpose\n*  =======\n*\n*  CLARGV generates a vector of complex plane rotations with real\n*  cosines, determined by elements of the complex vectors x and y.\n*  For i = 1,2,...,n\n*\n*     (        c(i)   s(i) ) ( x(i) ) = ( r(i) )\n*     ( -conjg(s(i))  c(i) ) ( y(i) ) = (   0  )\n*\n*     where c(i)**2 + ABS(s(i))**2 = 1\n*\n*  The following conventions are used (these are the same as in CLARTG,\n*  but differ from the BLAS1 routine CROTG):\n*     If y(i)=0, then c(i)=1 and s(i)=0.\n*     If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real.\n*\n\n*  Arguments\n*  =========\n*\n*  N       (input) INTEGER\n*          The number of plane rotations to be generated.\n*\n*  X       (input/output) COMPLEX array, dimension (1+(N-1)*INCX)\n*          On entry, the vector x.\n*          On exit, x(i) is overwritten by r(i), for i = 1,...,n.\n*\n*  INCX    (input) INTEGER\n*          The increment between elements of X. INCX > 0.\n*\n*  Y       (input/output) COMPLEX array, dimension (1+(N-1)*INCY)\n*          On entry, the vector y.\n*          On exit, the sines of the plane rotations.\n*\n*  INCY    (input) INTEGER\n*          The increment between elements of Y. INCY > 0.\n*\n*  C       (output) REAL array, dimension (1+(N-1)*INCC)\n*          The cosines of the plane rotations.\n*\n*  INCC    (input) INTEGER\n*          The increment between elements of C. INCC > 0.\n*\n\n*  Further Details\n*  ======= =======\n*\n*  6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel\n*\n*  This version has a few statements commented out for thread safety\n*  (machine parameters are computed on each entry). 10 feb 03, SJH.\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  c, x, y = NumRu::Lapack.clargv( n, x, incx, y, incy, incc, [: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_n = argv[0];
+  rblapack_x = argv[1];
+  rblapack_incx = argv[2];
+  rblapack_y = argv[3];
+  rblapack_incy = argv[4];
+  rblapack_incc = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  n = NUM2INT(rblapack_n);
+  incx = NUM2INT(rblapack_incx);
+  incy = NUM2INT(rblapack_incy);
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (2th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 1)
+    rb_raise(rb_eArgError, "rank of x (2th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_x) != (1+(n-1)*incx))
+    rb_raise(rb_eRuntimeError, "shape 0 of x must be %d", 1+(n-1)*incx);
+  if (NA_TYPE(rblapack_x) != NA_SCOMPLEX)
+    rblapack_x = na_change_type(rblapack_x, NA_SCOMPLEX);
+  x = NA_PTR_TYPE(rblapack_x, complex*);
+  incc = NUM2INT(rblapack_incc);
+  if (!NA_IsNArray(rblapack_y))
+    rb_raise(rb_eArgError, "y (4th argument) must be NArray");
+  if (NA_RANK(rblapack_y) != 1)
+    rb_raise(rb_eArgError, "rank of y (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_y) != (1+(n-1)*incy))
+    rb_raise(rb_eRuntimeError, "shape 0 of y must be %d", 1+(n-1)*incy);
+  if (NA_TYPE(rblapack_y) != NA_SCOMPLEX)
+    rblapack_y = na_change_type(rblapack_y, NA_SCOMPLEX);
+  y = NA_PTR_TYPE(rblapack_y, complex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 1+(n-1)*incc;
+    rblapack_c = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 1+(n-1)*incx;
+    rblapack_x_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  x_out__ = NA_PTR_TYPE(rblapack_x_out__, complex*);
+  MEMCPY(x_out__, x, complex, NA_TOTAL(rblapack_x));
+  rblapack_x = rblapack_x_out__;
+  x = x_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = 1+(n-1)*incy;
+    rblapack_y_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  y_out__ = NA_PTR_TYPE(rblapack_y_out__, complex*);
+  MEMCPY(y_out__, y, complex, NA_TOTAL(rblapack_y));
+  rblapack_y = rblapack_y_out__;
+  y = y_out__;
+
+  clargv_(&n, x, &incx, y, &incy, c, &incc);
+
+  return rb_ary_new3(3, rblapack_c, rblapack_x, rblapack_y);
+}
+
+void
+init_lapack_clargv(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "clargv", rblapack_clargv, -1);
+}

data/ext/clarnv.c

@@ -0,0 +1,83 @@
+#include "rb_lapack.h"
+
+extern VOID clarnv_(integer* idist, integer* iseed, integer* n, complex* x);
+
+
+static VALUE
+rblapack_clarnv(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_idist;
+  integer idist; 
+  VALUE rblapack_iseed;
+  integer *iseed; 
+  VALUE rblapack_n;
+  integer n; 
+  VALUE rblapack_x;
+  complex *x; 
+  VALUE rblapack_iseed_out__;
+  integer *iseed_out__;
+
+
+  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  x, iseed = NumRu::Lapack.clarnv( idist, iseed, n, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARNV( IDIST, ISEED, N, X )\n\n*  Purpose\n*  =======\n*\n*  CLARNV returns a vector of n random complex numbers from a uniform or\n*  normal distribution.\n*\n\n*  Arguments\n*  =========\n*\n*  IDIST   (input) INTEGER\n*          Specifies the distribution of the random numbers:\n*          = 1:  real and imaginary parts each uniform (0,1)\n*          = 2:  real and imaginary parts each uniform (-1,1)\n*          = 3:  real and imaginary parts each normal (0,1)\n*          = 4:  uniformly distributed on the disc abs(z) < 1\n*          = 5:  uniformly distributed on the circle abs(z) = 1\n*\n*  ISEED   (input/output) INTEGER array, dimension (4)\n*          On entry, the seed of the random number generator; the array\n*          elements must be between 0 and 4095, and ISEED(4) must be\n*          odd.\n*          On exit, the seed is updated.\n*\n*  N       (input) INTEGER\n*          The number of random numbers to be generated.\n*\n*  X       (output) COMPLEX array, dimension (N)\n*          The generated random numbers.\n*\n\n*  Further Details\n*  ===============\n*\n*  This routine calls the auxiliary routine SLARUV to generate random\n*  real numbers from a uniform (0,1) distribution, in batches of up to\n*  128 using vectorisable code. The Box-Muller method is used to\n*  transform numbers from a uniform to a normal distribution.\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  x, iseed = NumRu::Lapack.clarnv( idist, iseed, n, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 3 && argc != 3)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 3)", argc);
+  rblapack_idist = argv[0];
+  rblapack_iseed = argv[1];
+  rblapack_n = argv[2];
+  if (argc == 3) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  idist = NUM2INT(rblapack_idist);
+  n = NUM2INT(rblapack_n);
+  if (!NA_IsNArray(rblapack_iseed))
+    rb_raise(rb_eArgError, "iseed (2th argument) must be NArray");
+  if (NA_RANK(rblapack_iseed) != 1)
+    rb_raise(rb_eArgError, "rank of iseed (2th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_iseed) != (4))
+    rb_raise(rb_eRuntimeError, "shape 0 of iseed must be %d", 4);
+  if (NA_TYPE(rblapack_iseed) != NA_LINT)
+    rblapack_iseed = na_change_type(rblapack_iseed, NA_LINT);
+  iseed = NA_PTR_TYPE(rblapack_iseed, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = MAX(1,n);
+    rblapack_x = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  x = NA_PTR_TYPE(rblapack_x, complex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 4;
+    rblapack_iseed_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  iseed_out__ = NA_PTR_TYPE(rblapack_iseed_out__, integer*);
+  MEMCPY(iseed_out__, iseed, integer, NA_TOTAL(rblapack_iseed));
+  rblapack_iseed = rblapack_iseed_out__;
+  iseed = iseed_out__;
+
+  clarnv_(&idist, iseed, &n, x);
+
+  return rb_ary_new3(2, rblapack_x, rblapack_iseed);
+}
+
+void
+init_lapack_clarnv(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "clarnv", rblapack_clarnv, -1);
+}

data/ext/clarrv.c

@@ -0,0 +1,271 @@
+#include "rb_lapack.h"
+
+extern VOID clarrv_(integer* n, real* vl, real* vu, real* d, real* l, real* pivmin, integer* isplit, integer* m, integer* dol, integer* dou, real* minrgp, real* rtol1, real* rtol2, real* w, real* werr, real* wgap, integer* iblock, integer* indexw, real* gers, complex* z, integer* ldz, integer* isuppz, real* work, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_clarrv(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_vl;
+  real vl; 
+  VALUE rblapack_vu;
+  real vu; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_l;
+  real *l; 
+  VALUE rblapack_pivmin;
+  real pivmin; 
+  VALUE rblapack_isplit;
+  integer *isplit; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_dol;
+  integer dol; 
+  VALUE rblapack_dou;
+  integer dou; 
+  VALUE rblapack_minrgp;
+  real minrgp; 
+  VALUE rblapack_rtol1;
+  real rtol1; 
+  VALUE rblapack_rtol2;
+  real rtol2; 
+  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_z;
+  complex *z; 
+  VALUE rblapack_isuppz;
+  integer *isuppz; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_l_out__;
+  real *l_out__;
+  VALUE rblapack_w_out__;
+  real *w_out__;
+  VALUE rblapack_werr_out__;
+  real *werr_out__;
+  VALUE rblapack_wgap_out__;
+  real *wgap_out__;
+  real *work;
+  integer *iwork;
+
+  integer n;
+  integer ldz;
+
+  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  z, isuppz, info, d, l, w, werr, wgap = NumRu::Lapack.clarrv( vl, vu, d, l, pivmin, isplit, m, dol, dou, minrgp, rtol1, rtol2, w, werr, wgap, iblock, indexw, gers, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARRV( N, VL, VU, D, L, PIVMIN, ISPLIT, M, DOL, DOU, MINRGP, RTOL1, RTOL2, W, WERR, WGAP, IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ, WORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLARRV computes the eigenvectors of the tridiagonal matrix\n*  T = L D L^T given L, D and APPROXIMATIONS to the eigenvalues of L D L^T.\n*  The input eigenvalues should have been computed by SLARRE.\n*\n\n*  Arguments\n*  =========\n*\n*  N       (input) INTEGER\n*          The order of the matrix.  N >= 0.\n*\n*  VL      (input) REAL            \n*  VU      (input) REAL            \n*          Lower and upper bounds of the interval that contains the desired\n*          eigenvalues. VL < VU. Needed to compute gaps on the left or right\n*          end of the extremal eigenvalues in the desired RANGE.\n*\n*  D       (input/output) REAL             array, dimension (N)\n*          On entry, the N diagonal elements of the diagonal matrix D.\n*          On exit, D may be overwritten.\n*\n*  L       (input/output) REAL             array, dimension (N)\n*          On entry, the (N-1) subdiagonal elements of the unit\n*          bidiagonal matrix L are in elements 1 to N-1 of L\n*          (if the matrix is not splitted.) At the end of each block\n*          is stored the corresponding shift as given by SLARRE.\n*          On exit, L is overwritten.\n*\n*  PIVMIN  (in) DOUBLE PRECISION\n*          The minimum pivot allowed in the Sturm sequence.\n*\n*  ISPLIT  (input) 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\n*          ISPLIT( 1 ), the second of rows/columns ISPLIT( 1 )+1\n*          through ISPLIT( 2 ), etc.\n*\n*  M       (input) INTEGER\n*          The total number of input eigenvalues.  0 <= M <= N.\n*\n*  DOL     (input) INTEGER\n*  DOU     (input) INTEGER\n*          If the user wants to compute only selected eigenvectors from all\n*          the eigenvalues supplied, he can specify an index range DOL:DOU.\n*          Or else the setting DOL=1, DOU=M should be applied.\n*          Note that DOL and DOU refer to the order in which the eigenvalues\n*          are stored in W.\n*          If the user wants to compute only selected eigenpairs, then\n*          the columns DOL-1 to DOU+1 of the eigenvector space Z contain the\n*          computed eigenvectors. All other columns of Z are set to zero.\n*\n*  MINRGP  (input) REAL            \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*  W       (input/output) REAL             array, dimension (N)\n*          The first M elements of W contain the APPROXIMATE eigenvalues for\n*          which eigenvectors are to be computed.  The eigenvalues\n*          should be grouped by split-off block and ordered from\n*          smallest to largest within the block ( The output array\n*          W from SLARRE is expected here ). Furthermore, they are with\n*          respect to the shift of the corresponding root representation\n*          for their block. On exit, W holds the eigenvalues of the\n*          UNshifted matrix.\n*\n*  WERR    (input/output) REAL             array, dimension (N)\n*          The first M elements contain the semiwidth of the uncertainty\n*          interval of the corresponding eigenvalue in W\n*\n*  WGAP    (input/output) REAL             array, dimension (N)\n*          The separation from the right neighbor eigenvalue in W.\n*\n*  IBLOCK  (input) 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  (input) 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 the second block.\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)). The Gerschgorin intervals should\n*          be computed from the original UNshifted matrix.\n*\n*  Z       (output) COMPLEX          array, dimension (LDZ, max(1,M) )\n*          If INFO = 0, the first M columns of Z contain the\n*          orthonormal eigenvectors of the matrix T\n*          corresponding to the input eigenvalues, with the i-th\n*          column of Z holding the eigenvector associated with W(i).\n*          Note: the user must ensure that at least max(1,M) columns are\n*          supplied in the array Z.\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*  ISUPPZ  (output) INTEGER array, dimension ( 2*max(1,M) )\n*          The support of the eigenvectors in Z, i.e., the indices\n*          indicating the nonzero elements in Z. The I-th eigenvector\n*          is nonzero only in elements ISUPPZ( 2*I-1 ) through\n*          ISUPPZ( 2*I ).\n*\n*  WORK    (workspace) REAL             array, dimension (12*N)\n*\n*  IWORK   (workspace) INTEGER array, dimension (7*N)\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*\n*          > 0:  A problem occured in CLARRV.\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 SLARRB when refining a child's eigenvalues.\n*          =-2:  Problem in SLARRF when computing the RRR of a child.\n*                When a child is inside a tight cluster, it can be difficult\n*                to find an RRR. A partial remedy from the user's point of\n*                view is to make the parameter MINRGP smaller and recompile.\n*                However, as the orthogonality of the computed vectors is\n*                proportional to 1/MINRGP, the user should be aware that\n*                he might be trading in precision when he decreases MINRGP.\n*          =-3:  Problem in SLARRB when refining a single eigenvalue\n*                after the Rayleigh correction was rejected.\n*          = 5:  The Rayleigh Quotient Iteration failed to converge to\n*                full accuracy in MAXITR steps.\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  z, isuppz, info, d, l, w, werr, wgap = NumRu::Lapack.clarrv( vl, vu, d, l, pivmin, isplit, m, dol, dou, minrgp, rtol1, rtol2, w, werr, wgap, iblock, indexw, gers, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 18 && argc != 18)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 18)", argc);
+  rblapack_vl = argv[0];
+  rblapack_vu = argv[1];
+  rblapack_d = argv[2];
+  rblapack_l = argv[3];
+  rblapack_pivmin = argv[4];
+  rblapack_isplit = argv[5];
+  rblapack_m = argv[6];
+  rblapack_dol = argv[7];
+  rblapack_dou = argv[8];
+  rblapack_minrgp = argv[9];
+  rblapack_rtol1 = argv[10];
+  rblapack_rtol2 = argv[11];
+  rblapack_w = argv[12];
+  rblapack_werr = argv[13];
+  rblapack_wgap = argv[14];
+  rblapack_iblock = argv[15];
+  rblapack_indexw = argv[16];
+  rblapack_gers = argv[17];
+  if (argc == 18) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  vl = (real)NUM2DBL(rblapack_vl);
+  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*);
+  pivmin = (real)NUM2DBL(rblapack_pivmin);
+  m = NUM2INT(rblapack_m);
+  dou = NUM2INT(rblapack_dou);
+  rtol1 = (real)NUM2DBL(rblapack_rtol1);
+  if (!NA_IsNArray(rblapack_w))
+    rb_raise(rb_eArgError, "w (13th argument) must be NArray");
+  if (NA_RANK(rblapack_w) != 1)
+    rb_raise(rb_eArgError, "rank of w (13th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_w) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of w must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_w) != NA_SFLOAT)
+    rblapack_w = na_change_type(rblapack_w, NA_SFLOAT);
+  w = NA_PTR_TYPE(rblapack_w, real*);
+  if (!NA_IsNArray(rblapack_wgap))
+    rb_raise(rb_eArgError, "wgap (15th argument) must be NArray");
+  if (NA_RANK(rblapack_wgap) != 1)
+    rb_raise(rb_eArgError, "rank of wgap (15th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_wgap) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of wgap must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_wgap) != NA_SFLOAT)
+    rblapack_wgap = na_change_type(rblapack_wgap, NA_SFLOAT);
+  wgap = NA_PTR_TYPE(rblapack_wgap, real*);
+  if (!NA_IsNArray(rblapack_indexw))
+    rb_raise(rb_eArgError, "indexw (17th argument) must be NArray");
+  if (NA_RANK(rblapack_indexw) != 1)
+    rb_raise(rb_eArgError, "rank of indexw (17th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_indexw) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of indexw must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_indexw) != NA_LINT)
+    rblapack_indexw = na_change_type(rblapack_indexw, NA_LINT);
+  indexw = NA_PTR_TYPE(rblapack_indexw, integer*);
+  vu = (real)NUM2DBL(rblapack_vu);
+  if (!NA_IsNArray(rblapack_isplit))
+    rb_raise(rb_eArgError, "isplit (6th argument) must be NArray");
+  if (NA_RANK(rblapack_isplit) != 1)
+    rb_raise(rb_eArgError, "rank of isplit (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_isplit) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of isplit must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_isplit) != NA_LINT)
+    rblapack_isplit = na_change_type(rblapack_isplit, NA_LINT);
+  isplit = NA_PTR_TYPE(rblapack_isplit, integer*);
+  minrgp = (real)NUM2DBL(rblapack_minrgp);
+  if (!NA_IsNArray(rblapack_werr))
+    rb_raise(rb_eArgError, "werr (14th argument) must be NArray");
+  if (NA_RANK(rblapack_werr) != 1)
+    rb_raise(rb_eArgError, "rank of werr (14th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_werr) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of werr must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_werr) != NA_SFLOAT)
+    rblapack_werr = na_change_type(rblapack_werr, NA_SFLOAT);
+  werr = NA_PTR_TYPE(rblapack_werr, real*);
+  if (!NA_IsNArray(rblapack_l))
+    rb_raise(rb_eArgError, "l (4th argument) must be NArray");
+  if (NA_RANK(rblapack_l) != 1)
+    rb_raise(rb_eArgError, "rank of l (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_l) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of l must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_l) != NA_SFLOAT)
+    rblapack_l = na_change_type(rblapack_l, NA_SFLOAT);
+  l = NA_PTR_TYPE(rblapack_l, real*);
+  rtol2 = (real)NUM2DBL(rblapack_rtol2);
+  dol = NUM2INT(rblapack_dol);
+  if (!NA_IsNArray(rblapack_iblock))
+    rb_raise(rb_eArgError, "iblock (16th argument) must be NArray");
+  if (NA_RANK(rblapack_iblock) != 1)
+    rb_raise(rb_eArgError, "rank of iblock (16th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_iblock) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of iblock must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_iblock) != NA_LINT)
+    rblapack_iblock = na_change_type(rblapack_iblock, NA_LINT);
+  iblock = NA_PTR_TYPE(rblapack_iblock, integer*);
+  ldz = n;
+  if (!NA_IsNArray(rblapack_gers))
+    rb_raise(rb_eArgError, "gers (18th argument) must be NArray");
+  if (NA_RANK(rblapack_gers) != 1)
+    rb_raise(rb_eArgError, "rank of gers (18th 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*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldz;
+    shape[1] = MAX(1,m);
+    rblapack_z = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  z = NA_PTR_TYPE(rblapack_z, complex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 2*MAX(1,m);
+    rblapack_isuppz = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  isuppz = NA_PTR_TYPE(rblapack_isuppz, 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[1];
+    shape[0] = n;
+    rblapack_l_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  l_out__ = NA_PTR_TYPE(rblapack_l_out__, real*);
+  MEMCPY(l_out__, l, real, NA_TOTAL(rblapack_l));
+  rblapack_l = rblapack_l_out__;
+  l = l_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_w_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  w_out__ = NA_PTR_TYPE(rblapack_w_out__, real*);
+  MEMCPY(w_out__, w, real, NA_TOTAL(rblapack_w));
+  rblapack_w = rblapack_w_out__;
+  w = w_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_werr_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  werr_out__ = NA_PTR_TYPE(rblapack_werr_out__, real*);
+  MEMCPY(werr_out__, werr, real, NA_TOTAL(rblapack_werr));
+  rblapack_werr = rblapack_werr_out__;
+  werr = werr_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_wgap_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  wgap_out__ = NA_PTR_TYPE(rblapack_wgap_out__, real*);
+  MEMCPY(wgap_out__, wgap, real, NA_TOTAL(rblapack_wgap));
+  rblapack_wgap = rblapack_wgap_out__;
+  wgap = wgap_out__;
+  work = ALLOC_N(real, (12*n));
+  iwork = ALLOC_N(integer, (7*n));
+
+  clarrv_(&n, &vl, &vu, d, l, &pivmin, isplit, &m, &dol, &dou, &minrgp, &rtol1, &rtol2, w, werr, wgap, iblock, indexw, gers, z, &ldz, isuppz, work, iwork, &info);
+
+  free(work);
+  free(iwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(8, rblapack_z, rblapack_isuppz, rblapack_info, rblapack_d, rblapack_l, rblapack_w, rblapack_werr, rblapack_wgap);
+}
+
+void
+init_lapack_clarrv(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "clarrv", rblapack_clarrv, -1);
+}