ruby-lapack 1.7 → 1.7.1

data/ext/zlarf.c

@@ -0,0 +1,102 @@
+#include "rb_lapack.h"
+
+extern VOID zlarf_(char* side, integer* m, integer* n, doublecomplex* v, integer* incv, doublecomplex* tau, doublecomplex* c, integer* ldc, doublecomplex* work);
+
+
+static VALUE
+rblapack_zlarf(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_side;
+  char side; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_v;
+  doublecomplex *v; 
+  VALUE rblapack_incv;
+  integer incv; 
+  VALUE rblapack_tau;
+  doublecomplex tau; 
+  VALUE rblapack_c;
+  doublecomplex *c; 
+  VALUE rblapack_c_out__;
+  doublecomplex *c_out__;
+  doublecomplex *work;
+
+  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.zlarf( side, m, v, incv, tau, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK )\n\n*  Purpose\n*  =======\n*\n*  ZLARF 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*  To apply H' (the conjugate transpose of H), supply conjg(tau) instead\n*  tau.\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*16 array, dimension\n*                     (1 + (M-1)*abs(INCV)) if SIDE = 'L'\n*                  or (1 + (N-1)*abs(INCV)) if SIDE = 'R'\n*          The vector v in the representation of H. V is not used if\n*          TAU = 0.\n*\n*  INCV    (input) INTEGER\n*          The increment between elements of v. INCV <> 0.\n*\n*  TAU     (input) COMPLEX*16\n*          The value tau in the representation of H.\n*\n*  C       (input/output) COMPLEX*16 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. LDC >= max(1,M).\n*\n*  WORK    (workspace) COMPLEX*16 array, dimension\n*                         (N) if SIDE = 'L'\n*                      or (M) if SIDE = 'R'\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  c = NumRu::Lapack.zlarf( side, m, v, incv, tau, c, [: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_side = argv[0];
+  rblapack_m = argv[1];
+  rblapack_v = argv[2];
+  rblapack_incv = argv[3];
+  rblapack_tau = argv[4];
+  rblapack_c = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  side = StringValueCStr(rblapack_side)[0];
+  incv = NUM2INT(rblapack_incv);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (6th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 2)
+    rb_raise(rb_eArgError, "rank of c (6th argument) must be %d", 2);
+  ldc = NA_SHAPE0(rblapack_c);
+  n = NA_SHAPE1(rblapack_c);
+  if (NA_TYPE(rblapack_c) != NA_DCOMPLEX)
+    rblapack_c = na_change_type(rblapack_c, NA_DCOMPLEX);
+  c = NA_PTR_TYPE(rblapack_c, doublecomplex*);
+  m = NUM2INT(rblapack_m);
+  tau.r = NUM2DBL(rb_funcall(rblapack_tau, rb_intern("real"), 0));
+  tau.i = NUM2DBL(rb_funcall(rblapack_tau, rb_intern("imag"), 0));
+  if (!NA_IsNArray(rblapack_v))
+    rb_raise(rb_eArgError, "v (3th argument) must be NArray");
+  if (NA_RANK(rblapack_v) != 1)
+    rb_raise(rb_eArgError, "rank of v (3th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_v) != (1 + (m-1)*abs(incv)))
+    rb_raise(rb_eRuntimeError, "shape 0 of v must be %d", 1 + (m-1)*abs(incv));
+  if (NA_TYPE(rblapack_v) != NA_DCOMPLEX)
+    rblapack_v = na_change_type(rblapack_v, NA_DCOMPLEX);
+  v = NA_PTR_TYPE(rblapack_v, doublecomplex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldc;
+    shape[1] = n;
+    rblapack_c_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  c_out__ = NA_PTR_TYPE(rblapack_c_out__, doublecomplex*);
+  MEMCPY(c_out__, c, doublecomplex, NA_TOTAL(rblapack_c));
+  rblapack_c = rblapack_c_out__;
+  c = c_out__;
+  work = ALLOC_N(doublecomplex, (lsame_(&side,"L") ? n : lsame_(&side,"R") ? m : 0));
+
+  zlarf_(&side, &m, &n, v, &incv, &tau, c, &ldc, work);
+
+  free(work);
+  return rblapack_c;
+}
+
+void
+init_lapack_zlarf(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlarf", rblapack_zlarf, -1);
+}

data/ext/zlarfb.c

@@ -0,0 +1,123 @@
+#include "rb_lapack.h"
+
+extern VOID zlarfb_(char* side, char* trans, char* direct, char* storev, integer* m, integer* n, integer* k, doublecomplex* v, integer* ldv, doublecomplex* t, integer* ldt, doublecomplex* c, integer* ldc, doublecomplex* work, integer* ldwork);
+
+
+static VALUE
+rblapack_zlarfb(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_side;
+  char side; 
+  VALUE rblapack_trans;
+  char trans; 
+  VALUE rblapack_direct;
+  char direct; 
+  VALUE rblapack_storev;
+  char storev; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_v;
+  doublecomplex *v; 
+  VALUE rblapack_t;
+  doublecomplex *t; 
+  VALUE rblapack_c;
+  doublecomplex *c; 
+  VALUE rblapack_c_out__;
+  doublecomplex *c_out__;
+  doublecomplex *work;
+
+  integer ldv;
+  integer k;
+  integer ldt;
+  integer ldc;
+  integer n;
+  integer ldwork;
+
+  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.zlarfb( side, trans, direct, storev, m, v, t, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, T, LDT, C, LDC, WORK, LDWORK )\n\n*  Purpose\n*  =======\n*\n*  ZLARFB applies a complex block reflector H or its transpose H' to a\n*  complex M-by-N matrix C, from either the left or the right.\n*\n\n*  Arguments\n*  =========\n*\n*  SIDE    (input) CHARACTER*1\n*          = 'L': apply H or H' from the Left\n*          = 'R': apply H or H' from the Right\n*\n*  TRANS   (input) CHARACTER*1\n*          = 'N': apply H (No transpose)\n*          = 'C': apply H' (Conjugate transpose)\n*\n*  DIRECT  (input) CHARACTER*1\n*          Indicates how H is formed from a product of elementary\n*          reflectors\n*          = 'F': H = H(1) H(2) . . . H(k) (Forward)\n*          = 'B': H = H(k) . . . H(2) H(1) (Backward)\n*\n*  STOREV  (input) CHARACTER*1\n*          Indicates how the vectors which define the elementary\n*          reflectors are stored:\n*          = 'C': Columnwise\n*          = 'R': Rowwise\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*  K       (input) INTEGER\n*          The order of the matrix T (= the number of elementary\n*          reflectors whose product defines the block reflector).\n*\n*  V       (input) COMPLEX*16 array, dimension\n*                                (LDV,K) if STOREV = 'C'\n*                                (LDV,M) if STOREV = 'R' and SIDE = 'L'\n*                                (LDV,N) if STOREV = 'R' and SIDE = 'R'\n*          The matrix V. See further details.\n*\n*  LDV     (input) INTEGER\n*          The leading dimension of the array V.\n*          If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M);\n*          if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N);\n*          if STOREV = 'R', LDV >= K.\n*\n*  T       (input) COMPLEX*16 array, dimension (LDT,K)\n*          The triangular K-by-K matrix T in the representation of the\n*          block reflector.\n*\n*  LDT     (input) INTEGER\n*          The leading dimension of the array T. LDT >= K.\n*\n*  C       (input/output) COMPLEX*16 array, dimension (LDC,N)\n*          On entry, the M-by-N matrix C.\n*          On exit, C is overwritten by H*C or H'*C or C*H or C*H'.\n*\n*  LDC     (input) INTEGER\n*          The leading dimension of the array C. LDC >= max(1,M).\n*\n*  WORK    (workspace) COMPLEX*16 array, dimension (LDWORK,K)\n*\n*  LDWORK  (input) INTEGER\n*          The leading dimension of the array WORK.\n*          If SIDE = 'L', LDWORK >= max(1,N);\n*          if SIDE = 'R', LDWORK >= max(1,M).\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  c = NumRu::Lapack.zlarfb( side, trans, direct, storev, m, v, t, c, [: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_side = argv[0];
+  rblapack_trans = argv[1];
+  rblapack_direct = argv[2];
+  rblapack_storev = argv[3];
+  rblapack_m = argv[4];
+  rblapack_v = argv[5];
+  rblapack_t = argv[6];
+  rblapack_c = argv[7];
+  if (argc == 8) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  side = StringValueCStr(rblapack_side)[0];
+  direct = StringValueCStr(rblapack_direct)[0];
+  m = NUM2INT(rblapack_m);
+  if (!NA_IsNArray(rblapack_t))
+    rb_raise(rb_eArgError, "t (7th argument) must be NArray");
+  if (NA_RANK(rblapack_t) != 2)
+    rb_raise(rb_eArgError, "rank of t (7th argument) must be %d", 2);
+  ldt = NA_SHAPE0(rblapack_t);
+  k = NA_SHAPE1(rblapack_t);
+  if (NA_TYPE(rblapack_t) != NA_DCOMPLEX)
+    rblapack_t = na_change_type(rblapack_t, NA_DCOMPLEX);
+  t = NA_PTR_TYPE(rblapack_t, doublecomplex*);
+  trans = StringValueCStr(rblapack_trans)[0];
+  if (!NA_IsNArray(rblapack_v))
+    rb_raise(rb_eArgError, "v (6th argument) must be NArray");
+  if (NA_RANK(rblapack_v) != 2)
+    rb_raise(rb_eArgError, "rank of v (6th argument) must be %d", 2);
+  ldv = NA_SHAPE0(rblapack_v);
+  if (NA_SHAPE1(rblapack_v) != k)
+    rb_raise(rb_eRuntimeError, "shape 1 of v must be the same as shape 1 of t");
+  if (NA_TYPE(rblapack_v) != NA_DCOMPLEX)
+    rblapack_v = na_change_type(rblapack_v, NA_DCOMPLEX);
+  v = NA_PTR_TYPE(rblapack_v, doublecomplex*);
+  storev = StringValueCStr(rblapack_storev)[0];
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (8th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 2)
+    rb_raise(rb_eArgError, "rank of c (8th argument) must be %d", 2);
+  ldc = NA_SHAPE0(rblapack_c);
+  n = NA_SHAPE1(rblapack_c);
+  if (NA_TYPE(rblapack_c) != NA_DCOMPLEX)
+    rblapack_c = na_change_type(rblapack_c, NA_DCOMPLEX);
+  c = NA_PTR_TYPE(rblapack_c, doublecomplex*);
+  ldwork = MAX(1,n) ? side = 'l' : MAX(1,m) ? side = 'r' : 0;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldc;
+    shape[1] = n;
+    rblapack_c_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  c_out__ = NA_PTR_TYPE(rblapack_c_out__, doublecomplex*);
+  MEMCPY(c_out__, c, doublecomplex, NA_TOTAL(rblapack_c));
+  rblapack_c = rblapack_c_out__;
+  c = c_out__;
+  work = ALLOC_N(doublecomplex, (ldwork)*(k));
+
+  zlarfb_(&side, &trans, &direct, &storev, &m, &n, &k, v, &ldv, t, &ldt, c, &ldc, work, &ldwork);
+
+  free(work);
+  return rblapack_c;
+}
+
+void
+init_lapack_zlarfb(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlarfb", rblapack_zlarfb, -1);
+}

data/ext/zlarfg.c

@@ -0,0 +1,84 @@
+#include "rb_lapack.h"
+
+extern VOID zlarfg_(integer* n, doublecomplex* alpha, doublecomplex* x, integer* incx, doublecomplex* tau);
+
+
+static VALUE
+rblapack_zlarfg(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_n;
+  integer n; 
+  VALUE rblapack_alpha;
+  doublecomplex alpha; 
+  VALUE rblapack_x;
+  doublecomplex *x; 
+  VALUE rblapack_incx;
+  integer incx; 
+  VALUE rblapack_tau;
+  doublecomplex tau; 
+  VALUE rblapack_x_out__;
+  doublecomplex *x_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  tau, alpha, x = NumRu::Lapack.zlarfg( n, alpha, x, incx, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLARFG( N, ALPHA, X, INCX, TAU )\n\n*  Purpose\n*  =======\n*\n*  ZLARFG generates a complex elementary reflector H of order n, such\n*  that\n*\n*        H' * ( alpha ) = ( beta ),   H' * H = I.\n*             (   x   )   (   0  )\n*\n*  where alpha and beta are scalars, with beta real, and x is an\n*  (n-1)-element complex vector. H is represented in the form\n*\n*        H = I - tau * ( 1 ) * ( 1 v' ) ,\n*                      ( v )\n*\n*  where tau is a complex scalar and v is a complex (n-1)-element\n*  vector. Note that H is not hermitian.\n*\n*  If the elements of x are all zero and alpha is real, then tau = 0\n*  and H is taken to be the unit matrix.\n*\n*  Otherwise  1 <= real(tau) <= 2  and  abs(tau-1) <= 1 .\n*\n\n*  Arguments\n*  =========\n*\n*  N       (input) INTEGER\n*          The order of the elementary reflector.\n*\n*  ALPHA   (input/output) COMPLEX*16\n*          On entry, the value alpha.\n*          On exit, it is overwritten with the value beta.\n*\n*  X       (input/output) COMPLEX*16 array, dimension\n*                         (1+(N-2)*abs(INCX))\n*          On entry, the vector x.\n*          On exit, it is overwritten with the vector v.\n*\n*  INCX    (input) INTEGER\n*          The increment between elements of X. INCX > 0.\n*\n*  TAU     (output) COMPLEX*16\n*          The value tau.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  tau, alpha, x = NumRu::Lapack.zlarfg( n, alpha, x, incx, [: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_n = argv[0];
+  rblapack_alpha = argv[1];
+  rblapack_x = argv[2];
+  rblapack_incx = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  n = NUM2INT(rblapack_n);
+  incx = NUM2INT(rblapack_incx);
+  alpha.r = NUM2DBL(rb_funcall(rblapack_alpha, rb_intern("real"), 0));
+  alpha.i = NUM2DBL(rb_funcall(rblapack_alpha, rb_intern("imag"), 0));
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (3th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 1)
+    rb_raise(rb_eArgError, "rank of x (3th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_x) != (1+(n-2)*abs(incx)))
+    rb_raise(rb_eRuntimeError, "shape 0 of x must be %d", 1+(n-2)*abs(incx));
+  if (NA_TYPE(rblapack_x) != NA_DCOMPLEX)
+    rblapack_x = na_change_type(rblapack_x, NA_DCOMPLEX);
+  x = NA_PTR_TYPE(rblapack_x, doublecomplex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 1+(n-2)*abs(incx);
+    rblapack_x_out__ = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
+  }
+  x_out__ = NA_PTR_TYPE(rblapack_x_out__, doublecomplex*);
+  MEMCPY(x_out__, x, doublecomplex, NA_TOTAL(rblapack_x));
+  rblapack_x = rblapack_x_out__;
+  x = x_out__;
+
+  zlarfg_(&n, &alpha, x, &incx, &tau);
+
+  rblapack_tau = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(tau.r)), rb_float_new((double)(tau.i)));
+  rblapack_alpha = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(alpha.r)), rb_float_new((double)(alpha.i)));
+  return rb_ary_new3(3, rblapack_tau, rblapack_alpha, rblapack_x);
+}
+
+void
+init_lapack_zlarfg(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlarfg", rblapack_zlarfg, -1);
+}

data/ext/zlarfgp.c

@@ -0,0 +1,84 @@
+#include "rb_lapack.h"
+
+extern VOID zlarfgp_(integer* n, doublecomplex* alpha, doublecomplex* x, integer* incx, doublecomplex* tau);
+
+
+static VALUE
+rblapack_zlarfgp(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_n;
+  integer n; 
+  VALUE rblapack_alpha;
+  doublecomplex alpha; 
+  VALUE rblapack_x;
+  doublecomplex *x; 
+  VALUE rblapack_incx;
+  integer incx; 
+  VALUE rblapack_tau;
+  doublecomplex tau; 
+  VALUE rblapack_x_out__;
+  doublecomplex *x_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  tau, alpha, x = NumRu::Lapack.zlarfgp( n, alpha, x, incx, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLARFGP( N, ALPHA, X, INCX, TAU )\n\n*  Purpose\n*  =======\n*\n*  ZLARFGP generates a complex elementary reflector H of order n, such\n*  that\n*\n*        H' * ( alpha ) = ( beta ),   H' * H = I.\n*             (   x   )   (   0  )\n*\n*  where alpha and beta are scalars, beta is real and non-negative, and\n*  x is an (n-1)-element complex vector.  H is represented in the form\n*\n*        H = I - tau * ( 1 ) * ( 1 v' ) ,\n*                      ( v )\n*\n*  where tau is a complex scalar and v is a complex (n-1)-element\n*  vector. Note that H is not hermitian.\n*\n*  If the elements of x are all zero and alpha is real, then tau = 0\n*  and H is taken to be the unit matrix.\n*\n\n*  Arguments\n*  =========\n*\n*  N       (input) INTEGER\n*          The order of the elementary reflector.\n*\n*  ALPHA   (input/output) COMPLEX*16\n*          On entry, the value alpha.\n*          On exit, it is overwritten with the value beta.\n*\n*  X       (input/output) COMPLEX*16 array, dimension\n*                         (1+(N-2)*abs(INCX))\n*          On entry, the vector x.\n*          On exit, it is overwritten with the vector v.\n*\n*  INCX    (input) INTEGER\n*          The increment between elements of X. INCX > 0.\n*\n*  TAU     (output) COMPLEX*16\n*          The value tau.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  tau, alpha, x = NumRu::Lapack.zlarfgp( n, alpha, x, incx, [: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_n = argv[0];
+  rblapack_alpha = argv[1];
+  rblapack_x = argv[2];
+  rblapack_incx = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  n = NUM2INT(rblapack_n);
+  incx = NUM2INT(rblapack_incx);
+  alpha.r = NUM2DBL(rb_funcall(rblapack_alpha, rb_intern("real"), 0));
+  alpha.i = NUM2DBL(rb_funcall(rblapack_alpha, rb_intern("imag"), 0));
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (3th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 1)
+    rb_raise(rb_eArgError, "rank of x (3th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_x) != (1+(n-2)*abs(incx)))
+    rb_raise(rb_eRuntimeError, "shape 0 of x must be %d", 1+(n-2)*abs(incx));
+  if (NA_TYPE(rblapack_x) != NA_DCOMPLEX)
+    rblapack_x = na_change_type(rblapack_x, NA_DCOMPLEX);
+  x = NA_PTR_TYPE(rblapack_x, doublecomplex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = 1+(n-2)*abs(incx);
+    rblapack_x_out__ = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
+  }
+  x_out__ = NA_PTR_TYPE(rblapack_x_out__, doublecomplex*);
+  MEMCPY(x_out__, x, doublecomplex, NA_TOTAL(rblapack_x));
+  rblapack_x = rblapack_x_out__;
+  x = x_out__;
+
+  zlarfgp_(&n, &alpha, x, &incx, &tau);
+
+  rblapack_tau = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(tau.r)), rb_float_new((double)(tau.i)));
+  rblapack_alpha = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(alpha.r)), rb_float_new((double)(alpha.i)));
+  return rb_ary_new3(3, rblapack_tau, rblapack_alpha, rblapack_x);
+}
+
+void
+init_lapack_zlarfgp(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlarfgp", rblapack_zlarfgp, -1);
+}

data/ext/zlarft.c

@@ -0,0 +1,105 @@
+#include "rb_lapack.h"
+
+extern VOID zlarft_(char* direct, char* storev, integer* n, integer* k, doublecomplex* v, integer* ldv, doublecomplex* tau, doublecomplex* t, integer* ldt);
+
+
+static VALUE
+rblapack_zlarft(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_direct;
+  char direct; 
+  VALUE rblapack_storev;
+  char storev; 
+  VALUE rblapack_n;
+  integer n; 
+  VALUE rblapack_v;
+  doublecomplex *v; 
+  VALUE rblapack_tau;
+  doublecomplex *tau; 
+  VALUE rblapack_t;
+  doublecomplex *t; 
+  VALUE rblapack_v_out__;
+  doublecomplex *v_out__;
+
+  integer ldv;
+  integer k;
+  integer ldt;
+
+  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  t, v = NumRu::Lapack.zlarft( direct, storev, n, v, tau, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )\n\n*  Purpose\n*  =======\n*\n*  ZLARFT forms the triangular factor T of a complex block reflector H\n*  of order n, which is defined as a product of k elementary reflectors.\n*\n*  If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;\n*\n*  If DIRECT = 'B', H = H(k) . . . H(2) H(1) and T is lower triangular.\n*\n*  If STOREV = 'C', the vector which defines the elementary reflector\n*  H(i) is stored in the i-th column of the array V, and\n*\n*     H  =  I - V * T * V'\n*\n*  If STOREV = 'R', the vector which defines the elementary reflector\n*  H(i) is stored in the i-th row of the array V, and\n*\n*     H  =  I - V' * T * V\n*\n\n*  Arguments\n*  =========\n*\n*  DIRECT  (input) CHARACTER*1\n*          Specifies the order in which the elementary reflectors are\n*          multiplied to form the block reflector:\n*          = 'F': H = H(1) H(2) . . . H(k) (Forward)\n*          = 'B': H = H(k) . . . H(2) H(1) (Backward)\n*\n*  STOREV  (input) CHARACTER*1\n*          Specifies how the vectors which define the elementary\n*          reflectors are stored (see also Further Details):\n*          = 'C': columnwise\n*          = 'R': rowwise\n*\n*  N       (input) INTEGER\n*          The order of the block reflector H. N >= 0.\n*\n*  K       (input) INTEGER\n*          The order of the triangular factor T (= the number of\n*          elementary reflectors). K >= 1.\n*\n*  V       (input/output) COMPLEX*16 array, dimension\n*                               (LDV,K) if STOREV = 'C'\n*                               (LDV,N) if STOREV = 'R'\n*          The matrix V. See further details.\n*\n*  LDV     (input) INTEGER\n*          The leading dimension of the array V.\n*          If STOREV = 'C', LDV >= max(1,N); if STOREV = 'R', LDV >= K.\n*\n*  TAU     (input) COMPLEX*16 array, dimension (K)\n*          TAU(i) must contain the scalar factor of the elementary\n*          reflector H(i).\n*\n*  T       (output) COMPLEX*16 array, dimension (LDT,K)\n*          The k by k triangular factor T of the block reflector.\n*          If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is\n*          lower triangular. The rest of the array is not used.\n*\n*  LDT     (input) INTEGER\n*          The leading dimension of the array T. LDT >= K.\n*\n\n*  Further Details\n*  ===============\n*\n*  The shape of the matrix V and the storage of the vectors which define\n*  the H(i) is best illustrated by the following example with n = 5 and\n*  k = 3. The elements equal to 1 are not stored; the corresponding\n*  array elements are modified but restored on exit. The rest of the\n*  array is not used.\n*\n*  DIRECT = 'F' and STOREV = 'C':         DIRECT = 'F' and STOREV = 'R':\n*\n*               V = (  1       )                 V = (  1 v1 v1 v1 v1 )\n*                   ( v1  1    )                     (     1 v2 v2 v2 )\n*                   ( v1 v2  1 )                     (        1 v3 v3 )\n*                   ( v1 v2 v3 )\n*                   ( v1 v2 v3 )\n*\n*  DIRECT = 'B' and STOREV = 'C':         DIRECT = 'B' and STOREV = 'R':\n*\n*               V = ( v1 v2 v3 )                 V = ( v1 v1  1       )\n*                   ( v1 v2 v3 )                     ( v2 v2 v2  1    )\n*                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )\n*                   (     1 v3 )\n*                   (        1 )\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  t, v = NumRu::Lapack.zlarft( direct, storev, n, v, tau, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 5 && argc != 5)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 5)", argc);
+  rblapack_direct = argv[0];
+  rblapack_storev = argv[1];
+  rblapack_n = argv[2];
+  rblapack_v = argv[3];
+  rblapack_tau = argv[4];
+  if (argc == 5) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  direct = StringValueCStr(rblapack_direct)[0];
+  n = NUM2INT(rblapack_n);
+  if (!NA_IsNArray(rblapack_tau))
+    rb_raise(rb_eArgError, "tau (5th argument) must be NArray");
+  if (NA_RANK(rblapack_tau) != 1)
+    rb_raise(rb_eArgError, "rank of tau (5th argument) must be %d", 1);
+  k = NA_SHAPE0(rblapack_tau);
+  if (NA_TYPE(rblapack_tau) != NA_DCOMPLEX)
+    rblapack_tau = na_change_type(rblapack_tau, NA_DCOMPLEX);
+  tau = NA_PTR_TYPE(rblapack_tau, doublecomplex*);
+  storev = StringValueCStr(rblapack_storev)[0];
+  ldt = k;
+  if (!NA_IsNArray(rblapack_v))
+    rb_raise(rb_eArgError, "v (4th argument) must be NArray");
+  if (NA_RANK(rblapack_v) != 2)
+    rb_raise(rb_eArgError, "rank of v (4th argument) must be %d", 2);
+  ldv = NA_SHAPE0(rblapack_v);
+  if (NA_SHAPE1(rblapack_v) != (lsame_(&storev,"C") ? k : lsame_(&storev,"R") ? n : 0))
+    rb_raise(rb_eRuntimeError, "shape 1 of v must be %d", lsame_(&storev,"C") ? k : lsame_(&storev,"R") ? n : 0);
+  if (NA_TYPE(rblapack_v) != NA_DCOMPLEX)
+    rblapack_v = na_change_type(rblapack_v, NA_DCOMPLEX);
+  v = NA_PTR_TYPE(rblapack_v, doublecomplex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldt;
+    shape[1] = k;
+    rblapack_t = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  t = NA_PTR_TYPE(rblapack_t, doublecomplex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldv;
+    shape[1] = lsame_(&storev,"C") ? k : lsame_(&storev,"R") ? n : 0;
+    rblapack_v_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  v_out__ = NA_PTR_TYPE(rblapack_v_out__, doublecomplex*);
+  MEMCPY(v_out__, v, doublecomplex, NA_TOTAL(rblapack_v));
+  rblapack_v = rblapack_v_out__;
+  v = v_out__;
+
+  zlarft_(&direct, &storev, &n, &k, v, &ldv, tau, t, &ldt);
+
+  return rb_ary_new3(2, rblapack_t, rblapack_v);
+}
+
+void
+init_lapack_zlarft(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlarft", rblapack_zlarft, -1);
+}