ruby-lapack 1.7 → 1.7.1

data/ext/sopgtr.c

@@ -0,0 +1,91 @@
+#include "rb_lapack.h"
+
+extern VOID sopgtr_(char* uplo, integer* n, real* ap, real* tau, real* q, integer* ldq, real* work, integer* info);
+
+
+static VALUE
+rblapack_sopgtr(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_ap;
+  real *ap; 
+  VALUE rblapack_tau;
+  real *tau; 
+  VALUE rblapack_q;
+  real *q; 
+  VALUE rblapack_info;
+  integer info; 
+  real *work;
+
+  integer ldap;
+  integer ldtau;
+  integer ldq;
+  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  q, info = NumRu::Lapack.sopgtr( uplo, ap, tau, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SOPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SOPGTR generates a real orthogonal matrix Q which is defined as the\n*  product of n-1 elementary reflectors H(i) of order n, as returned by\n*  SSPTRD using packed storage:\n*\n*  if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),\n*\n*  if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          = 'U': Upper triangular packed storage used in previous\n*                 call to SSPTRD;\n*          = 'L': Lower triangular packed storage used in previous\n*                 call to SSPTRD.\n*\n*  N       (input) INTEGER\n*          The order of the matrix Q. N >= 0.\n*\n*  AP      (input) REAL array, dimension (N*(N+1)/2)\n*          The vectors which define the elementary reflectors, as\n*          returned by SSPTRD.\n*\n*  TAU     (input) REAL array, dimension (N-1)\n*          TAU(i) must contain the scalar factor of the elementary\n*          reflector H(i), as returned by SSPTRD.\n*\n*  Q       (output) REAL array, dimension (LDQ,N)\n*          The N-by-N orthogonal matrix Q.\n*\n*  LDQ     (input) INTEGER\n*          The leading dimension of the array Q. LDQ >= max(1,N).\n*\n*  WORK    (workspace) REAL array, dimension (N-1)\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*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  q, info = NumRu::Lapack.sopgtr( uplo, ap, tau, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 3 && argc != 3)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 3)", argc);
+  rblapack_uplo = argv[0];
+  rblapack_ap = argv[1];
+  rblapack_tau = argv[2];
+  if (argc == 3) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_tau))
+    rb_raise(rb_eArgError, "tau (3th argument) must be NArray");
+  if (NA_RANK(rblapack_tau) != 1)
+    rb_raise(rb_eArgError, "rank of tau (3th argument) must be %d", 1);
+  ldtau = NA_SHAPE0(rblapack_tau);
+  if (NA_TYPE(rblapack_tau) != NA_SFLOAT)
+    rblapack_tau = na_change_type(rblapack_tau, NA_SFLOAT);
+  tau = NA_PTR_TYPE(rblapack_tau, real*);
+  n = ldtau+1;
+  if (!NA_IsNArray(rblapack_ap))
+    rb_raise(rb_eArgError, "ap (2th argument) must be NArray");
+  if (NA_RANK(rblapack_ap) != 1)
+    rb_raise(rb_eArgError, "rank of ap (2th argument) must be %d", 1);
+  ldap = NA_SHAPE0(rblapack_ap);
+  if (NA_TYPE(rblapack_ap) != NA_SFLOAT)
+    rblapack_ap = na_change_type(rblapack_ap, NA_SFLOAT);
+  ap = NA_PTR_TYPE(rblapack_ap, real*);
+  ldq = MAX(1,n);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldq;
+    shape[1] = n;
+    rblapack_q = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  q = NA_PTR_TYPE(rblapack_q, real*);
+  work = ALLOC_N(real, (n-1));
+
+  sopgtr_(&uplo, &n, ap, tau, q, &ldq, work, &info);
+
+  free(work);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(2, rblapack_q, rblapack_info);
+}
+
+void
+init_lapack_sopgtr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sopgtr", rblapack_sopgtr, -1);
+}

data/ext/sopmtr.c

@@ -0,0 +1,116 @@
+#include "rb_lapack.h"
+
+extern VOID sopmtr_(char* side, char* uplo, char* trans, integer* m, integer* n, real* ap, real* tau, real* c, integer* ldc, real* work, integer* info);
+
+
+static VALUE
+rblapack_sopmtr(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_side;
+  char side; 
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_trans;
+  char trans; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_ap;
+  real *ap; 
+  VALUE rblapack_tau;
+  real *tau; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_c_out__;
+  real *c_out__;
+  real *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  info, c = NumRu::Lapack.sopmtr( side, uplo, trans, m, ap, tau, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SOPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SOPMTR overwrites the general real M-by-N matrix C with\n*\n*                  SIDE = 'L'     SIDE = 'R'\n*  TRANS = 'N':      Q * C          C * Q\n*  TRANS = 'T':      Q**T * C       C * Q**T\n*\n*  where Q is a real orthogonal matrix of order nq, with nq = m if\n*  SIDE = 'L' and nq = n if SIDE = 'R'. Q is defined as the product of\n*  nq-1 elementary reflectors, as returned by SSPTRD using packed\n*  storage:\n*\n*  if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);\n*\n*  if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).\n*\n\n*  Arguments\n*  =========\n*\n*  SIDE    (input) CHARACTER*1\n*          = 'L': apply Q or Q**T from the Left;\n*          = 'R': apply Q or Q**T from the Right.\n*\n*  UPLO    (input) CHARACTER*1\n*          = 'U': Upper triangular packed storage used in previous\n*                 call to SSPTRD;\n*          = 'L': Lower triangular packed storage used in previous\n*                 call to SSPTRD.\n*\n*  TRANS   (input) CHARACTER*1\n*          = 'N':  No transpose, apply Q;\n*          = 'T':  Transpose, apply Q**T.\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix C. M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix C. N >= 0.\n*\n*  AP      (input) REAL array, dimension\n*                               (M*(M+1)/2) if SIDE = 'L'\n*                               (N*(N+1)/2) if SIDE = 'R'\n*          The vectors which define the elementary reflectors, as\n*          returned by SSPTRD.  AP is modified by the routine but\n*          restored on exit.\n*\n*  TAU     (input) REAL array, dimension (M-1) if SIDE = 'L'\n*                                     or (N-1) if SIDE = 'R'\n*          TAU(i) must contain the scalar factor of the elementary\n*          reflector H(i), as returned by SSPTRD.\n*\n*  C       (input/output) REAL array, dimension (LDC,N)\n*          On entry, the M-by-N matrix C.\n*          On exit, C is overwritten by Q*C or Q**T*C or C*Q**T or C*Q.\n*\n*  LDC     (input) INTEGER\n*          The leading dimension of the array C. LDC >= max(1,M).\n*\n*  WORK    (workspace) REAL array, dimension\n*                                   (N) if SIDE = 'L'\n*                                   (M) if SIDE = 'R'\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*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, c = NumRu::Lapack.sopmtr( side, uplo, trans, m, ap, 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_uplo = argv[1];
+  rblapack_trans = argv[2];
+  rblapack_m = argv[3];
+  rblapack_ap = argv[4];
+  rblapack_tau = argv[5];
+  rblapack_c = argv[6];
+  if (argc == 7) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  side = StringValueCStr(rblapack_side)[0];
+  trans = StringValueCStr(rblapack_trans)[0];
+  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_SFLOAT)
+    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  m = NUM2INT(rblapack_m);
+  if (!NA_IsNArray(rblapack_tau))
+    rb_raise(rb_eArgError, "tau (6th argument) must be NArray");
+  if (NA_RANK(rblapack_tau) != 1)
+    rb_raise(rb_eArgError, "rank of tau (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_tau) != (m-1))
+    rb_raise(rb_eRuntimeError, "shape 0 of tau must be %d", m-1);
+  if (NA_TYPE(rblapack_tau) != NA_SFLOAT)
+    rblapack_tau = na_change_type(rblapack_tau, NA_SFLOAT);
+  tau = NA_PTR_TYPE(rblapack_tau, real*);
+  if (!NA_IsNArray(rblapack_ap))
+    rb_raise(rb_eArgError, "ap (5th argument) must be NArray");
+  if (NA_RANK(rblapack_ap) != 1)
+    rb_raise(rb_eArgError, "rank of ap (5th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_ap) != (m*(m+1)/2))
+    rb_raise(rb_eRuntimeError, "shape 0 of ap must be %d", m*(m+1)/2);
+  if (NA_TYPE(rblapack_ap) != NA_SFLOAT)
+    rblapack_ap = na_change_type(rblapack_ap, NA_SFLOAT);
+  ap = NA_PTR_TYPE(rblapack_ap, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldc;
+    shape[1] = n;
+    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, (lsame_(&side,"L") ? n : lsame_(&side,"R") ? m : 0));
+
+  sopmtr_(&side, &uplo, &trans, &m, &n, ap, tau, c, &ldc, work, &info);
+
+  free(work);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(2, rblapack_info, rblapack_c);
+}
+
+void
+init_lapack_sopmtr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sopmtr", rblapack_sopmtr, -1);
+}

data/ext/sorbdb.c

@@ -0,0 +1,232 @@
+#include "rb_lapack.h"
+
+extern VOID sorbdb_(char* trans, char* signs, integer* m, integer* p, integer* q, real* x11, integer* ldx11, real* x12, integer* ldx12, real* x21, integer* ldx21, real* x22, integer* ldx22, real* theta, real* phi, real* taup1, real* taup2, real* tauq1, real* tauq2, real* work, integer* lwork, integer* info);
+
+
+static VALUE
+rblapack_sorbdb(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_trans;
+  char trans; 
+  VALUE rblapack_signs;
+  char signs; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_x11;
+  real *x11; 
+  VALUE rblapack_x12;
+  real *x12; 
+  VALUE rblapack_x21;
+  real *x21; 
+  VALUE rblapack_x22;
+  real *x22; 
+  VALUE rblapack_lwork;
+  integer lwork; 
+  VALUE rblapack_theta;
+  real *theta; 
+  VALUE rblapack_phi;
+  real *phi; 
+  VALUE rblapack_taup1;
+  real *taup1; 
+  VALUE rblapack_taup2;
+  real *taup2; 
+  VALUE rblapack_tauq1;
+  real *tauq1; 
+  VALUE rblapack_tauq2;
+  real *tauq2; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_x11_out__;
+  real *x11_out__;
+  VALUE rblapack_x12_out__;
+  real *x12_out__;
+  VALUE rblapack_x21_out__;
+  real *x21_out__;
+  VALUE rblapack_x22_out__;
+  real *x22_out__;
+  real *work;
+
+  integer ldx11;
+  integer q;
+  integer ldx12;
+  integer ldx21;
+  integer ldx22;
+  integer p;
+
+  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  theta, phi, taup1, taup2, tauq1, tauq2, info, x11, x12, x21, x22 = NumRu::Lapack.sorbdb( trans, signs, m, x11, x12, x21, x22, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, TAUP2, TAUQ1, TAUQ2, WORK, LWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SORBDB simultaneously bidiagonalizes the blocks of an M-by-M\n*  partitioned orthogonal matrix X:\n*\n*                                  [ B11 | B12 0  0 ]\n*      [ X11 | X12 ]   [ P1 |    ] [  0  |  0 -I  0 ] [ Q1 |    ]**T\n*  X = [-----------] = [---------] [----------------] [---------]   .\n*      [ X21 | X22 ]   [    | P2 ] [ B21 | B22 0  0 ] [    | Q2 ]\n*                                  [  0  |  0  0  I ]\n*\n*  X11 is P-by-Q. Q must be no larger than P, M-P, or M-Q. (If this is\n*  not the case, then X must be transposed and/or permuted. This can be\n*  done in constant time using the TRANS and SIGNS options. See SORCSD\n*  for details.)\n*\n*  The orthogonal matrices P1, P2, Q1, and Q2 are P-by-P, (M-P)-by-\n*  (M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. They are\n*  represented implicitly by Householder vectors.\n*\n*  B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented\n*  implicitly by angles THETA, PHI.\n*\n\n*  Arguments\n*  =========\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*  SIGNS   (input) CHARACTER\n*          = 'O':      The lower-left block is made nonpositive (the\n*                      \"other\" convention);\n*          otherwise:  The upper-right block is made nonpositive (the\n*                      \"default\" convention).\n*\n*  M       (input) INTEGER\n*          The number of rows and columns in X.\n*\n*  P       (input) INTEGER\n*          The number of rows in X11 and X12. 0 <= P <= M.\n*\n*  Q       (input) INTEGER\n*          The number of columns in X11 and X21. 0 <= Q <=\n*          MIN(P,M-P,M-Q).\n*\n*  X11     (input/output) REAL array, dimension (LDX11,Q)\n*          On entry, the top-left block of the orthogonal matrix to be\n*          reduced. On exit, the form depends on TRANS:\n*          If TRANS = 'N', then\n*             the columns of tril(X11) specify reflectors for P1,\n*             the rows of triu(X11,1) specify reflectors for Q1;\n*          else TRANS = 'T', and\n*             the rows of triu(X11) specify reflectors for P1,\n*             the columns of tril(X11,-1) specify reflectors for Q1.\n*\n*  LDX11   (input) INTEGER\n*          The leading dimension of X11. If TRANS = 'N', then LDX11 >=\n*          P; else LDX11 >= Q.\n*\n*  X12     (input/output) REAL array, dimension (LDX12,M-Q)\n*          On entry, the top-right block of the orthogonal matrix to\n*          be reduced. On exit, the form depends on TRANS:\n*          If TRANS = 'N', then\n*             the rows of triu(X12) specify the first P reflectors for\n*             Q2;\n*          else TRANS = 'T', and\n*             the columns of tril(X12) specify the first P reflectors\n*             for Q2.\n*\n*  LDX12   (input) INTEGER\n*          The leading dimension of X12. If TRANS = 'N', then LDX12 >=\n*          P; else LDX11 >= M-Q.\n*\n*  X21     (input/output) REAL array, dimension (LDX21,Q)\n*          On entry, the bottom-left block of the orthogonal matrix to\n*          be reduced. On exit, the form depends on TRANS:\n*          If TRANS = 'N', then\n*             the columns of tril(X21) specify reflectors for P2;\n*          else TRANS = 'T', and\n*             the rows of triu(X21) specify reflectors for P2.\n*\n*  LDX21   (input) INTEGER\n*          The leading dimension of X21. If TRANS = 'N', then LDX21 >=\n*          M-P; else LDX21 >= Q.\n*\n*  X22     (input/output) REAL array, dimension (LDX22,M-Q)\n*          On entry, the bottom-right block of the orthogonal matrix to\n*          be reduced. On exit, the form depends on TRANS:\n*          If TRANS = 'N', then\n*             the rows of triu(X22(Q+1:M-P,P+1:M-Q)) specify the last\n*             M-P-Q reflectors for Q2,\n*          else TRANS = 'T', and\n*             the columns of tril(X22(P+1:M-Q,Q+1:M-P)) specify the last\n*             M-P-Q reflectors for P2.\n*\n*  LDX22   (input) INTEGER\n*          The leading dimension of X22. If TRANS = 'N', then LDX22 >=\n*          M-P; else LDX22 >= M-Q.\n*\n*  THETA   (output) REAL array, dimension (Q)\n*          The entries of the bidiagonal blocks B11, B12, B21, B22 can\n*          be computed from the angles THETA and PHI. See Further\n*          Details.\n*\n*  PHI     (output) REAL array, dimension (Q-1)\n*          The entries of the bidiagonal blocks B11, B12, B21, B22 can\n*          be computed from the angles THETA and PHI. See Further\n*          Details.\n*\n*  TAUP1   (output) REAL array, dimension (P)\n*          The scalar factors of the elementary reflectors that define\n*          P1.\n*\n*  TAUP2   (output) REAL array, dimension (M-P)\n*          The scalar factors of the elementary reflectors that define\n*          P2.\n*\n*  TAUQ1   (output) REAL array, dimension (Q)\n*          The scalar factors of the elementary reflectors that define\n*          Q1.\n*\n*  TAUQ2   (output) REAL array, dimension (M-Q)\n*          The scalar factors of the elementary reflectors that define\n*          Q2.\n*\n*  WORK    (workspace) REAL array, dimension (LWORK)\n*\n*  LWORK   (input) INTEGER\n*          The dimension of the array WORK. LWORK >= M-Q.\n*\n*          If LWORK = -1, then a workspace query is assumed; the routine\n*          only calculates the optimal size of the WORK array, returns\n*          this value as the first entry of the WORK array, and no error\n*          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*\n\n*  Further Details\n*  ===============\n*\n*  The bidiagonal blocks B11, B12, B21, and B22 are represented\n*  implicitly by angles THETA(1), ..., THETA(Q) and PHI(1), ...,\n*  PHI(Q-1). B11 and B21 are upper bidiagonal, while B21 and B22 are\n*  lower bidiagonal. Every entry in each bidiagonal band is a product\n*  of a sine or cosine of a THETA with a sine or cosine of a PHI. See\n*  [1] or SORCSD for details.\n*\n*  P1, P2, Q1, and Q2 are represented as products of elementary\n*  reflectors. See SORCSD for details on generating P1, P2, Q1, and Q2\n*  using SORGQR and SORGLQ.\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*  ====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  theta, phi, taup1, taup2, tauq1, tauq2, info, x11, x12, x21, x22 = NumRu::Lapack.sorbdb( trans, signs, m, x11, x12, x21, x22, [:lwork => lwork, :usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 7 && argc != 8)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 7)", argc);
+  rblapack_trans = argv[0];
+  rblapack_signs = argv[1];
+  rblapack_m = argv[2];
+  rblapack_x11 = argv[3];
+  rblapack_x12 = argv[4];
+  rblapack_x21 = argv[5];
+  rblapack_x22 = argv[6];
+  if (argc == 8) {
+    rblapack_lwork = argv[7];
+  } else if (rblapack_options != Qnil) {
+    rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
+  } else {
+    rblapack_lwork = Qnil;
+  }
+
+  trans = StringValueCStr(rblapack_trans)[0];
+  m = NUM2INT(rblapack_m);
+  signs = StringValueCStr(rblapack_signs)[0];
+  if (!NA_IsNArray(rblapack_x11))
+    rb_raise(rb_eArgError, "x11 (4th argument) must be NArray");
+  if (NA_RANK(rblapack_x11) != 2)
+    rb_raise(rb_eArgError, "rank of x11 (4th argument) must be %d", 2);
+  ldx11 = NA_SHAPE0(rblapack_x11);
+  q = NA_SHAPE1(rblapack_x11);
+  if (NA_TYPE(rblapack_x11) != NA_SFLOAT)
+    rblapack_x11 = na_change_type(rblapack_x11, NA_SFLOAT);
+  x11 = NA_PTR_TYPE(rblapack_x11, real*);
+  p = ldx11;
+  ldx21 = p;
+  if (!NA_IsNArray(rblapack_x21))
+    rb_raise(rb_eArgError, "x21 (6th argument) must be NArray");
+  if (NA_RANK(rblapack_x21) != 2)
+    rb_raise(rb_eArgError, "rank of x21 (6th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_x21) != ldx21)
+    rb_raise(rb_eRuntimeError, "shape 0 of x21 must be p");
+  if (NA_SHAPE1(rblapack_x21) != q)
+    rb_raise(rb_eRuntimeError, "shape 1 of x21 must be the same as shape 1 of x11");
+  if (NA_TYPE(rblapack_x21) != NA_SFLOAT)
+    rblapack_x21 = na_change_type(rblapack_x21, NA_SFLOAT);
+  x21 = NA_PTR_TYPE(rblapack_x21, real*);
+  if (rblapack_lwork == Qnil)
+    lwork = m-q;
+  else {
+    lwork = NUM2INT(rblapack_lwork);
+  }
+  ldx22 = p;
+  if (!NA_IsNArray(rblapack_x22))
+    rb_raise(rb_eArgError, "x22 (7th argument) must be NArray");
+  if (NA_RANK(rblapack_x22) != 2)
+    rb_raise(rb_eArgError, "rank of x22 (7th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_x22) != ldx22)
+    rb_raise(rb_eRuntimeError, "shape 0 of x22 must be p");
+  if (NA_SHAPE1(rblapack_x22) != (m-q))
+    rb_raise(rb_eRuntimeError, "shape 1 of x22 must be %d", m-q);
+  if (NA_TYPE(rblapack_x22) != NA_SFLOAT)
+    rblapack_x22 = na_change_type(rblapack_x22, NA_SFLOAT);
+  x22 = NA_PTR_TYPE(rblapack_x22, real*);
+  ldx12 = p;
+  if (!NA_IsNArray(rblapack_x12))
+    rb_raise(rb_eArgError, "x12 (5th argument) must be NArray");
+  if (NA_RANK(rblapack_x12) != 2)
+    rb_raise(rb_eArgError, "rank of x12 (5th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_x12) != ldx12)
+    rb_raise(rb_eRuntimeError, "shape 0 of x12 must be p");
+  if (NA_SHAPE1(rblapack_x12) != (m-q))
+    rb_raise(rb_eRuntimeError, "shape 1 of x12 must be %d", m-q);
+  if (NA_TYPE(rblapack_x12) != NA_SFLOAT)
+    rblapack_x12 = na_change_type(rblapack_x12, NA_SFLOAT);
+  x12 = NA_PTR_TYPE(rblapack_x12, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_theta = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  theta = NA_PTR_TYPE(rblapack_theta, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q-1;
+    rblapack_phi = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  phi = NA_PTR_TYPE(rblapack_phi, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = p;
+    rblapack_taup1 = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  taup1 = NA_PTR_TYPE(rblapack_taup1, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = m-p;
+    rblapack_taup2 = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  taup2 = NA_PTR_TYPE(rblapack_taup2, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_tauq1 = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  tauq1 = NA_PTR_TYPE(rblapack_tauq1, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = m-q;
+    rblapack_tauq2 = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  tauq2 = NA_PTR_TYPE(rblapack_tauq2, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldx11;
+    shape[1] = q;
+    rblapack_x11_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  x11_out__ = NA_PTR_TYPE(rblapack_x11_out__, real*);
+  MEMCPY(x11_out__, x11, real, NA_TOTAL(rblapack_x11));
+  rblapack_x11 = rblapack_x11_out__;
+  x11 = x11_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldx12;
+    shape[1] = m-q;
+    rblapack_x12_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  x12_out__ = NA_PTR_TYPE(rblapack_x12_out__, real*);
+  MEMCPY(x12_out__, x12, real, NA_TOTAL(rblapack_x12));
+  rblapack_x12 = rblapack_x12_out__;
+  x12 = x12_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldx21;
+    shape[1] = q;
+    rblapack_x21_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  x21_out__ = NA_PTR_TYPE(rblapack_x21_out__, real*);
+  MEMCPY(x21_out__, x21, real, NA_TOTAL(rblapack_x21));
+  rblapack_x21 = rblapack_x21_out__;
+  x21 = x21_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldx22;
+    shape[1] = m-q;
+    rblapack_x22_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  x22_out__ = NA_PTR_TYPE(rblapack_x22_out__, real*);
+  MEMCPY(x22_out__, x22, real, NA_TOTAL(rblapack_x22));
+  rblapack_x22 = rblapack_x22_out__;
+  x22 = x22_out__;
+  work = ALLOC_N(real, (MAX(1,lwork)));
+
+  sorbdb_(&trans, &signs, &m, &p, &q, x11, &ldx11, x12, &ldx12, x21, &ldx21, x22, &ldx22, theta, phi, taup1, taup2, tauq1, tauq2, work, &lwork, &info);
+
+  free(work);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(11, rblapack_theta, rblapack_phi, rblapack_taup1, rblapack_taup2, rblapack_tauq1, rblapack_tauq2, rblapack_info, rblapack_x11, rblapack_x12, rblapack_x21, rblapack_x22);
+}
+
+void
+init_lapack_sorbdb(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sorbdb", rblapack_sorbdb, -1);
+}

data/ext/sorcsd.c

@@ -0,0 +1,197 @@
+#include "rb_lapack.h"
+
+extern VOID sorcsd_(char* jobu1, char* jobu2, char* jobv1t, char* jobv2t, char* trans, char* signs, integer* m, integer* p, integer* q, real* x11, integer* ldx11, real* x12, integer* ldx12, real* x21, integer* ldx21, real* x22, integer* ldx22, real* theta, real* u1, integer* ldu1, real* u2, integer* ldu2, real* v1t, integer* ldv1t, real* v2t, integer* ldv2t, real* work, integer* lwork, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_sorcsd(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_signs;
+  char signs; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_x11;
+  real *x11; 
+  VALUE rblapack_x12;
+  real *x12; 
+  VALUE rblapack_x21;
+  real *x21; 
+  VALUE rblapack_x22;
+  real *x22; 
+  VALUE rblapack_lwork;
+  integer lwork; 
+  VALUE rblapack_theta;
+  real *theta; 
+  VALUE rblapack_u1;
+  real *u1; 
+  VALUE rblapack_u2;
+  real *u2; 
+  VALUE rblapack_v1t;
+  real *v1t; 
+  VALUE rblapack_v2t;
+  real *v2t; 
+  VALUE rblapack_info;
+  integer info; 
+  real *work;
+  integer *iwork;
+
+  integer ldx11;
+  integer q;
+  integer ldx12;
+  integer ldx21;
+  integer ldx22;
+  integer p;
+  integer ldv2t;
+  integer ldv1t;
+  integer ldu1;
+  integer ldu2;
+
+  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  theta, u1, u2, v1t, v2t, info = NumRu::Lapack.sorcsd( jobu1, jobu2, jobv1t, jobv2t, trans, signs, m, x11, x12, x21, x22, lwork, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      RECURSIVE SUBROUTINE SORCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, X21, LDX21, X22, LDX22, THETA, U1, LDU1, U2, LDU2, V1T, LDV1T, V2T, LDV2T, WORK, LWORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SORCSD computes the CS decomposition of an M-by-M partitioned\n*  orthogonal matrix X:\n*\n*                                  [  I  0  0 |  0  0  0 ]\n*                                  [  0  C  0 |  0 -S  0 ]\n*      [ X11 | X12 ]   [ U1 |    ] [  0  0  0 |  0  0 -I ] [ V1 |    ]**T\n*  X = [-----------] = [---------] [---------------------] [---------]   .\n*      [ X21 | X22 ]   [    | U2 ] [  0  0  0 |  I  0  0 ] [    | V2 ]\n*                                  [  0  S  0 |  0  C  0 ]\n*                                  [  0  0  I |  0  0  0 ]\n*\n*  X11 is P-by-Q. The orthogonal matrices U1, U2, V1, and V2 are P-by-P,\n*  (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are\n*  R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in\n*  which R = MIN(P,M-P,Q,M-Q).\n*\n\n*  Arguments\n*  =========\n*\n*  JOBU1   (input) CHARACTER\n*          = 'Y':      U1 is computed;\n*          otherwise:  U1 is not computed.\n*\n*  JOBU2   (input) CHARACTER\n*          = 'Y':      U2 is computed;\n*          otherwise:  U2 is not computed.\n*\n*  JOBV1T  (input) CHARACTER\n*          = 'Y':      V1T is computed;\n*          otherwise:  V1T is not computed.\n*\n*  JOBV2T  (input) CHARACTER\n*          = 'Y':      V2T is computed;\n*          otherwise:  V2T is not computed.\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*  SIGNS   (input) CHARACTER\n*          = 'O':      The lower-left block is made nonpositive (the\n*                      \"other\" convention);\n*          otherwise:  The upper-right block is made nonpositive (the\n*                      \"default\" convention).\n*\n*  M       (input) INTEGER\n*          The number of rows and columns in X.\n*\n*  P       (input) INTEGER\n*          The number of rows in X11 and X12. 0 <= P <= M.\n*\n*  Q       (input) INTEGER\n*          The number of columns in X11 and X21. 0 <= Q <= M.\n*\n*  X       (input/workspace) REAL array, dimension (LDX,M)\n*          On entry, the orthogonal matrix whose CSD is desired.\n*\n*  LDX     (input) INTEGER\n*          The leading dimension of X. LDX >= MAX(1,M).\n*\n*  THETA   (output) REAL array, dimension (R), in which R =\n*          MIN(P,M-P,Q,M-Q).\n*          C = DIAG( COS(THETA(1)), ... , COS(THETA(R)) ) and\n*          S = DIAG( SIN(THETA(1)), ... , SIN(THETA(R)) ).\n*\n*  U1      (output) REAL array, dimension (P)\n*          If JOBU1 = 'Y', U1 contains the P-by-P orthogonal matrix U1.\n*\n*  LDU1    (input) INTEGER\n*          The leading dimension of U1. If JOBU1 = 'Y', LDU1 >=\n*          MAX(1,P).\n*\n*  U2      (output) REAL array, dimension (M-P)\n*          If JOBU2 = 'Y', U2 contains the (M-P)-by-(M-P) orthogonal\n*          matrix U2.\n*\n*  LDU2    (input) INTEGER\n*          The leading dimension of U2. If JOBU2 = 'Y', LDU2 >=\n*          MAX(1,M-P).\n*\n*  V1T     (output) REAL array, dimension (Q)\n*          If JOBV1T = 'Y', V1T contains the Q-by-Q matrix orthogonal\n*          matrix V1**T.\n*\n*  LDV1T   (input) INTEGER\n*          The leading dimension of V1T. If JOBV1T = 'Y', LDV1T >=\n*          MAX(1,Q).\n*\n*  V2T     (output) REAL array, dimension (M-Q)\n*          If JOBV2T = 'Y', V2T contains the (M-Q)-by-(M-Q) orthogonal\n*          matrix V2**T.\n*\n*  LDV2T   (input) INTEGER\n*          The leading dimension of V2T. If JOBV2T = 'Y', LDV2T >=\n*          MAX(1,M-Q).\n*\n*  WORK    (workspace) REAL array, dimension (MAX(1,LWORK))\n*          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n*          If INFO > 0 on exit, WORK(2:R) contains the values PHI(1),\n*          ..., PHI(R-1) that, together with THETA(1), ..., THETA(R),\n*          define the matrix in intermediate bidiagonal-block form\n*          remaining after nonconvergence. INFO specifies the number\n*          of nonzero PHI's.\n*\n*  LWORK   (input) INTEGER\n*          The dimension of the array WORK.\n*\n*          If LWORK = -1, then a workspace query is assumed; the routine\n*          only calculates the optimal size of the WORK array, returns\n*          this value as the first entry of the work array, and no error\n*          message related to LWORK is issued by XERBLA.\n*\n*  IWORK   (workspace) INTEGER array, dimension (M-Q)\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit.\n*          < 0:  if INFO = -i, the i-th argument had an illegal value.\n*          > 0:  SBBCSD did not converge. See the description of WORK\n*                above for details.\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\n*  ===================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  theta, u1, u2, v1t, v2t, info = NumRu::Lapack.sorcsd( jobu1, jobu2, jobv1t, jobv2t, trans, signs, m, x11, x12, x21, x22, lwork, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 12 && argc != 12)
+    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_signs = argv[5];
+  rblapack_m = argv[6];
+  rblapack_x11 = argv[7];
+  rblapack_x12 = argv[8];
+  rblapack_x21 = argv[9];
+  rblapack_x22 = argv[10];
+  rblapack_lwork = argv[11];
+  if (argc == 12) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  jobu1 = StringValueCStr(rblapack_jobu1)[0];
+  jobv1t = StringValueCStr(rblapack_jobv1t)[0];
+  trans = StringValueCStr(rblapack_trans)[0];
+  m = NUM2INT(rblapack_m);
+  lwork = NUM2INT(rblapack_lwork);
+  jobu2 = StringValueCStr(rblapack_jobu2)[0];
+  signs = StringValueCStr(rblapack_signs)[0];
+  jobv2t = StringValueCStr(rblapack_jobv2t)[0];
+  if (!NA_IsNArray(rblapack_x11))
+    rb_raise(rb_eArgError, "x11 (8th argument) must be NArray");
+  if (NA_RANK(rblapack_x11) != 2)
+    rb_raise(rb_eArgError, "rank of x11 (8th argument) must be %d", 2);
+  ldx11 = NA_SHAPE0(rblapack_x11);
+  q = NA_SHAPE1(rblapack_x11);
+  if (NA_TYPE(rblapack_x11) != NA_SFLOAT)
+    rblapack_x11 = na_change_type(rblapack_x11, NA_SFLOAT);
+  x11 = NA_PTR_TYPE(rblapack_x11, real*);
+  p = ldx11;
+  ldx21 = p;
+  if (!NA_IsNArray(rblapack_x21))
+    rb_raise(rb_eArgError, "x21 (10th argument) must be NArray");
+  if (NA_RANK(rblapack_x21) != 2)
+    rb_raise(rb_eArgError, "rank of x21 (10th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_x21) != ldx21)
+    rb_raise(rb_eRuntimeError, "shape 0 of x21 must be p");
+  if (NA_SHAPE1(rblapack_x21) != q)
+    rb_raise(rb_eRuntimeError, "shape 1 of x21 must be the same as shape 1 of x11");
+  if (NA_TYPE(rblapack_x21) != NA_SFLOAT)
+    rblapack_x21 = na_change_type(rblapack_x21, NA_SFLOAT);
+  x21 = NA_PTR_TYPE(rblapack_x21, real*);
+  ldv2t = lsame_(&jobv2t,"Y") ? MAX(1,m-q) : 0;
+  ldu1 = lsame_(&jobu1,"Y") ? MAX(1,p) : 0;
+  ldx12 = p;
+  if (!NA_IsNArray(rblapack_x12))
+    rb_raise(rb_eArgError, "x12 (9th argument) must be NArray");
+  if (NA_RANK(rblapack_x12) != 2)
+    rb_raise(rb_eArgError, "rank of x12 (9th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_x12) != ldx12)
+    rb_raise(rb_eRuntimeError, "shape 0 of x12 must be p");
+  if (NA_SHAPE1(rblapack_x12) != (m-q))
+    rb_raise(rb_eRuntimeError, "shape 1 of x12 must be %d", m-q);
+  if (NA_TYPE(rblapack_x12) != NA_SFLOAT)
+    rblapack_x12 = na_change_type(rblapack_x12, NA_SFLOAT);
+  x12 = NA_PTR_TYPE(rblapack_x12, real*);
+  ldv1t = lsame_(&jobv1t,"Y") ? MAX(1,q) : 0;
+  ldx22 = p;
+  if (!NA_IsNArray(rblapack_x22))
+    rb_raise(rb_eArgError, "x22 (11th argument) must be NArray");
+  if (NA_RANK(rblapack_x22) != 2)
+    rb_raise(rb_eArgError, "rank of x22 (11th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_x22) != ldx22)
+    rb_raise(rb_eRuntimeError, "shape 0 of x22 must be p");
+  if (NA_SHAPE1(rblapack_x22) != (m-q))
+    rb_raise(rb_eRuntimeError, "shape 1 of x22 must be %d", m-q);
+  if (NA_TYPE(rblapack_x22) != NA_SFLOAT)
+    rblapack_x22 = na_change_type(rblapack_x22, NA_SFLOAT);
+  x22 = NA_PTR_TYPE(rblapack_x22, real*);
+  ldu2 = lsame_(&jobu2,"Y") ? MAX(1,m-p) : 0;
+  {
+    na_shape_t shape[1];
+    shape[0] = MIN(MIN(MIN(p,m-p),q),m-q);
+    rblapack_theta = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  theta = NA_PTR_TYPE(rblapack_theta, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = p;
+    rblapack_u1 = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  u1 = NA_PTR_TYPE(rblapack_u1, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = m-p;
+    rblapack_u2 = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  u2 = NA_PTR_TYPE(rblapack_u2, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = q;
+    rblapack_v1t = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  v1t = NA_PTR_TYPE(rblapack_v1t, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = m-q;
+    rblapack_v2t = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  v2t = NA_PTR_TYPE(rblapack_v2t, real*);
+  work = ALLOC_N(real, (MAX(1,lwork)));
+  iwork = ALLOC_N(integer, (m-q));
+
+  sorcsd_(&jobu1, &jobu2, &jobv1t, &jobv2t, &trans, &signs, &m, &p, &q, x11, &ldx11, x12, &ldx12, x21, &ldx21, x22, &ldx22, theta, u1, &ldu1, u2, &ldu2, v1t, &ldv1t, v2t, &ldv2t, work, &lwork, iwork, &info);
+
+  free(work);
+  free(iwork);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(6, rblapack_theta, rblapack_u1, rblapack_u2, rblapack_v1t, rblapack_v2t, rblapack_info);
+}
+
+void
+init_lapack_sorcsd(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "sorcsd", rblapack_sorcsd, -1);
+}