ruby-lapack 1.7 → 1.7.1

data/ext/claic1.c

@@ -0,0 +1,90 @@
+#include "rb_lapack.h"
+
+extern VOID claic1_(integer* job, integer* j, complex* x, real* sest, complex* w, complex* gamma, real* sestpr, complex* s, complex* c);
+
+
+static VALUE
+rblapack_claic1(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_job;
+  integer job; 
+  VALUE rblapack_x;
+  complex *x; 
+  VALUE rblapack_sest;
+  real sest; 
+  VALUE rblapack_w;
+  complex *w; 
+  VALUE rblapack_gamma;
+  complex gamma; 
+  VALUE rblapack_sestpr;
+  real sestpr; 
+  VALUE rblapack_s;
+  complex s; 
+  VALUE rblapack_c;
+  complex c; 
+
+  integer j;
+
+  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  sestpr, s, c = NumRu::Lapack.claic1( job, x, sest, w, gamma, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C )\n\n*  Purpose\n*  =======\n*\n*  CLAIC1 applies one step of incremental condition estimation in\n*  its simplest version:\n*\n*  Let x, twonorm(x) = 1, be an approximate singular vector of an j-by-j\n*  lower triangular matrix L, such that\n*           twonorm(L*x) = sest\n*  Then CLAIC1 computes sestpr, s, c such that\n*  the vector\n*                  [ s*x ]\n*           xhat = [  c  ]\n*  is an approximate singular vector of\n*                  [ L     0  ]\n*           Lhat = [ w' gamma ]\n*  in the sense that\n*           twonorm(Lhat*xhat) = sestpr.\n*\n*  Depending on JOB, an estimate for the largest or smallest singular\n*  value is computed.\n*\n*  Note that [s c]' and sestpr**2 is an eigenpair of the system\n*\n*      diag(sest*sest, 0) + [alpha  gamma] * [ conjg(alpha) ]\n*                                            [ conjg(gamma) ]\n*\n*  where  alpha =  conjg(x)'*w.\n*\n\n*  Arguments\n*  =========\n*\n*  JOB     (input) INTEGER\n*          = 1: an estimate for the largest singular value is computed.\n*          = 2: an estimate for the smallest singular value is computed.\n*\n*  J       (input) INTEGER\n*          Length of X and W\n*\n*  X       (input) COMPLEX array, dimension (J)\n*          The j-vector x.\n*\n*  SEST    (input) REAL\n*          Estimated singular value of j by j matrix L\n*\n*  W       (input) COMPLEX array, dimension (J)\n*          The j-vector w.\n*\n*  GAMMA   (input) COMPLEX\n*          The diagonal element gamma.\n*\n*  SESTPR  (output) REAL\n*          Estimated singular value of (j+1) by (j+1) matrix Lhat.\n*\n*  S       (output) COMPLEX\n*          Sine needed in forming xhat.\n*\n*  C       (output) COMPLEX\n*          Cosine needed in forming xhat.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  sestpr, s, c = NumRu::Lapack.claic1( job, x, sest, w, gamma, [: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_job = argv[0];
+  rblapack_x = argv[1];
+  rblapack_sest = argv[2];
+  rblapack_w = argv[3];
+  rblapack_gamma = argv[4];
+  if (argc == 5) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  job = NUM2INT(rblapack_job);
+  sest = (real)NUM2DBL(rblapack_sest);
+  gamma.r = (real)NUM2DBL(rb_funcall(rblapack_gamma, rb_intern("real"), 0));
+  gamma.i = (real)NUM2DBL(rb_funcall(rblapack_gamma, rb_intern("imag"), 0));
+  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);
+  j = NA_SHAPE0(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*);
+  if (!NA_IsNArray(rblapack_w))
+    rb_raise(rb_eArgError, "w (4th argument) must be NArray");
+  if (NA_RANK(rblapack_w) != 1)
+    rb_raise(rb_eArgError, "rank of w (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_w) != j)
+    rb_raise(rb_eRuntimeError, "shape 0 of w must be the same as shape 0 of x");
+  if (NA_TYPE(rblapack_w) != NA_SCOMPLEX)
+    rblapack_w = na_change_type(rblapack_w, NA_SCOMPLEX);
+  w = NA_PTR_TYPE(rblapack_w, complex*);
+
+  claic1_(&job, &j, x, &sest, w, &gamma, &sestpr, &s, &c);
+
+  rblapack_sestpr = rb_float_new((double)sestpr);
+  rblapack_s = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(s.r)), rb_float_new((double)(s.i)));
+  rblapack_c = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(c.r)), rb_float_new((double)(c.i)));
+  return rb_ary_new3(3, rblapack_sestpr, rblapack_s, rblapack_c);
+}
+
+void
+init_lapack_claic1(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claic1", rblapack_claic1, -1);
+}

data/ext/clals0.c

@@ -0,0 +1,201 @@
+#include "rb_lapack.h"
+
+extern VOID clals0_(integer* icompq, integer* nl, integer* nr, integer* sqre, integer* nrhs, complex* b, integer* ldb, complex* bx, integer* ldbx, integer* perm, integer* givptr, integer* givcol, integer* ldgcol, real* givnum, integer* ldgnum, real* poles, real* difl, real* difr, real* z, integer* k, real* c, real* s, real* rwork, integer* info);
+
+
+static VALUE
+rblapack_clals0(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_icompq;
+  integer icompq; 
+  VALUE rblapack_nl;
+  integer nl; 
+  VALUE rblapack_nr;
+  integer nr; 
+  VALUE rblapack_sqre;
+  integer sqre; 
+  VALUE rblapack_b;
+  complex *b; 
+  VALUE rblapack_perm;
+  integer *perm; 
+  VALUE rblapack_givptr;
+  integer givptr; 
+  VALUE rblapack_givcol;
+  integer *givcol; 
+  VALUE rblapack_givnum;
+  real *givnum; 
+  VALUE rblapack_poles;
+  real *poles; 
+  VALUE rblapack_difl;
+  real *difl; 
+  VALUE rblapack_difr;
+  real *difr; 
+  VALUE rblapack_z;
+  real *z; 
+  VALUE rblapack_c;
+  real c; 
+  VALUE rblapack_s;
+  real s; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_b_out__;
+  complex *b_out__;
+  complex *bx;
+  real *rwork;
+
+  integer ldb;
+  integer nrhs;
+  integer n;
+  integer ldgcol;
+  integer ldgnum;
+  integer k;
+  integer ldbx;
+
+  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  info, b = NumRu::Lapack.clals0( icompq, nl, nr, sqre, b, perm, givptr, givcol, givnum, poles, difl, difr, z, c, s, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, POLES, DIFL, DIFR, Z, K, C, S, RWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLALS0 applies back the multiplying factors of either the left or the\n*  right singular vector matrix of a diagonal matrix appended by a row\n*  to the right hand side matrix B in solving the least squares problem\n*  using the divide-and-conquer SVD approach.\n*\n*  For the left singular vector matrix, three types of orthogonal\n*  matrices are involved:\n*\n*  (1L) Givens rotations: the number of such rotations is GIVPTR; the\n*       pairs of columns/rows they were applied to are stored in GIVCOL;\n*       and the C- and S-values of these rotations are stored in GIVNUM.\n*\n*  (2L) Permutation. The (NL+1)-st row of B is to be moved to the first\n*       row, and for J=2:N, PERM(J)-th row of B is to be moved to the\n*       J-th row.\n*\n*  (3L) The left singular vector matrix of the remaining matrix.\n*\n*  For the right singular vector matrix, four types of orthogonal\n*  matrices are involved:\n*\n*  (1R) The right singular vector matrix of the remaining matrix.\n*\n*  (2R) If SQRE = 1, one extra Givens rotation to generate the right\n*       null space.\n*\n*  (3R) The inverse transformation of (2L).\n*\n*  (4R) The inverse transformation of (1L).\n*\n\n*  Arguments\n*  =========\n*\n*  ICOMPQ (input) INTEGER\n*         Specifies whether singular vectors are to be computed in\n*         factored form:\n*         = 0: Left singular vector matrix.\n*         = 1: Right singular vector matrix.\n*\n*  NL     (input) INTEGER\n*         The row dimension of the upper block. NL >= 1.\n*\n*  NR     (input) INTEGER\n*         The row dimension of the lower block. NR >= 1.\n*\n*  SQRE   (input) INTEGER\n*         = 0: the lower block is an NR-by-NR square matrix.\n*         = 1: the lower block is an NR-by-(NR+1) rectangular matrix.\n*\n*         The bidiagonal matrix has row dimension N = NL + NR + 1,\n*         and column dimension M = N + SQRE.\n*\n*  NRHS   (input) INTEGER\n*         The number of columns of B and BX. NRHS must be at least 1.\n*\n*  B      (input/output) COMPLEX array, dimension ( LDB, NRHS )\n*         On input, B contains the right hand sides of the least\n*         squares problem in rows 1 through M. On output, B contains\n*         the solution X in rows 1 through N.\n*\n*  LDB    (input) INTEGER\n*         The leading dimension of B. LDB must be at least\n*         max(1,MAX( M, N ) ).\n*\n*  BX     (workspace) COMPLEX array, dimension ( LDBX, NRHS )\n*\n*  LDBX   (input) INTEGER\n*         The leading dimension of BX.\n*\n*  PERM   (input) INTEGER array, dimension ( N )\n*         The permutations (from deflation and sorting) applied\n*         to the two blocks.\n*\n*  GIVPTR (input) INTEGER\n*         The number of Givens rotations which took place in this\n*         subproblem.\n*\n*  GIVCOL (input) INTEGER array, dimension ( LDGCOL, 2 )\n*         Each pair of numbers indicates a pair of rows/columns\n*         involved in a Givens rotation.\n*\n*  LDGCOL (input) INTEGER\n*         The leading dimension of GIVCOL, must be at least N.\n*\n*  GIVNUM (input) REAL array, dimension ( LDGNUM, 2 )\n*         Each number indicates the C or S value used in the\n*         corresponding Givens rotation.\n*\n*  LDGNUM (input) INTEGER\n*         The leading dimension of arrays DIFR, POLES and\n*         GIVNUM, must be at least K.\n*\n*  POLES  (input) REAL array, dimension ( LDGNUM, 2 )\n*         On entry, POLES(1:K, 1) contains the new singular\n*         values obtained from solving the secular equation, and\n*         POLES(1:K, 2) is an array containing the poles in the secular\n*         equation.\n*\n*  DIFL   (input) REAL array, dimension ( K ).\n*         On entry, DIFL(I) is the distance between I-th updated\n*         (undeflated) singular value and the I-th (undeflated) old\n*         singular value.\n*\n*  DIFR   (input) REAL array, dimension ( LDGNUM, 2 ).\n*         On entry, DIFR(I, 1) contains the distances between I-th\n*         updated (undeflated) singular value and the I+1-th\n*         (undeflated) old singular value. And DIFR(I, 2) is the\n*         normalizing factor for the I-th right singular vector.\n*\n*  Z      (input) REAL array, dimension ( K )\n*         Contain the components of the deflation-adjusted updating row\n*         vector.\n*\n*  K      (input) INTEGER\n*         Contains the dimension of the non-deflated matrix,\n*         This is the order of the related secular equation. 1 <= K <=N.\n*\n*  C      (input) REAL\n*         C contains garbage if SQRE =0 and the C-value of a Givens\n*         rotation related to the right null space if SQRE = 1.\n*\n*  S      (input) REAL\n*         S contains garbage if SQRE =0 and the S-value of a Givens\n*         rotation related to the right null space if SQRE = 1.\n*\n*  RWORK  (workspace) REAL array, dimension\n*         ( K*(1+NRHS) + 2*NRHS )\n*\n*  INFO   (output) INTEGER\n*          = 0:  successful exit.\n*          < 0:  if INFO = -i, the i-th argument had an illegal value.\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*     Ming Gu and Ren-Cang Li, Computer Science Division, University of\n*       California at Berkeley, USA\n*     Osni Marques, LBNL/NERSC, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, b = NumRu::Lapack.clals0( icompq, nl, nr, sqre, b, perm, givptr, givcol, givnum, poles, difl, difr, z, c, s, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 15 && argc != 15)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 15)", argc);
+  rblapack_icompq = argv[0];
+  rblapack_nl = argv[1];
+  rblapack_nr = argv[2];
+  rblapack_sqre = argv[3];
+  rblapack_b = argv[4];
+  rblapack_perm = argv[5];
+  rblapack_givptr = argv[6];
+  rblapack_givcol = argv[7];
+  rblapack_givnum = argv[8];
+  rblapack_poles = argv[9];
+  rblapack_difl = argv[10];
+  rblapack_difr = argv[11];
+  rblapack_z = argv[12];
+  rblapack_c = argv[13];
+  rblapack_s = argv[14];
+  if (argc == 15) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  icompq = NUM2INT(rblapack_icompq);
+  nr = NUM2INT(rblapack_nr);
+  if (!NA_IsNArray(rblapack_b))
+    rb_raise(rb_eArgError, "b (5th argument) must be NArray");
+  if (NA_RANK(rblapack_b) != 2)
+    rb_raise(rb_eArgError, "rank of b (5th argument) must be %d", 2);
+  ldb = NA_SHAPE0(rblapack_b);
+  nrhs = NA_SHAPE1(rblapack_b);
+  if (NA_TYPE(rblapack_b) != NA_SCOMPLEX)
+    rblapack_b = na_change_type(rblapack_b, NA_SCOMPLEX);
+  b = NA_PTR_TYPE(rblapack_b, complex*);
+  givptr = NUM2INT(rblapack_givptr);
+  if (!NA_IsNArray(rblapack_givnum))
+    rb_raise(rb_eArgError, "givnum (9th argument) must be NArray");
+  if (NA_RANK(rblapack_givnum) != 2)
+    rb_raise(rb_eArgError, "rank of givnum (9th argument) must be %d", 2);
+  ldgnum = NA_SHAPE0(rblapack_givnum);
+  if (NA_SHAPE1(rblapack_givnum) != (2))
+    rb_raise(rb_eRuntimeError, "shape 1 of givnum must be %d", 2);
+  if (NA_TYPE(rblapack_givnum) != NA_SFLOAT)
+    rblapack_givnum = na_change_type(rblapack_givnum, NA_SFLOAT);
+  givnum = NA_PTR_TYPE(rblapack_givnum, real*);
+  if (!NA_IsNArray(rblapack_difl))
+    rb_raise(rb_eArgError, "difl (11th argument) must be NArray");
+  if (NA_RANK(rblapack_difl) != 1)
+    rb_raise(rb_eArgError, "rank of difl (11th argument) must be %d", 1);
+  k = NA_SHAPE0(rblapack_difl);
+  if (NA_TYPE(rblapack_difl) != NA_SFLOAT)
+    rblapack_difl = na_change_type(rblapack_difl, NA_SFLOAT);
+  difl = NA_PTR_TYPE(rblapack_difl, real*);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (13th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 1)
+    rb_raise(rb_eArgError, "rank of z (13th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_z) != k)
+    rb_raise(rb_eRuntimeError, "shape 0 of z must be the same as shape 0 of difl");
+  if (NA_TYPE(rblapack_z) != NA_SFLOAT)
+    rblapack_z = na_change_type(rblapack_z, NA_SFLOAT);
+  z = NA_PTR_TYPE(rblapack_z, real*);
+  s = (real)NUM2DBL(rblapack_s);
+  nl = NUM2INT(rblapack_nl);
+  if (!NA_IsNArray(rblapack_perm))
+    rb_raise(rb_eArgError, "perm (6th argument) must be NArray");
+  if (NA_RANK(rblapack_perm) != 1)
+    rb_raise(rb_eArgError, "rank of perm (6th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_perm);
+  if (NA_TYPE(rblapack_perm) != NA_LINT)
+    rblapack_perm = na_change_type(rblapack_perm, NA_LINT);
+  perm = NA_PTR_TYPE(rblapack_perm, integer*);
+  if (!NA_IsNArray(rblapack_poles))
+    rb_raise(rb_eArgError, "poles (10th argument) must be NArray");
+  if (NA_RANK(rblapack_poles) != 2)
+    rb_raise(rb_eArgError, "rank of poles (10th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_poles) != ldgnum)
+    rb_raise(rb_eRuntimeError, "shape 0 of poles must be the same as shape 0 of givnum");
+  if (NA_SHAPE1(rblapack_poles) != (2))
+    rb_raise(rb_eRuntimeError, "shape 1 of poles must be %d", 2);
+  if (NA_TYPE(rblapack_poles) != NA_SFLOAT)
+    rblapack_poles = na_change_type(rblapack_poles, NA_SFLOAT);
+  poles = NA_PTR_TYPE(rblapack_poles, real*);
+  c = (real)NUM2DBL(rblapack_c);
+  sqre = NUM2INT(rblapack_sqre);
+  if (!NA_IsNArray(rblapack_difr))
+    rb_raise(rb_eArgError, "difr (12th argument) must be NArray");
+  if (NA_RANK(rblapack_difr) != 2)
+    rb_raise(rb_eArgError, "rank of difr (12th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_difr) != ldgnum)
+    rb_raise(rb_eRuntimeError, "shape 0 of difr must be the same as shape 0 of givnum");
+  if (NA_SHAPE1(rblapack_difr) != (2))
+    rb_raise(rb_eRuntimeError, "shape 1 of difr must be %d", 2);
+  if (NA_TYPE(rblapack_difr) != NA_SFLOAT)
+    rblapack_difr = na_change_type(rblapack_difr, NA_SFLOAT);
+  difr = NA_PTR_TYPE(rblapack_difr, real*);
+  if (!NA_IsNArray(rblapack_givcol))
+    rb_raise(rb_eArgError, "givcol (8th argument) must be NArray");
+  if (NA_RANK(rblapack_givcol) != 2)
+    rb_raise(rb_eArgError, "rank of givcol (8th argument) must be %d", 2);
+  ldgcol = NA_SHAPE0(rblapack_givcol);
+  if (NA_SHAPE1(rblapack_givcol) != (2))
+    rb_raise(rb_eRuntimeError, "shape 1 of givcol must be %d", 2);
+  if (NA_TYPE(rblapack_givcol) != NA_LINT)
+    rblapack_givcol = na_change_type(rblapack_givcol, NA_LINT);
+  givcol = NA_PTR_TYPE(rblapack_givcol, integer*);
+  ldbx = n;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldb;
+    shape[1] = nrhs;
+    rblapack_b_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  b_out__ = NA_PTR_TYPE(rblapack_b_out__, complex*);
+  MEMCPY(b_out__, b, complex, NA_TOTAL(rblapack_b));
+  rblapack_b = rblapack_b_out__;
+  b = b_out__;
+  bx = ALLOC_N(complex, (ldbx)*(nrhs));
+  rwork = ALLOC_N(real, (k*(1+nrhs) + 2*nrhs));
+
+  clals0_(&icompq, &nl, &nr, &sqre, &nrhs, b, &ldb, bx, &ldbx, perm, &givptr, givcol, &ldgcol, givnum, &ldgnum, poles, difl, difr, z, &k, &c, &s, rwork, &info);
+
+  free(bx);
+  free(rwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(2, rblapack_info, rblapack_b);
+}
+
+void
+init_lapack_clals0(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "clals0", rblapack_clals0, -1);
+}

data/ext/clalsa.c

@@ -0,0 +1,270 @@
+#include "rb_lapack.h"
+
+extern VOID clalsa_(integer* icompq, integer* smlsiz, integer* n, integer* nrhs, complex* b, integer* ldb, complex* bx, integer* ldbx, real* u, integer* ldu, real* vt, integer* k, real* difl, real* difr, real* z, real* poles, integer* givptr, integer* givcol, integer* ldgcol, integer* perm, real* givnum, real* c, real* s, real* rwork, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_clalsa(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_icompq;
+  integer icompq; 
+  VALUE rblapack_b;
+  complex *b; 
+  VALUE rblapack_u;
+  real *u; 
+  VALUE rblapack_vt;
+  real *vt; 
+  VALUE rblapack_k;
+  integer *k; 
+  VALUE rblapack_difl;
+  real *difl; 
+  VALUE rblapack_difr;
+  real *difr; 
+  VALUE rblapack_z;
+  real *z; 
+  VALUE rblapack_poles;
+  real *poles; 
+  VALUE rblapack_givptr;
+  integer *givptr; 
+  VALUE rblapack_givcol;
+  integer *givcol; 
+  VALUE rblapack_perm;
+  integer *perm; 
+  VALUE rblapack_givnum;
+  real *givnum; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_s;
+  real *s; 
+  VALUE rblapack_bx;
+  complex *bx; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_b_out__;
+  complex *b_out__;
+  real *rwork;
+  integer *iwork;
+
+  integer ldb;
+  integer nrhs;
+  integer ldu;
+  integer smlsiz;
+  integer n;
+  integer nlvl;
+  integer ldgcol;
+  integer ldbx;
+
+  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  bx, info, b = NumRu::Lapack.clalsa( icompq, b, u, vt, k, difl, difr, z, poles, givptr, givcol, perm, givnum, c, s, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL, PERM, GIVNUM, C, S, RWORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLALSA is an itermediate step in solving the least squares problem\n*  by computing the SVD of the coefficient matrix in compact form (The\n*  singular vectors are computed as products of simple orthorgonal\n*  matrices.).\n*\n*  If ICOMPQ = 0, CLALSA applies the inverse of the left singular vector\n*  matrix of an upper bidiagonal matrix to the right hand side; and if\n*  ICOMPQ = 1, CLALSA applies the right singular vector matrix to the\n*  right hand side. The singular vector matrices were generated in\n*  compact form by CLALSA.\n*\n\n*  Arguments\n*  =========\n*\n*  ICOMPQ (input) INTEGER\n*         Specifies whether the left or the right singular vector\n*         matrix is involved.\n*         = 0: Left singular vector matrix\n*         = 1: Right singular vector matrix\n*\n*  SMLSIZ (input) INTEGER\n*         The maximum size of the subproblems at the bottom of the\n*         computation tree.\n*\n*  N      (input) INTEGER\n*         The row and column dimensions of the upper bidiagonal matrix.\n*\n*  NRHS   (input) INTEGER\n*         The number of columns of B and BX. NRHS must be at least 1.\n*\n*  B      (input/output) COMPLEX array, dimension ( LDB, NRHS )\n*         On input, B contains the right hand sides of the least\n*         squares problem in rows 1 through M.\n*         On output, B contains the solution X in rows 1 through N.\n*\n*  LDB    (input) INTEGER\n*         The leading dimension of B in the calling subprogram.\n*         LDB must be at least max(1,MAX( M, N ) ).\n*\n*  BX     (output) COMPLEX array, dimension ( LDBX, NRHS )\n*         On exit, the result of applying the left or right singular\n*         vector matrix to B.\n*\n*  LDBX   (input) INTEGER\n*         The leading dimension of BX.\n*\n*  U      (input) REAL array, dimension ( LDU, SMLSIZ ).\n*         On entry, U contains the left singular vector matrices of all\n*         subproblems at the bottom level.\n*\n*  LDU    (input) INTEGER, LDU = > N.\n*         The leading dimension of arrays U, VT, DIFL, DIFR,\n*         POLES, GIVNUM, and Z.\n*\n*  VT     (input) REAL array, dimension ( LDU, SMLSIZ+1 ).\n*         On entry, VT' contains the right singular vector matrices of\n*         all subproblems at the bottom level.\n*\n*  K      (input) INTEGER array, dimension ( N ).\n*\n*  DIFL   (input) REAL array, dimension ( LDU, NLVL ).\n*         where NLVL = INT(log_2 (N/(SMLSIZ+1))) + 1.\n*\n*  DIFR   (input) REAL array, dimension ( LDU, 2 * NLVL ).\n*         On entry, DIFL(*, I) and DIFR(*, 2 * I -1) record\n*         distances between singular values on the I-th level and\n*         singular values on the (I -1)-th level, and DIFR(*, 2 * I)\n*         record the normalizing factors of the right singular vectors\n*         matrices of subproblems on I-th level.\n*\n*  Z      (input) REAL array, dimension ( LDU, NLVL ).\n*         On entry, Z(1, I) contains the components of the deflation-\n*         adjusted updating row vector for subproblems on the I-th\n*         level.\n*\n*  POLES  (input) REAL array, dimension ( LDU, 2 * NLVL ).\n*         On entry, POLES(*, 2 * I -1: 2 * I) contains the new and old\n*         singular values involved in the secular equations on the I-th\n*         level.\n*\n*  GIVPTR (input) INTEGER array, dimension ( N ).\n*         On entry, GIVPTR( I ) records the number of Givens\n*         rotations performed on the I-th problem on the computation\n*         tree.\n*\n*  GIVCOL (input) INTEGER array, dimension ( LDGCOL, 2 * NLVL ).\n*         On entry, for each I, GIVCOL(*, 2 * I - 1: 2 * I) records the\n*         locations of Givens rotations performed on the I-th level on\n*         the computation tree.\n*\n*  LDGCOL (input) INTEGER, LDGCOL = > N.\n*         The leading dimension of arrays GIVCOL and PERM.\n*\n*  PERM   (input) INTEGER array, dimension ( LDGCOL, NLVL ).\n*         On entry, PERM(*, I) records permutations done on the I-th\n*         level of the computation tree.\n*\n*  GIVNUM (input) REAL array, dimension ( LDU, 2 * NLVL ).\n*         On entry, GIVNUM(*, 2 *I -1 : 2 * I) records the C- and S-\n*         values of Givens rotations performed on the I-th level on the\n*         computation tree.\n*\n*  C      (input) REAL array, dimension ( N ).\n*         On entry, if the I-th subproblem is not square,\n*         C( I ) contains the C-value of a Givens rotation related to\n*         the right null space of the I-th subproblem.\n*\n*  S      (input) REAL array, dimension ( N ).\n*         On entry, if the I-th subproblem is not square,\n*         S( I ) contains the S-value of a Givens rotation related to\n*         the right null space of the I-th subproblem.\n*\n*  RWORK  (workspace) REAL array, dimension at least\n*         MAX( (SMLSZ+1)*NRHS*3, N*(1+NRHS) + 2*NRHS ).\n*\n*  IWORK  (workspace) INTEGER array.\n*         The dimension must be at least 3 * N\n*\n*  INFO   (output) INTEGER\n*          = 0:  successful exit.\n*          < 0:  if INFO = -i, the i-th argument had an illegal value.\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*     Ming Gu and Ren-Cang Li, Computer Science Division, University of\n*       California at Berkeley, USA\n*     Osni Marques, LBNL/NERSC, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  bx, info, b = NumRu::Lapack.clalsa( icompq, b, u, vt, k, difl, difr, z, poles, givptr, givcol, perm, givnum, c, s, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 15 && argc != 15)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 15)", argc);
+  rblapack_icompq = argv[0];
+  rblapack_b = argv[1];
+  rblapack_u = argv[2];
+  rblapack_vt = argv[3];
+  rblapack_k = argv[4];
+  rblapack_difl = argv[5];
+  rblapack_difr = argv[6];
+  rblapack_z = argv[7];
+  rblapack_poles = argv[8];
+  rblapack_givptr = argv[9];
+  rblapack_givcol = argv[10];
+  rblapack_perm = argv[11];
+  rblapack_givnum = argv[12];
+  rblapack_c = argv[13];
+  rblapack_s = argv[14];
+  if (argc == 15) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  icompq = NUM2INT(rblapack_icompq);
+  if (!NA_IsNArray(rblapack_u))
+    rb_raise(rb_eArgError, "u (3th argument) must be NArray");
+  if (NA_RANK(rblapack_u) != 2)
+    rb_raise(rb_eArgError, "rank of u (3th argument) must be %d", 2);
+  ldu = NA_SHAPE0(rblapack_u);
+  smlsiz = NA_SHAPE1(rblapack_u);
+  if (NA_TYPE(rblapack_u) != NA_SFLOAT)
+    rblapack_u = na_change_type(rblapack_u, NA_SFLOAT);
+  u = NA_PTR_TYPE(rblapack_u, real*);
+  if (!NA_IsNArray(rblapack_k))
+    rb_raise(rb_eArgError, "k (5th argument) must be NArray");
+  if (NA_RANK(rblapack_k) != 1)
+    rb_raise(rb_eArgError, "rank of k (5th argument) must be %d", 1);
+  n = 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_givptr))
+    rb_raise(rb_eArgError, "givptr (10th argument) must be NArray");
+  if (NA_RANK(rblapack_givptr) != 1)
+    rb_raise(rb_eArgError, "rank of givptr (10th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_givptr) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of givptr must be the same as shape 0 of k");
+  if (NA_TYPE(rblapack_givptr) != NA_LINT)
+    rblapack_givptr = na_change_type(rblapack_givptr, NA_LINT);
+  givptr = NA_PTR_TYPE(rblapack_givptr, integer*);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (14th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (14th 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 0 of k");
+  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_b))
+    rb_raise(rb_eArgError, "b (2th argument) must be NArray");
+  if (NA_RANK(rblapack_b) != 2)
+    rb_raise(rb_eArgError, "rank of b (2th argument) must be %d", 2);
+  ldb = NA_SHAPE0(rblapack_b);
+  nrhs = NA_SHAPE1(rblapack_b);
+  if (NA_TYPE(rblapack_b) != NA_SCOMPLEX)
+    rblapack_b = na_change_type(rblapack_b, NA_SCOMPLEX);
+  b = NA_PTR_TYPE(rblapack_b, complex*);
+  if (!NA_IsNArray(rblapack_s))
+    rb_raise(rb_eArgError, "s (15th argument) must be NArray");
+  if (NA_RANK(rblapack_s) != 1)
+    rb_raise(rb_eArgError, "rank of s (15th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_s) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of s must be the same as shape 0 of k");
+  if (NA_TYPE(rblapack_s) != NA_SFLOAT)
+    rblapack_s = na_change_type(rblapack_s, NA_SFLOAT);
+  s = NA_PTR_TYPE(rblapack_s, real*);
+  nlvl = (int)(1.0/log(2.0)*log((double)n/(smlsiz+1))) + 1;
+  if (!NA_IsNArray(rblapack_vt))
+    rb_raise(rb_eArgError, "vt (4th argument) must be NArray");
+  if (NA_RANK(rblapack_vt) != 2)
+    rb_raise(rb_eArgError, "rank of vt (4th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_vt) != ldu)
+    rb_raise(rb_eRuntimeError, "shape 0 of vt must be the same as shape 0 of u");
+  if (NA_SHAPE1(rblapack_vt) != (smlsiz+1))
+    rb_raise(rb_eRuntimeError, "shape 1 of vt must be %d", smlsiz+1);
+  if (NA_TYPE(rblapack_vt) != NA_SFLOAT)
+    rblapack_vt = na_change_type(rblapack_vt, NA_SFLOAT);
+  vt = NA_PTR_TYPE(rblapack_vt, real*);
+  if (!NA_IsNArray(rblapack_difr))
+    rb_raise(rb_eArgError, "difr (7th argument) must be NArray");
+  if (NA_RANK(rblapack_difr) != 2)
+    rb_raise(rb_eArgError, "rank of difr (7th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_difr) != ldu)
+    rb_raise(rb_eRuntimeError, "shape 0 of difr must be the same as shape 0 of u");
+  if (NA_SHAPE1(rblapack_difr) != (2 * nlvl))
+    rb_raise(rb_eRuntimeError, "shape 1 of difr must be %d", 2 * nlvl);
+  if (NA_TYPE(rblapack_difr) != NA_SFLOAT)
+    rblapack_difr = na_change_type(rblapack_difr, NA_SFLOAT);
+  difr = NA_PTR_TYPE(rblapack_difr, real*);
+  if (!NA_IsNArray(rblapack_poles))
+    rb_raise(rb_eArgError, "poles (9th argument) must be NArray");
+  if (NA_RANK(rblapack_poles) != 2)
+    rb_raise(rb_eArgError, "rank of poles (9th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_poles) != ldu)
+    rb_raise(rb_eRuntimeError, "shape 0 of poles must be the same as shape 0 of u");
+  if (NA_SHAPE1(rblapack_poles) != (2 * nlvl))
+    rb_raise(rb_eRuntimeError, "shape 1 of poles must be %d", 2 * nlvl);
+  if (NA_TYPE(rblapack_poles) != NA_SFLOAT)
+    rblapack_poles = na_change_type(rblapack_poles, NA_SFLOAT);
+  poles = NA_PTR_TYPE(rblapack_poles, real*);
+  if (!NA_IsNArray(rblapack_perm))
+    rb_raise(rb_eArgError, "perm (12th argument) must be NArray");
+  if (NA_RANK(rblapack_perm) != 2)
+    rb_raise(rb_eArgError, "rank of perm (12th argument) must be %d", 2);
+  ldgcol = NA_SHAPE0(rblapack_perm);
+  if (NA_SHAPE1(rblapack_perm) != nlvl)
+    rb_raise(rb_eRuntimeError, "shape 1 of perm must be (int)(1.0/log(2.0)*log((double)n/(smlsiz+1))) + 1");
+  if (NA_TYPE(rblapack_perm) != NA_LINT)
+    rblapack_perm = na_change_type(rblapack_perm, NA_LINT);
+  perm = NA_PTR_TYPE(rblapack_perm, integer*);
+  ldbx = n;
+  if (!NA_IsNArray(rblapack_difl))
+    rb_raise(rb_eArgError, "difl (6th argument) must be NArray");
+  if (NA_RANK(rblapack_difl) != 2)
+    rb_raise(rb_eArgError, "rank of difl (6th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_difl) != ldu)
+    rb_raise(rb_eRuntimeError, "shape 0 of difl must be the same as shape 0 of u");
+  if (NA_SHAPE1(rblapack_difl) != nlvl)
+    rb_raise(rb_eRuntimeError, "shape 1 of difl must be (int)(1.0/log(2.0)*log((double)n/(smlsiz+1))) + 1");
+  if (NA_TYPE(rblapack_difl) != NA_SFLOAT)
+    rblapack_difl = na_change_type(rblapack_difl, NA_SFLOAT);
+  difl = NA_PTR_TYPE(rblapack_difl, real*);
+  if (!NA_IsNArray(rblapack_givcol))
+    rb_raise(rb_eArgError, "givcol (11th argument) must be NArray");
+  if (NA_RANK(rblapack_givcol) != 2)
+    rb_raise(rb_eArgError, "rank of givcol (11th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_givcol) != ldgcol)
+    rb_raise(rb_eRuntimeError, "shape 0 of givcol must be the same as shape 0 of perm");
+  if (NA_SHAPE1(rblapack_givcol) != (2 * nlvl))
+    rb_raise(rb_eRuntimeError, "shape 1 of givcol must be %d", 2 * nlvl);
+  if (NA_TYPE(rblapack_givcol) != NA_LINT)
+    rblapack_givcol = na_change_type(rblapack_givcol, NA_LINT);
+  givcol = NA_PTR_TYPE(rblapack_givcol, integer*);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (8th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 2)
+    rb_raise(rb_eArgError, "rank of z (8th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_z) != ldu)
+    rb_raise(rb_eRuntimeError, "shape 0 of z must be the same as shape 0 of u");
+  if (NA_SHAPE1(rblapack_z) != nlvl)
+    rb_raise(rb_eRuntimeError, "shape 1 of z must be (int)(1.0/log(2.0)*log((double)n/(smlsiz+1))) + 1");
+  if (NA_TYPE(rblapack_z) != NA_SFLOAT)
+    rblapack_z = na_change_type(rblapack_z, NA_SFLOAT);
+  z = NA_PTR_TYPE(rblapack_z, real*);
+  if (!NA_IsNArray(rblapack_givnum))
+    rb_raise(rb_eArgError, "givnum (13th argument) must be NArray");
+  if (NA_RANK(rblapack_givnum) != 2)
+    rb_raise(rb_eArgError, "rank of givnum (13th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_givnum) != ldu)
+    rb_raise(rb_eRuntimeError, "shape 0 of givnum must be the same as shape 0 of u");
+  if (NA_SHAPE1(rblapack_givnum) != (2 * nlvl))
+    rb_raise(rb_eRuntimeError, "shape 1 of givnum must be %d", 2 * nlvl);
+  if (NA_TYPE(rblapack_givnum) != NA_SFLOAT)
+    rblapack_givnum = na_change_type(rblapack_givnum, NA_SFLOAT);
+  givnum = NA_PTR_TYPE(rblapack_givnum, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldbx;
+    shape[1] = nrhs;
+    rblapack_bx = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  bx = NA_PTR_TYPE(rblapack_bx, complex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldb;
+    shape[1] = nrhs;
+    rblapack_b_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  b_out__ = NA_PTR_TYPE(rblapack_b_out__, complex*);
+  MEMCPY(b_out__, b, complex, NA_TOTAL(rblapack_b));
+  rblapack_b = rblapack_b_out__;
+  b = b_out__;
+  rwork = ALLOC_N(real, (MAX(n,(smlsiz+1)*nrhs*3)));
+  iwork = ALLOC_N(integer, (3 * n));
+
+  clalsa_(&icompq, &smlsiz, &n, &nrhs, b, &ldb, bx, &ldbx, u, &ldu, vt, k, difl, difr, z, poles, givptr, givcol, &ldgcol, perm, givnum, c, s, rwork, iwork, &info);
+
+  free(rwork);
+  free(iwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(3, rblapack_bx, rblapack_info, rblapack_b);
+}
+
+void
+init_lapack_clalsa(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "clalsa", rblapack_clalsa, -1);
+}