ruby-lapack 1.7 → 1.7.1

data/ext/slasd4.c

@@ -0,0 +1,93 @@
+#include "rb_lapack.h"
+
+extern VOID slasd4_(integer* n, integer* i, real* d, real* z, real* delta, real* rho, real* sigma, real* work, integer* info);
+
+
+static VALUE
+rblapack_slasd4(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_i;
+  integer i; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_z;
+  real *z; 
+  VALUE rblapack_rho;
+  real rho; 
+  VALUE rblapack_delta;
+  real *delta; 
+  VALUE rblapack_sigma;
+  real sigma; 
+  VALUE rblapack_info;
+  integer info; 
+  real *work;
+
+  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  delta, sigma, info = NumRu::Lapack.slasd4( i, d, z, rho, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  This subroutine computes the square root of the I-th updated\n*  eigenvalue of a positive symmetric rank-one modification to\n*  a positive diagonal matrix whose entries are given as the squares\n*  of the corresponding entries in the array d, and that\n*\n*         0 <= D(i) < D(j)  for  i < j\n*\n*  and that RHO > 0. This is arranged by the calling routine, and is\n*  no loss in generality.  The rank-one modified system is thus\n*\n*         diag( D ) * diag( D ) +  RHO *  Z * Z_transpose.\n*\n*  where we assume the Euclidean norm of Z is 1.\n*\n*  The method consists of approximating the rational functions in the\n*  secular equation by simpler interpolating rational functions.\n*\n\n*  Arguments\n*  =========\n*\n*  N      (input) INTEGER\n*         The length of all arrays.\n*\n*  I      (input) INTEGER\n*         The index of the eigenvalue to be computed.  1 <= I <= N.\n*\n*  D      (input) REAL array, dimension ( N )\n*         The original eigenvalues.  It is assumed that they are in\n*         order, 0 <= D(I) < D(J)  for I < J.\n*\n*  Z      (input) REAL array, dimension (N)\n*         The components of the updating vector.\n*\n*  DELTA  (output) REAL array, dimension (N)\n*         If N .ne. 1, DELTA contains (D(j) - sigma_I) in its  j-th\n*         component.  If N = 1, then DELTA(1) = 1.  The vector DELTA\n*         contains the information necessary to construct the\n*         (singular) eigenvectors.\n*\n*  RHO    (input) REAL\n*         The scalar in the symmetric updating formula.\n*\n*  SIGMA  (output) REAL\n*         The computed sigma_I, the I-th updated eigenvalue.\n*\n*  WORK   (workspace) REAL array, dimension (N)\n*         If N .ne. 1, WORK contains (D(j) + sigma_I) in its  j-th\n*         component.  If N = 1, then WORK( 1 ) = 1.\n*\n*  INFO   (output) INTEGER\n*         = 0:  successful exit\n*         > 0:  if INFO = 1, the updating process failed.\n*\n*  Internal Parameters\n*  ===================\n*\n*  Logical variable ORGATI (origin-at-i?) is used for distinguishing\n*  whether D(i) or D(i+1) is treated as the origin.\n*\n*            ORGATI = .true.    origin at i\n*            ORGATI = .false.   origin at i+1\n*\n*  Logical variable SWTCH3 (switch-for-3-poles?) is for noting\n*  if we are working with THREE poles!\n*\n*  MAXIT is the maximum number of iterations allowed for each\n*  eigenvalue.\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*     Ren-Cang Li, Computer Science Division, University of California\n*     at Berkeley, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  delta, sigma, info = NumRu::Lapack.slasd4( i, d, z, rho, [: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_i = argv[0];
+  rblapack_d = argv[1];
+  rblapack_z = argv[2];
+  rblapack_rho = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  i = NUM2INT(rblapack_i);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (3th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 1)
+    rb_raise(rb_eArgError, "rank of z (3th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_z);
+  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_d))
+    rb_raise(rb_eArgError, "d (2th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (2th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_d) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of d must be the same as shape 0 of z");
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  rho = (real)NUM2DBL(rblapack_rho);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_delta = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  delta = NA_PTR_TYPE(rblapack_delta, real*);
+  work = ALLOC_N(real, (n));
+
+  slasd4_(&n, &i, d, z, delta, &rho, &sigma, work, &info);
+
+  free(work);
+  rblapack_sigma = rb_float_new((double)sigma);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(3, rblapack_delta, rblapack_sigma, rblapack_info);
+}
+
+void
+init_lapack_slasd4(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slasd4", rblapack_slasd4, -1);
+}

data/ext/slasd5.c

@@ -0,0 +1,90 @@
+#include "rb_lapack.h"
+
+extern VOID slasd5_(integer* i, real* d, real* z, real* delta, real* rho, real* dsigma, real* work);
+
+
+static VALUE
+rblapack_slasd5(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_i;
+  integer i; 
+  VALUE rblapack_d;
+  real *d; 
+  VALUE rblapack_z;
+  real *z; 
+  VALUE rblapack_rho;
+  real rho; 
+  VALUE rblapack_delta;
+  real *delta; 
+  VALUE rblapack_dsigma;
+  real dsigma; 
+  real *work;
+
+
+  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  delta, dsigma = NumRu::Lapack.slasd5( i, d, z, rho, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK )\n\n*  Purpose\n*  =======\n*\n*  This subroutine computes the square root of the I-th eigenvalue\n*  of a positive symmetric rank-one modification of a 2-by-2 diagonal\n*  matrix\n*\n*             diag( D ) * diag( D ) +  RHO *  Z * transpose(Z) .\n*\n*  The diagonal entries in the array D are assumed to satisfy\n*\n*             0 <= D(i) < D(j)  for  i < j .\n*\n*  We also assume RHO > 0 and that the Euclidean norm of the vector\n*  Z is one.\n*\n\n*  Arguments\n*  =========\n*\n*  I      (input) INTEGER\n*         The index of the eigenvalue to be computed.  I = 1 or I = 2.\n*\n*  D      (input) REAL array, dimension (2)\n*         The original eigenvalues.  We assume 0 <= D(1) < D(2).\n*\n*  Z      (input) REAL array, dimension (2)\n*         The components of the updating vector.\n*\n*  DELTA  (output) REAL array, dimension (2)\n*         Contains (D(j) - sigma_I) in its  j-th component.\n*         The vector DELTA contains the information necessary\n*         to construct the eigenvectors.\n*\n*  RHO    (input) REAL\n*         The scalar in the symmetric updating formula.\n*\n*  DSIGMA (output) REAL\n*         The computed sigma_I, the I-th updated eigenvalue.\n*\n*  WORK   (workspace) REAL array, dimension (2)\n*         WORK contains (D(j) + sigma_I) in its  j-th component.\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*     Ren-Cang Li, Computer Science Division, University of California\n*     at Berkeley, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  delta, dsigma = NumRu::Lapack.slasd5( i, d, z, rho, [: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_i = argv[0];
+  rblapack_d = argv[1];
+  rblapack_z = argv[2];
+  rblapack_rho = argv[3];
+  if (argc == 4) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  i = NUM2INT(rblapack_i);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (3th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 1)
+    rb_raise(rb_eArgError, "rank of z (3th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_z) != (2))
+    rb_raise(rb_eRuntimeError, "shape 0 of z must be %d", 2);
+  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_d))
+    rb_raise(rb_eArgError, "d (2th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (2th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_d) != (2))
+    rb_raise(rb_eRuntimeError, "shape 0 of d must be %d", 2);
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  rho = (real)NUM2DBL(rblapack_rho);
+  {
+    na_shape_t shape[1];
+    shape[0] = 2;
+    rblapack_delta = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  delta = NA_PTR_TYPE(rblapack_delta, real*);
+  work = ALLOC_N(real, (2));
+
+  slasd5_(&i, d, z, delta, &rho, &dsigma, work);
+
+  free(work);
+  rblapack_dsigma = rb_float_new((double)dsigma);
+  return rb_ary_new3(2, rblapack_delta, rblapack_dsigma);
+}
+
+void
+init_lapack_slasd5(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slasd5", rblapack_slasd5, -1);
+}

data/ext/slasd6.c

@@ -0,0 +1,236 @@
+#include "rb_lapack.h"
+
+extern VOID slasd6_(integer* icompq, integer* nl, integer* nr, integer* sqre, real* d, real* vf, real* vl, real* alpha, real* beta, integer* idxq, 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* work, integer* iwork, integer* info);
+
+
+static VALUE
+rblapack_slasd6(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_d;
+  real *d; 
+  VALUE rblapack_vf;
+  real *vf; 
+  VALUE rblapack_vl;
+  real *vl; 
+  VALUE rblapack_alpha;
+  real alpha; 
+  VALUE rblapack_beta;
+  real beta; 
+  VALUE rblapack_idxq;
+  integer *idxq; 
+  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_k;
+  integer k; 
+  VALUE rblapack_c;
+  real c; 
+  VALUE rblapack_s;
+  real s; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_vf_out__;
+  real *vf_out__;
+  VALUE rblapack_vl_out__;
+  real *vl_out__;
+  real *work;
+  integer *iwork;
+
+  integer m;
+  integer n;
+  integer ldgcol;
+  integer ldgnum;
+
+  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  idxq, perm, givptr, givcol, givnum, poles, difl, difr, z, k, c, s, info, d, vf, vl, alpha, beta = NumRu::Lapack.slasd6( icompq, nl, nr, sqre, d, vf, vl, alpha, beta, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA, IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, POLES, DIFL, DIFR, Z, K, C, S, WORK, IWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  SLASD6 computes the SVD of an updated upper bidiagonal matrix B\n*  obtained by merging two smaller ones by appending a row. This\n*  routine is used only for the problem which requires all singular\n*  values and optionally singular vector matrices in factored form.\n*  B is an N-by-M matrix with N = NL + NR + 1 and M = N + SQRE.\n*  A related subroutine, SLASD1, handles the case in which all singular\n*  values and singular vectors of the bidiagonal matrix are desired.\n*\n*  SLASD6 computes the SVD as follows:\n*\n*                ( D1(in)  0    0     0 )\n*    B = U(in) * (   Z1'   a   Z2'    b ) * VT(in)\n*                (   0     0   D2(in) 0 )\n*\n*      = U(out) * ( D(out) 0) * VT(out)\n*\n*  where Z' = (Z1' a Z2' b) = u' VT', and u is a vector of dimension M\n*  with ALPHA and BETA in the NL+1 and NL+2 th entries and zeros\n*  elsewhere; and the entry b is empty if SQRE = 0.\n*\n*  The singular values of B can be computed using D1, D2, the first\n*  components of all the right singular vectors of the lower block, and\n*  the last components of all the right singular vectors of the upper\n*  block. These components are stored and updated in VF and VL,\n*  respectively, in SLASD6. Hence U and VT are not explicitly\n*  referenced.\n*\n*  The singular values are stored in D. The algorithm consists of two\n*  stages:\n*\n*        The first stage consists of deflating the size of the problem\n*        when there are multiple singular values or if there is a zero\n*        in the Z vector. For each such occurence the dimension of the\n*        secular equation problem is reduced by one. This stage is\n*        performed by the routine SLASD7.\n*\n*        The second stage consists of calculating the updated\n*        singular values. This is done by finding the roots of the\n*        secular equation via the routine SLASD4 (as called by SLASD8).\n*        This routine also updates VF and VL and computes the distances\n*        between the updated singular values and the old singular\n*        values.\n*\n*  SLASD6 is called from SLASDA.\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: Compute singular values only.\n*         = 1: Compute singular vectors in factored form as well.\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*  D      (input/output) REAL array, dimension (NL+NR+1).\n*         On entry D(1:NL,1:NL) contains the singular values of the\n*         upper block, and D(NL+2:N) contains the singular values\n*         of the lower block. On exit D(1:N) contains the singular\n*         values of the modified matrix.\n*\n*  VF     (input/output) REAL array, dimension (M)\n*         On entry, VF(1:NL+1) contains the first components of all\n*         right singular vectors of the upper block; and VF(NL+2:M)\n*         contains the first components of all right singular vectors\n*         of the lower block. On exit, VF contains the first components\n*         of all right singular vectors of the bidiagonal matrix.\n*\n*  VL     (input/output) REAL array, dimension (M)\n*         On entry, VL(1:NL+1) contains the  last components of all\n*         right singular vectors of the upper block; and VL(NL+2:M)\n*         contains the last components of all right singular vectors of\n*         the lower block. On exit, VL contains the last components of\n*         all right singular vectors of the bidiagonal matrix.\n*\n*  ALPHA  (input/output) REAL\n*         Contains the diagonal element associated with the added row.\n*\n*  BETA   (input/output) REAL\n*         Contains the off-diagonal element associated with the added\n*         row.\n*\n*  IDXQ   (output) INTEGER array, dimension (N)\n*         This contains the permutation which will reintegrate the\n*         subproblem just solved back into sorted order, i.e.\n*         D( IDXQ( I = 1, N ) ) will be in ascending order.\n*\n*  PERM   (output) INTEGER array, dimension ( N )\n*         The permutations (from deflation and sorting) to be applied\n*         to each block. Not referenced if ICOMPQ = 0.\n*\n*  GIVPTR (output) INTEGER\n*         The number of Givens rotations which took place in this\n*         subproblem. Not referenced if ICOMPQ = 0.\n*\n*  GIVCOL (output) INTEGER array, dimension ( LDGCOL, 2 )\n*         Each pair of numbers indicates a pair of columns to take place\n*         in a Givens rotation. Not referenced if ICOMPQ = 0.\n*\n*  LDGCOL (input) INTEGER\n*         leading dimension of GIVCOL, must be at least N.\n*\n*  GIVNUM (output) REAL array, dimension ( LDGNUM, 2 )\n*         Each number indicates the C or S value to be used in the\n*         corresponding Givens rotation. Not referenced if ICOMPQ = 0.\n*\n*  LDGNUM (input) INTEGER\n*         The leading dimension of GIVNUM and POLES, must be at least N.\n*\n*  POLES  (output) REAL array, dimension ( LDGNUM, 2 )\n*         On exit, POLES(1,*) is an array containing the new singular\n*         values obtained from solving the secular equation, and\n*         POLES(2,*) is an array containing the poles in the secular\n*         equation. Not referenced if ICOMPQ = 0.\n*\n*  DIFL   (output) REAL array, dimension ( N )\n*         On exit, 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   (output) REAL array,\n*                  dimension ( LDGNUM, 2 ) if ICOMPQ = 1 and\n*                  dimension ( N ) if ICOMPQ = 0.\n*         On exit, DIFR(I, 1) is the distance between I-th updated\n*         (undeflated) singular value and the I+1-th (undeflated) old\n*         singular value.\n*\n*         If ICOMPQ = 1, DIFR(1:K,2) is an array containing the\n*         normalizing factors for the right singular vector matrix.\n*\n*         See SLASD8 for details on DIFL and DIFR.\n*\n*  Z      (output) REAL array, dimension ( M )\n*         The first elements of this array contain the components\n*         of the deflation-adjusted updating row vector.\n*\n*  K      (output) 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      (output) 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      (output) 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*  WORK   (workspace) REAL array, dimension ( 4 * M )\n*\n*  IWORK  (workspace) INTEGER array, dimension ( 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*          > 0:  if INFO = 1, a singular value did not converge\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*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  idxq, perm, givptr, givcol, givnum, poles, difl, difr, z, k, c, s, info, d, vf, vl, alpha, beta = NumRu::Lapack.slasd6( icompq, nl, nr, sqre, d, vf, vl, alpha, beta, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 9 && argc != 9)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 9)", argc);
+  rblapack_icompq = argv[0];
+  rblapack_nl = argv[1];
+  rblapack_nr = argv[2];
+  rblapack_sqre = argv[3];
+  rblapack_d = argv[4];
+  rblapack_vf = argv[5];
+  rblapack_vl = argv[6];
+  rblapack_alpha = argv[7];
+  rblapack_beta = argv[8];
+  if (argc == 9) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  icompq = NUM2INT(rblapack_icompq);
+  nr = NUM2INT(rblapack_nr);
+  alpha = (real)NUM2DBL(rblapack_alpha);
+  nl = NUM2INT(rblapack_nl);
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (5th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (5th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_d) != (nl+nr+1))
+    rb_raise(rb_eRuntimeError, "shape 0 of d must be %d", nl+nr+1);
+  if (NA_TYPE(rblapack_d) != NA_SFLOAT)
+    rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
+  d = NA_PTR_TYPE(rblapack_d, real*);
+  beta = (real)NUM2DBL(rblapack_beta);
+  n = nl + nr + 1;
+  ldgcol = n;
+  sqre = NUM2INT(rblapack_sqre);
+  m = n + sqre;
+  if (!NA_IsNArray(rblapack_vf))
+    rb_raise(rb_eArgError, "vf (6th argument) must be NArray");
+  if (NA_RANK(rblapack_vf) != 1)
+    rb_raise(rb_eArgError, "rank of vf (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vf) != m)
+    rb_raise(rb_eRuntimeError, "shape 0 of vf must be n + sqre");
+  if (NA_TYPE(rblapack_vf) != NA_SFLOAT)
+    rblapack_vf = na_change_type(rblapack_vf, NA_SFLOAT);
+  vf = NA_PTR_TYPE(rblapack_vf, real*);
+  ldgnum = n;
+  if (!NA_IsNArray(rblapack_vl))
+    rb_raise(rb_eArgError, "vl (7th argument) must be NArray");
+  if (NA_RANK(rblapack_vl) != 1)
+    rb_raise(rb_eArgError, "rank of vl (7th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vl) != m)
+    rb_raise(rb_eRuntimeError, "shape 0 of vl must be n + sqre");
+  if (NA_TYPE(rblapack_vl) != NA_SFLOAT)
+    rblapack_vl = na_change_type(rblapack_vl, NA_SFLOAT);
+  vl = NA_PTR_TYPE(rblapack_vl, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_idxq = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  idxq = NA_PTR_TYPE(rblapack_idxq, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_perm = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  perm = NA_PTR_TYPE(rblapack_perm, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldgcol;
+    shape[1] = 2;
+    rblapack_givcol = na_make_object(NA_LINT, 2, shape, cNArray);
+  }
+  givcol = NA_PTR_TYPE(rblapack_givcol, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldgnum;
+    shape[1] = 2;
+    rblapack_givnum = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  givnum = NA_PTR_TYPE(rblapack_givnum, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldgnum;
+    shape[1] = 2;
+    rblapack_poles = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  poles = NA_PTR_TYPE(rblapack_poles, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_difl = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  difl = NA_PTR_TYPE(rblapack_difl, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = icompq == 1 ? ldgnum : icompq == 0 ? n : 0;
+    shape[1] = icompq == 1 ? 2 : 0;
+    rblapack_difr = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  difr = NA_PTR_TYPE(rblapack_difr, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_z = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  z = NA_PTR_TYPE(rblapack_z, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = nl+nr+1;
+    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] = m;
+    rblapack_vf_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  vf_out__ = NA_PTR_TYPE(rblapack_vf_out__, real*);
+  MEMCPY(vf_out__, vf, real, NA_TOTAL(rblapack_vf));
+  rblapack_vf = rblapack_vf_out__;
+  vf = vf_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_vl_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  vl_out__ = NA_PTR_TYPE(rblapack_vl_out__, real*);
+  MEMCPY(vl_out__, vl, real, NA_TOTAL(rblapack_vl));
+  rblapack_vl = rblapack_vl_out__;
+  vl = vl_out__;
+  work = ALLOC_N(real, (4 * m));
+  iwork = ALLOC_N(integer, (3 * n));
+
+  slasd6_(&icompq, &nl, &nr, &sqre, d, vf, vl, &alpha, &beta, idxq, perm, &givptr, givcol, &ldgcol, givnum, &ldgnum, poles, difl, difr, z, &k, &c, &s, work, iwork, &info);
+
+  free(work);
+  free(iwork);
+  rblapack_givptr = INT2NUM(givptr);
+  rblapack_k = INT2NUM(k);
+  rblapack_c = rb_float_new((double)c);
+  rblapack_s = rb_float_new((double)s);
+  rblapack_info = INT2NUM(info);
+  rblapack_alpha = rb_float_new((double)alpha);
+  rblapack_beta = rb_float_new((double)beta);
+  return rb_ary_new3(18, rblapack_idxq, rblapack_perm, rblapack_givptr, rblapack_givcol, rblapack_givnum, rblapack_poles, rblapack_difl, rblapack_difr, rblapack_z, rblapack_k, rblapack_c, rblapack_s, rblapack_info, rblapack_d, rblapack_vf, rblapack_vl, rblapack_alpha, rblapack_beta);
+}
+
+void
+init_lapack_slasd6(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slasd6", rblapack_slasd6, -1);
+}

data/ext/slasd7.c

@@ -0,0 +1,225 @@
+#include "rb_lapack.h"
+
+extern VOID slasd7_(integer* icompq, integer* nl, integer* nr, integer* sqre, integer* k, real* d, real* z, real* zw, real* vf, real* vfw, real* vl, real* vlw, real* alpha, real* beta, real* dsigma, integer* idx, integer* idxp, integer* idxq, integer* perm, integer* givptr, integer* givcol, integer* ldgcol, real* givnum, integer* ldgnum, real* c, real* s, integer* info);
+
+
+static VALUE
+rblapack_slasd7(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_d;
+  real *d; 
+  VALUE rblapack_vf;
+  real *vf; 
+  VALUE rblapack_vl;
+  real *vl; 
+  VALUE rblapack_alpha;
+  real alpha; 
+  VALUE rblapack_beta;
+  real beta; 
+  VALUE rblapack_idxq;
+  integer *idxq; 
+  VALUE rblapack_k;
+  integer k; 
+  VALUE rblapack_z;
+  real *z; 
+  VALUE rblapack_dsigma;
+  real *dsigma; 
+  VALUE rblapack_perm;
+  integer *perm; 
+  VALUE rblapack_givptr;
+  integer givptr; 
+  VALUE rblapack_givcol;
+  integer *givcol; 
+  VALUE rblapack_givnum;
+  real *givnum; 
+  VALUE rblapack_c;
+  real c; 
+  VALUE rblapack_s;
+  real s; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_d_out__;
+  real *d_out__;
+  VALUE rblapack_vf_out__;
+  real *vf_out__;
+  VALUE rblapack_vl_out__;
+  real *vl_out__;
+  real *zw;
+  real *vfw;
+  real *vlw;
+  integer *idx;
+  integer *idxp;
+
+  integer n;
+  integer m;
+  integer ldgcol;
+  integer ldgnum;
+
+  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  k, z, dsigma, perm, givptr, givcol, givnum, c, s, info, d, vf, vl = NumRu::Lapack.slasd7( icompq, nl, nr, sqre, d, vf, vl, alpha, beta, idxq, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE SLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL, VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, C, S, INFO )\n\n*  Purpose\n*  =======\n*\n*  SLASD7 merges the two sets of singular values together into a single\n*  sorted set. Then it tries to deflate the size of the problem. There\n*  are two ways in which deflation can occur:  when two or more singular\n*  values are close together or if there is a tiny entry in the Z\n*  vector. For each such occurrence the order of the related\n*  secular equation problem is reduced by one.\n*\n*  SLASD7 is called from SLASD6.\n*\n\n*  Arguments\n*  =========\n*\n*  ICOMPQ  (input) INTEGER\n*          Specifies whether singular vectors are to be computed\n*          in compact form, as follows:\n*          = 0: Compute singular values only.\n*          = 1: Compute singular vectors of upper\n*               bidiagonal matrix in compact form.\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\n*         N = NL + NR + 1 rows and\n*         M = N + SQRE >= N columns.\n*\n*  K      (output) INTEGER\n*         Contains the dimension of the non-deflated matrix, this is\n*         the order of the related secular equation. 1 <= K <=N.\n*\n*  D      (input/output) REAL array, dimension ( N )\n*         On entry D contains the singular values of the two submatrices\n*         to be combined. On exit D contains the trailing (N-K) updated\n*         singular values (those which were deflated) sorted into\n*         increasing order.\n*\n*  Z      (output) REAL array, dimension ( M )\n*         On exit Z contains the updating row vector in the secular\n*         equation.\n*\n*  ZW     (workspace) REAL array, dimension ( M )\n*         Workspace for Z.\n*\n*  VF     (input/output) REAL array, dimension ( M )\n*         On entry, VF(1:NL+1) contains the first components of all\n*         right singular vectors of the upper block; and VF(NL+2:M)\n*         contains the first components of all right singular vectors\n*         of the lower block. On exit, VF contains the first components\n*         of all right singular vectors of the bidiagonal matrix.\n*\n*  VFW    (workspace) REAL array, dimension ( M )\n*         Workspace for VF.\n*\n*  VL     (input/output) REAL array, dimension ( M )\n*         On entry, VL(1:NL+1) contains the  last components of all\n*         right singular vectors of the upper block; and VL(NL+2:M)\n*         contains the last components of all right singular vectors\n*         of the lower block. On exit, VL contains the last components\n*         of all right singular vectors of the bidiagonal matrix.\n*\n*  VLW    (workspace) REAL array, dimension ( M )\n*         Workspace for VL.\n*\n*  ALPHA  (input) REAL\n*         Contains the diagonal element associated with the added row.\n*\n*  BETA   (input) REAL\n*         Contains the off-diagonal element associated with the added\n*         row.\n*\n*  DSIGMA (output) REAL array, dimension ( N )\n*         Contains a copy of the diagonal elements (K-1 singular values\n*         and one zero) in the secular equation.\n*\n*  IDX    (workspace) INTEGER array, dimension ( N )\n*         This will contain the permutation used to sort the contents of\n*         D into ascending order.\n*\n*  IDXP   (workspace) INTEGER array, dimension ( N )\n*         This will contain the permutation used to place deflated\n*         values of D at the end of the array. On output IDXP(2:K)\n*         points to the nondeflated D-values and IDXP(K+1:N)\n*         points to the deflated singular values.\n*\n*  IDXQ   (input) INTEGER array, dimension ( N )\n*         This contains the permutation which separately sorts the two\n*         sub-problems in D into ascending order.  Note that entries in\n*         the first half of this permutation must first be moved one\n*         position backward; and entries in the second half\n*         must first have NL+1 added to their values.\n*\n*  PERM   (output) INTEGER array, dimension ( N )\n*         The permutations (from deflation and sorting) to be applied\n*         to each singular block. Not referenced if ICOMPQ = 0.\n*\n*  GIVPTR (output) INTEGER\n*         The number of Givens rotations which took place in this\n*         subproblem. Not referenced if ICOMPQ = 0.\n*\n*  GIVCOL (output) INTEGER array, dimension ( LDGCOL, 2 )\n*         Each pair of numbers indicates a pair of columns to take place\n*         in a Givens rotation. Not referenced if ICOMPQ = 0.\n*\n*  LDGCOL (input) INTEGER\n*         The leading dimension of GIVCOL, must be at least N.\n*\n*  GIVNUM (output) REAL array, dimension ( LDGNUM, 2 )\n*         Each number indicates the C or S value to be used in the\n*         corresponding Givens rotation. Not referenced if ICOMPQ = 0.\n*\n*  LDGNUM (input) INTEGER\n*         The leading dimension of GIVNUM, must be at least N.\n*\n*  C      (output) 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      (output) 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*  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 Huan Ren, Computer Science Division, University of\n*     California at Berkeley, USA\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  k, z, dsigma, perm, givptr, givcol, givnum, c, s, info, d, vf, vl = NumRu::Lapack.slasd7( icompq, nl, nr, sqre, d, vf, vl, alpha, beta, idxq, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 10 && argc != 10)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 10)", argc);
+  rblapack_icompq = argv[0];
+  rblapack_nl = argv[1];
+  rblapack_nr = argv[2];
+  rblapack_sqre = argv[3];
+  rblapack_d = argv[4];
+  rblapack_vf = argv[5];
+  rblapack_vl = argv[6];
+  rblapack_alpha = argv[7];
+  rblapack_beta = argv[8];
+  rblapack_idxq = argv[9];
+  if (argc == 10) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  icompq = NUM2INT(rblapack_icompq);
+  nr = NUM2INT(rblapack_nr);
+  if (!NA_IsNArray(rblapack_d))
+    rb_raise(rb_eArgError, "d (5th argument) must be NArray");
+  if (NA_RANK(rblapack_d) != 1)
+    rb_raise(rb_eArgError, "rank of d (5th 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_vl))
+    rb_raise(rb_eArgError, "vl (7th argument) must be NArray");
+  if (NA_RANK(rblapack_vl) != 1)
+    rb_raise(rb_eArgError, "rank of vl (7th argument) must be %d", 1);
+  m = NA_SHAPE0(rblapack_vl);
+  if (NA_TYPE(rblapack_vl) != NA_SFLOAT)
+    rblapack_vl = na_change_type(rblapack_vl, NA_SFLOAT);
+  vl = NA_PTR_TYPE(rblapack_vl, real*);
+  beta = (real)NUM2DBL(rblapack_beta);
+  nl = NUM2INT(rblapack_nl);
+  if (!NA_IsNArray(rblapack_vf))
+    rb_raise(rb_eArgError, "vf (6th argument) must be NArray");
+  if (NA_RANK(rblapack_vf) != 1)
+    rb_raise(rb_eArgError, "rank of vf (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vf) != m)
+    rb_raise(rb_eRuntimeError, "shape 0 of vf must be the same as shape 0 of vl");
+  if (NA_TYPE(rblapack_vf) != NA_SFLOAT)
+    rblapack_vf = na_change_type(rblapack_vf, NA_SFLOAT);
+  vf = NA_PTR_TYPE(rblapack_vf, real*);
+  if (!NA_IsNArray(rblapack_idxq))
+    rb_raise(rb_eArgError, "idxq (10th argument) must be NArray");
+  if (NA_RANK(rblapack_idxq) != 1)
+    rb_raise(rb_eArgError, "rank of idxq (10th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_idxq) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of idxq must be the same as shape 0 of d");
+  if (NA_TYPE(rblapack_idxq) != NA_LINT)
+    rblapack_idxq = na_change_type(rblapack_idxq, NA_LINT);
+  idxq = NA_PTR_TYPE(rblapack_idxq, integer*);
+  ldgcol = n;
+  sqre = NUM2INT(rblapack_sqre);
+  ldgnum = n;
+  alpha = (real)NUM2DBL(rblapack_alpha);
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_z = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  z = NA_PTR_TYPE(rblapack_z, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_dsigma = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  dsigma = NA_PTR_TYPE(rblapack_dsigma, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_perm = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  perm = NA_PTR_TYPE(rblapack_perm, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldgcol;
+    shape[1] = 2;
+    rblapack_givcol = na_make_object(NA_LINT, 2, shape, cNArray);
+  }
+  givcol = NA_PTR_TYPE(rblapack_givcol, integer*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldgnum;
+    shape[1] = 2;
+    rblapack_givnum = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  givnum = NA_PTR_TYPE(rblapack_givnum, 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] = m;
+    rblapack_vf_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  vf_out__ = NA_PTR_TYPE(rblapack_vf_out__, real*);
+  MEMCPY(vf_out__, vf, real, NA_TOTAL(rblapack_vf));
+  rblapack_vf = rblapack_vf_out__;
+  vf = vf_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_vl_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  vl_out__ = NA_PTR_TYPE(rblapack_vl_out__, real*);
+  MEMCPY(vl_out__, vl, real, NA_TOTAL(rblapack_vl));
+  rblapack_vl = rblapack_vl_out__;
+  vl = vl_out__;
+  zw = ALLOC_N(real, (m));
+  vfw = ALLOC_N(real, (m));
+  vlw = ALLOC_N(real, (m));
+  idx = ALLOC_N(integer, (n));
+  idxp = ALLOC_N(integer, (n));
+
+  slasd7_(&icompq, &nl, &nr, &sqre, &k, d, z, zw, vf, vfw, vl, vlw, &alpha, &beta, dsigma, idx, idxp, idxq, perm, &givptr, givcol, &ldgcol, givnum, &ldgnum, &c, &s, &info);
+
+  free(zw);
+  free(vfw);
+  free(vlw);
+  free(idx);
+  free(idxp);
+  rblapack_k = INT2NUM(k);
+  rblapack_givptr = INT2NUM(givptr);
+  rblapack_c = rb_float_new((double)c);
+  rblapack_s = rb_float_new((double)s);
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(13, rblapack_k, rblapack_z, rblapack_dsigma, rblapack_perm, rblapack_givptr, rblapack_givcol, rblapack_givnum, rblapack_c, rblapack_s, rblapack_info, rblapack_d, rblapack_vf, rblapack_vl);
+}
+
+void
+init_lapack_slasd7(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "slasd7", rblapack_slasd7, -1);
+}