ruby-lapack 1.7 → 1.7.1

data/ext/slapmr.c

@@ -0,0 +1,97 @@
+#include "rb_lapack.h"
+
+extern VOID slapmr_(logical* forwrd, integer* m, integer* n, real* x, integer* ldx, integer* k);
+
+
+static VALUE
+rblapack_slapmr(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_forwrd;
+  logical forwrd; 
+  VALUE rblapack_x;
+  real *x; 
+  VALUE rblapack_k;
+  integer *k; 
+  VALUE rblapack_x_out__;
+  real *x_out__;
+  VALUE rblapack_k_out__;
+  integer *k_out__;
+
+  integer ldx;
+  integer n;
+  integer m;
+
+  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, k = NumRu::Lapack.slapmr( forwrd, x, k, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLAPMR( FORWRD, M, N, X, LDX, K )\n\n*  Purpose\n*  =======\n*\n*  SLAPMR rearranges the rows of the M by N matrix X as specified\n*  by the permutation K(1),K(2),...,K(M) of the integers 1,...,M.\n*  If FORWRD = .TRUE.,  forward permutation:\n*\n*       X(K(I),*) is moved X(I,*) for I = 1,2,...,M.\n*\n*  If FORWRD = .FALSE., backward permutation:\n*\n*       X(I,*) is moved to X(K(I),*) for I = 1,2,...,M.\n*\n\n*  Arguments\n*  =========\n*\n*  FORWRD  (input) LOGICAL\n*          = .TRUE., forward permutation\n*          = .FALSE., backward permutation\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix X. M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix X. N >= 0.\n*\n*  X       (input/output) REAL array, dimension (LDX,N)\n*          On entry, the M by N matrix X.\n*          On exit, X contains the permuted matrix X.\n*\n*  LDX     (input) INTEGER\n*          The leading dimension of the array X, LDX >= MAX(1,M).\n*\n*  K       (input/output) INTEGER array, dimension (M)\n*          On entry, K contains the permutation vector. K is used as\n*          internal workspace, but reset to its original value on\n*          output.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            I, IN, J, JJ\n      REAL               TEMP\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  x, k = NumRu::Lapack.slapmr( forwrd, x, k, [: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_forwrd = argv[0];
+  rblapack_x = argv[1];
+  rblapack_k = argv[2];
+  if (argc == 3) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  forwrd = (rblapack_forwrd == Qtrue);
+  if (!NA_IsNArray(rblapack_k))
+    rb_raise(rb_eArgError, "k (3th argument) must be NArray");
+  if (NA_RANK(rblapack_k) != 1)
+    rb_raise(rb_eArgError, "rank of k (3th argument) must be %d", 1);
+  m = NA_SHAPE0(rblapack_k);
+  if (NA_TYPE(rblapack_k) != NA_LINT)
+    rblapack_k = na_change_type(rblapack_k, NA_LINT);
+  k = NA_PTR_TYPE(rblapack_k, integer*);
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (2th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 2)
+    rb_raise(rb_eArgError, "rank of x (2th argument) must be %d", 2);
+  ldx = NA_SHAPE0(rblapack_x);
+  n = NA_SHAPE1(rblapack_x);
+  if (NA_TYPE(rblapack_x) != NA_SFLOAT)
+    rblapack_x = na_change_type(rblapack_x, NA_SFLOAT);
+  x = NA_PTR_TYPE(rblapack_x, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldx;
+    shape[1] = n;
+    rblapack_x_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  x_out__ = NA_PTR_TYPE(rblapack_x_out__, real*);
+  MEMCPY(x_out__, x, real, NA_TOTAL(rblapack_x));
+  rblapack_x = rblapack_x_out__;
+  x = x_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_k_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  k_out__ = NA_PTR_TYPE(rblapack_k_out__, integer*);
+  MEMCPY(k_out__, k, integer, NA_TOTAL(rblapack_k));
+  rblapack_k = rblapack_k_out__;
+  k = k_out__;
+
+  slapmr_(&forwrd, &m, &n, x, &ldx, k);
+
+  return rb_ary_new3(2, rblapack_x, rblapack_k);
+}
+
+void
+init_lapack_slapmr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slapmr", rblapack_slapmr, -1);
+}

data/ext/slapmt.c

@@ -0,0 +1,101 @@
+#include "rb_lapack.h"
+
+extern VOID slapmt_(logical* forwrd, integer* m, integer* n, real* x, integer* ldx, integer* k);
+
+
+static VALUE
+rblapack_slapmt(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_forwrd;
+  logical forwrd; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_x;
+  real *x; 
+  VALUE rblapack_k;
+  integer *k; 
+  VALUE rblapack_x_out__;
+  real *x_out__;
+  VALUE rblapack_k_out__;
+  integer *k_out__;
+
+  integer ldx;
+  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  x, k = NumRu::Lapack.slapmt( forwrd, m, x, k, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLAPMT( FORWRD, M, N, X, LDX, K )\n\n*  Purpose\n*  =======\n*\n*  SLAPMT rearranges the columns of the M by N matrix X as specified\n*  by the permutation K(1),K(2),...,K(N) of the integers 1,...,N.\n*  If FORWRD = .TRUE.,  forward permutation:\n*\n*       X(*,K(J)) is moved X(*,J) for J = 1,2,...,N.\n*\n*  If FORWRD = .FALSE., backward permutation:\n*\n*       X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.\n*\n\n*  Arguments\n*  =========\n*\n*  FORWRD  (input) LOGICAL\n*          = .TRUE., forward permutation\n*          = .FALSE., backward permutation\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix X. M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix X. N >= 0.\n*\n*  X       (input/output) REAL array, dimension (LDX,N)\n*          On entry, the M by N matrix X.\n*          On exit, X contains the permuted matrix X.\n*\n*  LDX     (input) INTEGER\n*          The leading dimension of the array X, LDX >= MAX(1,M).\n*\n*  K       (input/output) INTEGER array, dimension (N)\n*          On entry, K contains the permutation vector. K is used as\n*          internal workspace, but reset to its original value on\n*          output.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            I, II, J, IN\n      REAL               TEMP\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  x, k = NumRu::Lapack.slapmt( forwrd, m, x, k, [: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_forwrd = argv[0];
+  rblapack_m = argv[1];
+  rblapack_x = argv[2];
+  rblapack_k = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  forwrd = (rblapack_forwrd == Qtrue);
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (3th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 2)
+    rb_raise(rb_eArgError, "rank of x (3th argument) must be %d", 2);
+  ldx = NA_SHAPE0(rblapack_x);
+  n = NA_SHAPE1(rblapack_x);
+  if (NA_TYPE(rblapack_x) != NA_SFLOAT)
+    rblapack_x = na_change_type(rblapack_x, NA_SFLOAT);
+  x = NA_PTR_TYPE(rblapack_x, real*);
+  m = NUM2INT(rblapack_m);
+  if (!NA_IsNArray(rblapack_k))
+    rb_raise(rb_eArgError, "k (4th argument) must be NArray");
+  if (NA_RANK(rblapack_k) != 1)
+    rb_raise(rb_eArgError, "rank of k (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_k) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of k must be the same as shape 1 of x");
+  if (NA_TYPE(rblapack_k) != NA_LINT)
+    rblapack_k = na_change_type(rblapack_k, NA_LINT);
+  k = NA_PTR_TYPE(rblapack_k, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldx;
+    shape[1] = n;
+    rblapack_x_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  x_out__ = NA_PTR_TYPE(rblapack_x_out__, real*);
+  MEMCPY(x_out__, x, real, NA_TOTAL(rblapack_x));
+  rblapack_x = rblapack_x_out__;
+  x = x_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_k_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  k_out__ = NA_PTR_TYPE(rblapack_k_out__, integer*);
+  MEMCPY(k_out__, k, integer, NA_TOTAL(rblapack_k));
+  rblapack_k = rblapack_k_out__;
+  k = k_out__;
+
+  slapmt_(&forwrd, &m, &n, x, &ldx, k);
+
+  return rb_ary_new3(2, rblapack_x, rblapack_k);
+}
+
+void
+init_lapack_slapmt(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slapmt", rblapack_slapmt, -1);
+}

data/ext/slapy2.c

@@ -0,0 +1,55 @@
+#include "rb_lapack.h"
+
+extern real slapy2_(real* x, real* y);
+
+
+static VALUE
+rblapack_slapy2(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_x;
+  real x; 
+  VALUE rblapack_y;
+  real y; 
+  VALUE rblapack___out__;
+  real __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  __out__ = NumRu::Lapack.slapy2( x, y, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      REAL             FUNCTION SLAPY2( X, Y )\n\n*  Purpose\n*  =======\n*\n*  SLAPY2 returns sqrt(x**2+y**2), taking care not to cause unnecessary\n*  overflow.\n*\n\n*  Arguments\n*  =========\n*\n*  X       (input) REAL\n*  Y       (input) REAL\n*          X and Y specify the values x and y.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  __out__ = NumRu::Lapack.slapy2( x, y, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 2 && argc != 2)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 2)", argc);
+  rblapack_x = argv[0];
+  rblapack_y = argv[1];
+  if (argc == 2) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  x = (real)NUM2DBL(rblapack_x);
+  y = (real)NUM2DBL(rblapack_y);
+
+  __out__ = slapy2_(&x, &y);
+
+  rblapack___out__ = rb_float_new((double)__out__);
+  return rblapack___out__;
+}
+
+void
+init_lapack_slapy2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slapy2", rblapack_slapy2, -1);
+}

data/ext/slapy3.c

@@ -0,0 +1,59 @@
+#include "rb_lapack.h"
+
+extern real slapy3_(real* x, real* y, real* z);
+
+
+static VALUE
+rblapack_slapy3(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_x;
+  real x; 
+  VALUE rblapack_y;
+  real y; 
+  VALUE rblapack_z;
+  real z; 
+  VALUE rblapack___out__;
+  real __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  __out__ = NumRu::Lapack.slapy3( x, y, z, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      REAL             FUNCTION SLAPY3( X, Y, Z )\n\n*  Purpose\n*  =======\n*\n*  SLAPY3 returns sqrt(x**2+y**2+z**2), taking care not to cause\n*  unnecessary overflow.\n*\n\n*  Arguments\n*  =========\n*\n*  X       (input) REAL\n*  Y       (input) REAL\n*  Z       (input) REAL\n*          X, Y and Z specify the values x, y and z.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  __out__ = NumRu::Lapack.slapy3( x, y, z, [: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_x = argv[0];
+  rblapack_y = argv[1];
+  rblapack_z = argv[2];
+  if (argc == 3) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  x = (real)NUM2DBL(rblapack_x);
+  z = (real)NUM2DBL(rblapack_z);
+  y = (real)NUM2DBL(rblapack_y);
+
+  __out__ = slapy3_(&x, &y, &z);
+
+  rblapack___out__ = rb_float_new((double)__out__);
+  return rblapack___out__;
+}
+
+void
+init_lapack_slapy3(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slapy3", rblapack_slapy3, -1);
+}

data/ext/slaqgb.c

@@ -0,0 +1,117 @@
+#include "rb_lapack.h"
+
+extern VOID slaqgb_(integer* m, integer* n, integer* kl, integer* ku, real* ab, integer* ldab, real* r, real* c, real* rowcnd, real* colcnd, real* amax, char* equed);
+
+
+static VALUE
+rblapack_slaqgb(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_kl;
+  integer kl; 
+  VALUE rblapack_ku;
+  integer ku; 
+  VALUE rblapack_ab;
+  real *ab; 
+  VALUE rblapack_r;
+  real *r; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_rowcnd;
+  real rowcnd; 
+  VALUE rblapack_colcnd;
+  real colcnd; 
+  VALUE rblapack_amax;
+  real amax; 
+  VALUE rblapack_equed;
+  char equed; 
+  VALUE rblapack_ab_out__;
+  real *ab_out__;
+
+  integer ldab;
+  integer n;
+  integer m;
+
+  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  equed, ab = NumRu::Lapack.slaqgb( kl, ku, ab, r, c, rowcnd, colcnd, amax, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, AMAX, EQUED )\n\n*  Purpose\n*  =======\n*\n*  SLAQGB equilibrates a general M by N band matrix A with KL\n*  subdiagonals and KU superdiagonals using the row and scaling factors\n*  in the vectors R and C.\n*\n\n*  Arguments\n*  =========\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix A.  M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix A.  N >= 0.\n*\n*  KL      (input) INTEGER\n*          The number of subdiagonals within the band of A.  KL >= 0.\n*\n*  KU      (input) INTEGER\n*          The number of superdiagonals within the band of A.  KU >= 0.\n*\n*  AB      (input/output) REAL array, dimension (LDAB,N)\n*          On entry, the matrix A in band storage, in rows 1 to KL+KU+1.\n*          The j-th column of A is stored in the j-th column of the\n*          array AB as follows:\n*          AB(ku+1+i-j,j) = A(i,j) for max(1,j-ku)<=i<=min(m,j+kl)\n*\n*          On exit, the equilibrated matrix, in the same storage format\n*          as A.  See EQUED for the form of the equilibrated matrix.\n*\n*  LDAB    (input) INTEGER\n*          The leading dimension of the array AB.  LDA >= KL+KU+1.\n*\n*  R       (input) REAL array, dimension (M)\n*          The row scale factors for A.\n*\n*  C       (input) REAL array, dimension (N)\n*          The column scale factors for A.\n*\n*  ROWCND  (input) REAL\n*          Ratio of the smallest R(i) to the largest R(i).\n*\n*  COLCND  (input) REAL\n*          Ratio of the smallest C(i) to the largest C(i).\n*\n*  AMAX    (input) REAL\n*          Absolute value of largest matrix entry.\n*\n*  EQUED   (output) CHARACTER*1\n*          Specifies the form of equilibration that was done.\n*          = 'N':  No equilibration\n*          = 'R':  Row equilibration, i.e., A has been premultiplied by\n*                  diag(R).\n*          = 'C':  Column equilibration, i.e., A has been postmultiplied\n*                  by diag(C).\n*          = 'B':  Both row and column equilibration, i.e., A has been\n*                  replaced by diag(R) * A * diag(C).\n*\n*  Internal Parameters\n*  ===================\n*\n*  THRESH is a threshold value used to decide if row or column scaling\n*  should be done based on the ratio of the row or column scaling\n*  factors.  If ROWCND < THRESH, row scaling is done, and if\n*  COLCND < THRESH, column scaling is done.\n*\n*  LARGE and SMALL are threshold values used to decide if row scaling\n*  should be done based on the absolute size of the largest matrix\n*  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  equed, ab = NumRu::Lapack.slaqgb( kl, ku, ab, r, c, rowcnd, colcnd, amax, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 8 && argc != 8)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 8)", argc);
+  rblapack_kl = argv[0];
+  rblapack_ku = argv[1];
+  rblapack_ab = argv[2];
+  rblapack_r = argv[3];
+  rblapack_c = argv[4];
+  rblapack_rowcnd = argv[5];
+  rblapack_colcnd = argv[6];
+  rblapack_amax = argv[7];
+  if (argc == 8) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  kl = NUM2INT(rblapack_kl);
+  if (!NA_IsNArray(rblapack_ab))
+    rb_raise(rb_eArgError, "ab (3th argument) must be NArray");
+  if (NA_RANK(rblapack_ab) != 2)
+    rb_raise(rb_eArgError, "rank of ab (3th argument) must be %d", 2);
+  ldab = NA_SHAPE0(rblapack_ab);
+  n = NA_SHAPE1(rblapack_ab);
+  if (NA_TYPE(rblapack_ab) != NA_SFLOAT)
+    rblapack_ab = na_change_type(rblapack_ab, NA_SFLOAT);
+  ab = NA_PTR_TYPE(rblapack_ab, real*);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (5th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (5th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_c) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of c must be the same as shape 1 of ab");
+  if (NA_TYPE(rblapack_c) != NA_SFLOAT)
+    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  colcnd = (real)NUM2DBL(rblapack_colcnd);
+  ku = NUM2INT(rblapack_ku);
+  rowcnd = (real)NUM2DBL(rblapack_rowcnd);
+  if (!NA_IsNArray(rblapack_r))
+    rb_raise(rb_eArgError, "r (4th argument) must be NArray");
+  if (NA_RANK(rblapack_r) != 1)
+    rb_raise(rb_eArgError, "rank of r (4th argument) must be %d", 1);
+  m = NA_SHAPE0(rblapack_r);
+  if (NA_TYPE(rblapack_r) != NA_SFLOAT)
+    rblapack_r = na_change_type(rblapack_r, NA_SFLOAT);
+  r = NA_PTR_TYPE(rblapack_r, real*);
+  amax = (real)NUM2DBL(rblapack_amax);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldab;
+    shape[1] = n;
+    rblapack_ab_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  ab_out__ = NA_PTR_TYPE(rblapack_ab_out__, real*);
+  MEMCPY(ab_out__, ab, real, NA_TOTAL(rblapack_ab));
+  rblapack_ab = rblapack_ab_out__;
+  ab = ab_out__;
+
+  slaqgb_(&m, &n, &kl, &ku, ab, &ldab, r, c, &rowcnd, &colcnd, &amax, &equed);
+
+  rblapack_equed = rb_str_new(&equed,1);
+  return rb_ary_new3(2, rblapack_equed, rblapack_ab);
+}
+
+void
+init_lapack_slaqgb(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slaqgb", rblapack_slaqgb, -1);
+}

data/ext/slaqge.c

@@ -0,0 +1,109 @@
+#include "rb_lapack.h"
+
+extern VOID slaqge_(integer* m, integer* n, real* a, integer* lda, real* r, real* c, real* rowcnd, real* colcnd, real* amax, char* equed);
+
+
+static VALUE
+rblapack_slaqge(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_a;
+  real *a; 
+  VALUE rblapack_r;
+  real *r; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_rowcnd;
+  real rowcnd; 
+  VALUE rblapack_colcnd;
+  real colcnd; 
+  VALUE rblapack_amax;
+  real amax; 
+  VALUE rblapack_equed;
+  char equed; 
+  VALUE rblapack_a_out__;
+  real *a_out__;
+
+  integer lda;
+  integer n;
+  integer m;
+
+  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  equed, a = NumRu::Lapack.slaqge( a, r, c, rowcnd, colcnd, amax, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, EQUED )\n\n*  Purpose\n*  =======\n*\n*  SLAQGE equilibrates a general M by N matrix A using the row and\n*  column scaling factors in the vectors R and C.\n*\n\n*  Arguments\n*  =========\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix A.  M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix A.  N >= 0.\n*\n*  A       (input/output) REAL array, dimension (LDA,N)\n*          On entry, the M by N matrix A.\n*          On exit, the equilibrated matrix.  See EQUED for the form of\n*          the equilibrated matrix.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(M,1).\n*\n*  R       (input) REAL array, dimension (M)\n*          The row scale factors for A.\n*\n*  C       (input) REAL array, dimension (N)\n*          The column scale factors for A.\n*\n*  ROWCND  (input) REAL\n*          Ratio of the smallest R(i) to the largest R(i).\n*\n*  COLCND  (input) REAL\n*          Ratio of the smallest C(i) to the largest C(i).\n*\n*  AMAX    (input) REAL\n*          Absolute value of largest matrix entry.\n*\n*  EQUED   (output) CHARACTER*1\n*          Specifies the form of equilibration that was done.\n*          = 'N':  No equilibration\n*          = 'R':  Row equilibration, i.e., A has been premultiplied by\n*                  diag(R).\n*          = 'C':  Column equilibration, i.e., A has been postmultiplied\n*                  by diag(C).\n*          = 'B':  Both row and column equilibration, i.e., A has been\n*                  replaced by diag(R) * A * diag(C).\n*\n*  Internal Parameters\n*  ===================\n*\n*  THRESH is a threshold value used to decide if row or column scaling\n*  should be done based on the ratio of the row or column scaling\n*  factors.  If ROWCND < THRESH, row scaling is done, and if\n*  COLCND < THRESH, column scaling is done.\n*\n*  LARGE and SMALL are threshold values used to decide if row scaling\n*  should be done based on the absolute size of the largest matrix\n*  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  equed, a = NumRu::Lapack.slaqge( a, r, c, rowcnd, colcnd, amax, [: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_a = argv[0];
+  rblapack_r = argv[1];
+  rblapack_c = argv[2];
+  rblapack_rowcnd = argv[3];
+  rblapack_colcnd = argv[4];
+  rblapack_amax = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  if (!NA_IsNArray(rblapack_a))
+    rb_raise(rb_eArgError, "a (1th argument) must be NArray");
+  if (NA_RANK(rblapack_a) != 2)
+    rb_raise(rb_eArgError, "rank of a (1th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_a);
+  n = NA_SHAPE1(rblapack_a);
+  if (NA_TYPE(rblapack_a) != NA_SFLOAT)
+    rblapack_a = na_change_type(rblapack_a, NA_SFLOAT);
+  a = NA_PTR_TYPE(rblapack_a, real*);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (3th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (3th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_c) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of c must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_c) != NA_SFLOAT)
+    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  colcnd = (real)NUM2DBL(rblapack_colcnd);
+  if (!NA_IsNArray(rblapack_r))
+    rb_raise(rb_eArgError, "r (2th argument) must be NArray");
+  if (NA_RANK(rblapack_r) != 1)
+    rb_raise(rb_eArgError, "rank of r (2th argument) must be %d", 1);
+  m = NA_SHAPE0(rblapack_r);
+  if (NA_TYPE(rblapack_r) != NA_SFLOAT)
+    rblapack_r = na_change_type(rblapack_r, NA_SFLOAT);
+  r = NA_PTR_TYPE(rblapack_r, real*);
+  amax = (real)NUM2DBL(rblapack_amax);
+  rowcnd = (real)NUM2DBL(rblapack_rowcnd);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, real*);
+  MEMCPY(a_out__, a, real, NA_TOTAL(rblapack_a));
+  rblapack_a = rblapack_a_out__;
+  a = a_out__;
+
+  slaqge_(&m, &n, a, &lda, r, c, &rowcnd, &colcnd, &amax, &equed);
+
+  rblapack_equed = rb_str_new(&equed,1);
+  return rb_ary_new3(2, rblapack_equed, rblapack_a);
+}
+
+void
+init_lapack_slaqge(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slaqge", rblapack_slaqge, -1);
+}