ruby-lapack 1.7 → 1.7.1

data/ext/dlaqp2.c

@@ -0,0 +1,158 @@
+#include "rb_lapack.h"
+
+extern VOID dlaqp2_(integer* m, integer* n, integer* offset, doublereal* a, integer* lda, integer* jpvt, doublereal* tau, doublereal* vn1, doublereal* vn2, doublereal* work);
+
+
+static VALUE
+rblapack_dlaqp2(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_offset;
+  integer offset; 
+  VALUE rblapack_a;
+  doublereal *a; 
+  VALUE rblapack_jpvt;
+  integer *jpvt; 
+  VALUE rblapack_vn1;
+  doublereal *vn1; 
+  VALUE rblapack_vn2;
+  doublereal *vn2; 
+  VALUE rblapack_tau;
+  doublereal *tau; 
+  VALUE rblapack_a_out__;
+  doublereal *a_out__;
+  VALUE rblapack_jpvt_out__;
+  integer *jpvt_out__;
+  VALUE rblapack_vn1_out__;
+  doublereal *vn1_out__;
+  VALUE rblapack_vn2_out__;
+  doublereal *vn2_out__;
+  doublereal *work;
+
+  integer lda;
+  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  tau, a, jpvt, vn1, vn2 = NumRu::Lapack.dlaqp2( m, offset, a, jpvt, vn1, vn2, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE DLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, WORK )\n\n*  Purpose\n*  =======\n*\n*  DLAQP2 computes a QR factorization with column pivoting of\n*  the block A(OFFSET+1:M,1:N).\n*  The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.\n*\n\n*  Arguments\n*  =========\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix A. M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix A. N >= 0.\n*\n*  OFFSET  (input) INTEGER\n*          The number of rows of the matrix A that must be pivoted\n*          but no factorized. OFFSET >= 0.\n*\n*  A       (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n*          On entry, the M-by-N matrix A.\n*          On exit, the upper triangle of block A(OFFSET+1:M,1:N) is \n*          the triangular factor obtained; the elements in block\n*          A(OFFSET+1:M,1:N) below the diagonal, together with the\n*          array TAU, represent the orthogonal matrix Q as a product of\n*          elementary reflectors. Block A(1:OFFSET,1:N) has been\n*          accordingly pivoted, but no factorized.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A. LDA >= max(1,M).\n*\n*  JPVT    (input/output) INTEGER array, dimension (N)\n*          On entry, if JPVT(i) .ne. 0, the i-th column of A is permuted\n*          to the front of A*P (a leading column); if JPVT(i) = 0,\n*          the i-th column of A is a free column.\n*          On exit, if JPVT(i) = k, then the i-th column of A*P\n*          was the k-th column of A.\n*\n*  TAU     (output) DOUBLE PRECISION array, dimension (min(M,N))\n*          The scalar factors of the elementary reflectors.\n*\n*  VN1     (input/output) DOUBLE PRECISION array, dimension (N)\n*          The vector with the partial column norms.\n*\n*  VN2     (input/output) DOUBLE PRECISION array, dimension (N)\n*          The vector with the exact column norms.\n*\n*  WORK    (workspace) DOUBLE PRECISION array, dimension (N)\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain\n*    X. Sun, Computer Science Dept., Duke University, USA\n*\n*  Partial column norm updating strategy modified by\n*    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,\n*    University of Zagreb, Croatia.\n*     June 2010\n*  For more details see LAPACK Working Note 176.\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  tau, a, jpvt, vn1, vn2 = NumRu::Lapack.dlaqp2( m, offset, a, jpvt, vn1, vn2, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 6 && argc != 6)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 6)", argc);
+  rblapack_m = argv[0];
+  rblapack_offset = argv[1];
+  rblapack_a = argv[2];
+  rblapack_jpvt = argv[3];
+  rblapack_vn1 = argv[4];
+  rblapack_vn2 = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  m = NUM2INT(rblapack_m);
+  if (!NA_IsNArray(rblapack_a))
+    rb_raise(rb_eArgError, "a (3th argument) must be NArray");
+  if (NA_RANK(rblapack_a) != 2)
+    rb_raise(rb_eArgError, "rank of a (3th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_a);
+  n = NA_SHAPE1(rblapack_a);
+  if (NA_TYPE(rblapack_a) != NA_DFLOAT)
+    rblapack_a = na_change_type(rblapack_a, NA_DFLOAT);
+  a = NA_PTR_TYPE(rblapack_a, doublereal*);
+  if (!NA_IsNArray(rblapack_vn1))
+    rb_raise(rb_eArgError, "vn1 (5th argument) must be NArray");
+  if (NA_RANK(rblapack_vn1) != 1)
+    rb_raise(rb_eArgError, "rank of vn1 (5th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vn1) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of vn1 must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_vn1) != NA_DFLOAT)
+    rblapack_vn1 = na_change_type(rblapack_vn1, NA_DFLOAT);
+  vn1 = NA_PTR_TYPE(rblapack_vn1, doublereal*);
+  offset = NUM2INT(rblapack_offset);
+  if (!NA_IsNArray(rblapack_vn2))
+    rb_raise(rb_eArgError, "vn2 (6th argument) must be NArray");
+  if (NA_RANK(rblapack_vn2) != 1)
+    rb_raise(rb_eArgError, "rank of vn2 (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vn2) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of vn2 must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_vn2) != NA_DFLOAT)
+    rblapack_vn2 = na_change_type(rblapack_vn2, NA_DFLOAT);
+  vn2 = NA_PTR_TYPE(rblapack_vn2, doublereal*);
+  if (!NA_IsNArray(rblapack_jpvt))
+    rb_raise(rb_eArgError, "jpvt (4th argument) must be NArray");
+  if (NA_RANK(rblapack_jpvt) != 1)
+    rb_raise(rb_eArgError, "rank of jpvt (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_jpvt) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of jpvt must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_jpvt) != NA_LINT)
+    rblapack_jpvt = na_change_type(rblapack_jpvt, NA_LINT);
+  jpvt = NA_PTR_TYPE(rblapack_jpvt, integer*);
+  {
+    na_shape_t shape[1];
+    shape[0] = MIN(m,n);
+    rblapack_tau = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  tau = NA_PTR_TYPE(rblapack_tau, doublereal*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, doublereal*);
+  MEMCPY(a_out__, a, doublereal, NA_TOTAL(rblapack_a));
+  rblapack_a = rblapack_a_out__;
+  a = a_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_jpvt_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  jpvt_out__ = NA_PTR_TYPE(rblapack_jpvt_out__, integer*);
+  MEMCPY(jpvt_out__, jpvt, integer, NA_TOTAL(rblapack_jpvt));
+  rblapack_jpvt = rblapack_jpvt_out__;
+  jpvt = jpvt_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_vn1_out__ = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  vn1_out__ = NA_PTR_TYPE(rblapack_vn1_out__, doublereal*);
+  MEMCPY(vn1_out__, vn1, doublereal, NA_TOTAL(rblapack_vn1));
+  rblapack_vn1 = rblapack_vn1_out__;
+  vn1 = vn1_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_vn2_out__ = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  vn2_out__ = NA_PTR_TYPE(rblapack_vn2_out__, doublereal*);
+  MEMCPY(vn2_out__, vn2, doublereal, NA_TOTAL(rblapack_vn2));
+  rblapack_vn2 = rblapack_vn2_out__;
+  vn2 = vn2_out__;
+  work = ALLOC_N(doublereal, (n));
+
+  dlaqp2_(&m, &n, &offset, a, &lda, jpvt, tau, vn1, vn2, work);
+
+  free(work);
+  return rb_ary_new3(5, rblapack_tau, rblapack_a, rblapack_jpvt, rblapack_vn1, rblapack_vn2);
+}
+
+void
+init_lapack_dlaqp2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "dlaqp2", rblapack_dlaqp2, -1);
+}

data/ext/dlaqps.c

@@ -0,0 +1,208 @@
+#include "rb_lapack.h"
+
+extern VOID dlaqps_(integer* m, integer* n, integer* offset, integer* nb, integer* kb, doublereal* a, integer* lda, integer* jpvt, doublereal* tau, doublereal* vn1, doublereal* vn2, doublereal* auxv, doublereal* f, integer* ldf);
+
+
+static VALUE
+rblapack_dlaqps(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_offset;
+  integer offset; 
+  VALUE rblapack_a;
+  doublereal *a; 
+  VALUE rblapack_jpvt;
+  integer *jpvt; 
+  VALUE rblapack_vn1;
+  doublereal *vn1; 
+  VALUE rblapack_vn2;
+  doublereal *vn2; 
+  VALUE rblapack_auxv;
+  doublereal *auxv; 
+  VALUE rblapack_f;
+  doublereal *f; 
+  VALUE rblapack_kb;
+  integer kb; 
+  VALUE rblapack_tau;
+  doublereal *tau; 
+  VALUE rblapack_a_out__;
+  doublereal *a_out__;
+  VALUE rblapack_jpvt_out__;
+  integer *jpvt_out__;
+  VALUE rblapack_vn1_out__;
+  doublereal *vn1_out__;
+  VALUE rblapack_vn2_out__;
+  doublereal *vn2_out__;
+  VALUE rblapack_auxv_out__;
+  doublereal *auxv_out__;
+  VALUE rblapack_f_out__;
+  doublereal *f_out__;
+
+  integer lda;
+  integer n;
+  integer nb;
+  integer ldf;
+
+  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  kb, tau, a, jpvt, vn1, vn2, auxv, f = NumRu::Lapack.dlaqps( m, offset, a, jpvt, vn1, vn2, auxv, f, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE DLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, VN2, AUXV, F, LDF )\n\n*  Purpose\n*  =======\n*\n*  DLAQPS computes a step of QR factorization with column pivoting\n*  of a real M-by-N matrix A by using Blas-3.  It tries to factorize\n*  NB columns from A starting from the row OFFSET+1, and updates all\n*  of the matrix with Blas-3 xGEMM.\n*\n*  In some cases, due to catastrophic cancellations, it cannot\n*  factorize NB columns.  Hence, the actual number of factorized\n*  columns is returned in KB.\n*\n*  Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.\n*\n\n*  Arguments\n*  =========\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix A. M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix A. N >= 0\n*\n*  OFFSET  (input) INTEGER\n*          The number of rows of A that have been factorized in\n*          previous steps.\n*\n*  NB      (input) INTEGER\n*          The number of columns to factorize.\n*\n*  KB      (output) INTEGER\n*          The number of columns actually factorized.\n*\n*  A       (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n*          On entry, the M-by-N matrix A.\n*          On exit, block A(OFFSET+1:M,1:KB) is the triangular\n*          factor obtained and block A(1:OFFSET,1:N) has been\n*          accordingly pivoted, but no factorized.\n*          The rest of the matrix, block A(OFFSET+1:M,KB+1:N) has\n*          been updated.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A. LDA >= max(1,M).\n*\n*  JPVT    (input/output) INTEGER array, dimension (N)\n*          JPVT(I) = K <==> Column K of the full matrix A has been\n*          permuted into position I in AP.\n*\n*  TAU     (output) DOUBLE PRECISION array, dimension (KB)\n*          The scalar factors of the elementary reflectors.\n*\n*  VN1     (input/output) DOUBLE PRECISION array, dimension (N)\n*          The vector with the partial column norms.\n*\n*  VN2     (input/output) DOUBLE PRECISION array, dimension (N)\n*          The vector with the exact column norms.\n*\n*  AUXV    (input/output) DOUBLE PRECISION array, dimension (NB)\n*          Auxiliar vector.\n*\n*  F       (input/output) DOUBLE PRECISION array, dimension (LDF,NB)\n*          Matrix F' = L*Y'*A.\n*\n*  LDF     (input) INTEGER\n*          The leading dimension of the array F. LDF >= max(1,N).\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain\n*    X. Sun, Computer Science Dept., Duke University, USA\n*\n*  Partial column norm updating strategy modified by\n*    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,\n*    University of Zagreb, Croatia.\n*     June 2010\n*  For more details see LAPACK Working Note 176.\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  kb, tau, a, jpvt, vn1, vn2, auxv, f = NumRu::Lapack.dlaqps( m, offset, a, jpvt, vn1, vn2, auxv, f, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 8 && argc != 8)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 8)", argc);
+  rblapack_m = argv[0];
+  rblapack_offset = argv[1];
+  rblapack_a = argv[2];
+  rblapack_jpvt = argv[3];
+  rblapack_vn1 = argv[4];
+  rblapack_vn2 = argv[5];
+  rblapack_auxv = argv[6];
+  rblapack_f = argv[7];
+  if (argc == 8) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  m = NUM2INT(rblapack_m);
+  if (!NA_IsNArray(rblapack_a))
+    rb_raise(rb_eArgError, "a (3th argument) must be NArray");
+  if (NA_RANK(rblapack_a) != 2)
+    rb_raise(rb_eArgError, "rank of a (3th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_a);
+  n = NA_SHAPE1(rblapack_a);
+  if (NA_TYPE(rblapack_a) != NA_DFLOAT)
+    rblapack_a = na_change_type(rblapack_a, NA_DFLOAT);
+  a = NA_PTR_TYPE(rblapack_a, doublereal*);
+  if (!NA_IsNArray(rblapack_vn1))
+    rb_raise(rb_eArgError, "vn1 (5th argument) must be NArray");
+  if (NA_RANK(rblapack_vn1) != 1)
+    rb_raise(rb_eArgError, "rank of vn1 (5th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vn1) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of vn1 must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_vn1) != NA_DFLOAT)
+    rblapack_vn1 = na_change_type(rblapack_vn1, NA_DFLOAT);
+  vn1 = NA_PTR_TYPE(rblapack_vn1, doublereal*);
+  if (!NA_IsNArray(rblapack_auxv))
+    rb_raise(rb_eArgError, "auxv (7th argument) must be NArray");
+  if (NA_RANK(rblapack_auxv) != 1)
+    rb_raise(rb_eArgError, "rank of auxv (7th argument) must be %d", 1);
+  nb = NA_SHAPE0(rblapack_auxv);
+  if (NA_TYPE(rblapack_auxv) != NA_DFLOAT)
+    rblapack_auxv = na_change_type(rblapack_auxv, NA_DFLOAT);
+  auxv = NA_PTR_TYPE(rblapack_auxv, doublereal*);
+  offset = NUM2INT(rblapack_offset);
+  if (!NA_IsNArray(rblapack_vn2))
+    rb_raise(rb_eArgError, "vn2 (6th argument) must be NArray");
+  if (NA_RANK(rblapack_vn2) != 1)
+    rb_raise(rb_eArgError, "rank of vn2 (6th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_vn2) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of vn2 must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_vn2) != NA_DFLOAT)
+    rblapack_vn2 = na_change_type(rblapack_vn2, NA_DFLOAT);
+  vn2 = NA_PTR_TYPE(rblapack_vn2, doublereal*);
+  if (!NA_IsNArray(rblapack_jpvt))
+    rb_raise(rb_eArgError, "jpvt (4th argument) must be NArray");
+  if (NA_RANK(rblapack_jpvt) != 1)
+    rb_raise(rb_eArgError, "rank of jpvt (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_jpvt) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of jpvt must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_jpvt) != NA_LINT)
+    rblapack_jpvt = na_change_type(rblapack_jpvt, NA_LINT);
+  jpvt = NA_PTR_TYPE(rblapack_jpvt, integer*);
+  if (!NA_IsNArray(rblapack_f))
+    rb_raise(rb_eArgError, "f (8th argument) must be NArray");
+  if (NA_RANK(rblapack_f) != 2)
+    rb_raise(rb_eArgError, "rank of f (8th argument) must be %d", 2);
+  ldf = NA_SHAPE0(rblapack_f);
+  if (NA_SHAPE1(rblapack_f) != nb)
+    rb_raise(rb_eRuntimeError, "shape 1 of f must be the same as shape 0 of auxv");
+  if (NA_TYPE(rblapack_f) != NA_DFLOAT)
+    rblapack_f = na_change_type(rblapack_f, NA_DFLOAT);
+  f = NA_PTR_TYPE(rblapack_f, doublereal*);
+  kb = nb;
+  {
+    na_shape_t shape[1];
+    shape[0] = kb;
+    rblapack_tau = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  tau = NA_PTR_TYPE(rblapack_tau, doublereal*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, doublereal*);
+  MEMCPY(a_out__, a, doublereal, NA_TOTAL(rblapack_a));
+  rblapack_a = rblapack_a_out__;
+  a = a_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_jpvt_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
+  }
+  jpvt_out__ = NA_PTR_TYPE(rblapack_jpvt_out__, integer*);
+  MEMCPY(jpvt_out__, jpvt, integer, NA_TOTAL(rblapack_jpvt));
+  rblapack_jpvt = rblapack_jpvt_out__;
+  jpvt = jpvt_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_vn1_out__ = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  vn1_out__ = NA_PTR_TYPE(rblapack_vn1_out__, doublereal*);
+  MEMCPY(vn1_out__, vn1, doublereal, NA_TOTAL(rblapack_vn1));
+  rblapack_vn1 = rblapack_vn1_out__;
+  vn1 = vn1_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_vn2_out__ = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  vn2_out__ = NA_PTR_TYPE(rblapack_vn2_out__, doublereal*);
+  MEMCPY(vn2_out__, vn2, doublereal, NA_TOTAL(rblapack_vn2));
+  rblapack_vn2 = rblapack_vn2_out__;
+  vn2 = vn2_out__;
+  {
+    na_shape_t shape[1];
+    shape[0] = nb;
+    rblapack_auxv_out__ = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  auxv_out__ = NA_PTR_TYPE(rblapack_auxv_out__, doublereal*);
+  MEMCPY(auxv_out__, auxv, doublereal, NA_TOTAL(rblapack_auxv));
+  rblapack_auxv = rblapack_auxv_out__;
+  auxv = auxv_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldf;
+    shape[1] = nb;
+    rblapack_f_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
+  }
+  f_out__ = NA_PTR_TYPE(rblapack_f_out__, doublereal*);
+  MEMCPY(f_out__, f, doublereal, NA_TOTAL(rblapack_f));
+  rblapack_f = rblapack_f_out__;
+  f = f_out__;
+
+  dlaqps_(&m, &n, &offset, &nb, &kb, a, &lda, jpvt, tau, vn1, vn2, auxv, f, &ldf);
+
+  rblapack_kb = INT2NUM(kb);
+  return rb_ary_new3(8, rblapack_kb, rblapack_tau, rblapack_a, rblapack_jpvt, rblapack_vn1, rblapack_vn2, rblapack_auxv, rblapack_f);
+}
+
+void
+init_lapack_dlaqps(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "dlaqps", rblapack_dlaqps, -1);
+}

data/ext/dlaqr0.c

@@ -0,0 +1,153 @@
+#include "rb_lapack.h"
+
+extern VOID dlaqr0_(logical* wantt, logical* wantz, integer* n, integer* ilo, integer* ihi, doublereal* h, integer* ldh, doublereal* wr, doublereal* wi, integer* iloz, integer* ihiz, doublereal* z, integer* ldz, doublereal* work, integer* lwork, integer* info);
+
+
+static VALUE
+rblapack_dlaqr0(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_wantt;
+  logical wantt; 
+  VALUE rblapack_wantz;
+  logical wantz; 
+  VALUE rblapack_ilo;
+  integer ilo; 
+  VALUE rblapack_h;
+  doublereal *h; 
+  VALUE rblapack_iloz;
+  integer iloz; 
+  VALUE rblapack_ihiz;
+  integer ihiz; 
+  VALUE rblapack_z;
+  doublereal *z; 
+  VALUE rblapack_lwork;
+  integer lwork; 
+  VALUE rblapack_wr;
+  doublereal *wr; 
+  VALUE rblapack_wi;
+  doublereal *wi; 
+  VALUE rblapack_work;
+  doublereal *work; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_h_out__;
+  doublereal *h_out__;
+  VALUE rblapack_z_out__;
+  doublereal *z_out__;
+
+  integer ldh;
+  integer n;
+  integer ldz;
+  integer ihi;
+
+  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  wr, wi, work, info, h, z = NumRu::Lapack.dlaqr0( wantt, wantz, ilo, h, iloz, ihiz, z, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE DLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )\n\n*     Purpose\n*     =======\n*\n*     DLAQR0 computes the eigenvalues of a Hessenberg matrix H\n*     and, optionally, the matrices T and Z from the Schur decomposition\n*     H = Z T Z**T, where T is an upper quasi-triangular matrix (the\n*     Schur form), and Z is the orthogonal matrix of Schur vectors.\n*\n*     Optionally Z may be postmultiplied into an input orthogonal\n*     matrix Q so that this routine can give the Schur factorization\n*     of a matrix A which has been reduced to the Hessenberg form H\n*     by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.\n*\n\n*     Arguments\n*     =========\n*\n*     WANTT   (input) LOGICAL\n*          = .TRUE. : the full Schur form T is required;\n*          = .FALSE.: only eigenvalues are required.\n*\n*     WANTZ   (input) LOGICAL\n*          = .TRUE. : the matrix of Schur vectors Z is required;\n*          = .FALSE.: Schur vectors are not required.\n*\n*     N     (input) INTEGER\n*           The order of the matrix H.  N .GE. 0.\n*\n*     ILO   (input) INTEGER\n*     IHI   (input) INTEGER\n*           It is assumed that H is already upper triangular in rows\n*           and columns 1:ILO-1 and IHI+1:N and, if ILO.GT.1,\n*           H(ILO,ILO-1) is zero. ILO and IHI are normally set by a\n*           previous call to DGEBAL, and then passed to DGEHRD when the\n*           matrix output by DGEBAL is reduced to Hessenberg form.\n*           Otherwise, ILO and IHI should be set to 1 and N,\n*           respectively.  If N.GT.0, then 1.LE.ILO.LE.IHI.LE.N.\n*           If N = 0, then ILO = 1 and IHI = 0.\n*\n*     H     (input/output) DOUBLE PRECISION array, dimension (LDH,N)\n*           On entry, the upper Hessenberg matrix H.\n*           On exit, if INFO = 0 and WANTT is .TRUE., then H contains\n*           the upper quasi-triangular matrix T from the Schur\n*           decomposition (the Schur form); 2-by-2 diagonal blocks\n*           (corresponding to complex conjugate pairs of eigenvalues)\n*           are returned in standard form, with H(i,i) = H(i+1,i+1)\n*           and H(i+1,i)*H(i,i+1).LT.0. If INFO = 0 and WANTT is\n*           .FALSE., then the contents of H are unspecified on exit.\n*           (The output value of H when INFO.GT.0 is given under the\n*           description of INFO below.)\n*\n*           This subroutine may explicitly set H(i,j) = 0 for i.GT.j and\n*           j = 1, 2, ... ILO-1 or j = IHI+1, IHI+2, ... N.\n*\n*     LDH   (input) INTEGER\n*           The leading dimension of the array H. LDH .GE. max(1,N).\n*\n*     WR    (output) DOUBLE PRECISION array, dimension (IHI)\n*     WI    (output) DOUBLE PRECISION array, dimension (IHI)\n*           The real and imaginary parts, respectively, of the computed\n*           eigenvalues of H(ILO:IHI,ILO:IHI) are stored in WR(ILO:IHI)\n*           and WI(ILO:IHI). If two eigenvalues are computed as a\n*           complex conjugate pair, they are stored in consecutive\n*           elements of WR and WI, say the i-th and (i+1)th, with\n*           WI(i) .GT. 0 and WI(i+1) .LT. 0. If WANTT is .TRUE., then\n*           the eigenvalues are stored in the same order as on the\n*           diagonal of the Schur form returned in H, with\n*           WR(i) = H(i,i) and, if H(i:i+1,i:i+1) is a 2-by-2 diagonal\n*           block, WI(i) = sqrt(-H(i+1,i)*H(i,i+1)) and\n*           WI(i+1) = -WI(i).\n*\n*     ILOZ     (input) INTEGER\n*     IHIZ     (input) INTEGER\n*           Specify the rows of Z to which transformations must be\n*           applied if WANTZ is .TRUE..\n*           1 .LE. ILOZ .LE. ILO; IHI .LE. IHIZ .LE. N.\n*\n*     Z     (input/output) DOUBLE PRECISION array, dimension (LDZ,IHI)\n*           If WANTZ is .FALSE., then Z is not referenced.\n*           If WANTZ is .TRUE., then Z(ILO:IHI,ILOZ:IHIZ) is\n*           replaced by Z(ILO:IHI,ILOZ:IHIZ)*U where U is the\n*           orthogonal Schur factor of H(ILO:IHI,ILO:IHI).\n*           (The output value of Z when INFO.GT.0 is given under\n*           the description of INFO below.)\n*\n*     LDZ   (input) INTEGER\n*           The leading dimension of the array Z.  if WANTZ is .TRUE.\n*           then LDZ.GE.MAX(1,IHIZ).  Otherwize, LDZ.GE.1.\n*\n*     WORK  (workspace/output) DOUBLE PRECISION array, dimension LWORK\n*           On exit, if LWORK = -1, WORK(1) returns an estimate of\n*           the optimal value for LWORK.\n*\n*     LWORK (input) INTEGER\n*           The dimension of the array WORK.  LWORK .GE. max(1,N)\n*           is sufficient, but LWORK typically as large as 6*N may\n*           be required for optimal performance.  A workspace query\n*           to determine the optimal workspace size is recommended.\n*\n*           If LWORK = -1, then DLAQR0 does a workspace query.\n*           In this case, DLAQR0 checks the input parameters and\n*           estimates the optimal workspace size for the given\n*           values of N, ILO and IHI.  The estimate is returned\n*           in WORK(1).  No error message related to LWORK is\n*           issued by XERBLA.  Neither H nor Z are accessed.\n*\n*\n*     INFO  (output) INTEGER\n*             =  0:  successful exit\n*           .GT. 0:  if INFO = i, DLAQR0 failed to compute all of\n*                the eigenvalues.  Elements 1:ilo-1 and i+1:n of WR\n*                and WI contain those eigenvalues which have been\n*                successfully computed.  (Failures are rare.)\n*\n*                If INFO .GT. 0 and WANT is .FALSE., then on exit,\n*                the remaining unconverged eigenvalues are the eigen-\n*                values of the upper Hessenberg matrix rows and\n*                columns ILO through INFO of the final, output\n*                value of H.\n*\n*                If INFO .GT. 0 and WANTT is .TRUE., then on exit\n*\n*           (*)  (initial value of H)*U  = U*(final value of H)\n*\n*                where U is an orthogonal matrix.  The final\n*                value of H is upper Hessenberg and quasi-triangular\n*                in rows and columns INFO+1 through IHI.\n*\n*                If INFO .GT. 0 and WANTZ is .TRUE., then on exit\n*\n*                  (final value of Z(ILO:IHI,ILOZ:IHIZ)\n*                   =  (initial value of Z(ILO:IHI,ILOZ:IHIZ)*U\n*\n*                where U is the orthogonal matrix in (*) (regard-\n*                less of the value of WANTT.)\n*\n*                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not\n*                accessed.\n*\n\n*     ================================================================\n*     Based on contributions by\n*        Karen Braman and Ralph Byers, Department of Mathematics,\n*        University of Kansas, USA\n*\n*     ================================================================\n*     References:\n*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR\n*       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3\n*       Performance, SIAM Journal of Matrix Analysis, volume 23, pages\n*       929--947, 2002.\n*\n*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR\n*       Algorithm Part II: Aggressive Early Deflation, SIAM Journal\n*       of Matrix Analysis, volume 23, pages 948--973, 2002.\n*\n*     ================================================================\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  wr, wi, work, info, h, z = NumRu::Lapack.dlaqr0( wantt, wantz, ilo, h, iloz, ihiz, z, [: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_wantt = argv[0];
+  rblapack_wantz = argv[1];
+  rblapack_ilo = argv[2];
+  rblapack_h = argv[3];
+  rblapack_iloz = argv[4];
+  rblapack_ihiz = argv[5];
+  rblapack_z = 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;
+  }
+
+  wantt = (rblapack_wantt == Qtrue);
+  ilo = NUM2INT(rblapack_ilo);
+  iloz = NUM2INT(rblapack_iloz);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (7th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 2)
+    rb_raise(rb_eArgError, "rank of z (7th argument) must be %d", 2);
+  ldz = NA_SHAPE0(rblapack_z);
+  ihi = NA_SHAPE1(rblapack_z);
+  if (NA_TYPE(rblapack_z) != NA_DFLOAT)
+    rblapack_z = na_change_type(rblapack_z, NA_DFLOAT);
+  z = NA_PTR_TYPE(rblapack_z, doublereal*);
+  wantz = (rblapack_wantz == Qtrue);
+  ihiz = NUM2INT(rblapack_ihiz);
+  if (!NA_IsNArray(rblapack_h))
+    rb_raise(rb_eArgError, "h (4th argument) must be NArray");
+  if (NA_RANK(rblapack_h) != 2)
+    rb_raise(rb_eArgError, "rank of h (4th argument) must be %d", 2);
+  ldh = NA_SHAPE0(rblapack_h);
+  n = NA_SHAPE1(rblapack_h);
+  if (NA_TYPE(rblapack_h) != NA_DFLOAT)
+    rblapack_h = na_change_type(rblapack_h, NA_DFLOAT);
+  h = NA_PTR_TYPE(rblapack_h, doublereal*);
+  if (rblapack_lwork == Qnil)
+    lwork = n;
+  else {
+    lwork = NUM2INT(rblapack_lwork);
+  }
+  {
+    na_shape_t shape[1];
+    shape[0] = ihi;
+    rblapack_wr = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  wr = NA_PTR_TYPE(rblapack_wr, doublereal*);
+  {
+    na_shape_t shape[1];
+    shape[0] = ihi;
+    rblapack_wi = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  wi = NA_PTR_TYPE(rblapack_wi, doublereal*);
+  {
+    na_shape_t shape[1];
+    shape[0] = MAX(1,lwork);
+    rblapack_work = na_make_object(NA_DFLOAT, 1, shape, cNArray);
+  }
+  work = NA_PTR_TYPE(rblapack_work, doublereal*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldh;
+    shape[1] = n;
+    rblapack_h_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
+  }
+  h_out__ = NA_PTR_TYPE(rblapack_h_out__, doublereal*);
+  MEMCPY(h_out__, h, doublereal, NA_TOTAL(rblapack_h));
+  rblapack_h = rblapack_h_out__;
+  h = h_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldz;
+    shape[1] = ihi;
+    rblapack_z_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
+  }
+  z_out__ = NA_PTR_TYPE(rblapack_z_out__, doublereal*);
+  MEMCPY(z_out__, z, doublereal, NA_TOTAL(rblapack_z));
+  rblapack_z = rblapack_z_out__;
+  z = z_out__;
+
+  dlaqr0_(&wantt, &wantz, &n, &ilo, &ihi, h, &ldh, wr, wi, &iloz, &ihiz, z, &ldz, work, &lwork, &info);
+
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(6, rblapack_wr, rblapack_wi, rblapack_work, rblapack_info, rblapack_h, rblapack_z);
+}
+
+void
+init_lapack_dlaqr0(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "dlaqr0", rblapack_dlaqr0, -1);
+}