ruby-lapack 1.7 → 1.7.1

data/ext/strttp.c

@@ -0,0 +1,73 @@
+#include "rb_lapack.h"
+
+extern VOID strttp_(char* uplo, integer* n, real* a, integer* lda, real* ap, integer* info);
+
+
+static VALUE
+rblapack_strttp(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_a;
+  real *a; 
+  VALUE rblapack_ap;
+  real *ap; 
+  VALUE rblapack_info;
+  integer info; 
+
+  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  ap, info = NumRu::Lapack.strttp( uplo, a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE STRTTP( UPLO, N, A, LDA, AP, INFO )\n\n*  Purpose\n*  =======\n*\n*  STRTTP copies a triangular matrix A from full format (TR) to standard\n*  packed format (TP).\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          = 'U':  A is upper triangular.\n*          = 'L':  A is lower triangular.\n*\n*  N       (input) INTEGER\n*          The order of the matrices AP and A.  N >= 0.\n*\n*  A       (input) REAL array, dimension (LDA,N)\n*          On exit, the triangular 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*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(1,N).\n*\n*  AP      (output) REAL array, dimension (N*(N+1)/2\n*          On exit, the upper or lower triangular matrix A, packed\n*          columnwise in a linear array. The j-th column of A is stored\n*          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*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*          < 0:  if INFO = -i, the i-th argument had an illegal value\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  ap, info = NumRu::Lapack.strttp( uplo, a, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 2 && argc != 2)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 2)", argc);
+  rblapack_uplo = argv[0];
+  rblapack_a = argv[1];
+  if (argc == 2) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  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);
+  n = NA_SHAPE1(rblapack_a);
+  if (NA_TYPE(rblapack_a) != NA_SFLOAT)
+    rblapack_a = na_change_type(rblapack_a, NA_SFLOAT);
+  a = NA_PTR_TYPE(rblapack_a, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n*(n+1)/2;
+    rblapack_ap = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  ap = NA_PTR_TYPE(rblapack_ap, real*);
+
+  strttp_(&uplo, &n, a, &lda, ap, &info);
+
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(2, rblapack_ap, rblapack_info);
+}
+
+void
+init_lapack_strttp(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "strttp", rblapack_strttp, -1);
+}

data/ext/stzrqf.c

@@ -0,0 +1,83 @@
+#include "rb_lapack.h"
+
+extern VOID stzrqf_(integer* m, integer* n, real* a, integer* lda, real* tau, integer* info);
+
+
+static VALUE
+rblapack_stzrqf(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_a;
+  real *a; 
+  VALUE rblapack_tau;
+  real *tau; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_a_out__;
+  real *a_out__;
+
+  integer lda;
+  integer n;
+  integer m;
+
+  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, info, a = NumRu::Lapack.stzrqf( a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE STZRQF( M, N, A, LDA, TAU, INFO )\n\n*  Purpose\n*  =======\n*\n*  This routine is deprecated and has been replaced by routine STZRZF.\n*\n*  STZRQF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A\n*  to upper triangular form by means of orthogonal transformations.\n*\n*  The upper trapezoidal matrix A is factored as\n*\n*     A = ( R  0 ) * Z,\n*\n*  where Z is an N-by-N orthogonal matrix and R is an M-by-M upper\n*  triangular matrix.\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 >= M.\n*\n*  A       (input/output) REAL array, dimension (LDA,N)\n*          On entry, the leading M-by-N upper trapezoidal part of the\n*          array A must contain the matrix to be factorized.\n*          On exit, the leading M-by-M upper triangular part of A\n*          contains the upper triangular matrix R, and elements M+1 to\n*          N of the first M rows of A, with the array TAU, represent the\n*          orthogonal matrix Z as a product of M elementary reflectors.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(1,M).\n*\n*  TAU     (output) REAL array, dimension (M)\n*          The scalar factors of the elementary reflectors.\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*          < 0:  if INFO = -i, the i-th argument had an illegal value\n*\n\n*  Further Details\n*  ===============\n*\n*  The factorization is obtained by Householder's method.  The kth\n*  transformation matrix, Z( k ), which is used to introduce zeros into\n*  the ( m - k + 1 )th row of A, is given in the form\n*\n*     Z( k ) = ( I     0   ),\n*              ( 0  T( k ) )\n*\n*  where\n*\n*     T( k ) = I - tau*u( k )*u( k )',   u( k ) = (   1    ),\n*                                                 (   0    )\n*                                                 ( z( k ) )\n*\n*  tau is a scalar and z( k ) is an ( n - m ) element vector.\n*  tau and z( k ) are chosen to annihilate the elements of the kth row\n*  of X.\n*\n*  The scalar tau is returned in the kth element of TAU and the vector\n*  u( k ) in the kth row of A, such that the elements of z( k ) are\n*  in  a( k, m + 1 ), ..., a( k, n ). The elements of R are returned in\n*  the upper triangular part of A.\n*\n*  Z is given by\n*\n*     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  tau, info, a = NumRu::Lapack.stzrqf( a, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 1 && argc != 1)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 1)", argc);
+  rblapack_a = argv[0];
+  if (argc == 1) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  if (!NA_IsNArray(rblapack_a))
+    rb_raise(rb_eArgError, "a (1th argument) must be NArray");
+  if (NA_RANK(rblapack_a) != 2)
+    rb_raise(rb_eArgError, "rank of a (1th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_a);
+  n = NA_SHAPE1(rblapack_a);
+  if (NA_TYPE(rblapack_a) != NA_SFLOAT)
+    rblapack_a = na_change_type(rblapack_a, NA_SFLOAT);
+  a = NA_PTR_TYPE(rblapack_a, real*);
+  m = lda;
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_tau = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  tau = NA_PTR_TYPE(rblapack_tau, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, real*);
+  MEMCPY(a_out__, a, real, NA_TOTAL(rblapack_a));
+  rblapack_a = rblapack_a_out__;
+  a = a_out__;
+
+  stzrqf_(&m, &n, a, &lda, tau, &info);
+
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(3, rblapack_tau, rblapack_info, rblapack_a);
+}
+
+void
+init_lapack_stzrqf(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "stzrqf", rblapack_stzrqf, -1);
+}

data/ext/stzrzf.c

@@ -0,0 +1,101 @@
+#include "rb_lapack.h"
+
+extern VOID stzrzf_(integer* m, integer* n, real* a, integer* lda, real* tau, real* work, integer* lwork, integer* info);
+
+
+static VALUE
+rblapack_stzrzf(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_a;
+  real *a; 
+  VALUE rblapack_lwork;
+  integer lwork; 
+  VALUE rblapack_tau;
+  real *tau; 
+  VALUE rblapack_work;
+  real *work; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_a_out__;
+  real *a_out__;
+
+  integer lda;
+  integer n;
+  integer m;
+
+  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, work, info, a = NumRu::Lapack.stzrzf( a, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE STZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO )\n\n*  Purpose\n*  =======\n*\n*  STZRZF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A\n*  to upper triangular form by means of orthogonal transformations.\n*\n*  The upper trapezoidal matrix A is factored as\n*\n*     A = ( R  0 ) * Z,\n*\n*  where Z is an N-by-N orthogonal matrix and R is an M-by-M upper\n*  triangular matrix.\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 >= M.\n*\n*  A       (input/output) REAL array, dimension (LDA,N)\n*          On entry, the leading M-by-N upper trapezoidal part of the\n*          array A must contain the matrix to be factorized.\n*          On exit, the leading M-by-M upper triangular part of A\n*          contains the upper triangular matrix R, and elements M+1 to\n*          N of the first M rows of A, with the array TAU, represent the\n*          orthogonal matrix Z as a product of M elementary reflectors.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(1,M).\n*\n*  TAU     (output) REAL array, dimension (M)\n*          The scalar factors of the elementary reflectors.\n*\n*  WORK    (workspace/output) REAL array, dimension (MAX(1,LWORK))\n*          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n*\n*  LWORK   (input) INTEGER\n*          The dimension of the array WORK.  LWORK >= max(1,M).\n*          For optimum performance LWORK >= M*NB, where NB is\n*          the optimal blocksize.\n*\n*          If LWORK = -1, then a workspace query is assumed; the routine\n*          only calculates the optimal size of the WORK array, returns\n*          this value as the first entry of the WORK array, and no error\n*          message related to LWORK is issued by XERBLA.\n*\n*  INFO    (output) INTEGER\n*          = 0:  successful exit\n*          < 0:  if INFO = -i, the i-th argument had an illegal value\n*\n\n*  Further Details\n*  ===============\n*\n*  Based on contributions by\n*    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA\n*\n*  The factorization is obtained by Householder's method.  The kth\n*  transformation matrix, Z( k ), which is used to introduce zeros into\n*  the ( m - k + 1 )th row of A, is given in the form\n*\n*     Z( k ) = ( I     0   ),\n*              ( 0  T( k ) )\n*\n*  where\n*\n*     T( k ) = I - tau*u( k )*u( k )',   u( k ) = (   1    ),\n*                                                 (   0    )\n*                                                 ( z( k ) )\n*\n*  tau is a scalar and z( k ) is an ( n - m ) element vector.\n*  tau and z( k ) are chosen to annihilate the elements of the kth row\n*  of X.\n*\n*  The scalar tau is returned in the kth element of TAU and the vector\n*  u( k ) in the kth row of A, such that the elements of z( k ) are\n*  in  a( k, m + 1 ), ..., a( k, n ). The elements of R are returned in\n*  the upper triangular part of A.\n*\n*  Z is given by\n*\n*     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).\n*\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  tau, work, info, a = NumRu::Lapack.stzrzf( a, [:lwork => lwork, :usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 1 && argc != 2)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 1)", argc);
+  rblapack_a = argv[0];
+  if (argc == 2) {
+    rblapack_lwork = argv[1];
+  } else if (rblapack_options != Qnil) {
+    rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
+  } else {
+    rblapack_lwork = Qnil;
+  }
+
+  if (!NA_IsNArray(rblapack_a))
+    rb_raise(rb_eArgError, "a (1th argument) must be NArray");
+  if (NA_RANK(rblapack_a) != 2)
+    rb_raise(rb_eArgError, "rank of a (1th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_a);
+  n = NA_SHAPE1(rblapack_a);
+  if (NA_TYPE(rblapack_a) != NA_SFLOAT)
+    rblapack_a = na_change_type(rblapack_a, NA_SFLOAT);
+  a = NA_PTR_TYPE(rblapack_a, real*);
+  m = lda;
+  if (rblapack_lwork == Qnil)
+    lwork = m;
+  else {
+    lwork = NUM2INT(rblapack_lwork);
+  }
+  {
+    na_shape_t shape[1];
+    shape[0] = m;
+    rblapack_tau = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  tau = NA_PTR_TYPE(rblapack_tau, real*);
+  {
+    na_shape_t shape[1];
+    shape[0] = MAX(1,lwork);
+    rblapack_work = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  work = NA_PTR_TYPE(rblapack_work, real*);
+  {
+    na_shape_t shape[2];
+    shape[0] = lda;
+    shape[1] = n;
+    rblapack_a_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  a_out__ = NA_PTR_TYPE(rblapack_a_out__, real*);
+  MEMCPY(a_out__, a, real, NA_TOTAL(rblapack_a));
+  rblapack_a = rblapack_a_out__;
+  a = a_out__;
+
+  stzrzf_(&m, &n, a, &lda, tau, work, &lwork, &info);
+
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(4, rblapack_tau, rblapack_work, rblapack_info, rblapack_a);
+}
+
+void
+init_lapack_stzrzf(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "stzrzf", rblapack_stzrzf, -1);
+}

data/ext/xerbla.c

@@ -0,0 +1,52 @@
+#include "rb_lapack.h"
+
+extern VOID xerbla_(char* srname, integer* info);
+
+
+static VALUE
+rblapack_xerbla(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_srname;
+  char *srname; 
+  VALUE rblapack_info;
+  integer info; 
+
+
+  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   = NumRu::Lapack.xerbla( srname, info, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE XERBLA( SRNAME, INFO )\n\n*  Purpose\n*  =======\n*\n*  XERBLA  is an error handler for the LAPACK routines.\n*  It is called by an LAPACK routine if an input parameter has an\n*  invalid value.  A message is printed and execution stops.\n*\n*  Installers may consider modifying the STOP statement in order to\n*  call system-specific exception-handling facilities.\n*\n\n*  Arguments\n*  =========\n*\n*  SRNAME  (input) CHARACTER*(*)\n*          The name of the routine which called XERBLA.\n*\n*  INFO    (input) INTEGER\n*          The position of the invalid parameter in the parameter list\n*          of the calling routine.\n*\n\n* =====================================================================\n*\n*     .. Intrinsic Functions ..\n      INTRINSIC          LEN_TRIM\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n   = NumRu::Lapack.xerbla( srname, info, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 2 && argc != 2)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 2)", argc);
+  rblapack_srname = argv[0];
+  rblapack_info = argv[1];
+  if (argc == 2) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  srname = StringValueCStr(rblapack_srname);
+  info = NUM2INT(rblapack_info);
+
+  xerbla_(srname, &info);
+
+  return Qnil;
+}
+
+void
+init_lapack_xerbla(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "xerbla", rblapack_xerbla, -1);
+}

data/ext/xerbla_array.c

@@ -0,0 +1,53 @@
+#include "rb_lapack.h"
+
+extern VOID xerbla_array_(char* srname_array, integer* srname_len, integer* info);
+
+
+static VALUE
+rblapack_xerbla_array(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_srname_array;
+  char *srname_array; 
+  VALUE rblapack_info;
+  integer info; 
+
+  integer srname_len;
+
+  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   = NumRu::Lapack.xerbla_array( srname_array, info, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE XERBLA_ARRAY( SRNAME_ARRAY, SRNAME_LEN, INFO)\n\n*  Purpose\n*  =======\n*\n*  XERBLA_ARRAY assists other languages in calling XERBLA, the LAPACK\n*  and BLAS error handler.  Rather than taking a Fortran string argument\n*  as the function's name, XERBLA_ARRAY takes an array of single\n*  characters along with the array's length.  XERBLA_ARRAY then copies\n*  up to 32 characters of that array into a Fortran string and passes\n*  that to XERBLA.  If called with a non-positive SRNAME_LEN,\n*  XERBLA_ARRAY will call XERBLA with a string of all blank characters.\n*\n*  Say some macro or other device makes XERBLA_ARRAY available to C99\n*  by a name lapack_xerbla and with a common Fortran calling convention.\n*  Then a C99 program could invoke XERBLA via:\n*     {\n*       int flen = strlen(__func__);\n*       lapack_xerbla(__func__, &flen, &info);\n*     }\n*\n*  Providing XERBLA_ARRAY is not necessary for intercepting LAPACK\n*  errors.  XERBLA_ARRAY calls XERBLA.\n*\n\n*  Arguments\n*  =========\n*\n*  SRNAME_ARRAY (input) CHARACTER(1) array, dimension (SRNAME_LEN)\n*          The name of the routine which called XERBLA_ARRAY.\n*\n*  SRNAME_LEN (input) INTEGER\n*          The length of the name in SRNAME_ARRAY.\n*\n*  INFO    (input) INTEGER\n*          The position of the invalid parameter in the parameter list\n*          of the calling routine.\n*\n\n* =====================================================================\n*\n*     ..\n*     .. Local Scalars ..\n      INTEGER I\n*     ..\n*     .. Local Arrays ..\n      CHARACTER*32 SRNAME\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC MIN, LEN\n*     ..\n*     .. External Functions ..\n      EXTERNAL XERBLA\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n   = NumRu::Lapack.xerbla_array( srname_array, info, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 2 && argc != 2)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 2)", argc);
+  rblapack_srname_array = argv[0];
+  rblapack_info = argv[1];
+  if (argc == 2) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  srname_array = StringValueCStr(rblapack_srname_array);
+  info = NUM2INT(rblapack_info);
+
+  xerbla_array_(srname_array, &srname_len, &info);
+
+  return Qnil;
+}
+
+void
+init_lapack_xerbla_array(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "xerbla_array", rblapack_xerbla_array, -1);
+}

data/ext/zbbcsd.c

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