ruby-lapack 1.6 → 1.7

data/ext/clarscl2.c

@@ -1,82 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID clarscl2_(integer* m, integer* n, real* d, complex* x, integer* ldx);
-
-
-static VALUE
-rblapack_clarscl2(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_d;
-  real *d; 
-  VALUE rblapack_x;
-  complex *x; 
-  VALUE rblapack_x_out__;
-  complex *x_out__;
-
-  integer m;
-  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 = NumRu::Lapack.clarscl2( d, x, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARSCL2 ( M, N, D, X, LDX )\n\n*  Purpose\n*  =======\n*\n*  CLARSCL2 performs a reciprocal diagonal scaling on an vector:\n*    x <-- inv(D) * x\n*  where the REAL diagonal matrix D is stored as a vector.\n*\n*  Eventually to be replaced by BLAS_cge_diag_scale in the new BLAS\n*  standard.\n*\n\n*  Arguments\n*  =========\n*\n*     M       (input) INTEGER\n*     The number of rows of D and X. M >= 0.\n*\n*     N       (input) INTEGER\n*     The number of columns of D and X. N >= 0.\n*\n*     D       (input) REAL array, length M\n*     Diagonal matrix D, stored as a vector of length M.\n*\n*     X       (input/output) COMPLEX array, dimension (LDX,N)\n*     On entry, the vector X to be scaled by D.\n*     On exit, the scaled vector.\n*\n*     LDX     (input) INTEGER\n*     The leading dimension of the vector X. LDX >= 0.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            I, J\n*     ..\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  x = NumRu::Lapack.clarscl2( d, x, [: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_d = argv[0];
-  rblapack_x = argv[1];
-  if (argc == 2) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  if (!NA_IsNArray(rblapack_d))
-    rb_raise(rb_eArgError, "d (1th argument) must be NArray");
-  if (NA_RANK(rblapack_d) != 1)
-    rb_raise(rb_eArgError, "rank of d (1th argument) must be %d", 1);
-  m = 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*);
-  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_SCOMPLEX)
-    rblapack_x = na_change_type(rblapack_x, NA_SCOMPLEX);
-  x = NA_PTR_TYPE(rblapack_x, complex*);
-  {
-    int shape[2];
-    shape[0] = ldx;
-    shape[1] = n;
-    rblapack_x_out__ = na_make_object(NA_SCOMPLEX, 2, 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__;
-
-  clarscl2_(&m, &n, d, x, &ldx);
-
-  return rblapack_x;
-}
-
-void
-init_lapack_clarscl2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "clarscl2", rblapack_clarscl2, -1);
-}

data/ext/clartg.c

@@ -1,63 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID clartg_(complex* f, complex* g, real* cs, complex* sn, complex* r);
-
-
-static VALUE
-rblapack_clartg(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_f;
-  complex f; 
-  VALUE rblapack_g;
-  complex g; 
-  VALUE rblapack_cs;
-  real cs; 
-  VALUE rblapack_sn;
-  complex sn; 
-  VALUE rblapack_r;
-  complex r; 
-
-
-  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  cs, sn, r = NumRu::Lapack.clartg( f, g, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARTG( F, G, CS, SN, R )\n\n*  Purpose\n*  =======\n*\n*  CLARTG generates a plane rotation so that\n*\n*     [  CS  SN  ]     [ F ]     [ R ]\n*     [  __      ]  .  [   ]  =  [   ]   where CS**2 + |SN|**2 = 1.\n*     [ -SN  CS  ]     [ G ]     [ 0 ]\n*\n*  This is a faster version of the BLAS1 routine CROTG, except for\n*  the following differences:\n*     F and G are unchanged on return.\n*     If G=0, then CS=1 and SN=0.\n*     If F=0, then CS=0 and SN is chosen so that R is real.\n*\n\n*  Arguments\n*  =========\n*\n*  F       (input) COMPLEX\n*          The first component of vector to be rotated.\n*\n*  G       (input) COMPLEX\n*          The second component of vector to be rotated.\n*\n*  CS      (output) REAL\n*          The cosine of the rotation.\n*\n*  SN      (output) COMPLEX\n*          The sine of the rotation.\n*\n*  R       (output) COMPLEX\n*          The nonzero component of the rotated vector.\n*\n\n*  Further Details\n*  ======= =======\n*\n*  3-5-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  cs, sn, r = NumRu::Lapack.clartg( f, g, [: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_f = argv[0];
-  rblapack_g = argv[1];
-  if (argc == 2) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  f.r = (real)NUM2DBL(rb_funcall(rblapack_f, rb_intern("real"), 0));
-  f.i = (real)NUM2DBL(rb_funcall(rblapack_f, rb_intern("imag"), 0));
-  g.r = (real)NUM2DBL(rb_funcall(rblapack_g, rb_intern("real"), 0));
-  g.i = (real)NUM2DBL(rb_funcall(rblapack_g, rb_intern("imag"), 0));
-
-  clartg_(&f, &g, &cs, &sn, &r);
-
-  rblapack_cs = rb_float_new((double)cs);
-  rblapack_sn = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(sn.r)), rb_float_new((double)(sn.i)));
-  rblapack_r = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(r.r)), rb_float_new((double)(r.i)));
-  return rb_ary_new3(3, rblapack_cs, rblapack_sn, rblapack_r);
-}
-
-void
-init_lapack_clartg(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "clartg", rblapack_clartg, -1);
-}

data/ext/clartv.c

@@ -1,130 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID clartv_(integer* n, complex* x, integer* incx, complex* y, integer* incy, real* c, complex* s, integer* incc);
-
-
-static VALUE
-rblapack_clartv(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_c;
-  real *c; 
-  VALUE rblapack_s;
-  complex *s; 
-  VALUE rblapack_incc;
-  integer incc; 
-  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  x, y = NumRu::Lapack.clartv( n, x, incx, y, incy, c, s, incc, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARTV( N, X, INCX, Y, INCY, C, S, INCC )\n\n*  Purpose\n*  =======\n*\n*  CLARTV applies a vector of complex plane rotations with real cosines\n*  to elements of the complex vectors x and y. For i = 1,2,...,n\n*\n*     ( x(i) ) := (        c(i)   s(i) ) ( x(i) )\n*     ( y(i) )    ( -conjg(s(i))  c(i) ) ( y(i) )\n*\n\n*  Arguments\n*  =========\n*\n*  N       (input) INTEGER\n*          The number of plane rotations to be applied.\n*\n*  X       (input/output) COMPLEX array, dimension (1+(N-1)*INCX)\n*          The vector x.\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*          The vector y.\n*\n*  INCY    (input) INTEGER\n*          The increment between elements of Y. INCY > 0.\n*\n*  C       (input) REAL array, dimension (1+(N-1)*INCC)\n*          The cosines of the plane rotations.\n*\n*  S       (input) COMPLEX array, dimension (1+(N-1)*INCC)\n*          The sines of the plane rotations.\n*\n*  INCC    (input) INTEGER\n*          The increment between elements of C and S. INCC > 0.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            I, IC, IX, IY\n      COMPLEX            XI, YI\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          CONJG\n*     ..\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  x, y = NumRu::Lapack.clartv( n, x, incx, y, incy, c, s, incc, [: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_n = argv[0];
-  rblapack_x = argv[1];
-  rblapack_incx = argv[2];
-  rblapack_y = argv[3];
-  rblapack_incy = argv[4];
-  rblapack_c = argv[5];
-  rblapack_s = argv[6];
-  rblapack_incc = argv[7];
-  if (argc == 8) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  n = NUM2INT(rblapack_n);
-  incx = NUM2INT(rblapack_incx);
-  incy = NUM2INT(rblapack_incy);
-  incc = NUM2INT(rblapack_incc);
-  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*);
-  if (!NA_IsNArray(rblapack_c))
-    rb_raise(rb_eArgError, "c (6th argument) must be NArray");
-  if (NA_RANK(rblapack_c) != 1)
-    rb_raise(rb_eArgError, "rank of c (6th argument) must be %d", 1);
-  if (NA_SHAPE0(rblapack_c) != (1+(n-1)*incc))
-    rb_raise(rb_eRuntimeError, "shape 0 of c must be %d", 1+(n-1)*incc);
-  if (NA_TYPE(rblapack_c) != NA_SFLOAT)
-    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
-  c = NA_PTR_TYPE(rblapack_c, real*);
-  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*);
-  if (!NA_IsNArray(rblapack_s))
-    rb_raise(rb_eArgError, "s (7th argument) must be NArray");
-  if (NA_RANK(rblapack_s) != 1)
-    rb_raise(rb_eArgError, "rank of s (7th argument) must be %d", 1);
-  if (NA_SHAPE0(rblapack_s) != (1+(n-1)*incc))
-    rb_raise(rb_eRuntimeError, "shape 0 of s must be %d", 1+(n-1)*incc);
-  if (NA_TYPE(rblapack_s) != NA_SCOMPLEX)
-    rblapack_s = na_change_type(rblapack_s, NA_SCOMPLEX);
-  s = NA_PTR_TYPE(rblapack_s, complex*);
-  {
-    int 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__;
-  {
-    int 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__;
-
-  clartv_(&n, x, &incx, y, &incy, c, s, &incc);
-
-  return rb_ary_new3(2, rblapack_x, rblapack_y);
-}
-
-void
-init_lapack_clartv(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "clartv", rblapack_clartv, -1);
-}

data/ext/clarz.c

@@ -1,106 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID clarz_(char* side, integer* m, integer* n, integer* l, complex* v, integer* incv, complex* tau, complex* c, integer* ldc, complex* work);
-
-
-static VALUE
-rblapack_clarz(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_side;
-  char side; 
-  VALUE rblapack_m;
-  integer m; 
-  VALUE rblapack_l;
-  integer l; 
-  VALUE rblapack_v;
-  complex *v; 
-  VALUE rblapack_incv;
-  integer incv; 
-  VALUE rblapack_tau;
-  complex tau; 
-  VALUE rblapack_c;
-  complex *c; 
-  VALUE rblapack_c_out__;
-  complex *c_out__;
-  complex *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.clarz( side, m, l, v, incv, tau, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK )\n\n*  Purpose\n*  =======\n*\n*  CLARZ applies a complex elementary reflector H to a complex\n*  M-by-N matrix C, from either the left or the right. H is represented\n*  in the 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*  H is a product of k elementary reflectors as returned by CTZRZF.\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*  L       (input) INTEGER\n*          The number of entries of the vector V containing\n*          the meaningful part of the Householder vectors.\n*          If SIDE = 'L', M >= L >= 0, if SIDE = 'R', N >= L >= 0.\n*\n*  V       (input) COMPLEX array, dimension (1+(L-1)*abs(INCV))\n*          The vector v in the representation of H as returned by\n*          CTZRZF. V is not used if TAU = 0.\n*\n*  INCV    (input) INTEGER\n*          The increment between elements of v. INCV <> 0.\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. LDC >= max(1,M).\n*\n*  WORK    (workspace) COMPLEX array, dimension\n*                         (N) if SIDE = 'L'\n*                      or (M) if SIDE = 'R'\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA\n*\n*  =====================================================================\n*\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  c = NumRu::Lapack.clarz( side, m, l, v, incv, tau, c, [:usage => usage, :help => help])\n");
-      return Qnil;
-    } 
-  } else
-    rblapack_options = Qnil;
-  if (argc != 7 && argc != 7)
-    rb_raise(rb_eArgError,"wrong number of arguments (%d for 7)", argc);
-  rblapack_side = argv[0];
-  rblapack_m = argv[1];
-  rblapack_l = argv[2];
-  rblapack_v = argv[3];
-  rblapack_incv = argv[4];
-  rblapack_tau = argv[5];
-  rblapack_c = argv[6];
-  if (argc == 7) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  side = StringValueCStr(rblapack_side)[0];
-  l = NUM2INT(rblapack_l);
-  incv = NUM2INT(rblapack_incv);
-  if (!NA_IsNArray(rblapack_c))
-    rb_raise(rb_eArgError, "c (7th argument) must be NArray");
-  if (NA_RANK(rblapack_c) != 2)
-    rb_raise(rb_eArgError, "rank of c (7th 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*);
-  m = NUM2INT(rblapack_m);
-  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 (4th argument) must be NArray");
-  if (NA_RANK(rblapack_v) != 1)
-    rb_raise(rb_eArgError, "rank of v (4th argument) must be %d", 1);
-  if (NA_SHAPE0(rblapack_v) != (1+(l-1)*abs(incv)))
-    rb_raise(rb_eRuntimeError, "shape 0 of v must be %d", 1+(l-1)*abs(incv));
-  if (NA_TYPE(rblapack_v) != NA_SCOMPLEX)
-    rblapack_v = na_change_type(rblapack_v, NA_SCOMPLEX);
-  v = NA_PTR_TYPE(rblapack_v, complex*);
-  {
-    int 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));
-
-  clarz_(&side, &m, &n, &l, v, &incv, &tau, c, &ldc, work);
-
-  free(work);
-  return rblapack_c;
-}
-
-void
-init_lapack_clarz(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "clarz", rblapack_clarz, -1);
-}

data/ext/clarzb.c

@@ -1,127 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID clarzb_(char* side, char* trans, char* direct, char* storev, integer* m, integer* n, integer* k, integer* l, complex* v, integer* ldv, complex* t, integer* ldt, complex* c, integer* ldc, complex* work, integer* ldwork);
-
-
-static VALUE
-rblapack_clarzb(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_l;
-  integer l; 
-  VALUE rblapack_v;
-  complex *v; 
-  VALUE rblapack_t;
-  complex *t; 
-  VALUE rblapack_c;
-  complex *c; 
-  VALUE rblapack_c_out__;
-  complex *c_out__;
-  complex *work;
-
-  integer ldv;
-  integer nv;
-  integer ldt;
-  integer k;
-  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.clarzb( side, trans, direct, storev, m, l, v, t, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, LDV, T, LDT, C, LDC, WORK, LDWORK )\n\n*  Purpose\n*  =======\n*\n*  CLARZB applies a complex block reflector H or its transpose H**H\n*  to a complex distributed M-by-N  C from the left or the right.\n*\n*  Currently, only STOREV = 'R' and DIRECT = 'B' are supported.\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, not supported yet)\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                        (not supported yet)\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*  L       (input) INTEGER\n*          The number of columns of the matrix V containing the\n*          meaningful part of the Householder reflectors.\n*          If SIDE = 'L', M >= L >= 0, if SIDE = 'R', N >= L >= 0.\n*\n*  V       (input) COMPLEX array, dimension (LDV,NV).\n*          If STOREV = 'C', NV = K; if STOREV = 'R', NV = L.\n*\n*  LDV     (input) INTEGER\n*          The leading dimension of the array V.\n*          If STOREV = 'C', LDV >= L; if STOREV = 'R', LDV >= K.\n*\n*  T       (input) COMPLEX 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 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 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*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA\n*\n*  =====================================================================\n*\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  c = NumRu::Lapack.clarzb( side, trans, direct, storev, m, l, v, t, c, [:usage => usage, :help => help])\n");
-      return Qnil;
-    } 
-  } else
-    rblapack_options = Qnil;
-  if (argc != 9 && argc != 9)
-    rb_raise(rb_eArgError,"wrong number of arguments (%d for 9)", argc);
-  rblapack_side = argv[0];
-  rblapack_trans = argv[1];
-  rblapack_direct = argv[2];
-  rblapack_storev = argv[3];
-  rblapack_m = argv[4];
-  rblapack_l = argv[5];
-  rblapack_v = argv[6];
-  rblapack_t = argv[7];
-  rblapack_c = argv[8];
-  if (argc == 9) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  side = StringValueCStr(rblapack_side)[0];
-  direct = StringValueCStr(rblapack_direct)[0];
-  m = NUM2INT(rblapack_m);
-  if (!NA_IsNArray(rblapack_v))
-    rb_raise(rb_eArgError, "v (7th argument) must be NArray");
-  if (NA_RANK(rblapack_v) != 2)
-    rb_raise(rb_eArgError, "rank of v (7th argument) must be %d", 2);
-  ldv = NA_SHAPE0(rblapack_v);
-  nv = NA_SHAPE1(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 (9th argument) must be NArray");
-  if (NA_RANK(rblapack_c) != 2)
-    rb_raise(rb_eArgError, "rank of c (9th 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*);
-  trans = StringValueCStr(rblapack_trans)[0];
-  l = NUM2INT(rblapack_l);
-  ldwork = MAX(1,n) ? side = 'l' : MAX(1,m) ? side = 'r' : 0;
-  storev = StringValueCStr(rblapack_storev)[0];
-  if (!NA_IsNArray(rblapack_t))
-    rb_raise(rb_eArgError, "t (8th argument) must be NArray");
-  if (NA_RANK(rblapack_t) != 2)
-    rb_raise(rb_eArgError, "rank of t (8th argument) must be %d", 2);
-  ldt = NA_SHAPE0(rblapack_t);
-  k = NA_SHAPE1(rblapack_t);
-  if (NA_TYPE(rblapack_t) != NA_SCOMPLEX)
-    rblapack_t = na_change_type(rblapack_t, NA_SCOMPLEX);
-  t = NA_PTR_TYPE(rblapack_t, complex*);
-  {
-    int 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, (ldwork)*(k));
-
-  clarzb_(&side, &trans, &direct, &storev, &m, &n, &k, &l, v, &ldv, t, &ldt, c, &ldc, work, &ldwork);
-
-  free(work);
-  return rblapack_c;
-}
-
-void
-init_lapack_clarzb(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "clarzb", rblapack_clarzb, -1);
-}