ruby-lapack 1.3

data/ext/cla_gbamv.c

@@ -0,0 +1,123 @@
+#include "rb_lapack.h"
+
+extern VOID cla_gbamv_(integer* trans, integer* m, integer* n, integer* kl, integer* ku, real* alpha, real* ab, integer* ldab, real* x, integer* incx, real* beta, real* y, integer* incy);
+
+
+static VALUE
+rblapack_cla_gbamv(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_trans;
+  integer trans; 
+  VALUE rblapack_m;
+  integer m; 
+  VALUE rblapack_kl;
+  integer kl; 
+  VALUE rblapack_ku;
+  integer ku; 
+  VALUE rblapack_alpha;
+  real alpha; 
+  VALUE rblapack_ab;
+  real *ab; 
+  VALUE rblapack_x;
+  real *x; 
+  VALUE rblapack_incx;
+  integer incx; 
+  VALUE rblapack_beta;
+  real beta; 
+  VALUE rblapack_y;
+  real *y; 
+  VALUE rblapack_incy;
+  integer incy; 
+  VALUE rblapack_y_out__;
+  real *y_out__;
+
+  integer ldab;
+  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  y = NumRu::Lapack.cla_gbamv( trans, m, kl, ku, alpha, ab, x, incx, beta, y, incy, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X, INCX, BETA, Y, INCY )\n\n*  Purpose\n*  =======\n*\n*  SLA_GBAMV  performs one of the matrix-vector operations\n*\n*          y := alpha*abs(A)*abs(x) + beta*abs(y),\n*     or   y := alpha*abs(A)'*abs(x) + beta*abs(y),\n*\n*  where alpha and beta are scalars, x and y are vectors and A is an\n*  m by n matrix.\n*\n*  This function is primarily used in calculating error bounds.\n*  To protect against underflow during evaluation, components in\n*  the resulting vector are perturbed away from zero by (N+1)\n*  times the underflow threshold.  To prevent unnecessarily large\n*  errors for block-structure embedded in general matrices,\n*  \"symbolically\" zero components are not perturbed.  A zero\n*  entry is considered \"symbolic\" if all multiplications involved\n*  in computing that entry have at least one zero multiplicand.\n*\n\n*  Arguments\n*  ==========\n*\n*  TRANS   (input) INTEGER\n*           On entry, TRANS specifies the operation to be performed as\n*           follows:\n*\n*             BLAS_NO_TRANS      y := alpha*abs(A)*abs(x) + beta*abs(y)\n*             BLAS_TRANS         y := alpha*abs(A')*abs(x) + beta*abs(y)\n*             BLAS_CONJ_TRANS    y := alpha*abs(A')*abs(x) + beta*abs(y)\n*\n*           Unchanged on exit.\n*\n*  M      (input) INTEGER\n*           On entry, M specifies the number of rows of the matrix A.\n*           M must be at least zero.\n*           Unchanged on exit.\n*\n*  N      (input) INTEGER\n*           On entry, N specifies the number of columns of the matrix A.\n*           N must be at least zero.\n*           Unchanged on exit.\n*\n*  KL     (input) INTEGER\n*           The number of subdiagonals within the band of A.  KL >= 0.\n*\n*  KU     (input) INTEGER\n*           The number of superdiagonals within the band of A.  KU >= 0.\n*\n*  ALPHA  (input) REAL\n*           On entry, ALPHA specifies the scalar alpha.\n*           Unchanged on exit.\n*\n*  A      (input) REAL array, dimension (LDA,n)\n*           Before entry, the leading m by n part of the array A must\n*           contain the matrix of coefficients.\n*           Unchanged on exit.\n*\n*  LDA    (input) INTEGER\n*           On entry, LDA specifies the first dimension of A as declared\n*           in the calling (sub) program. LDA must be at least\n*           max( 1, m ).\n*           Unchanged on exit.\n*\n*  X      (input) REAL array, dimension at least\n*           ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n'\n*           and at least\n*           ( 1 + ( m - 1 )*abs( INCX ) ) otherwise.\n*           Before entry, the incremented array X must contain the\n*           vector x.\n*           Unchanged on exit.\n*\n*  INCX   (input) INTEGER\n*           On entry, INCX specifies the increment for the elements of\n*           X. INCX must not be zero.\n*           Unchanged on exit.\n*\n*  BETA   (input) REAL\n*           On entry, BETA specifies the scalar beta. When BETA is\n*           supplied as zero then Y need not be set on input.\n*           Unchanged on exit.\n*\n*  Y      (input/output) REAL array, dimension at least\n*           ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n'\n*           and at least\n*           ( 1 + ( n - 1 )*abs( INCY ) ) otherwise.\n*           Before entry with BETA non-zero, the incremented array Y\n*           must contain the vector y. On exit, Y is overwritten by the\n*           updated vector y.\n*\n*  INCY   (input) INTEGER\n*           On entry, INCY specifies the increment for the elements of\n*           Y. INCY must not be zero.\n*           Unchanged on exit.\n*\n*\n*  Level 2 Blas routine.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  y = NumRu::Lapack.cla_gbamv( trans, m, kl, ku, alpha, ab, x, incx, beta, y, incy, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 11 && argc != 11)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 11)", argc);
+  rblapack_trans = argv[0];
+  rblapack_m = argv[1];
+  rblapack_kl = argv[2];
+  rblapack_ku = argv[3];
+  rblapack_alpha = argv[4];
+  rblapack_ab = argv[5];
+  rblapack_x = argv[6];
+  rblapack_incx = argv[7];
+  rblapack_beta = argv[8];
+  rblapack_y = argv[9];
+  rblapack_incy = argv[10];
+  if (argc == 11) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  kl = NUM2INT(rblapack_kl);
+  m = NUM2INT(rblapack_m);
+  beta = (real)NUM2DBL(rblapack_beta);
+  ldab = MAX(1,m);
+  alpha = (real)NUM2DBL(rblapack_alpha);
+  trans = NUM2INT(rblapack_trans);
+  if (!NA_IsNArray(rblapack_ab))
+    rb_raise(rb_eArgError, "ab (6th argument) must be NArray");
+  if (NA_RANK(rblapack_ab) != 2)
+    rb_raise(rb_eArgError, "rank of ab (6th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_ab) != ldab)
+    rb_raise(rb_eRuntimeError, "shape 0 of ab must be MAX(1,m)");
+  n = NA_SHAPE1(rblapack_ab);
+  if (NA_TYPE(rblapack_ab) != NA_SFLOAT)
+    rblapack_ab = na_change_type(rblapack_ab, NA_SFLOAT);
+  ab = NA_PTR_TYPE(rblapack_ab, real*);
+  incx = NUM2INT(rblapack_incx);
+  ku = NUM2INT(rblapack_ku);
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (7th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 1)
+    rb_raise(rb_eArgError, "rank of x (7th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_x) != (trans == ilatrans_("N") ? 1 + ( n - 1 )*abs( incx ) : 1 + ( m - 1 )*abs( incx )))
+    rb_raise(rb_eRuntimeError, "shape 0 of x must be %d", trans == ilatrans_("N") ? 1 + ( n - 1 )*abs( incx ) : 1 + ( m - 1 )*abs( incx ));
+  if (NA_TYPE(rblapack_x) != NA_SFLOAT)
+    rblapack_x = na_change_type(rblapack_x, NA_SFLOAT);
+  x = NA_PTR_TYPE(rblapack_x, real*);
+  incy = NUM2INT(rblapack_incy);
+  if (!NA_IsNArray(rblapack_y))
+    rb_raise(rb_eArgError, "y (10th argument) must be NArray");
+  if (NA_RANK(rblapack_y) != 1)
+    rb_raise(rb_eArgError, "rank of y (10th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_y) != (trans == ilatrans_("N") ? 1 + ( m - 1 )*abs( incy ) : 1 + ( n - 1 )*abs( incy )))
+    rb_raise(rb_eRuntimeError, "shape 0 of y must be %d", trans == ilatrans_("N") ? 1 + ( m - 1 )*abs( incy ) : 1 + ( n - 1 )*abs( incy ));
+  if (NA_TYPE(rblapack_y) != NA_SFLOAT)
+    rblapack_y = na_change_type(rblapack_y, NA_SFLOAT);
+  y = NA_PTR_TYPE(rblapack_y, real*);
+  {
+    int shape[1];
+    shape[0] = trans == ilatrans_("N") ? 1 + ( m - 1 )*abs( incy ) : 1 + ( n - 1 )*abs( incy );
+    rblapack_y_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  y_out__ = NA_PTR_TYPE(rblapack_y_out__, real*);
+  MEMCPY(y_out__, y, real, NA_TOTAL(rblapack_y));
+  rblapack_y = rblapack_y_out__;
+  y = y_out__;
+
+  cla_gbamv_(&trans, &m, &n, &kl, &ku, &alpha, ab, &ldab, x, &incx, &beta, y, &incy);
+
+  return rblapack_y;
+}
+
+void
+init_lapack_cla_gbamv(VALUE mLapack){
+  rb_define_module_function(mLapack, "cla_gbamv", rblapack_cla_gbamv, -1);
+}

data/ext/cla_gbrcond_c.c

@@ -0,0 +1,138 @@
+#include "rb_lapack.h"
+
+extern real cla_gbrcond_c_(char* trans, integer* n, integer* kl, integer* ku, complex* ab, integer* ldab, complex* afb, integer* ldafb, integer* ipiv, real* c, logical* capply, integer* info, complex* work, real* rwork);
+
+
+static VALUE
+rblapack_cla_gbrcond_c(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_trans;
+  char trans; 
+  VALUE rblapack_kl;
+  integer kl; 
+  VALUE rblapack_ku;
+  integer ku; 
+  VALUE rblapack_ab;
+  complex *ab; 
+  VALUE rblapack_afb;
+  complex *afb; 
+  VALUE rblapack_ipiv;
+  integer *ipiv; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_capply;
+  logical capply; 
+  VALUE rblapack_work;
+  complex *work; 
+  VALUE rblapack_rwork;
+  real *rwork; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack___out__;
+  real __out__; 
+
+  integer ldab;
+  integer n;
+  integer ldafb;
+
+  VALUE rblapack_options;
+  if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
+    argc--;
+    rblapack_options = argv[argc];
+    if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, __out__ = NumRu::Lapack.cla_gbrcond_c( trans, kl, ku, ab, afb, ipiv, c, capply, work, rwork, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      REAL FUNCTION CLA_GBRCOND_C( TRANS, N, KL, KU, AB, LDAB, AFB, LDAFB, IPIV, C, CAPPLY, INFO, WORK, RWORK )\n\n*  Purpose\n*  =======\n*\n*     CLA_GBRCOND_C Computes the infinity norm condition number of\n*     op(A) * inv(diag(C)) where C is a REAL vector.\n*\n\n*  Arguments\n*  =========\n*\n*     TRANS   (input) CHARACTER*1\n*     Specifies the form of the system of equations:\n*       = 'N':  A * X = B     (No transpose)\n*       = 'T':  A**T * X = B  (Transpose)\n*       = 'C':  A**H * X = B  (Conjugate Transpose = Transpose)\n*\n*     N       (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 0.\n*\n*     KL      (input) INTEGER\n*     The number of subdiagonals within the band of A.  KL >= 0.\n*\n*     KU      (input) INTEGER\n*     The number of superdiagonals within the band of A.  KU >= 0.\n*\n*     AB      (input) COMPLEX array, dimension (LDAB,N)\n*     On entry, the matrix A in band storage, in rows 1 to KL+KU+1.\n*     The j-th column of A is stored in the j-th column of the\n*     array AB as follows:\n*     AB(KU+1+i-j,j) = A(i,j) for max(1,j-KU)<=i<=min(N,j+kl)\n*\n*     LDAB    (input) INTEGER\n*     The leading dimension of the array AB.  LDAB >= KL+KU+1.\n*\n*     AFB     (input) COMPLEX array, dimension (LDAFB,N)\n*     Details of the LU factorization of the band matrix A, as\n*     computed by CGBTRF.  U is stored as an upper triangular\n*     band matrix with KL+KU superdiagonals in rows 1 to KL+KU+1,\n*     and the multipliers used during the factorization are stored\n*     in rows KL+KU+2 to 2*KL+KU+1.\n*\n*     LDAFB   (input) INTEGER\n*     The leading dimension of the array AFB.  LDAFB >= 2*KL+KU+1.\n*\n*     IPIV    (input) INTEGER array, dimension (N)\n*     The pivot indices from the factorization A = P*L*U\n*     as computed by CGBTRF; row i of the matrix was interchanged\n*     with row IPIV(i).\n*\n*     C       (input) REAL array, dimension (N)\n*     The vector C in the formula op(A) * inv(diag(C)).\n*\n*     CAPPLY  (input) LOGICAL\n*     If .TRUE. then access the vector C in the formula above.\n*\n*     INFO    (output) INTEGER\n*       = 0:  Successful exit.\n*     i > 0:  The ith argument is invalid.\n*\n*     WORK    (input) COMPLEX array, dimension (2*N).\n*     Workspace.\n*\n*     RWORK   (input) REAL array, dimension (N).\n*     Workspace.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      LOGICAL            NOTRANS\n      INTEGER            KASE, I, J\n      REAL               AINVNM, ANORM, TMP\n      COMPLEX            ZDUM\n*     ..\n*     .. Local Arrays ..\n      INTEGER            ISAVE( 3 )\n*     ..\n*     .. External Functions ..\n      LOGICAL            LSAME\n      EXTERNAL           LSAME\n*     ..\n*     .. External Subroutines ..\n      EXTERNAL           CLACN2, CGBTRS, XERBLA\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          ABS, MAX\n*     ..\n*     .. Statement Functions ..\n      REAL               CABS1\n*     ..\n*     .. Statement Function Definitions ..\n      CABS1( ZDUM ) = ABS( REAL( ZDUM ) ) + ABS( AIMAG( ZDUM ) )\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, __out__ = NumRu::Lapack.cla_gbrcond_c( trans, kl, ku, ab, afb, ipiv, c, capply, work, rwork, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 10 && argc != 10)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 10)", argc);
+  rblapack_trans = argv[0];
+  rblapack_kl = argv[1];
+  rblapack_ku = argv[2];
+  rblapack_ab = argv[3];
+  rblapack_afb = argv[4];
+  rblapack_ipiv = argv[5];
+  rblapack_c = argv[6];
+  rblapack_capply = argv[7];
+  rblapack_work = argv[8];
+  rblapack_rwork = argv[9];
+  if (argc == 10) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  if (!NA_IsNArray(rblapack_ipiv))
+    rb_raise(rb_eArgError, "ipiv (6th argument) must be NArray");
+  if (NA_RANK(rblapack_ipiv) != 1)
+    rb_raise(rb_eArgError, "rank of ipiv (6th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_ipiv);
+  if (NA_TYPE(rblapack_ipiv) != NA_LINT)
+    rblapack_ipiv = na_change_type(rblapack_ipiv, NA_LINT);
+  ipiv = NA_PTR_TYPE(rblapack_ipiv, integer*);
+  kl = NUM2INT(rblapack_kl);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (7th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (7th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_c) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of c must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_c) != NA_SFLOAT)
+    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  if (!NA_IsNArray(rblapack_afb))
+    rb_raise(rb_eArgError, "afb (5th argument) must be NArray");
+  if (NA_RANK(rblapack_afb) != 2)
+    rb_raise(rb_eArgError, "rank of afb (5th argument) must be %d", 2);
+  ldafb = NA_SHAPE0(rblapack_afb);
+  if (NA_SHAPE1(rblapack_afb) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of afb must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_afb) != NA_SCOMPLEX)
+    rblapack_afb = na_change_type(rblapack_afb, NA_SCOMPLEX);
+  afb = NA_PTR_TYPE(rblapack_afb, complex*);
+  ku = NUM2INT(rblapack_ku);
+  if (!NA_IsNArray(rblapack_ab))
+    rb_raise(rb_eArgError, "ab (4th argument) must be NArray");
+  if (NA_RANK(rblapack_ab) != 2)
+    rb_raise(rb_eArgError, "rank of ab (4th argument) must be %d", 2);
+  ldab = NA_SHAPE0(rblapack_ab);
+  if (NA_SHAPE1(rblapack_ab) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of ab must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_ab) != NA_SCOMPLEX)
+    rblapack_ab = na_change_type(rblapack_ab, NA_SCOMPLEX);
+  ab = NA_PTR_TYPE(rblapack_ab, complex*);
+  capply = (rblapack_capply == Qtrue);
+  trans = StringValueCStr(rblapack_trans)[0];
+  if (!NA_IsNArray(rblapack_rwork))
+    rb_raise(rb_eArgError, "rwork (10th argument) must be NArray");
+  if (NA_RANK(rblapack_rwork) != 1)
+    rb_raise(rb_eArgError, "rank of rwork (10th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_rwork) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of rwork must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_rwork) != NA_SFLOAT)
+    rblapack_rwork = na_change_type(rblapack_rwork, NA_SFLOAT);
+  rwork = NA_PTR_TYPE(rblapack_rwork, real*);
+  if (!NA_IsNArray(rblapack_work))
+    rb_raise(rb_eArgError, "work (9th argument) must be NArray");
+  if (NA_RANK(rblapack_work) != 1)
+    rb_raise(rb_eArgError, "rank of work (9th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_work) != (2*n))
+    rb_raise(rb_eRuntimeError, "shape 0 of work must be %d", 2*n);
+  if (NA_TYPE(rblapack_work) != NA_SCOMPLEX)
+    rblapack_work = na_change_type(rblapack_work, NA_SCOMPLEX);
+  work = NA_PTR_TYPE(rblapack_work, complex*);
+
+  __out__ = cla_gbrcond_c_(&trans, &n, &kl, &ku, ab, &ldab, afb, &ldafb, ipiv, c, &capply, &info, work, rwork);
+
+  rblapack_info = INT2NUM(info);
+  rblapack___out__ = rb_float_new((double)__out__);
+  return rb_ary_new3(2, rblapack_info, rblapack___out__);
+}
+
+void
+init_lapack_cla_gbrcond_c(VALUE mLapack){
+  rb_define_module_function(mLapack, "cla_gbrcond_c", rblapack_cla_gbrcond_c, -1);
+}

data/ext/cla_gbrcond_x.c

@@ -0,0 +1,134 @@
+#include "rb_lapack.h"
+
+extern real cla_gbrcond_x_(char* trans, integer* n, integer* kl, integer* ku, complex* ab, integer* ldab, complex* afb, integer* ldafb, integer* ipiv, complex* x, integer* info, complex* work, real* rwork);
+
+
+static VALUE
+rblapack_cla_gbrcond_x(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_trans;
+  char trans; 
+  VALUE rblapack_kl;
+  integer kl; 
+  VALUE rblapack_ku;
+  integer ku; 
+  VALUE rblapack_ab;
+  complex *ab; 
+  VALUE rblapack_afb;
+  complex *afb; 
+  VALUE rblapack_ipiv;
+  integer *ipiv; 
+  VALUE rblapack_x;
+  complex *x; 
+  VALUE rblapack_work;
+  complex *work; 
+  VALUE rblapack_rwork;
+  real *rwork; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack___out__;
+  real __out__; 
+
+  integer ldab;
+  integer n;
+  integer ldafb;
+
+  VALUE rblapack_options;
+  if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
+    argc--;
+    rblapack_options = argv[argc];
+    if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, __out__ = NumRu::Lapack.cla_gbrcond_x( trans, kl, ku, ab, afb, ipiv, x, work, rwork, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      REAL FUNCTION CLA_GBRCOND_X( TRANS, N, KL, KU, AB, LDAB, AFB, LDAFB, IPIV, X, INFO, WORK, RWORK )\n\n*  Purpose\n*  =======\n*\n*     CLA_GBRCOND_X Computes the infinity norm condition number of\n*     op(A) * diag(X) where X is a COMPLEX vector.\n*\n\n*  Arguments\n*  =========\n*\n*     TRANS   (input) CHARACTER*1\n*     Specifies the form of the system of equations:\n*       = 'N':  A * X = B     (No transpose)\n*       = 'T':  A**T * X = B  (Transpose)\n*       = 'C':  A**H * X = B  (Conjugate Transpose = Transpose)\n*\n*     N       (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 0.\n*\n*     KL      (input) INTEGER\n*     The number of subdiagonals within the band of A.  KL >= 0.\n*\n*     KU      (input) INTEGER\n*     The number of superdiagonals within the band of A.  KU >= 0.\n*\n*     AB      (input) COMPLEX array, dimension (LDAB,N)\n*     On entry, the matrix A in band storage, in rows 1 to KL+KU+1.\n*     The j-th column of A is stored in the j-th column of the\n*     array AB as follows:\n*     AB(KU+1+i-j,j) = A(i,j) for max(1,j-KU)<=i<=min(N,j+kl)\n*\n*     LDAB    (input) INTEGER\n*     The leading dimension of the array AB.  LDAB >= KL+KU+1.\n*\n*     AFB     (input) COMPLEX array, dimension (LDAFB,N)\n*     Details of the LU factorization of the band matrix A, as\n*     computed by CGBTRF.  U is stored as an upper triangular\n*     band matrix with KL+KU superdiagonals in rows 1 to KL+KU+1,\n*     and the multipliers used during the factorization are stored\n*     in rows KL+KU+2 to 2*KL+KU+1.\n*\n*     LDAFB   (input) INTEGER\n*     The leading dimension of the array AFB.  LDAFB >= 2*KL+KU+1.\n*\n*     IPIV    (input) INTEGER array, dimension (N)\n*     The pivot indices from the factorization A = P*L*U\n*     as computed by CGBTRF; row i of the matrix was interchanged\n*     with row IPIV(i).\n*\n*     X       (input) COMPLEX array, dimension (N)\n*     The vector X in the formula op(A) * diag(X).\n*\n*     INFO    (output) INTEGER\n*       = 0:  Successful exit.\n*     i > 0:  The ith argument is invalid.\n*\n*     WORK    (input) COMPLEX array, dimension (2*N).\n*     Workspace.\n*\n*     RWORK   (input) REAL array, dimension (N).\n*     Workspace.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      LOGICAL            NOTRANS\n      INTEGER            KASE, I, J\n      REAL               AINVNM, ANORM, TMP\n      COMPLEX            ZDUM\n*     ..\n*     .. Local Arrays ..\n      INTEGER            ISAVE( 3 )\n*     ..\n*     .. External Functions ..\n      LOGICAL            LSAME\n      EXTERNAL           LSAME\n*     ..\n*     .. External Subroutines ..\n      EXTERNAL           CLACN2, CGBTRS, XERBLA\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          ABS, MAX\n*     ..\n*     .. Statement Functions ..\n      REAL               CABS1\n*     ..\n*     .. Statement Function Definitions ..\n      CABS1( ZDUM ) = ABS( REAL( ZDUM ) ) + ABS( AIMAG( ZDUM ) )\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  info, __out__ = NumRu::Lapack.cla_gbrcond_x( trans, kl, ku, ab, afb, ipiv, x, work, rwork, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 9 && argc != 9)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 9)", argc);
+  rblapack_trans = argv[0];
+  rblapack_kl = argv[1];
+  rblapack_ku = argv[2];
+  rblapack_ab = argv[3];
+  rblapack_afb = argv[4];
+  rblapack_ipiv = argv[5];
+  rblapack_x = argv[6];
+  rblapack_work = argv[7];
+  rblapack_rwork = argv[8];
+  if (argc == 9) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  if (!NA_IsNArray(rblapack_ipiv))
+    rb_raise(rb_eArgError, "ipiv (6th argument) must be NArray");
+  if (NA_RANK(rblapack_ipiv) != 1)
+    rb_raise(rb_eArgError, "rank of ipiv (6th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_ipiv);
+  if (NA_TYPE(rblapack_ipiv) != NA_LINT)
+    rblapack_ipiv = na_change_type(rblapack_ipiv, NA_LINT);
+  ipiv = NA_PTR_TYPE(rblapack_ipiv, integer*);
+  kl = NUM2INT(rblapack_kl);
+  if (!NA_IsNArray(rblapack_rwork))
+    rb_raise(rb_eArgError, "rwork (9th argument) must be NArray");
+  if (NA_RANK(rblapack_rwork) != 1)
+    rb_raise(rb_eArgError, "rank of rwork (9th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_rwork) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of rwork must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_rwork) != NA_SFLOAT)
+    rblapack_rwork = na_change_type(rblapack_rwork, NA_SFLOAT);
+  rwork = NA_PTR_TYPE(rblapack_rwork, real*);
+  ku = NUM2INT(rblapack_ku);
+  if (!NA_IsNArray(rblapack_ab))
+    rb_raise(rb_eArgError, "ab (4th argument) must be NArray");
+  if (NA_RANK(rblapack_ab) != 2)
+    rb_raise(rb_eArgError, "rank of ab (4th argument) must be %d", 2);
+  ldab = NA_SHAPE0(rblapack_ab);
+  if (NA_SHAPE1(rblapack_ab) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of ab must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_ab) != NA_SCOMPLEX)
+    rblapack_ab = na_change_type(rblapack_ab, NA_SCOMPLEX);
+  ab = NA_PTR_TYPE(rblapack_ab, complex*);
+  if (!NA_IsNArray(rblapack_afb))
+    rb_raise(rb_eArgError, "afb (5th argument) must be NArray");
+  if (NA_RANK(rblapack_afb) != 2)
+    rb_raise(rb_eArgError, "rank of afb (5th argument) must be %d", 2);
+  ldafb = NA_SHAPE0(rblapack_afb);
+  if (NA_SHAPE1(rblapack_afb) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of afb must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_afb) != NA_SCOMPLEX)
+    rblapack_afb = na_change_type(rblapack_afb, NA_SCOMPLEX);
+  afb = NA_PTR_TYPE(rblapack_afb, complex*);
+  trans = StringValueCStr(rblapack_trans)[0];
+  if (!NA_IsNArray(rblapack_x))
+    rb_raise(rb_eArgError, "x (7th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 1)
+    rb_raise(rb_eArgError, "rank of x (7th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_x) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of x must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_x) != NA_SCOMPLEX)
+    rblapack_x = na_change_type(rblapack_x, NA_SCOMPLEX);
+  x = NA_PTR_TYPE(rblapack_x, complex*);
+  if (!NA_IsNArray(rblapack_work))
+    rb_raise(rb_eArgError, "work (8th argument) must be NArray");
+  if (NA_RANK(rblapack_work) != 1)
+    rb_raise(rb_eArgError, "rank of work (8th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_work) != (2*n))
+    rb_raise(rb_eRuntimeError, "shape 0 of work must be %d", 2*n);
+  if (NA_TYPE(rblapack_work) != NA_SCOMPLEX)
+    rblapack_work = na_change_type(rblapack_work, NA_SCOMPLEX);
+  work = NA_PTR_TYPE(rblapack_work, complex*);
+
+  __out__ = cla_gbrcond_x_(&trans, &n, &kl, &ku, ab, &ldab, afb, &ldafb, ipiv, x, &info, work, rwork);
+
+  rblapack_info = INT2NUM(info);
+  rblapack___out__ = rb_float_new((double)__out__);
+  return rb_ary_new3(2, rblapack_info, rblapack___out__);
+}
+
+void
+init_lapack_cla_gbrcond_x(VALUE mLapack){
+  rb_define_module_function(mLapack, "cla_gbrcond_x", rblapack_cla_gbrcond_x, -1);
+}

data/ext/cla_gbrfsx_extended.c

@@ -0,0 +1,291 @@
+#include "rb_lapack.h"
+
+extern VOID cla_gbrfsx_extended_(integer* prec_type, integer* trans_type, integer* n, integer* kl, integer* ku, integer* nrhs, complex* ab, integer* ldab, complex* afb, integer* ldafb, integer* ipiv, logical* colequ, real* c, complex* b, integer* ldb, complex* y, integer* ldy, real* berr_out, integer* n_norms, real* err_bnds_norm, real* err_bnds_comp, complex* res, real* ayb, complex* dy, complex* y_tail, real* rcond, integer* ithresh, real* rthresh, real* dz_ub, logical* ignore_cwise, integer* info);
+
+
+static VALUE
+rblapack_cla_gbrfsx_extended(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_prec_type;
+  integer prec_type; 
+  VALUE rblapack_trans_type;
+  integer trans_type; 
+  VALUE rblapack_kl;
+  integer kl; 
+  VALUE rblapack_ku;
+  integer ku; 
+  VALUE rblapack_ab;
+  complex *ab; 
+  VALUE rblapack_afb;
+  complex *afb; 
+  VALUE rblapack_ipiv;
+  integer *ipiv; 
+  VALUE rblapack_colequ;
+  logical colequ; 
+  VALUE rblapack_c;
+  real *c; 
+  VALUE rblapack_b;
+  complex *b; 
+  VALUE rblapack_y;
+  complex *y; 
+  VALUE rblapack_n_norms;
+  integer n_norms; 
+  VALUE rblapack_err_bnds_norm;
+  real *err_bnds_norm; 
+  VALUE rblapack_err_bnds_comp;
+  real *err_bnds_comp; 
+  VALUE rblapack_res;
+  complex *res; 
+  VALUE rblapack_ayb;
+  real *ayb; 
+  VALUE rblapack_dy;
+  complex *dy; 
+  VALUE rblapack_y_tail;
+  complex *y_tail; 
+  VALUE rblapack_rcond;
+  real rcond; 
+  VALUE rblapack_ithresh;
+  integer ithresh; 
+  VALUE rblapack_rthresh;
+  real rthresh; 
+  VALUE rblapack_dz_ub;
+  real dz_ub; 
+  VALUE rblapack_ignore_cwise;
+  logical ignore_cwise; 
+  VALUE rblapack_berr_out;
+  real *berr_out; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_y_out__;
+  complex *y_out__;
+  VALUE rblapack_err_bnds_norm_out__;
+  real *err_bnds_norm_out__;
+  VALUE rblapack_err_bnds_comp_out__;
+  real *err_bnds_comp_out__;
+
+  integer lda;
+  integer n;
+  integer ldaf;
+  integer ldb;
+  integer nrhs;
+  integer ldy;
+  integer n_err_bnds;
+  integer ldafb;
+  integer ldab;
+
+  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  berr_out, info, y, err_bnds_norm, err_bnds_comp = NumRu::Lapack.cla_gbrfsx_extended( prec_type, trans_type, kl, ku, ab, afb, ipiv, colequ, c, b, y, n_norms, err_bnds_norm, err_bnds_comp, res, ayb, dy, y_tail, rcond, ithresh, rthresh, dz_ub, ignore_cwise, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLA_GBRFSX_EXTENDED ( PREC_TYPE, TRANS_TYPE, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB, IPIV, COLEQU, C, B, LDB, Y, LDY, BERR_OUT, N_NORMS, ERR_BNDS_NORM, ERR_BNDS_COMP, RES, AYB, DY, Y_TAIL, RCOND, ITHRESH, RTHRESH, DZ_UB, IGNORE_CWISE, INFO )\n\n*  Purpose\n*  =======\n*\n*  CLA_GBRFSX_EXTENDED improves the computed solution to a system of\n*  linear equations by performing extra-precise iterative refinement\n*  and provides error bounds and backward error estimates for the solution.\n*  This subroutine is called by CGBRFSX to perform iterative refinement.\n*  In addition to normwise error bound, the code provides maximum\n*  componentwise error bound if possible. See comments for ERR_BNDS_NORM\n*  and ERR_BNDS_COMP for details of the error bounds. Note that this\n*  subroutine is only resonsible for setting the second fields of\n*  ERR_BNDS_NORM and ERR_BNDS_COMP.\n*\n\n*  Arguments\n*  =========\n*\n*     PREC_TYPE      (input) INTEGER\n*     Specifies the intermediate precision to be used in refinement.\n*     The value is defined by ILAPREC(P) where P is a CHARACTER and\n*     P    = 'S':  Single\n*          = 'D':  Double\n*          = 'I':  Indigenous\n*          = 'X', 'E':  Extra\n*\n*     TRANS_TYPE     (input) INTEGER\n*     Specifies the transposition operation on A.\n*     The value is defined by ILATRANS(T) where T is a CHARACTER and\n*     T    = 'N':  No transpose\n*          = 'T':  Transpose\n*          = 'C':  Conjugate transpose\n*\n*     N              (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 0.\n*\n*     KL             (input) INTEGER\n*     The number of subdiagonals within the band of A.  KL >= 0.\n*\n*     KU             (input) INTEGER\n*     The number of superdiagonals within the band of A.  KU >= 0\n*\n*     NRHS           (input) INTEGER\n*     The number of right-hand-sides, i.e., the number of columns of the\n*     matrix B.\n*\n*     AB             (input) COMPLEX array, dimension (LDA,N)\n*     On entry, the N-by-N matrix A.\n*\n*     LDAB           (input) INTEGER\n*     The leading dimension of the array A.  LDA >= max(1,N).\n*\n*     AFB            (input) COMPLEX array, dimension (LDAF,N)\n*     The factors L and U from the factorization\n*     A = P*L*U as computed by CGBTRF.\n*\n*     LDAFB          (input) INTEGER\n*     The leading dimension of the array AF.  LDAF >= max(1,N).\n*\n*     IPIV           (input) INTEGER array, dimension (N)\n*     The pivot indices from the factorization A = P*L*U\n*     as computed by CGBTRF; row i of the matrix was interchanged\n*     with row IPIV(i).\n*\n*     COLEQU         (input) LOGICAL\n*     If .TRUE. then column equilibration was done to A before calling\n*     this routine. This is needed to compute the solution and error\n*     bounds correctly.\n*\n*     C              (input) REAL array, dimension (N)\n*     The column scale factors for A. If COLEQU = .FALSE., C\n*     is not accessed. If C is input, each element of C should be a power\n*     of the radix to ensure a reliable solution and error estimates.\n*     Scaling by powers of the radix does not cause rounding errors unless\n*     the result underflows or overflows. Rounding errors during scaling\n*     lead to refining with a matrix that is not equivalent to the\n*     input matrix, producing error estimates that may not be\n*     reliable.\n*\n*     B              (input) COMPLEX array, dimension (LDB,NRHS)\n*     The right-hand-side matrix B.\n*\n*     LDB            (input) INTEGER\n*     The leading dimension of the array B.  LDB >= max(1,N).\n*\n*     Y              (input/output) COMPLEX array, dimension (LDY,NRHS)\n*     On entry, the solution matrix X, as computed by CGBTRS.\n*     On exit, the improved solution matrix Y.\n*\n*     LDY            (input) INTEGER\n*     The leading dimension of the array Y.  LDY >= max(1,N).\n*\n*     BERR_OUT       (output) REAL array, dimension (NRHS)\n*     On exit, BERR_OUT(j) contains the componentwise relative backward\n*     error for right-hand-side j from the formula\n*         max(i) ( abs(RES(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) )\n*     where abs(Z) is the componentwise absolute value of the matrix\n*     or vector Z. This is computed by CLA_LIN_BERR.\n*\n*     N_NORMS        (input) INTEGER\n*     Determines which error bounds to return (see ERR_BNDS_NORM\n*     and ERR_BNDS_COMP).\n*     If N_NORMS >= 1 return normwise error bounds.\n*     If N_NORMS >= 2 return componentwise error bounds.\n*\n*     ERR_BNDS_NORM  (input/output) REAL array, dimension\n*                    (NRHS, N_ERR_BNDS)\n*     For each right-hand side, this array contains information about\n*     various error bounds and condition numbers corresponding to the\n*     normwise relative error, which is defined as follows:\n*\n*     Normwise relative error in the ith solution vector:\n*             max_j (abs(XTRUE(j,i) - X(j,i)))\n*            ------------------------------\n*                  max_j abs(X(j,i))\n*\n*     The array is indexed by the type of error information as described\n*     below. There currently are up to three pieces of information\n*     returned.\n*\n*     The first index in ERR_BNDS_NORM(i,:) corresponds to the ith\n*     right-hand side.\n*\n*     The second index in ERR_BNDS_NORM(:,err) contains the following\n*     three fields:\n*     err = 1 \"Trust/don't trust\" boolean. Trust the answer if the\n*              reciprocal condition number is less than the threshold\n*              sqrt(n) * slamch('Epsilon').\n*\n*     err = 2 \"Guaranteed\" error bound: The estimated forward error,\n*              almost certainly within a factor of 10 of the true error\n*              so long as the next entry is greater than the threshold\n*              sqrt(n) * slamch('Epsilon'). This error bound should only\n*              be trusted if the previous boolean is true.\n*\n*     err = 3  Reciprocal condition number: Estimated normwise\n*              reciprocal condition number.  Compared with the threshold\n*              sqrt(n) * slamch('Epsilon') to determine if the error\n*              estimate is \"guaranteed\". These reciprocal condition\n*              numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some\n*              appropriately scaled matrix Z.\n*              Let Z = S*A, where S scales each row by a power of the\n*              radix so all absolute row sums of Z are approximately 1.\n*\n*     This subroutine is only responsible for setting the second field\n*     above.\n*     See Lapack Working Note 165 for further details and extra\n*     cautions.\n*\n*     ERR_BNDS_COMP  (input/output) REAL array, dimension\n*                    (NRHS, N_ERR_BNDS)\n*     For each right-hand side, this array contains information about\n*     various error bounds and condition numbers corresponding to the\n*     componentwise relative error, which is defined as follows:\n*\n*     Componentwise relative error in the ith solution vector:\n*                    abs(XTRUE(j,i) - X(j,i))\n*             max_j ----------------------\n*                         abs(X(j,i))\n*\n*     The array is indexed by the right-hand side i (on which the\n*     componentwise relative error depends), and the type of error\n*     information as described below. There currently are up to three\n*     pieces of information returned for each right-hand side. If\n*     componentwise accuracy is not requested (PARAMS(3) = 0.0), then\n*     ERR_BNDS_COMP is not accessed.  If N_ERR_BNDS .LT. 3, then at most\n*     the first (:,N_ERR_BNDS) entries are returned.\n*\n*     The first index in ERR_BNDS_COMP(i,:) corresponds to the ith\n*     right-hand side.\n*\n*     The second index in ERR_BNDS_COMP(:,err) contains the following\n*     three fields:\n*     err = 1 \"Trust/don't trust\" boolean. Trust the answer if the\n*              reciprocal condition number is less than the threshold\n*              sqrt(n) * slamch('Epsilon').\n*\n*     err = 2 \"Guaranteed\" error bound: The estimated forward error,\n*              almost certainly within a factor of 10 of the true error\n*              so long as the next entry is greater than the threshold\n*              sqrt(n) * slamch('Epsilon'). This error bound should only\n*              be trusted if the previous boolean is true.\n*\n*     err = 3  Reciprocal condition number: Estimated componentwise\n*              reciprocal condition number.  Compared with the threshold\n*              sqrt(n) * slamch('Epsilon') to determine if the error\n*              estimate is \"guaranteed\". These reciprocal condition\n*              numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some\n*              appropriately scaled matrix Z.\n*              Let Z = S*(A*diag(x)), where x is the solution for the\n*              current right-hand side and S scales each row of\n*              A*diag(x) by a power of the radix so all absolute row\n*              sums of Z are approximately 1.\n*\n*     This subroutine is only responsible for setting the second field\n*     above.\n*     See Lapack Working Note 165 for further details and extra\n*     cautions.\n*\n*     RES            (input) COMPLEX array, dimension (N)\n*     Workspace to hold the intermediate residual.\n*\n*     AYB            (input) REAL array, dimension (N)\n*     Workspace.\n*\n*     DY             (input) COMPLEX array, dimension (N)\n*     Workspace to hold the intermediate solution.\n*\n*     Y_TAIL         (input) COMPLEX array, dimension (N)\n*     Workspace to hold the trailing bits of the intermediate solution.\n*\n*     RCOND          (input) REAL\n*     Reciprocal scaled condition number.  This is an estimate of the\n*     reciprocal Skeel condition number of the matrix A after\n*     equilibration (if done).  If this is less than the machine\n*     precision (in particular, if it is zero), the matrix is singular\n*     to working precision.  Note that the error may still be small even\n*     if this number is very small and the matrix appears ill-\n*     conditioned.\n*\n*     ITHRESH        (input) INTEGER\n*     The maximum number of residual computations allowed for\n*     refinement. The default is 10. For 'aggressive' set to 100 to\n*     permit convergence using approximate factorizations or\n*     factorizations other than LU. If the factorization uses a\n*     technique other than Gaussian elimination, the guarantees in\n*     ERR_BNDS_NORM and ERR_BNDS_COMP may no longer be trustworthy.\n*\n*     RTHRESH        (input) REAL\n*     Determines when to stop refinement if the error estimate stops\n*     decreasing. Refinement will stop when the next solution no longer\n*     satisfies norm(dx_{i+1}) < RTHRESH * norm(dx_i) where norm(Z) is\n*     the infinity norm of Z. RTHRESH satisfies 0 < RTHRESH <= 1. The\n*     default value is 0.5. For 'aggressive' set to 0.9 to permit\n*     convergence on extremely ill-conditioned matrices. See LAWN 165\n*     for more details.\n*\n*     DZ_UB          (input) REAL\n*     Determines when to start considering componentwise convergence.\n*     Componentwise convergence is only considered after each component\n*     of the solution Y is stable, which we definte as the relative\n*     change in each component being less than DZ_UB. The default value\n*     is 0.25, requiring the first bit to be stable. See LAWN 165 for\n*     more details.\n*\n*     IGNORE_CWISE   (input) LOGICAL\n*     If .TRUE. then ignore componentwise convergence. Default value\n*     is .FALSE..\n*\n*     INFO           (output) INTEGER\n*       = 0:  Successful exit.\n*       < 0:  if INFO = -i, the ith argument to CGBTRS had an illegal\n*             value\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      CHARACTER          TRANS\n      INTEGER            CNT, I, J, M, X_STATE, Z_STATE, Y_PREC_STATE\n      REAL               YK, DYK, YMIN, NORMY, NORMX, NORMDX, DXRAT,\n     $                   DZRAT, PREVNORMDX, PREV_DZ_Z, DXRATMAX,\n     $                   DZRATMAX, DX_X, DZ_Z, FINAL_DX_X, FINAL_DZ_Z,\n     $                   EPS, HUGEVAL, INCR_THRESH\n      LOGICAL            INCR_PREC\n      COMPLEX            ZDUM\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  berr_out, info, y, err_bnds_norm, err_bnds_comp = NumRu::Lapack.cla_gbrfsx_extended( prec_type, trans_type, kl, ku, ab, afb, ipiv, colequ, c, b, y, n_norms, err_bnds_norm, err_bnds_comp, res, ayb, dy, y_tail, rcond, ithresh, rthresh, dz_ub, ignore_cwise, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 23 && argc != 23)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 23)", argc);
+  rblapack_prec_type = argv[0];
+  rblapack_trans_type = argv[1];
+  rblapack_kl = argv[2];
+  rblapack_ku = argv[3];
+  rblapack_ab = argv[4];
+  rblapack_afb = argv[5];
+  rblapack_ipiv = argv[6];
+  rblapack_colequ = argv[7];
+  rblapack_c = argv[8];
+  rblapack_b = argv[9];
+  rblapack_y = argv[10];
+  rblapack_n_norms = argv[11];
+  rblapack_err_bnds_norm = argv[12];
+  rblapack_err_bnds_comp = argv[13];
+  rblapack_res = argv[14];
+  rblapack_ayb = argv[15];
+  rblapack_dy = argv[16];
+  rblapack_y_tail = argv[17];
+  rblapack_rcond = argv[18];
+  rblapack_ithresh = argv[19];
+  rblapack_rthresh = argv[20];
+  rblapack_dz_ub = argv[21];
+  rblapack_ignore_cwise = argv[22];
+  if (argc == 23) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  rcond = (real)NUM2DBL(rblapack_rcond);
+  if (!NA_IsNArray(rblapack_ipiv))
+    rb_raise(rb_eArgError, "ipiv (7th argument) must be NArray");
+  if (NA_RANK(rblapack_ipiv) != 1)
+    rb_raise(rb_eArgError, "rank of ipiv (7th argument) must be %d", 1);
+  n = NA_SHAPE0(rblapack_ipiv);
+  if (NA_TYPE(rblapack_ipiv) != NA_LINT)
+    rblapack_ipiv = na_change_type(rblapack_ipiv, NA_LINT);
+  ipiv = NA_PTR_TYPE(rblapack_ipiv, integer*);
+  kl = NUM2INT(rblapack_kl);
+  colequ = (rblapack_colequ == Qtrue);
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (9th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (9th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_c) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of c must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_c) != NA_SFLOAT)
+    rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
+  c = NA_PTR_TYPE(rblapack_c, real*);
+  if (!NA_IsNArray(rblapack_y_tail))
+    rb_raise(rb_eArgError, "y_tail (18th argument) must be NArray");
+  if (NA_RANK(rblapack_y_tail) != 1)
+    rb_raise(rb_eArgError, "rank of y_tail (18th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_y_tail) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of y_tail must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_y_tail) != NA_SCOMPLEX)
+    rblapack_y_tail = na_change_type(rblapack_y_tail, NA_SCOMPLEX);
+  y_tail = NA_PTR_TYPE(rblapack_y_tail, complex*);
+  prec_type = NUM2INT(rblapack_prec_type);
+  rthresh = (real)NUM2DBL(rblapack_rthresh);
+  if (!NA_IsNArray(rblapack_err_bnds_comp))
+    rb_raise(rb_eArgError, "err_bnds_comp (14th argument) must be NArray");
+  if (NA_RANK(rblapack_err_bnds_comp) != 2)
+    rb_raise(rb_eArgError, "rank of err_bnds_comp (14th argument) must be %d", 2);
+  nrhs = NA_SHAPE0(rblapack_err_bnds_comp);
+  n_err_bnds = NA_SHAPE1(rblapack_err_bnds_comp);
+  if (NA_TYPE(rblapack_err_bnds_comp) != NA_SFLOAT)
+    rblapack_err_bnds_comp = na_change_type(rblapack_err_bnds_comp, NA_SFLOAT);
+  err_bnds_comp = NA_PTR_TYPE(rblapack_err_bnds_comp, real*);
+  ignore_cwise = (rblapack_ignore_cwise == Qtrue);
+  if (!NA_IsNArray(rblapack_dy))
+    rb_raise(rb_eArgError, "dy (17th argument) must be NArray");
+  if (NA_RANK(rblapack_dy) != 1)
+    rb_raise(rb_eArgError, "rank of dy (17th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_dy) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of dy must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_dy) != NA_SCOMPLEX)
+    rblapack_dy = na_change_type(rblapack_dy, NA_SCOMPLEX);
+  dy = NA_PTR_TYPE(rblapack_dy, complex*);
+  if (!NA_IsNArray(rblapack_err_bnds_norm))
+    rb_raise(rb_eArgError, "err_bnds_norm (13th argument) must be NArray");
+  if (NA_RANK(rblapack_err_bnds_norm) != 2)
+    rb_raise(rb_eArgError, "rank of err_bnds_norm (13th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_err_bnds_norm) != nrhs)
+    rb_raise(rb_eRuntimeError, "shape 0 of err_bnds_norm must be the same as shape 0 of err_bnds_comp");
+  if (NA_SHAPE1(rblapack_err_bnds_norm) != n_err_bnds)
+    rb_raise(rb_eRuntimeError, "shape 1 of err_bnds_norm must be the same as shape 1 of err_bnds_comp");
+  if (NA_TYPE(rblapack_err_bnds_norm) != NA_SFLOAT)
+    rblapack_err_bnds_norm = na_change_type(rblapack_err_bnds_norm, NA_SFLOAT);
+  err_bnds_norm = NA_PTR_TYPE(rblapack_err_bnds_norm, real*);
+  ku = NUM2INT(rblapack_ku);
+  if (!NA_IsNArray(rblapack_res))
+    rb_raise(rb_eArgError, "res (15th argument) must be NArray");
+  if (NA_RANK(rblapack_res) != 1)
+    rb_raise(rb_eArgError, "rank of res (15th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_res) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of res must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_res) != NA_SCOMPLEX)
+    rblapack_res = na_change_type(rblapack_res, NA_SCOMPLEX);
+  res = NA_PTR_TYPE(rblapack_res, complex*);
+  if (!NA_IsNArray(rblapack_b))
+    rb_raise(rb_eArgError, "b (10th argument) must be NArray");
+  if (NA_RANK(rblapack_b) != 2)
+    rb_raise(rb_eArgError, "rank of b (10th argument) must be %d", 2);
+  ldb = NA_SHAPE0(rblapack_b);
+  if (NA_SHAPE1(rblapack_b) != nrhs)
+    rb_raise(rb_eRuntimeError, "shape 1 of b must be the same as shape 0 of err_bnds_comp");
+  if (NA_TYPE(rblapack_b) != NA_SCOMPLEX)
+    rblapack_b = na_change_type(rblapack_b, NA_SCOMPLEX);
+  b = NA_PTR_TYPE(rblapack_b, complex*);
+  dz_ub = (real)NUM2DBL(rblapack_dz_ub);
+  ithresh = NUM2INT(rblapack_ithresh);
+  trans_type = NUM2INT(rblapack_trans_type);
+  n_norms = NUM2INT(rblapack_n_norms);
+  if (!NA_IsNArray(rblapack_ab))
+    rb_raise(rb_eArgError, "ab (5th argument) must be NArray");
+  if (NA_RANK(rblapack_ab) != 2)
+    rb_raise(rb_eArgError, "rank of ab (5th argument) must be %d", 2);
+  lda = NA_SHAPE0(rblapack_ab);
+  if (NA_SHAPE1(rblapack_ab) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of ab must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_ab) != NA_SCOMPLEX)
+    rblapack_ab = na_change_type(rblapack_ab, NA_SCOMPLEX);
+  ab = NA_PTR_TYPE(rblapack_ab, complex*);
+  if (!NA_IsNArray(rblapack_afb))
+    rb_raise(rb_eArgError, "afb (6th argument) must be NArray");
+  if (NA_RANK(rblapack_afb) != 2)
+    rb_raise(rb_eArgError, "rank of afb (6th argument) must be %d", 2);
+  ldaf = NA_SHAPE0(rblapack_afb);
+  if (NA_SHAPE1(rblapack_afb) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of afb must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_afb) != NA_SCOMPLEX)
+    rblapack_afb = na_change_type(rblapack_afb, NA_SCOMPLEX);
+  afb = NA_PTR_TYPE(rblapack_afb, complex*);
+  if (!NA_IsNArray(rblapack_y))
+    rb_raise(rb_eArgError, "y (11th argument) must be NArray");
+  if (NA_RANK(rblapack_y) != 2)
+    rb_raise(rb_eArgError, "rank of y (11th argument) must be %d", 2);
+  ldy = NA_SHAPE0(rblapack_y);
+  if (NA_SHAPE1(rblapack_y) != nrhs)
+    rb_raise(rb_eRuntimeError, "shape 1 of y must be the same as shape 0 of err_bnds_comp");
+  if (NA_TYPE(rblapack_y) != NA_SCOMPLEX)
+    rblapack_y = na_change_type(rblapack_y, NA_SCOMPLEX);
+  y = NA_PTR_TYPE(rblapack_y, complex*);
+  if (!NA_IsNArray(rblapack_ayb))
+    rb_raise(rb_eArgError, "ayb (16th argument) must be NArray");
+  if (NA_RANK(rblapack_ayb) != 1)
+    rb_raise(rb_eArgError, "rank of ayb (16th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_ayb) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of ayb must be the same as shape 0 of ipiv");
+  if (NA_TYPE(rblapack_ayb) != NA_SFLOAT)
+    rblapack_ayb = na_change_type(rblapack_ayb, NA_SFLOAT);
+  ayb = NA_PTR_TYPE(rblapack_ayb, real*);
+  ldafb = ldaf = MAX(1,n);
+  ldab = lda = MAX(1,n);
+  {
+    int shape[1];
+    shape[0] = nrhs;
+    rblapack_berr_out = na_make_object(NA_SFLOAT, 1, shape, cNArray);
+  }
+  berr_out = NA_PTR_TYPE(rblapack_berr_out, real*);
+  {
+    int shape[2];
+    shape[0] = ldy;
+    shape[1] = nrhs;
+    rblapack_y_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
+  }
+  y_out__ = NA_PTR_TYPE(rblapack_y_out__, complex*);
+  MEMCPY(y_out__, y, complex, NA_TOTAL(rblapack_y));
+  rblapack_y = rblapack_y_out__;
+  y = y_out__;
+  {
+    int shape[2];
+    shape[0] = nrhs;
+    shape[1] = n_err_bnds;
+    rblapack_err_bnds_norm_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  err_bnds_norm_out__ = NA_PTR_TYPE(rblapack_err_bnds_norm_out__, real*);
+  MEMCPY(err_bnds_norm_out__, err_bnds_norm, real, NA_TOTAL(rblapack_err_bnds_norm));
+  rblapack_err_bnds_norm = rblapack_err_bnds_norm_out__;
+  err_bnds_norm = err_bnds_norm_out__;
+  {
+    int shape[2];
+    shape[0] = nrhs;
+    shape[1] = n_err_bnds;
+    rblapack_err_bnds_comp_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
+  }
+  err_bnds_comp_out__ = NA_PTR_TYPE(rblapack_err_bnds_comp_out__, real*);
+  MEMCPY(err_bnds_comp_out__, err_bnds_comp, real, NA_TOTAL(rblapack_err_bnds_comp));
+  rblapack_err_bnds_comp = rblapack_err_bnds_comp_out__;
+  err_bnds_comp = err_bnds_comp_out__;
+
+  cla_gbrfsx_extended_(&prec_type, &trans_type, &n, &kl, &ku, &nrhs, ab, &ldab, afb, &ldafb, ipiv, &colequ, c, b, &ldb, y, &ldy, berr_out, &n_norms, err_bnds_norm, err_bnds_comp, res, ayb, dy, y_tail, &rcond, &ithresh, &rthresh, &dz_ub, &ignore_cwise, &info);
+
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(5, rblapack_berr_out, rblapack_info, rblapack_y, rblapack_err_bnds_norm, rblapack_err_bnds_comp);
+}
+
+void
+init_lapack_cla_gbrfsx_extended(VALUE mLapack){
+  rb_define_module_function(mLapack, "cla_gbrfsx_extended", rblapack_cla_gbrfsx_extended, -1);
+}