ruby-lapack 1.7 → 1.7.1

data/ext/claqhe.c

@@ -0,0 +1,97 @@
+#include "rb_lapack.h"
+
+extern VOID claqhe_(char* uplo, integer* n, complex* a, integer* lda, real* s, real* scond, real* amax, char* equed);
+
+
+static VALUE
+rblapack_claqhe(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_a;
+  complex *a; 
+  VALUE rblapack_s;
+  real *s; 
+  VALUE rblapack_scond;
+  real scond; 
+  VALUE rblapack_amax;
+  real amax; 
+  VALUE rblapack_equed;
+  char equed; 
+  VALUE rblapack_a_out__;
+  complex *a_out__;
+
+  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  equed, a = NumRu::Lapack.claqhe( uplo, a, s, scond, amax, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAQHE( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )\n\n*  Purpose\n*  =======\n*\n*  CLAQHE equilibrates a Hermitian matrix A using the scaling factors\n*  in the vector S.\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          Specifies whether the upper or lower triangular part of the\n*          Hermitian matrix A is stored.\n*          = 'U':  Upper triangular\n*          = 'L':  Lower triangular\n*\n*  N       (input) INTEGER\n*          The order of the matrix A.  N >= 0.\n*\n*  A       (input/output) COMPLEX array, dimension (LDA,N)\n*          On entry, the Hermitian matrix A.  If UPLO = 'U', the leading\n*          n by n upper triangular part of A contains the upper\n*          triangular part of the matrix A, and the strictly lower\n*          triangular part of A is not referenced.  If UPLO = 'L', the\n*          leading n by n lower triangular part of A contains the lower\n*          triangular part of the matrix A, and the strictly upper\n*          triangular part of A is not referenced.\n*\n*          On exit, if EQUED = 'Y', the equilibrated matrix:\n*          diag(S) * A * diag(S).\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(N,1).\n*\n*  S       (input) REAL array, dimension (N)\n*          The scale factors for A.\n*\n*  SCOND   (input) REAL\n*          Ratio of the smallest S(i) to the largest S(i).\n*\n*  AMAX    (input) REAL\n*          Absolute value of largest matrix entry.\n*\n*  EQUED   (output) CHARACTER*1\n*          Specifies whether or not equilibration was done.\n*          = 'N':  No equilibration.\n*          = 'Y':  Equilibration was done, i.e., A has been replaced by\n*                  diag(S) * A * diag(S).\n*\n*  Internal Parameters\n*  ===================\n*\n*  THRESH is a threshold value used to decide if scaling should be done\n*  based on the ratio of the scaling factors.  If SCOND < THRESH,\n*  scaling is done.\n*\n*  LARGE and SMALL are threshold values used to decide if scaling should\n*  be done based on the absolute size of the largest matrix element.\n*  If AMAX > LARGE or AMAX < SMALL, scaling is done.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  equed, a = NumRu::Lapack.claqhe( uplo, a, s, scond, amax, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 5 && argc != 5)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 5)", argc);
+  rblapack_uplo = argv[0];
+  rblapack_a = argv[1];
+  rblapack_s = argv[2];
+  rblapack_scond = argv[3];
+  rblapack_amax = argv[4];
+  if (argc == 5) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_s))
+    rb_raise(rb_eArgError, "s (3th argument) must be NArray");
+  if (NA_RANK(rblapack_s) != 1)
+    rb_raise(rb_eArgError, "rank of s (3th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_s);
+  if (NA_TYPE(rblapack_s) != NA_SFLOAT)
+    rblapack_s = na_change_type(rblapack_s, NA_SFLOAT);
+  s = NA_PTR_TYPE(rblapack_s, real*);
+  amax = (real)NUM2DBL(rblapack_amax);
+  if (!NA_IsNArray(rblapack_a))
+    rb_raise(rb_eArgError, "a (2th argument) must be NArray");
+  if (NA_RANK(rblapack_a) != 2)
+    rb_raise(rb_eArgError, "rank of a (2th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_a);
+  if (NA_SHAPE1(rblapack_a) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of a must be the same as shape 0 of s");
+  if (NA_TYPE(rblapack_a) != NA_SCOMPLEX)
+    rblapack_a = na_change_type(rblapack_a, NA_SCOMPLEX);
+  a = NA_PTR_TYPE(rblapack_a, complex*);
+  scond = (real)NUM2DBL(rblapack_scond);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, complex*);
+  MEMCPY(a_out__, a, complex, NA_TOTAL(rblapack_a));
+  rblapack_a = rblapack_a_out__;
+  a = a_out__;
+
+  claqhe_(&uplo, &n, a, &lda, s, &scond, &amax, &equed);
+
+  rblapack_equed = rb_str_new(&equed,1);
+  return rb_ary_new3(2, rblapack_equed, rblapack_a);
+}
+
+void
+init_lapack_claqhe(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claqhe", rblapack_claqhe, -1);
+}

data/ext/claqhp.c

@@ -0,0 +1,94 @@
+#include "rb_lapack.h"
+
+extern VOID claqhp_(char* uplo, integer* n, complex* ap, real* s, real* scond, real* amax, char* equed);
+
+
+static VALUE
+rblapack_claqhp(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_ap;
+  complex *ap; 
+  VALUE rblapack_s;
+  real *s; 
+  VALUE rblapack_scond;
+  real scond; 
+  VALUE rblapack_amax;
+  real amax; 
+  VALUE rblapack_equed;
+  char equed; 
+  VALUE rblapack_ap_out__;
+  complex *ap_out__;
+
+  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  equed, ap = NumRu::Lapack.claqhp( uplo, ap, s, scond, amax, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAQHP( UPLO, N, AP, S, SCOND, AMAX, EQUED )\n\n*  Purpose\n*  =======\n*\n*  CLAQHP equilibrates a Hermitian matrix A using the scaling factors\n*  in the vector S.\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          Specifies whether the upper or lower triangular part of the\n*          Hermitian matrix A is stored.\n*          = 'U':  Upper triangular\n*          = 'L':  Lower triangular\n*\n*  N       (input) INTEGER\n*          The order of the matrix A.  N >= 0.\n*\n*  AP      (input/output) COMPLEX array, dimension (N*(N+1)/2)\n*          On entry, the upper or lower triangle of the Hermitian matrix\n*          A, packed columnwise in a linear array.  The j-th column of A\n*          is stored in the array AP as follows:\n*          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;\n*          if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.\n*\n*          On exit, the equilibrated matrix:  diag(S) * A * diag(S), in\n*          the same storage format as A.\n*\n*  S       (input) REAL array, dimension (N)\n*          The scale factors for A.\n*\n*  SCOND   (input) REAL\n*          Ratio of the smallest S(i) to the largest S(i).\n*\n*  AMAX    (input) REAL\n*          Absolute value of largest matrix entry.\n*\n*  EQUED   (output) CHARACTER*1\n*          Specifies whether or not equilibration was done.\n*          = 'N':  No equilibration.\n*          = 'Y':  Equilibration was done, i.e., A has been replaced by\n*                  diag(S) * A * diag(S).\n*\n*  Internal Parameters\n*  ===================\n*\n*  THRESH is a threshold value used to decide if scaling should be done\n*  based on the ratio of the scaling factors.  If SCOND < THRESH,\n*  scaling is done.\n*\n*  LARGE and SMALL are threshold values used to decide if scaling should\n*  be done based on the absolute size of the largest matrix element.\n*  If AMAX > LARGE or AMAX < SMALL, scaling is done.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  equed, ap = NumRu::Lapack.claqhp( uplo, ap, s, scond, amax, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 5 && argc != 5)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 5)", argc);
+  rblapack_uplo = argv[0];
+  rblapack_ap = argv[1];
+  rblapack_s = argv[2];
+  rblapack_scond = argv[3];
+  rblapack_amax = argv[4];
+  if (argc == 5) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_s))
+    rb_raise(rb_eArgError, "s (3th argument) must be NArray");
+  if (NA_RANK(rblapack_s) != 1)
+    rb_raise(rb_eArgError, "rank of s (3th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_s);
+  if (NA_TYPE(rblapack_s) != NA_SFLOAT)
+    rblapack_s = na_change_type(rblapack_s, NA_SFLOAT);
+  s = NA_PTR_TYPE(rblapack_s, real*);
+  amax = (real)NUM2DBL(rblapack_amax);
+  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);
+  if (NA_SHAPE0(rblapack_ap) != (n*(n+1)/2))
+    rb_raise(rb_eRuntimeError, "shape 0 of ap must be %d", n*(n+1)/2);
+  if (NA_TYPE(rblapack_ap) != NA_SCOMPLEX)
+    rblapack_ap = na_change_type(rblapack_ap, NA_SCOMPLEX);
+  ap = NA_PTR_TYPE(rblapack_ap, complex*);
+  scond = (real)NUM2DBL(rblapack_scond);
+  {
+    na_shape_t shape[1];
+    shape[0] = n*(n+1)/2;
+    rblapack_ap_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  ap_out__ = NA_PTR_TYPE(rblapack_ap_out__, complex*);
+  MEMCPY(ap_out__, ap, complex, NA_TOTAL(rblapack_ap));
+  rblapack_ap = rblapack_ap_out__;
+  ap = ap_out__;
+
+  claqhp_(&uplo, &n, ap, s, &scond, &amax, &equed);
+
+  rblapack_equed = rb_str_new(&equed,1);
+  return rb_ary_new3(2, rblapack_equed, rblapack_ap);
+}
+
+void
+init_lapack_claqhp(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claqhp", rblapack_claqhp, -1);
+}

data/ext/claqp2.c

@@ -0,0 +1,158 @@
+#include "rb_lapack.h"
+
+extern VOID claqp2_(integer* m, integer* n, integer* offset, complex* a, integer* lda, integer* jpvt, complex* tau, real* vn1, real* vn2, complex* work);
+
+
+static VALUE
+rblapack_claqp2(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_offset;
+  integer offset; 
+  VALUE rblapack_a;
+  complex *a; 
+  VALUE rblapack_jpvt;
+  integer *jpvt; 
+  VALUE rblapack_vn1;
+  real *vn1; 
+  VALUE rblapack_vn2;
+  real *vn2; 
+  VALUE rblapack_tau;
+  complex *tau; 
+  VALUE rblapack_a_out__;
+  complex *a_out__;
+  VALUE rblapack_jpvt_out__;
+  integer *jpvt_out__;
+  VALUE rblapack_vn1_out__;
+  real *vn1_out__;
+  VALUE rblapack_vn2_out__;
+  real *vn2_out__;
+  complex *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.claqp2( m, offset, a, jpvt, vn1, vn2, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, WORK )\n\n*  Purpose\n*  =======\n*\n*  CLAQP2 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) COMPLEX 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) COMPLEX array, dimension (min(M,N))\n*          The scalar factors of the elementary reflectors.\n*\n*  VN1     (input/output) REAL array, dimension (N)\n*          The vector with the partial column norms.\n*\n*  VN2     (input/output) REAL array, dimension (N)\n*          The vector with the exact column norms.\n*\n*  WORK    (workspace) COMPLEX 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.claqp2( 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_SCOMPLEX)
+    rblapack_a = na_change_type(rblapack_a, NA_SCOMPLEX);
+  a = NA_PTR_TYPE(rblapack_a, complex*);
+  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_SFLOAT)
+    rblapack_vn1 = na_change_type(rblapack_vn1, NA_SFLOAT);
+  vn1 = NA_PTR_TYPE(rblapack_vn1, real*);
+  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_SFLOAT)
+    rblapack_vn2 = na_change_type(rblapack_vn2, NA_SFLOAT);
+  vn2 = NA_PTR_TYPE(rblapack_vn2, real*);
+  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_SCOMPLEX, 1, shape, cNArray);
+  }
+  tau = NA_PTR_TYPE(rblapack_tau, complex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, complex*);
+  MEMCPY(a_out__, a, complex, 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_SFLOAT, 1, shape, cNArray);
+  }
+  vn1_out__ = NA_PTR_TYPE(rblapack_vn1_out__, real*);
+  MEMCPY(vn1_out__, vn1, real, 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_SFLOAT, 1, shape, cNArray);
+  }
+  vn2_out__ = NA_PTR_TYPE(rblapack_vn2_out__, real*);
+  MEMCPY(vn2_out__, vn2, real, NA_TOTAL(rblapack_vn2));
+  rblapack_vn2 = rblapack_vn2_out__;
+  vn2 = vn2_out__;
+  work = ALLOC_N(complex, (n));
+
+  claqp2_(&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_claqp2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claqp2", rblapack_claqp2, -1);
+}

data/ext/claqps.c

@@ -0,0 +1,208 @@
+#include "rb_lapack.h"
+
+extern VOID claqps_(integer* m, integer* n, integer* offset, integer* nb, integer* kb, complex* a, integer* lda, integer* jpvt, complex* tau, real* vn1, real* vn2, complex* auxv, complex* f, integer* ldf);
+
+
+static VALUE
+rblapack_claqps(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_offset;
+  integer offset; 
+  VALUE rblapack_a;
+  complex *a; 
+  VALUE rblapack_jpvt;
+  integer *jpvt; 
+  VALUE rblapack_vn1;
+  real *vn1; 
+  VALUE rblapack_vn2;
+  real *vn2; 
+  VALUE rblapack_auxv;
+  complex *auxv; 
+  VALUE rblapack_f;
+  complex *f; 
+  VALUE rblapack_kb;
+  integer kb; 
+  VALUE rblapack_tau;
+  complex *tau; 
+  VALUE rblapack_a_out__;
+  complex *a_out__;
+  VALUE rblapack_jpvt_out__;
+  integer *jpvt_out__;
+  VALUE rblapack_vn1_out__;
+  real *vn1_out__;
+  VALUE rblapack_vn2_out__;
+  real *vn2_out__;
+  VALUE rblapack_auxv_out__;
+  complex *auxv_out__;
+  VALUE rblapack_f_out__;
+  complex *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.claqps( m, offset, a, jpvt, vn1, vn2, auxv, f, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, VN2, AUXV, F, LDF )\n\n*  Purpose\n*  =======\n*\n*  CLAQPS computes a step of QR factorization with column pivoting\n*  of a complex 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) COMPLEX 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) COMPLEX array, dimension (KB)\n*          The scalar factors of the elementary reflectors.\n*\n*  VN1     (input/output) REAL array, dimension (N)\n*          The vector with the partial column norms.\n*\n*  VN2     (input/output) REAL array, dimension (N)\n*          The vector with the exact column norms.\n*\n*  AUXV    (input/output) COMPLEX array, dimension (NB)\n*          Auxiliar vector.\n*\n*  F       (input/output) COMPLEX 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.claqps( 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_SCOMPLEX)
+    rblapack_a = na_change_type(rblapack_a, NA_SCOMPLEX);
+  a = NA_PTR_TYPE(rblapack_a, complex*);
+  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_SFLOAT)
+    rblapack_vn1 = na_change_type(rblapack_vn1, NA_SFLOAT);
+  vn1 = NA_PTR_TYPE(rblapack_vn1, real*);
+  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_SCOMPLEX)
+    rblapack_auxv = na_change_type(rblapack_auxv, NA_SCOMPLEX);
+  auxv = NA_PTR_TYPE(rblapack_auxv, complex*);
+  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_SFLOAT)
+    rblapack_vn2 = na_change_type(rblapack_vn2, NA_SFLOAT);
+  vn2 = NA_PTR_TYPE(rblapack_vn2, real*);
+  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_SCOMPLEX)
+    rblapack_f = na_change_type(rblapack_f, NA_SCOMPLEX);
+  f = NA_PTR_TYPE(rblapack_f, complex*);
+  kb = nb;
+  {
+    na_shape_t shape[1];
+    shape[0] = kb;
+    rblapack_tau = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  tau = NA_PTR_TYPE(rblapack_tau, complex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, complex*);
+  MEMCPY(a_out__, a, complex, 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_SFLOAT, 1, shape, cNArray);
+  }
+  vn1_out__ = NA_PTR_TYPE(rblapack_vn1_out__, real*);
+  MEMCPY(vn1_out__, vn1, real, 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_SFLOAT, 1, shape, cNArray);
+  }
+  vn2_out__ = NA_PTR_TYPE(rblapack_vn2_out__, real*);
+  MEMCPY(vn2_out__, vn2, real, 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_SCOMPLEX, 1, shape, cNArray);
+  }
+  auxv_out__ = NA_PTR_TYPE(rblapack_auxv_out__, complex*);
+  MEMCPY(auxv_out__, auxv, complex, 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_SCOMPLEX, 2, shape, cNArray);
+  }
+  f_out__ = NA_PTR_TYPE(rblapack_f_out__, complex*);
+  MEMCPY(f_out__, f, complex, NA_TOTAL(rblapack_f));
+  rblapack_f = rblapack_f_out__;
+  f = f_out__;
+
+  claqps_(&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_claqps(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "claqps", rblapack_claqps, -1);
+}