ruby-lapack 1.7 → 1.7.1

data/ext/sbbcsd.c

@@ -0,0 +1,287 @@
+#include "rb_lapack.h"
+
+extern VOID sbbcsd_(char* jobu1, char* jobu2, char* jobv1t, char* jobv2t, char* trans, integer* m, integer* p, integer* q, real* theta, real* phi, real* u1, integer* ldu1, real* u2, integer* ldu2, real* v1t, integer* ldv1t, real* v2t, integer* ldv2t, real* b11d, real* b11e, real* b12d, real* b12e, real* b21d, real* b21e, real* b22d, real* b22e, real* work, integer* lwork, integer* info);
+
+
+static VALUE
+rblapack_sbbcsd(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_jobu1;
+  char jobu1; 
+  VALUE rblapack_jobu2;
+  char jobu2; 
+  VALUE rblapack_jobv1t;
+  char jobv1t; 
+  VALUE rblapack_jobv2t;
+  char jobv2t; 
+  VALUE rblapack_trans;
+  char trans; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_theta;
+  real *theta; 
+  VALUE rblapack_phi;
+  real *phi; 
+  VALUE rblapack_u1;
+  real *u1; 
+  VALUE rblapack_u2;
+  real *u2; 
+  VALUE rblapack_v1t;
+  real *v1t; 
+  VALUE rblapack_v2t;
+  real *v2t; 
+  VALUE rblapack_lwork;
+  integer lwork; 
+  VALUE rblapack_b11d;
+  real *b11d; 
+  VALUE rblapack_b11e;
+  real *b11e; 
+  VALUE rblapack_b12d;
+  real *b12d; 
+  VALUE rblapack_b12e;
+  real *b12e; 
+  VALUE rblapack_b21d;
+  real *b21d; 
+  VALUE rblapack_b21e;
+  real *b21e; 
+  VALUE rblapack_b22d;
+  real *b22d; 
+  VALUE rblapack_b22e;
+  real *b22e; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_theta_out__;
+  real *theta_out__;
+  VALUE rblapack_u1_out__;
+  real *u1_out__;
+  VALUE rblapack_u2_out__;
+  real *u2_out__;
+  VALUE rblapack_v1t_out__;
+  real *v1t_out__;
+  VALUE rblapack_v2t_out__;
+  real *v2t_out__;
+  real *work;
+
+  integer q;
+  integer ldu1;
+  integer p;
+  integer ldu2;
+  integer ldv1t;
+  integer ldv2t;
+
+  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  b11d, b11e, b12d, b12e, b21d, b21e, b22d, b22e, info, theta, u1, u2, v1t, v2t = NumRu::Lapack.sbbcsd( jobu1, jobu2, jobv1t, jobv2t, trans, m, theta, phi, u1, u2, v1t, v2t, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q, THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T, V2T, LDV2T, B11D, B11E, B12D, B12E, B21D, B21E, B22D, B22E, WORK, LWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SBBCSD computes the CS decomposition of an orthogonal matrix in\n*  bidiagonal-block form,\n*\n*\n*      [ B11 | B12 0  0 ]\n*      [  0  |  0 -I  0 ]\n*  X = [----------------]\n*      [ B21 | B22 0  0 ]\n*      [  0  |  0  0  I ]\n*\n*                                [  C | -S  0  0 ]\n*                    [ U1 |    ] [  0 |  0 -I  0 ] [ V1 |    ]**T\n*                  = [---------] [---------------] [---------]   .\n*                    [    | U2 ] [  S |  C  0  0 ] [    | V2 ]\n*                                [  0 |  0  0  I ]\n*\n*  X is M-by-M, its top-left block is P-by-Q, and Q must be no larger\n*  than P, M-P, or M-Q. (If Q is not the smallest index, then X must be\n*  transposed and/or permuted. This can be done in constant time using\n*  the TRANS and SIGNS options. See SORCSD for details.)\n*\n*  The bidiagonal matrices B11, B12, B21, and B22 are represented\n*  implicitly by angles THETA(1:Q) and PHI(1:Q-1).\n*\n*  The orthogonal matrices U1, U2, V1T, and V2T are input/output.\n*  The input matrices are pre- or post-multiplied by the appropriate\n*  singular vector matrices.\n*\n\n*  Arguments\n*  =========\n*\n*  JOBU1   (input) CHARACTER\n*          = 'Y':      U1 is updated;\n*          otherwise:  U1 is not updated.\n*\n*  JOBU2   (input) CHARACTER\n*          = 'Y':      U2 is updated;\n*          otherwise:  U2 is not updated.\n*\n*  JOBV1T  (input) CHARACTER\n*          = 'Y':      V1T is updated;\n*          otherwise:  V1T is not updated.\n*\n*  JOBV2T  (input) CHARACTER\n*          = 'Y':      V2T is updated;\n*          otherwise:  V2T is not updated.\n*\n*  TRANS   (input) CHARACTER\n*          = 'T':      X, U1, U2, V1T, and V2T are stored in row-major\n*                      order;\n*          otherwise:  X, U1, U2, V1T, and V2T are stored in column-\n*                      major order.\n*\n*  M       (input) INTEGER\n*          The number of rows and columns in X, the orthogonal matrix in\n*          bidiagonal-block form.\n*\n*  P       (input) INTEGER\n*          The number of rows in the top-left block of X. 0 <= P <= M.\n*\n*  Q       (input) INTEGER\n*          The number of columns in the top-left block of X.\n*          0 <= Q <= MIN(P,M-P,M-Q).\n*\n*  THETA   (input/output) REAL array, dimension (Q)\n*          On entry, the angles THETA(1),...,THETA(Q) that, along with\n*          PHI(1), ...,PHI(Q-1), define the matrix in bidiagonal-block\n*          form. On exit, the angles whose cosines and sines define the\n*          diagonal blocks in the CS decomposition.\n*\n*  PHI     (input/workspace) REAL array, dimension (Q-1)\n*          The angles PHI(1),...,PHI(Q-1) that, along with THETA(1),...,\n*          THETA(Q), define the matrix in bidiagonal-block form.\n*\n*  U1      (input/output) REAL array, dimension (LDU1,P)\n*          On entry, an LDU1-by-P matrix. On exit, U1 is postmultiplied\n*          by the left singular vector matrix common to [ B11 ; 0 ] and\n*          [ B12 0 0 ; 0 -I 0 0 ].\n*\n*  LDU1    (input) INTEGER\n*          The leading dimension of the array U1.\n*\n*  U2      (input/output) REAL array, dimension (LDU2,M-P)\n*          On entry, an LDU2-by-(M-P) matrix. On exit, U2 is\n*          postmultiplied by the left singular vector matrix common to\n*          [ B21 ; 0 ] and [ B22 0 0 ; 0 0 I ].\n*\n*  LDU2    (input) INTEGER\n*          The leading dimension of the array U2.\n*\n*  V1T     (input/output) REAL array, dimension (LDV1T,Q)\n*          On entry, a LDV1T-by-Q matrix. On exit, V1T is premultiplied\n*          by the transpose of the right singular vector\n*          matrix common to [ B11 ; 0 ] and [ B21 ; 0 ].\n*\n*  LDV1T   (input) INTEGER\n*          The leading dimension of the array V1T.\n*\n*  V2T     (input/output) REAL array, dimenison (LDV2T,M-Q)\n*          On entry, a LDV2T-by-(M-Q) matrix. On exit, V2T is\n*          premultiplied by the transpose of the right\n*          singular vector matrix common to [ B12 0 0 ; 0 -I 0 ] and\n*          [ B22 0 0 ; 0 0 I ].\n*\n*  LDV2T   (input) INTEGER\n*          The leading dimension of the array V2T.\n*\n*  B11D    (output) REAL array, dimension (Q)\n*          When SBBCSD converges, B11D contains the cosines of THETA(1),\n*          ..., THETA(Q). If SBBCSD fails to converge, then B11D\n*          contains the diagonal of the partially reduced top-left\n*          block.\n*\n*  B11E    (output) REAL array, dimension (Q-1)\n*          When SBBCSD converges, B11E contains zeros. If SBBCSD fails\n*          to converge, then B11E contains the superdiagonal of the\n*          partially reduced top-left block.\n*\n*  B12D    (output) REAL array, dimension (Q)\n*          When SBBCSD converges, B12D contains the negative sines of\n*          THETA(1), ..., THETA(Q). If SBBCSD fails to converge, then\n*          B12D contains the diagonal of the partially reduced top-right\n*          block.\n*\n*  B12E    (output) REAL array, dimension (Q-1)\n*          When SBBCSD converges, B12E contains zeros. If SBBCSD fails\n*          to converge, then B12E contains the subdiagonal of the\n*          partially reduced top-right block.\n*\n*  WORK    (workspace) REAL array, dimension (MAX(1,LWORK))\n*          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n*\n*  LWORK   (input) INTEGER\n*          The dimension of the array WORK. LWORK >= MAX(1,8*Q).\n*\n*          If LWORK = -1, then a workspace query is assumed; the\n*          routine only calculates the optimal size of the WORK array,\n*          returns this value as the first entry of the work array, and\n*          no error message related to LWORK is issued by XERBLA.\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit.\n*          < 0:  if INFO = -i, the i-th argument had an illegal value.\n*          > 0:  if SBBCSD did not converge, INFO specifies the number\n*                of nonzero entries in PHI, and B11D, B11E, etc.,\n*                contain the partially reduced matrix.\n*\n*  Reference\n*  =========\n*\n*  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.\n*      Algorithms, 50(1):33-65, 2009.\n*\n*  Internal Parameters\n*  ===================\n*\n*  TOLMUL  REAL, default = MAX(10,MIN(100,EPS**(-1/8)))\n*          TOLMUL controls the convergence criterion of the QR loop.\n*          Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they\n*          are within TOLMUL*EPS of either bound.\n*\n\n*  ===================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  b11d, b11e, b12d, b12e, b21d, b21e, b22d, b22e, info, theta, u1, u2, v1t, v2t = NumRu::Lapack.sbbcsd( jobu1, jobu2, jobv1t, jobv2t, trans, m, theta, phi, u1, u2, v1t, v2t, [:lwork => lwork, :usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 12 && argc != 13)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 12)", argc);
+  rblapack_jobu1 = argv[0];
+  rblapack_jobu2 = argv[1];
+  rblapack_jobv1t = argv[2];
+  rblapack_jobv2t = argv[3];
+  rblapack_trans = argv[4];
+  rblapack_m = argv[5];
+  rblapack_theta = argv[6];
+  rblapack_phi = argv[7];
+  rblapack_u1 = argv[8];
+  rblapack_u2 = argv[9];
+  rblapack_v1t = argv[10];
+  rblapack_v2t = argv[11];
+  if (argc == 13) {
+    rblapack_lwork = argv[12];
+  } else if (rblapack_options != Qnil) {
+    rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
+  } else {
+    rblapack_lwork = Qnil;
+  }
+
+  jobu1 = StringValueCStr(rblapack_jobu1)[0];
+  jobv1t = StringValueCStr(rblapack_jobv1t)[0];
+  trans = StringValueCStr(rblapack_trans)[0];
+  if (!NA_IsNArray(rblapack_theta))
+    rb_raise(rb_eArgError, "theta (7th argument) must be NArray");
+  if (NA_RANK(rblapack_theta) != 1)
+    rb_raise(rb_eArgError, "rank of theta (7th argument) must be %d", 1);
+  q = NA_SHAPE0(rblapack_theta);
+  if (NA_TYPE(rblapack_theta) != NA_SFLOAT)
+    rblapack_theta = na_change_type(rblapack_theta, NA_SFLOAT);
+  theta = NA_PTR_TYPE(rblapack_theta, real*);
+  if (!NA_IsNArray(rblapack_u1))
+    rb_raise(rb_eArgError, "u1 (9th argument) must be NArray");
+  if (NA_RANK(rblapack_u1) != 2)
+    rb_raise(rb_eArgError, "rank of u1 (9th argument) must be %d", 2);
+  ldu1 = NA_SHAPE0(rblapack_u1);
+  p = NA_SHAPE1(rblapack_u1);
+  if (NA_TYPE(rblapack_u1) != NA_SFLOAT)
+    rblapack_u1 = na_change_type(rblapack_u1, NA_SFLOAT);
+  u1 = NA_PTR_TYPE(rblapack_u1, real*);
+  if (!NA_IsNArray(rblapack_v1t))
+    rb_raise(rb_eArgError, "v1t (11th argument) must be NArray");
+  if (NA_RANK(rblapack_v1t) != 2)
+    rb_raise(rb_eArgError, "rank of v1t (11th argument) must be %d", 2);
+  ldv1t = NA_SHAPE0(rblapack_v1t);
+  if (NA_SHAPE1(rblapack_v1t) != q)
+    rb_raise(rb_eRuntimeError, "shape 1 of v1t must be the same as shape 0 of theta");
+  if (NA_TYPE(rblapack_v1t) != NA_SFLOAT)
+    rblapack_v1t = na_change_type(rblapack_v1t, NA_SFLOAT);
+  v1t = NA_PTR_TYPE(rblapack_v1t, real*);
+  if (rblapack_lwork == Qnil)
+    lwork = 8*q;
+  else {
+    lwork = NUM2INT(rblapack_lwork);
+  }
+  jobu2 = StringValueCStr(rblapack_jobu2)[0];
+  m = NUM2INT(rblapack_m);
+  if (!NA_IsNArray(rblapack_u2))
+    rb_raise(rb_eArgError, "u2 (10th argument) must be NArray");
+  if (NA_RANK(rblapack_u2) != 2)
+    rb_raise(rb_eArgError, "rank of u2 (10th argument) must be %d", 2);
+  ldu2 = NA_SHAPE0(rblapack_u2);
+  if (NA_SHAPE1(rblapack_u2) != (m-p))
+    rb_raise(rb_eRuntimeError, "shape 1 of u2 must be %d", m-p);
+  if (NA_TYPE(rblapack_u2) != NA_SFLOAT)
+    rblapack_u2 = na_change_type(rblapack_u2, NA_SFLOAT);
+  u2 = NA_PTR_TYPE(rblapack_u2, real*);
+  jobv2t = StringValueCStr(rblapack_jobv2t)[0];
+  if (!NA_IsNArray(rblapack_v2t))
+    rb_raise(rb_eArgError, "v2t (12th argument) must be NArray");
+  if (NA_RANK(rblapack_v2t) != 2)
+    rb_raise(rb_eArgError, "rank of v2t (12th argument) must be %d", 2);
+  ldv2t = NA_SHAPE0(rblapack_v2t);
+  if (NA_SHAPE1(rblapack_v2t) != (m-q))
+    rb_raise(rb_eRuntimeError, "shape 1 of v2t must be %d", m-q);
+  if (NA_TYPE(rblapack_v2t) != NA_SFLOAT)
+    rblapack_v2t = na_change_type(rblapack_v2t, NA_SFLOAT);
+  v2t = NA_PTR_TYPE(rblapack_v2t, real*);
+  if (!NA_IsNArray(rblapack_phi))
+    rb_raise(rb_eArgError, "phi (8th argument) must be NArray");
+  if (NA_RANK(rblapack_phi) != 1)
+    rb_raise(rb_eArgError, "rank of phi (8th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_phi) != (q-1))
+    rb_raise(rb_eRuntimeError, "shape 0 of phi must be %d", q-1);
+  if (NA_TYPE(rblapack_phi) != NA_SFLOAT)
+    rblapack_phi = na_change_type(rblapack_phi, NA_SFLOAT);
+  phi = NA_PTR_TYPE(rblapack_phi, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_b11d = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b11d = NA_PTR_TYPE(rblapack_b11d, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q-1;
+    rblapack_b11e = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b11e = NA_PTR_TYPE(rblapack_b11e, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_b12d = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b12d = NA_PTR_TYPE(rblapack_b12d, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q-1;
+    rblapack_b12e = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b12e = NA_PTR_TYPE(rblapack_b12e, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_b21d = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b21d = NA_PTR_TYPE(rblapack_b21d, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q-1;
+    rblapack_b21e = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b21e = NA_PTR_TYPE(rblapack_b21e, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_b22d = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b22d = NA_PTR_TYPE(rblapack_b22d, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q-1;
+    rblapack_b22e = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  b22e = NA_PTR_TYPE(rblapack_b22e, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_theta_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  theta_out__ = NA_PTR_TYPE(rblapack_theta_out__, real*);
+  MEMCPY(theta_out__, theta, real, NA_TOTAL(rblapack_theta));
+  rblapack_theta = rblapack_theta_out__;
+  theta = theta_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldu1;
+    shape[1] = p;
+    rblapack_u1_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  u1_out__ = NA_PTR_TYPE(rblapack_u1_out__, real*);
+  MEMCPY(u1_out__, u1, real, NA_TOTAL(rblapack_u1));
+  rblapack_u1 = rblapack_u1_out__;
+  u1 = u1_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldu2;
+    shape[1] = m-p;
+    rblapack_u2_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  u2_out__ = NA_PTR_TYPE(rblapack_u2_out__, real*);
+  MEMCPY(u2_out__, u2, real, NA_TOTAL(rblapack_u2));
+  rblapack_u2 = rblapack_u2_out__;
+  u2 = u2_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldv1t;
+    shape[1] = q;
+    rblapack_v1t_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  v1t_out__ = NA_PTR_TYPE(rblapack_v1t_out__, real*);
+  MEMCPY(v1t_out__, v1t, real, NA_TOTAL(rblapack_v1t));
+  rblapack_v1t = rblapack_v1t_out__;
+  v1t = v1t_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldv2t;
+    shape[1] = m-q;
+    rblapack_v2t_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  v2t_out__ = NA_PTR_TYPE(rblapack_v2t_out__, real*);
+  MEMCPY(v2t_out__, v2t, real, NA_TOTAL(rblapack_v2t));
+  rblapack_v2t = rblapack_v2t_out__;
+  v2t = v2t_out__;
+  work = ALLOC_N(real, (MAX(1,lwork)));
+
+  sbbcsd_(&jobu1, &jobu2, &jobv1t, &jobv2t, &trans, &m, &p, &q, theta, phi, u1, &ldu1, u2, &ldu2, v1t, &ldv1t, v2t, &ldv2t, b11d, b11e, b12d, b12e, b21d, b21e, b22d, b22e, work, &lwork, &info);
+
+  free(work);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(14, rblapack_b11d, rblapack_b11e, rblapack_b12d, rblapack_b12e, rblapack_b21d, rblapack_b21e, rblapack_b22d, rblapack_b22e, rblapack_info, rblapack_theta, rblapack_u1, rblapack_u2, rblapack_v1t, rblapack_v2t);
+}
+
+void
+init_lapack_sbbcsd(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sbbcsd", rblapack_sbbcsd, -1);
+}

data/ext/sbdsdc.c

@@ -0,0 +1,157 @@
+#include "rb_lapack.h"
+
+extern VOID sbdsdc_(char* uplo, char* compq, integer* n, real* d, real* e, real* u, integer* ldu, real* vt, integer* ldvt, real* q, integer* iq, real* work, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_sbdsdc(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_compq;
+  char compq; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_e;
+  real *e; 
+  VALUE rblapack_u;
+  real *u; 
+  VALUE rblapack_vt;
+  real *vt; 
+  VALUE rblapack_q;
+  real *q; 
+  VALUE rblapack_iq;
+  integer *iq; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_e_out__;
+  real *e_out__;
+  real *work;
+  integer *iwork;
+
+  integer n;
+  integer c__9;
+  integer c__0;
+  integer ldq;
+  integer ldvt;
+  integer ldiq;
+  integer lwork;
+  integer ldu;
+  integer smlsiz;
+
+  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  u, vt, q, iq, info, d, e = NumRu::Lapack.sbdsdc( uplo, compq, d, e, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ, WORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SBDSDC computes the singular value decomposition (SVD) of a real\n*  N-by-N (upper or lower) bidiagonal matrix B:  B = U * S * VT,\n*  using a divide and conquer method, where S is a diagonal matrix\n*  with non-negative diagonal elements (the singular values of B), and\n*  U and VT are orthogonal matrices of left and right singular vectors,\n*  respectively. SBDSDC can be used to compute all singular values,\n*  and optionally, singular vectors or singular vectors in compact form.\n*\n*  This code makes very mild assumptions about floating point\n*  arithmetic. It will work on machines with a guard digit in\n*  add/subtract, or on those binary machines without guard digits\n*  which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.\n*  It could conceivably fail on hexadecimal or decimal machines\n*  without guard digits, but we know of none.  See SLASD3 for details.\n*\n*  The code currently calls SLASDQ if singular values only are desired.\n*  However, it can be slightly modified to compute singular values\n*  using the divide and conquer method.\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          = 'U':  B is upper bidiagonal.\n*          = 'L':  B is lower bidiagonal.\n*\n*  COMPQ   (input) CHARACTER*1\n*          Specifies whether singular vectors are to be computed\n*          as follows:\n*          = 'N':  Compute singular values only;\n*          = 'P':  Compute singular values and compute singular\n*                  vectors in compact form;\n*          = 'I':  Compute singular values and singular vectors.\n*\n*  N       (input) INTEGER\n*          The order of the matrix B.  N >= 0.\n*\n*  D       (input/output) REAL array, dimension (N)\n*          On entry, the n diagonal elements of the bidiagonal matrix B.\n*          On exit, if INFO=0, the singular values of B.\n*\n*  E       (input/output) REAL array, dimension (N-1)\n*          On entry, the elements of E contain the offdiagonal\n*          elements of the bidiagonal matrix whose SVD is desired.\n*          On exit, E has been destroyed.\n*\n*  U       (output) REAL array, dimension (LDU,N)\n*          If  COMPQ = 'I', then:\n*             On exit, if INFO = 0, U contains the left singular vectors\n*             of the bidiagonal matrix.\n*          For other values of COMPQ, U is not referenced.\n*\n*  LDU     (input) INTEGER\n*          The leading dimension of the array U.  LDU >= 1.\n*          If singular vectors are desired, then LDU >= max( 1, N ).\n*\n*  VT      (output) REAL array, dimension (LDVT,N)\n*          If  COMPQ = 'I', then:\n*             On exit, if INFO = 0, VT' contains the right singular\n*             vectors of the bidiagonal matrix.\n*          For other values of COMPQ, VT is not referenced.\n*\n*  LDVT    (input) INTEGER\n*          The leading dimension of the array VT.  LDVT >= 1.\n*          If singular vectors are desired, then LDVT >= max( 1, N ).\n*\n*  Q       (output) REAL array, dimension (LDQ)\n*          If  COMPQ = 'P', then:\n*             On exit, if INFO = 0, Q and IQ contain the left\n*             and right singular vectors in a compact form,\n*             requiring O(N log N) space instead of 2*N**2.\n*             In particular, Q contains all the REAL data in\n*             LDQ >= N*(11 + 2*SMLSIZ + 8*INT(LOG_2(N/(SMLSIZ+1))))\n*             words of memory, where SMLSIZ is returned by ILAENV and\n*             is equal to the maximum size of the subproblems at the\n*             bottom of the computation tree (usually about 25).\n*          For other values of COMPQ, Q is not referenced.\n*\n*  IQ      (output) INTEGER array, dimension (LDIQ)\n*          If  COMPQ = 'P', then:\n*             On exit, if INFO = 0, Q and IQ contain the left\n*             and right singular vectors in a compact form,\n*             requiring O(N log N) space instead of 2*N**2.\n*             In particular, IQ contains all INTEGER data in\n*             LDIQ >= N*(3 + 3*INT(LOG_2(N/(SMLSIZ+1))))\n*             words of memory, where SMLSIZ is returned by ILAENV and\n*             is equal to the maximum size of the subproblems at the\n*             bottom of the computation tree (usually about 25).\n*          For other values of COMPQ, IQ is not referenced.\n*\n*  WORK    (workspace) REAL array, dimension (MAX(1,LWORK))\n*          If COMPQ = 'N' then LWORK >= (4 * N).\n*          If COMPQ = 'P' then LWORK >= (6 * N).\n*          If COMPQ = 'I' then LWORK >= (3 * N**2 + 4 * N).\n*\n*  IWORK   (workspace) INTEGER array, dimension (8*N)\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit.\n*          < 0:  if INFO = -i, the i-th argument had an illegal value.\n*          > 0:  The algorithm failed to compute a singular value.\n*                The update process of divide and conquer failed.\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*     Ming Gu and Huan Ren, Computer Science Division, University of\n*     California at Berkeley, USA\n*  =====================================================================\n*  Changed dimension statement in comment describing E from (N) to\n*  (N-1).  Sven, 17 Feb 05.\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  u, vt, q, iq, info, d, e = NumRu::Lapack.sbdsdc( uplo, compq, d, e, [: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_uplo = argv[0];
+  rblapack_compq = argv[1];
+  rblapack_d = argv[2];
+  rblapack_e = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (3th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (3th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_d);
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  c__9 = 9;
+  compq = StringValueCStr(rblapack_compq)[0];
+  c__0 = 0;
+  ldvt = lsame_(&compq,"I") ? MAX(1,n) : 0;
+  lwork = lsame_(&compq,"N") ? 4*n : lsame_(&compq,"P") ? 6*n : lsame_(&compq,"I") ? 3*n*n+4*n : 0;
+  smlsiz = ilaenv_(&c__9, "SBDSDC", " ", &c__0, &c__0, &c__0, &c__0);
+  if (!NA_IsNArray(rblapack_e))
+    rb_raise(rb_eArgError, "e (4th argument) must be NArray");
+  if (NA_RANK(rblapack_e) != 1)
+    rb_raise(rb_eArgError, "rank of e (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_e) != (n-1))
+    rb_raise(rb_eRuntimeError, "shape 0 of e must be %d", n-1);
+  if (NA_TYPE(rblapack_e) != NA_SFLOAT)
+    rblapack_e = na_change_type(rblapack_e, NA_SFLOAT);
+  e = NA_PTR_TYPE(rblapack_e, real*);
+  ldiq = lsame_(&compq,"P") ? n*(3+3*(int)(log(((double)n)/(smlsiz+1))/log(2.0))) : 0;
+  ldq = lsame_(&compq,"P") ? n*(11+2*smlsiz+8*(int)(log(((double)n)/(smlsiz+1))/log(2.0))) : 0;
+  ldu = lsame_(&compq,"I") ? MAX(1,n) : 0;
+  {
+    na_shape_t shape[2];
+    shape[0] = lsame_(&compq,"I") ? ldu : 0;
+    shape[1] = lsame_(&compq,"I") ? n : 0;
+    rblapack_u = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  u = NA_PTR_TYPE(rblapack_u, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lsame_(&compq,"I") ? ldvt : 0;
+    shape[1] = lsame_(&compq,"I") ? n : 0;
+    rblapack_vt = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  vt = NA_PTR_TYPE(rblapack_vt, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = lsame_(&compq,"I") ? ldq : 0;
+    rblapack_q = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  q = NA_PTR_TYPE(rblapack_q, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = lsame_(&compq,"I") ? ldiq : 0;
+    rblapack_iq = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  iq = NA_PTR_TYPE(rblapack_iq, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_d_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  d_out__ = NA_PTR_TYPE(rblapack_d_out__, real*);
+  MEMCPY(d_out__, d, real, NA_TOTAL(rblapack_d));
+  rblapack_d = rblapack_d_out__;
+  d = d_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n-1;
+    rblapack_e_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  e_out__ = NA_PTR_TYPE(rblapack_e_out__, real*);
+  MEMCPY(e_out__, e, real, NA_TOTAL(rblapack_e));
+  rblapack_e = rblapack_e_out__;
+  e = e_out__;
+  work = ALLOC_N(real, (MAX(1,lwork)));
+  iwork = ALLOC_N(integer, (8*n));
+
+  sbdsdc_(&uplo, &compq, &n, d, e, u, &ldu, vt, &ldvt, q, iq, work, iwork, &info);
+
+  free(work);
+  free(iwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(7, rblapack_u, rblapack_vt, rblapack_q, rblapack_iq, rblapack_info, rblapack_d, rblapack_e);
+}
+
+void
+init_lapack_sbdsdc(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sbdsdc", rblapack_sbdsdc, -1);
+}

data/ext/sbdsqr.c

@@ -0,0 +1,182 @@
+#include "rb_lapack.h"
+
+extern VOID sbdsqr_(char* uplo, integer* n, integer* ncvt, integer* nru, integer* ncc, real* d, real* e, real* vt, integer* ldvt, real* u, integer* ldu, real* c, integer* ldc, real* work, integer* info);
+
+
+static VALUE
+rblapack_sbdsqr(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_nru;
+  integer nru; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_e;
+  real *e; 
+  VALUE rblapack_vt;
+  real *vt; 
+  VALUE rblapack_u;
+  real *u; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_e_out__;
+  real *e_out__;
+  VALUE rblapack_vt_out__;
+  real *vt_out__;
+  VALUE rblapack_u_out__;
+  real *u_out__;
+  VALUE rblapack_c_out__;
+  real *c_out__;
+  real *work;
+
+  integer n;
+  integer ldvt;
+  integer ncvt;
+  integer ldu;
+  integer ldc;
+  integer ncc;
+
+  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, d, e, vt, u, c = NumRu::Lapack.sbdsqr( uplo, nru, d, e, vt, u, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, LDU, C, LDC, WORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SBDSQR computes the singular values and, optionally, the right and/or\n*  left singular vectors from the singular value decomposition (SVD) of\n*  a real N-by-N (upper or lower) bidiagonal matrix B using the implicit\n*  zero-shift QR algorithm.  The SVD of B has the form\n*  \n*     B = Q * S * P**T\n*  \n*  where S is the diagonal matrix of singular values, Q is an orthogonal\n*  matrix of left singular vectors, and P is an orthogonal matrix of\n*  right singular vectors.  If left singular vectors are requested, this\n*  subroutine actually returns U*Q instead of Q, and, if right singular\n*  vectors are requested, this subroutine returns P**T*VT instead of\n*  P**T, for given real input matrices U and VT.  When U and VT are the\n*  orthogonal matrices that reduce a general matrix A to bidiagonal\n*  form:  A = U*B*VT, as computed by SGEBRD, then\n* \n*     A = (U*Q) * S * (P**T*VT)\n* \n*  is the SVD of A.  Optionally, the subroutine may also compute Q**T*C\n*  for a given real input matrix C.\n*\n*  See \"Computing  Small Singular Values of Bidiagonal Matrices With\n*  Guaranteed High Relative Accuracy,\" by J. Demmel and W. Kahan,\n*  LAPACK Working Note #3 (or SIAM J. Sci. Statist. Comput. vol. 11,\n*  no. 5, pp. 873-912, Sept 1990) and\n*  \"Accurate singular values and differential qd algorithms,\" by\n*  B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics\n*  Department, University of California at Berkeley, July 1992\n*  for a detailed description of the algorithm.\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          = 'U':  B is upper bidiagonal;\n*          = 'L':  B is lower bidiagonal.\n*\n*  N       (input) INTEGER\n*          The order of the matrix B.  N >= 0.\n*\n*  NCVT    (input) INTEGER\n*          The number of columns of the matrix VT. NCVT >= 0.\n*\n*  NRU     (input) INTEGER\n*          The number of rows of the matrix U. NRU >= 0.\n*\n*  NCC     (input) INTEGER\n*          The number of columns of the matrix C. NCC >= 0.\n*\n*  D       (input/output) REAL array, dimension (N)\n*          On entry, the n diagonal elements of the bidiagonal matrix B.\n*          On exit, if INFO=0, the singular values of B in decreasing\n*          order.\n*\n*  E       (input/output) REAL array, dimension (N-1)\n*          On entry, the N-1 offdiagonal elements of the bidiagonal\n*          matrix B.\n*          On exit, if INFO = 0, E is destroyed; if INFO > 0, D and E\n*          will contain the diagonal and superdiagonal elements of a\n*          bidiagonal matrix orthogonally equivalent to the one given\n*          as input.\n*\n*  VT      (input/output) REAL array, dimension (LDVT, NCVT)\n*          On entry, an N-by-NCVT matrix VT.\n*          On exit, VT is overwritten by P**T * VT.\n*          Not referenced if NCVT = 0.\n*\n*  LDVT    (input) INTEGER\n*          The leading dimension of the array VT.\n*          LDVT >= max(1,N) if NCVT > 0; LDVT >= 1 if NCVT = 0.\n*\n*  U       (input/output) REAL array, dimension (LDU, N)\n*          On entry, an NRU-by-N matrix U.\n*          On exit, U is overwritten by U * Q.\n*          Not referenced if NRU = 0.\n*\n*  LDU     (input) INTEGER\n*          The leading dimension of the array U.  LDU >= max(1,NRU).\n*\n*  C       (input/output) REAL array, dimension (LDC, NCC)\n*          On entry, an N-by-NCC matrix C.\n*          On exit, C is overwritten by Q**T * C.\n*          Not referenced if NCC = 0.\n*\n*  LDC     (input) INTEGER\n*          The leading dimension of the array C.\n*          LDC >= max(1,N) if NCC > 0; LDC >=1 if NCC = 0.\n*\n*  WORK    (workspace) REAL array, dimension (4*N)\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*          < 0:  If INFO = -i, the i-th argument had an illegal value\n*          > 0:\n*             if NCVT = NRU = NCC = 0,\n*                = 1, a split was marked by a positive value in E\n*                = 2, current block of Z not diagonalized after 30*N\n*                     iterations (in inner while loop)\n*                = 3, termination criterion of outer while loop not met \n*                     (program created more than N unreduced blocks)\n*             else NCVT = NRU = NCC = 0,\n*                   the algorithm did not converge; D and E contain the\n*                   elements of a bidiagonal matrix which is orthogonally\n*                   similar to the input matrix B;  if INFO = i, i\n*                   elements of E have not converged to zero.\n*\n*  Internal Parameters\n*  ===================\n*\n*  TOLMUL  REAL, default = max(10,min(100,EPS**(-1/8)))\n*          TOLMUL controls the convergence criterion of the QR loop.\n*          If it is positive, TOLMUL*EPS is the desired relative\n*             precision in the computed singular values.\n*          If it is negative, abs(TOLMUL*EPS*sigma_max) is the\n*             desired absolute accuracy in the computed singular\n*             values (corresponds to relative accuracy\n*             abs(TOLMUL*EPS) in the largest singular value.\n*          abs(TOLMUL) should be between 1 and 1/EPS, and preferably\n*             between 10 (for fast convergence) and .1/EPS\n*             (for there to be some accuracy in the results).\n*          Default is to lose at either one eighth or 2 of the\n*             available decimal digits in each computed singular value\n*             (whichever is smaller).\n*\n*  MAXITR  INTEGER, default = 6\n*          MAXITR controls the maximum number of passes of the\n*          algorithm through its inner loop. The algorithms stops\n*          (and so fails to converge) if the number of passes\n*          through the inner loop exceeds MAXITR*N**2.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, d, e, vt, u, c = NumRu::Lapack.sbdsqr( uplo, nru, d, e, vt, u, 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_uplo = argv[0];
+  rblapack_nru = argv[1];
+  rblapack_d = argv[2];
+  rblapack_e = argv[3];
+  rblapack_vt = argv[4];
+  rblapack_u = argv[5];
+  rblapack_c = argv[6];
+  if (argc == 7) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (3th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (3th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_d);
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  if (!NA_IsNArray(rblapack_vt))
+    rb_raise(rb_eArgError, "vt (5th argument) must be NArray");
+  if (NA_RANK(rblapack_vt) != 2)
+    rb_raise(rb_eArgError, "rank of vt (5th argument) must be %d", 2);
+  ldvt = NA_SHAPE0(rblapack_vt);
+  ncvt = NA_SHAPE1(rblapack_vt);
+  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_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);
+  ncc = NA_SHAPE1(rblapack_c);
+  if (NA_TYPE(rblapack_c) != NA_SFLOAT)
+    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  nru = NUM2INT(rblapack_nru);
+  if (!NA_IsNArray(rblapack_u))
+    rb_raise(rb_eArgError, "u (6th argument) must be NArray");
+  if (NA_RANK(rblapack_u) != 2)
+    rb_raise(rb_eArgError, "rank of u (6th argument) must be %d", 2);
+  ldu = NA_SHAPE0(rblapack_u);
+  if (NA_SHAPE1(rblapack_u) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of u must be the same as shape 0 of d");
+  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_e))
+    rb_raise(rb_eArgError, "e (4th argument) must be NArray");
+  if (NA_RANK(rblapack_e) != 1)
+    rb_raise(rb_eArgError, "rank of e (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_e) != (n-1))
+    rb_raise(rb_eRuntimeError, "shape 0 of e must be %d", n-1);
+  if (NA_TYPE(rblapack_e) != NA_SFLOAT)
+    rblapack_e = na_change_type(rblapack_e, NA_SFLOAT);
+  e = NA_PTR_TYPE(rblapack_e, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_d_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  d_out__ = NA_PTR_TYPE(rblapack_d_out__, real*);
+  MEMCPY(d_out__, d, real, NA_TOTAL(rblapack_d));
+  rblapack_d = rblapack_d_out__;
+  d = d_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n-1;
+    rblapack_e_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  e_out__ = NA_PTR_TYPE(rblapack_e_out__, real*);
+  MEMCPY(e_out__, e, real, NA_TOTAL(rblapack_e));
+  rblapack_e = rblapack_e_out__;
+  e = e_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldvt;
+    shape[1] = ncvt;
+    rblapack_vt_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  vt_out__ = NA_PTR_TYPE(rblapack_vt_out__, real*);
+  MEMCPY(vt_out__, vt, real, NA_TOTAL(rblapack_vt));
+  rblapack_vt = rblapack_vt_out__;
+  vt = vt_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldu;
+    shape[1] = n;
+    rblapack_u_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  u_out__ = NA_PTR_TYPE(rblapack_u_out__, real*);
+  MEMCPY(u_out__, u, real, NA_TOTAL(rblapack_u));
+  rblapack_u = rblapack_u_out__;
+  u = u_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldc;
+    shape[1] = ncc;
+    rblapack_c_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  c_out__ = NA_PTR_TYPE(rblapack_c_out__, real*);
+  MEMCPY(c_out__, c, real, NA_TOTAL(rblapack_c));
+  rblapack_c = rblapack_c_out__;
+  c = c_out__;
+  work = ALLOC_N(real, (4*n));
+
+  sbdsqr_(&uplo, &n, &ncvt, &nru, &ncc, d, e, vt, &ldvt, u, &ldu, c, &ldc, work, &info);
+
+  free(work);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(6, rblapack_info, rblapack_d, rblapack_e, rblapack_vt, rblapack_u, rblapack_c);
+}
+
+void
+init_lapack_sbdsqr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sbdsqr", rblapack_sbdsqr, -1);
+}