ruby-lapack 1.7 → 1.7.1

data/ext/cla_lin_berr.c

@@ -0,0 +1,84 @@
+#include "rb_lapack.h"
+
+extern VOID cla_lin_berr_(integer* n, integer* nz, integer* nrhs, doublereal* res, doublereal* ayb, complex* berr);
+
+
+static VALUE
+rblapack_cla_lin_berr(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_nz;
+  integer nz; 
+  VALUE rblapack_res;
+  doublereal *res; 
+  VALUE rblapack_ayb;
+  doublereal *ayb; 
+  VALUE rblapack_berr;
+  complex *berr; 
+
+  integer n;
+  integer nrhs;
+
+  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 = NumRu::Lapack.cla_lin_berr( nz, res, ayb, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE CLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR )\n\n*  Purpose\n*  =======\n*\n*     CLA_LIN_BERR computes componentwise relative backward error from\n*     the formula\n*         max(i) ( abs(R(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.\n*\n\n*     N       (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 0.\n*\n*     NZ      (input) INTEGER\n*     We add (NZ+1)*SLAMCH( 'Safe minimum' ) to R(i) in the numerator to\n*     guard against spuriously zero residuals. Default value is N.\n*\n*     NRHS    (input) INTEGER\n*     The number of right hand sides, i.e., the number of columns\n*     of the matrices AYB, RES, and BERR.  NRHS >= 0.\n*\n*     RES    (input) DOUBLE PRECISION array, dimension (N,NRHS)\n*     The residual matrix, i.e., the matrix R in the relative backward\n*     error formula above.\n*\n*     AYB    (input) DOUBLE PRECISION array, dimension (N, NRHS)\n*     The denominator in the relative backward error formula above, i.e.,\n*     the matrix abs(op(A_s))*abs(Y) + abs(B_s). The matrices A, Y, and B\n*     are from iterative refinement (see cla_gerfsx_extended.f).\n*     \n*     BERR   (output) COMPLEX array, dimension (NRHS)\n*     The componentwise relative backward error from the formula above.\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      REAL               TMP\n      INTEGER            I, J\n      COMPLEX            CDUM\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          ABS, REAL, AIMAG, MAX\n*     ..\n*     .. External Functions ..\n      EXTERNAL           SLAMCH\n      REAL               SLAMCH\n      REAL               SAFE1\n*     ..\n*     .. Statement Functions ..\n      COMPLEX            CABS1\n*     ..\n*     .. Statement Function Definitions ..\n      CABS1( CDUM ) = ABS( REAL( CDUM ) ) + ABS( AIMAG( CDUM ) )\n*     ..\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  berr = NumRu::Lapack.cla_lin_berr( nz, res, ayb, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 3 && argc != 3)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 3)", argc);
+  rblapack_nz = argv[0];
+  rblapack_res = argv[1];
+  rblapack_ayb = argv[2];
+  if (argc == 3) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  nz = NUM2INT(rblapack_nz);
+  if (!NA_IsNArray(rblapack_ayb))
+    rb_raise(rb_eArgError, "ayb (3th argument) must be NArray");
+  if (NA_RANK(rblapack_ayb) != 2)
+    rb_raise(rb_eArgError, "rank of ayb (3th argument) must be %d", 2);
+  n = NA_SHAPE0(rblapack_ayb);
+  nrhs = NA_SHAPE1(rblapack_ayb);
+  if (NA_TYPE(rblapack_ayb) != NA_DFLOAT)
+    rblapack_ayb = na_change_type(rblapack_ayb, NA_DFLOAT);
+  ayb = NA_PTR_TYPE(rblapack_ayb, doublereal*);
+  if (!NA_IsNArray(rblapack_res))
+    rb_raise(rb_eArgError, "res (2th argument) must be NArray");
+  if (NA_RANK(rblapack_res) != 2)
+    rb_raise(rb_eArgError, "rank of res (2th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_res) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of res must be the same as shape 0 of ayb");
+  if (NA_SHAPE1(rblapack_res) != nrhs)
+    rb_raise(rb_eRuntimeError, "shape 1 of res must be the same as shape 1 of ayb");
+  if (NA_TYPE(rblapack_res) != NA_DFLOAT)
+    rblapack_res = na_change_type(rblapack_res, NA_DFLOAT);
+  res = NA_PTR_TYPE(rblapack_res, doublereal*);
+  {
+    na_shape_t shape[1];
+    shape[0] = nrhs;
+    rblapack_berr = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
+  }
+  berr = NA_PTR_TYPE(rblapack_berr, complex*);
+
+  cla_lin_berr_(&n, &nz, &nrhs, res, ayb, berr);
+
+  return rblapack_berr;
+}
+
+void
+init_lapack_cla_lin_berr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "cla_lin_berr", rblapack_cla_lin_berr, -1);
+}

data/ext/cla_porcond_c.c

@@ -0,0 +1,122 @@
+#include "rb_lapack.h"
+
+extern real cla_porcond_c_(char* uplo, integer* n, complex* a, integer* lda, complex* af, integer* ldaf, real* c, logical* capply, integer* info, complex* work, real* rwork);
+
+
+static VALUE
+rblapack_cla_porcond_c(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_a;
+  complex *a; 
+  VALUE rblapack_af;
+  complex *af; 
+  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 lda;
+  integer n;
+  integer ldaf;
+
+  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_porcond_c( uplo, a, af, c, capply, work, rwork, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      REAL FUNCTION CLA_PORCOND_C( UPLO, N, A, LDA, AF, LDAF, C, CAPPLY, INFO, WORK, RWORK )\n\n*  Purpose\n*  =======\n*\n*     CLA_PORCOND_C Computes the infinity norm condition number of\n*     op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector\n*\n\n*  Arguments\n*  =========\n*\n*     UPLO    (input) CHARACTER*1\n*       = 'U':  Upper triangle of A is stored;\n*       = 'L':  Lower triangle of A is stored.\n*\n*     N       (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 0.\n*\n*     A       (input) COMPLEX array, dimension (LDA,N)\n*     On entry, the N-by-N matrix A\n*\n*     LDA     (input) INTEGER\n*     The leading dimension of the array A.  LDA >= max(1,N).\n*\n*     AF      (input) COMPLEX array, dimension (LDAF,N)\n*     The triangular factor U or L from the Cholesky factorization\n*     A = U**T*U or A = L*L**T, as computed by CPOTRF.\n*\n*     LDAF    (input) INTEGER\n*     The leading dimension of the array AF.  LDAF >= max(1,N).\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      INTEGER            KASE\n      REAL               AINVNM, ANORM, TMP\n      INTEGER            I, J\n      LOGICAL            UP\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, CPOTRS, XERBLA\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          ABS, MAX, REAL, AIMAG\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_porcond_c( uplo, a, af, c, capply, work, rwork, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 7 && argc != 7)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 7)", argc);
+  rblapack_uplo = argv[0];
+  rblapack_a = argv[1];
+  rblapack_af = argv[2];
+  rblapack_c = argv[3];
+  rblapack_capply = argv[4];
+  rblapack_work = argv[5];
+  rblapack_rwork = argv[6];
+  if (argc == 7) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_af))
+    rb_raise(rb_eArgError, "af (3th argument) must be NArray");
+  if (NA_RANK(rblapack_af) != 2)
+    rb_raise(rb_eArgError, "rank of af (3th argument) must be %d", 2);
+  ldaf = NA_SHAPE0(rblapack_af);
+  n = NA_SHAPE1(rblapack_af);
+  if (NA_TYPE(rblapack_af) != NA_SCOMPLEX)
+    rblapack_af = na_change_type(rblapack_af, NA_SCOMPLEX);
+  af = NA_PTR_TYPE(rblapack_af, complex*);
+  capply = (rblapack_capply == Qtrue);
+  if (!NA_IsNArray(rblapack_rwork))
+    rb_raise(rb_eArgError, "rwork (7th argument) must be NArray");
+  if (NA_RANK(rblapack_rwork) != 1)
+    rb_raise(rb_eArgError, "rank of rwork (7th 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 1 of af");
+  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_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 1 of af");
+  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_c))
+    rb_raise(rb_eArgError, "c (4th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (4th 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 1 of af");
+  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_work))
+    rb_raise(rb_eArgError, "work (6th argument) must be NArray");
+  if (NA_RANK(rblapack_work) != 1)
+    rb_raise(rb_eArgError, "rank of work (6th 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_porcond_c_(&uplo, &n, a, &lda, af, &ldaf, 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_porcond_c(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "cla_porcond_c", rblapack_cla_porcond_c, -1);
+}

data/ext/cla_porcond_x.c

@@ -0,0 +1,118 @@
+#include "rb_lapack.h"
+
+extern real cla_porcond_x_(char* uplo, integer* n, complex* a, integer* lda, complex* af, integer* ldaf, complex* x, integer* info, complex* work, real* rwork);
+
+
+static VALUE
+rblapack_cla_porcond_x(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_a;
+  complex *a; 
+  VALUE rblapack_af;
+  complex *af; 
+  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 lda;
+  integer n;
+  integer ldaf;
+
+  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_porcond_x( uplo, a, af, x, work, rwork, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      REAL FUNCTION CLA_PORCOND_X( UPLO, N, A, LDA, AF, LDAF, X, INFO, WORK, RWORK )\n\n*  Purpose\n*  =======\n*\n*     CLA_PORCOND_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*     UPLO    (input) CHARACTER*1\n*       = 'U':  Upper triangle of A is stored;\n*       = 'L':  Lower triangle of A is stored.\n*\n*     N       (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 0.\n*\n*     A       (input) COMPLEX array, dimension (LDA,N)\n*     On entry, the N-by-N matrix A.\n*\n*     LDA     (input) INTEGER\n*     The leading dimension of the array A.  LDA >= max(1,N).\n*\n*     AF      (input) COMPLEX array, dimension (LDAF,N)\n*     The triangular factor U or L from the Cholesky factorization\n*     A = U**T*U or A = L*L**T, as computed by CPOTRF.\n*\n*     LDAF    (input) INTEGER\n*     The leading dimension of the array AF.  LDAF >= max(1,N).\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      INTEGER            KASE, I, J\n      REAL               AINVNM, ANORM, TMP\n      LOGICAL            UP\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, CPOTRS, XERBLA\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          ABS, MAX, REAL, AIMAG\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_porcond_x( uplo, a, af, x, work, rwork, [: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_uplo = argv[0];
+  rblapack_a = argv[1];
+  rblapack_af = argv[2];
+  rblapack_x = argv[3];
+  rblapack_work = argv[4];
+  rblapack_rwork = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_af))
+    rb_raise(rb_eArgError, "af (3th argument) must be NArray");
+  if (NA_RANK(rblapack_af) != 2)
+    rb_raise(rb_eArgError, "rank of af (3th argument) must be %d", 2);
+  ldaf = NA_SHAPE0(rblapack_af);
+  n = NA_SHAPE1(rblapack_af);
+  if (NA_TYPE(rblapack_af) != NA_SCOMPLEX)
+    rblapack_af = na_change_type(rblapack_af, NA_SCOMPLEX);
+  af = NA_PTR_TYPE(rblapack_af, complex*);
+  if (!NA_IsNArray(rblapack_rwork))
+    rb_raise(rb_eArgError, "rwork (6th argument) must be NArray");
+  if (NA_RANK(rblapack_rwork) != 1)
+    rb_raise(rb_eArgError, "rank of rwork (6th 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 1 of af");
+  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_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 1 of af");
+  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_x))
+    rb_raise(rb_eArgError, "x (4th argument) must be NArray");
+  if (NA_RANK(rblapack_x) != 1)
+    rb_raise(rb_eArgError, "rank of x (4th 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 1 of af");
+  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 (5th argument) must be NArray");
+  if (NA_RANK(rblapack_work) != 1)
+    rb_raise(rb_eArgError, "rank of work (5th 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_porcond_x_(&uplo, &n, a, &lda, af, &ldaf, 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_porcond_x(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "cla_porcond_x", rblapack_cla_porcond_x, -1);
+}

data/ext/cla_porfsx_extended.c

@@ -0,0 +1,271 @@
+#include "rb_lapack.h"
+
+extern VOID cla_porfsx_extended_(integer* prec_type, char* uplo, integer* n, integer* nrhs, complex* a, integer* lda, complex* af, integer* ldaf, 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_porfsx_extended(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_prec_type;
+  integer prec_type; 
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_a;
+  complex *a; 
+  VALUE rblapack_af;
+  complex *af; 
+  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;
+
+  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_porfsx_extended( prec_type, uplo, a, af, 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_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, AF, LDAF, 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_PORFSX_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 CPORFSX 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*     UPLO    (input) CHARACTER*1\n*       = 'U':  Upper triangle of A is stored;\n*       = 'L':  Lower triangle of A is stored.\n*\n*     N              (input) INTEGER\n*     The number of linear equations, i.e., the order of the\n*     matrix A.  N >= 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*     A              (input) COMPLEX array, dimension (LDA,N)\n*     On entry, the N-by-N matrix A.\n*\n*     LDA            (input) INTEGER\n*     The leading dimension of the array A.  LDA >= max(1,N).\n*\n*     AF             (input) COMPLEX array, dimension (LDAF,N)\n*     The triangular factor U or L from the Cholesky factorization\n*     A = U**T*U or A = L*L**T, as computed by CPOTRF.\n*\n*     LDAF           (input) INTEGER\n*     The leading dimension of the array AF.  LDAF >= max(1,N).\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\n*                    (LDY,NRHS)\n*     On entry, the solution matrix X, as computed by CPOTRS.\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 CPOTRS had an illegal\n*             value\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            UPLO2, CNT, I, J, X_STATE, Z_STATE,\n     $                   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_porfsx_extended( prec_type, uplo, a, af, 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 != 20 && argc != 20)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 20)", argc);
+  rblapack_prec_type = argv[0];
+  rblapack_uplo = argv[1];
+  rblapack_a = argv[2];
+  rblapack_af = argv[3];
+  rblapack_colequ = argv[4];
+  rblapack_c = argv[5];
+  rblapack_b = argv[6];
+  rblapack_y = argv[7];
+  rblapack_n_norms = argv[8];
+  rblapack_err_bnds_norm = argv[9];
+  rblapack_err_bnds_comp = argv[10];
+  rblapack_res = argv[11];
+  rblapack_ayb = argv[12];
+  rblapack_dy = argv[13];
+  rblapack_y_tail = argv[14];
+  rblapack_rcond = argv[15];
+  rblapack_ithresh = argv[16];
+  rblapack_rthresh = argv[17];
+  rblapack_dz_ub = argv[18];
+  rblapack_ignore_cwise = argv[19];
+  if (argc == 20) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  prec_type = NUM2INT(rblapack_prec_type);
+  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*);
+  colequ = (rblapack_colequ == Qtrue);
+  if (!NA_IsNArray(rblapack_b))
+    rb_raise(rb_eArgError, "b (7th argument) must be NArray");
+  if (NA_RANK(rblapack_b) != 2)
+    rb_raise(rb_eArgError, "rank of b (7th argument) must be %d", 2);
+  ldb = NA_SHAPE0(rblapack_b);
+  nrhs = NA_SHAPE1(rblapack_b);
+  if (NA_TYPE(rblapack_b) != NA_SCOMPLEX)
+    rblapack_b = na_change_type(rblapack_b, NA_SCOMPLEX);
+  b = NA_PTR_TYPE(rblapack_b, complex*);
+  n_norms = NUM2INT(rblapack_n_norms);
+  if (!NA_IsNArray(rblapack_err_bnds_comp))
+    rb_raise(rb_eArgError, "err_bnds_comp (11th argument) must be NArray");
+  if (NA_RANK(rblapack_err_bnds_comp) != 2)
+    rb_raise(rb_eArgError, "rank of err_bnds_comp (11th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_err_bnds_comp) != nrhs)
+    rb_raise(rb_eRuntimeError, "shape 0 of err_bnds_comp must be the same as shape 1 of b");
+  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*);
+  if (!NA_IsNArray(rblapack_ayb))
+    rb_raise(rb_eArgError, "ayb (13th argument) must be NArray");
+  if (NA_RANK(rblapack_ayb) != 1)
+    rb_raise(rb_eArgError, "rank of ayb (13th 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 1 of a");
+  if (NA_TYPE(rblapack_ayb) != NA_SFLOAT)
+    rblapack_ayb = na_change_type(rblapack_ayb, NA_SFLOAT);
+  ayb = NA_PTR_TYPE(rblapack_ayb, real*);
+  if (!NA_IsNArray(rblapack_y_tail))
+    rb_raise(rb_eArgError, "y_tail (15th argument) must be NArray");
+  if (NA_RANK(rblapack_y_tail) != 1)
+    rb_raise(rb_eArgError, "rank of y_tail (15th 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 1 of a");
+  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*);
+  ithresh = NUM2INT(rblapack_ithresh);
+  dz_ub = (real)NUM2DBL(rblapack_dz_ub);
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_c))
+    rb_raise(rb_eArgError, "c (6th argument) must be NArray");
+  if (NA_RANK(rblapack_c) != 1)
+    rb_raise(rb_eArgError, "rank of c (6th 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 1 of a");
+  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_err_bnds_norm))
+    rb_raise(rb_eArgError, "err_bnds_norm (10th argument) must be NArray");
+  if (NA_RANK(rblapack_err_bnds_norm) != 2)
+    rb_raise(rb_eArgError, "rank of err_bnds_norm (10th 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 1 of b");
+  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*);
+  if (!NA_IsNArray(rblapack_dy))
+    rb_raise(rb_eArgError, "dy (14th argument) must be NArray");
+  if (NA_RANK(rblapack_dy) != 1)
+    rb_raise(rb_eArgError, "rank of dy (14th 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 1 of a");
+  if (NA_TYPE(rblapack_dy) != NA_SCOMPLEX)
+    rblapack_dy = na_change_type(rblapack_dy, NA_SCOMPLEX);
+  dy = NA_PTR_TYPE(rblapack_dy, complex*);
+  rthresh = (real)NUM2DBL(rblapack_rthresh);
+  if (!NA_IsNArray(rblapack_af))
+    rb_raise(rb_eArgError, "af (4th argument) must be NArray");
+  if (NA_RANK(rblapack_af) != 2)
+    rb_raise(rb_eArgError, "rank of af (4th argument) must be %d", 2);
+  ldaf = NA_SHAPE0(rblapack_af);
+  if (NA_SHAPE1(rblapack_af) != n)
+    rb_raise(rb_eRuntimeError, "shape 1 of af must be the same as shape 1 of a");
+  if (NA_TYPE(rblapack_af) != NA_SCOMPLEX)
+    rblapack_af = na_change_type(rblapack_af, NA_SCOMPLEX);
+  af = NA_PTR_TYPE(rblapack_af, complex*);
+  if (!NA_IsNArray(rblapack_res))
+    rb_raise(rb_eArgError, "res (12th argument) must be NArray");
+  if (NA_RANK(rblapack_res) != 1)
+    rb_raise(rb_eArgError, "rank of res (12th 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 1 of a");
+  if (NA_TYPE(rblapack_res) != NA_SCOMPLEX)
+    rblapack_res = na_change_type(rblapack_res, NA_SCOMPLEX);
+  res = NA_PTR_TYPE(rblapack_res, complex*);
+  ignore_cwise = (rblapack_ignore_cwise == Qtrue);
+  if (!NA_IsNArray(rblapack_y))
+    rb_raise(rb_eArgError, "y (8th argument) must be NArray");
+  if (NA_RANK(rblapack_y) != 2)
+    rb_raise(rb_eArgError, "rank of y (8th 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 1 of b");
+  if (NA_TYPE(rblapack_y) != NA_SCOMPLEX)
+    rblapack_y = na_change_type(rblapack_y, NA_SCOMPLEX);
+  y = NA_PTR_TYPE(rblapack_y, complex*);
+  rcond = (real)NUM2DBL(rblapack_rcond);
+  {
+    na_shape_t 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*);
+  {
+    na_shape_t 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__;
+  {
+    na_shape_t 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__;
+  {
+    na_shape_t 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_porfsx_extended_(&prec_type, &uplo, &n, &nrhs, a, &lda, af, &ldaf, &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_porfsx_extended(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "cla_porfsx_extended", rblapack_cla_porfsx_extended, -1);
+}