ruby-lapack 1.6 → 1.7

data/ext/zlabrd.c

@@ -1,132 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID zlabrd_(integer* m, integer* n, integer* nb, doublecomplex* a, integer* lda, doublereal* d, doublereal* e, doublecomplex* tauq, doublecomplex* taup, doublecomplex* x, integer* ldx, doublecomplex* y, integer* ldy);
-
-
-static VALUE
-rblapack_zlabrd(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_m;
-  integer m; 
-  VALUE rblapack_nb;
-  integer nb; 
-  VALUE rblapack_a;
-  doublecomplex *a; 
-  VALUE rblapack_d;
-  doublereal *d; 
-  VALUE rblapack_e;
-  doublereal *e; 
-  VALUE rblapack_tauq;
-  doublecomplex *tauq; 
-  VALUE rblapack_taup;
-  doublecomplex *taup; 
-  VALUE rblapack_x;
-  doublecomplex *x; 
-  VALUE rblapack_y;
-  doublecomplex *y; 
-  VALUE rblapack_a_out__;
-  doublecomplex *a_out__;
-
-  integer lda;
-  integer n;
-  integer ldx;
-  integer ldy;
-
-  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  d, e, tauq, taup, x, y, a = NumRu::Lapack.zlabrd( m, nb, a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, LDY )\n\n*  Purpose\n*  =======\n*\n*  ZLABRD reduces the first NB rows and columns of a complex general\n*  m by n matrix A to upper or lower real bidiagonal form by a unitary\n*  transformation Q' * A * P, and returns the matrices X and Y which\n*  are needed to apply the transformation to the unreduced part of A.\n*\n*  If m >= n, A is reduced to upper bidiagonal form; if m < n, to lower\n*  bidiagonal form.\n*\n*  This is an auxiliary routine called by ZGEBRD\n*\n\n*  Arguments\n*  =========\n*\n*  M       (input) INTEGER\n*          The number of rows in the matrix A.\n*\n*  N       (input) INTEGER\n*          The number of columns in the matrix A.\n*\n*  NB      (input) INTEGER\n*          The number of leading rows and columns of A to be reduced.\n*\n*  A       (input/output) COMPLEX*16 array, dimension (LDA,N)\n*          On entry, the m by n general matrix to be reduced.\n*          On exit, the first NB rows and columns of the matrix are\n*          overwritten; the rest of the array is unchanged.\n*          If m >= n, elements on and below the diagonal in the first NB\n*            columns, with the array TAUQ, represent the unitary\n*            matrix Q as a product of elementary reflectors; and\n*            elements above the diagonal in the first NB rows, with the\n*            array TAUP, represent the unitary matrix P as a product\n*            of elementary reflectors.\n*          If m < n, elements below the diagonal in the first NB\n*            columns, with the array TAUQ, represent the unitary\n*            matrix Q as a product of elementary reflectors, and\n*            elements on and above the diagonal in the first NB rows,\n*            with the array TAUP, represent the unitary matrix P as\n*            a product of elementary reflectors.\n*          See Further Details.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(1,M).\n*\n*  D       (output) DOUBLE PRECISION array, dimension (NB)\n*          The diagonal elements of the first NB rows and columns of\n*          the reduced matrix.  D(i) = A(i,i).\n*\n*  E       (output) DOUBLE PRECISION array, dimension (NB)\n*          The off-diagonal elements of the first NB rows and columns of\n*          the reduced matrix.\n*\n*  TAUQ    (output) COMPLEX*16 array dimension (NB)\n*          The scalar factors of the elementary reflectors which\n*          represent the unitary matrix Q. See Further Details.\n*\n*  TAUP    (output) COMPLEX*16 array, dimension (NB)\n*          The scalar factors of the elementary reflectors which\n*          represent the unitary matrix P. See Further Details.\n*\n*  X       (output) COMPLEX*16 array, dimension (LDX,NB)\n*          The m-by-nb matrix X required to update the unreduced part\n*          of A.\n*\n*  LDX     (input) INTEGER\n*          The leading dimension of the array X. LDX >= max(1,M).\n*\n*  Y       (output) COMPLEX*16 array, dimension (LDY,NB)\n*          The n-by-nb matrix Y required to update the unreduced part\n*          of A.\n*\n*  LDY     (input) INTEGER\n*          The leading dimension of the array Y. LDY >= max(1,N).\n*\n\n*  Further Details\n*  ===============\n*\n*  The matrices Q and P are represented as products of elementary\n*  reflectors:\n*\n*     Q = H(1) H(2) . . . H(nb)  and  P = G(1) G(2) . . . G(nb)\n*\n*  Each H(i) and G(i) has the form:\n*\n*     H(i) = I - tauq * v * v'  and G(i) = I - taup * u * u'\n*\n*  where tauq and taup are complex scalars, and v and u are complex\n*  vectors.\n*\n*  If m >= n, v(1:i-1) = 0, v(i) = 1, and v(i:m) is stored on exit in\n*  A(i:m,i); u(1:i) = 0, u(i+1) = 1, and u(i+1:n) is stored on exit in\n*  A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i).\n*\n*  If m < n, v(1:i) = 0, v(i+1) = 1, and v(i+1:m) is stored on exit in\n*  A(i+2:m,i); u(1:i-1) = 0, u(i) = 1, and u(i:n) is stored on exit in\n*  A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i).\n*\n*  The elements of the vectors v and u together form the m-by-nb matrix\n*  V and the nb-by-n matrix U' which are needed, with X and Y, to apply\n*  the transformation to the unreduced part of the matrix, using a block\n*  update of the form:  A := A - V*Y' - X*U'.\n*\n*  The contents of A on exit are illustrated by the following examples\n*  with nb = 2:\n*\n*  m = 6 and n = 5 (m > n):          m = 5 and n = 6 (m < n):\n*\n*    (  1   1   u1  u1  u1 )           (  1   u1  u1  u1  u1  u1 )\n*    (  v1  1   1   u2  u2 )           (  1   1   u2  u2  u2  u2 )\n*    (  v1  v2  a   a   a  )           (  v1  1   a   a   a   a  )\n*    (  v1  v2  a   a   a  )           (  v1  v2  a   a   a   a  )\n*    (  v1  v2  a   a   a  )           (  v1  v2  a   a   a   a  )\n*    (  v1  v2  a   a   a  )\n*\n*  where a denotes an element of the original matrix which is unchanged,\n*  vi denotes an element of the vector defining H(i), and ui an element\n*  of the vector defining G(i).\n*\n*  =====================================================================\n*\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  d, e, tauq, taup, x, y, a = NumRu::Lapack.zlabrd( m, nb, a, [: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_m = argv[0];
-  rblapack_nb = argv[1];
-  rblapack_a = argv[2];
-  if (argc == 3) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  m = NUM2INT(rblapack_m);
-  if (!NA_IsNArray(rblapack_a))
-    rb_raise(rb_eArgError, "a (3th argument) must be NArray");
-  if (NA_RANK(rblapack_a) != 2)
-    rb_raise(rb_eArgError, "rank of a (3th argument) must be %d", 2);
-  lda = NA_SHAPE0(rblapack_a);
-  n = NA_SHAPE1(rblapack_a);
-  if (NA_TYPE(rblapack_a) != NA_DCOMPLEX)
-    rblapack_a = na_change_type(rblapack_a, NA_DCOMPLEX);
-  a = NA_PTR_TYPE(rblapack_a, doublecomplex*);
-  ldy = MAX(1,n);
-  nb = NUM2INT(rblapack_nb);
-  ldx = MAX(1,m);
-  {
-    int shape[1];
-    shape[0] = MAX(1,nb);
-    rblapack_d = na_make_object(NA_DFLOAT, 1, shape, cNArray);
-  }
-  d = NA_PTR_TYPE(rblapack_d, doublereal*);
-  {
-    int shape[1];
-    shape[0] = MAX(1,nb);
-    rblapack_e = na_make_object(NA_DFLOAT, 1, shape, cNArray);
-  }
-  e = NA_PTR_TYPE(rblapack_e, doublereal*);
-  {
-    int shape[1];
-    shape[0] = MAX(1,nb);
-    rblapack_tauq = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
-  }
-  tauq = NA_PTR_TYPE(rblapack_tauq, doublecomplex*);
-  {
-    int shape[1];
-    shape[0] = MAX(1,nb);
-    rblapack_taup = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
-  }
-  taup = NA_PTR_TYPE(rblapack_taup, doublecomplex*);
-  {
-    int shape[2];
-    shape[0] = ldx;
-    shape[1] = MAX(1,nb);
-    rblapack_x = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
-  }
-  x = NA_PTR_TYPE(rblapack_x, doublecomplex*);
-  {
-    int shape[2];
-    shape[0] = ldy;
-    shape[1] = MAX(1,nb);
-    rblapack_y = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
-  }
-  y = NA_PTR_TYPE(rblapack_y, doublecomplex*);
-  {
-    int shape[2];
-    shape[0] = lda;
-    shape[1] = n;
-    rblapack_a_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
-  }
-  a_out__ = NA_PTR_TYPE(rblapack_a_out__, doublecomplex*);
-  MEMCPY(a_out__, a, doublecomplex, NA_TOTAL(rblapack_a));
-  rblapack_a = rblapack_a_out__;
-  a = a_out__;
-
-  zlabrd_(&m, &n, &nb, a, &lda, d, e, tauq, taup, x, &ldx, y, &ldy);
-
-  return rb_ary_new3(7, rblapack_d, rblapack_e, rblapack_tauq, rblapack_taup, rblapack_x, rblapack_y, rblapack_a);
-}
-
-void
-init_lapack_zlabrd(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "zlabrd", rblapack_zlabrd, -1);
-}

data/ext/zlacgv.c

@@ -1,75 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID zlacgv_(integer* n, doublecomplex* x, integer* incx);
-
-
-static VALUE
-rblapack_zlacgv(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_n;
-  integer n; 
-  VALUE rblapack_x;
-  doublecomplex *x; 
-  VALUE rblapack_incx;
-  integer incx; 
-  VALUE rblapack_x_out__;
-  doublecomplex *x_out__;
-
-
-  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  x = NumRu::Lapack.zlacgv( n, x, incx, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLACGV( N, X, INCX )\n\n*  Purpose\n*  =======\n*\n*  ZLACGV conjugates a complex vector of length N.\n*\n\n*  Arguments\n*  =========\n*\n*  N       (input) INTEGER\n*          The length of the vector X.  N >= 0.\n*\n*  X       (input/output) COMPLEX*16 array, dimension\n*                         (1+(N-1)*abs(INCX))\n*          On entry, the vector of length N to be conjugated.\n*          On exit, X is overwritten with conjg(X).\n*\n*  INCX    (input) INTEGER\n*          The spacing between successive elements of X.\n*\n\n* =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            I, IOFF\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          DCONJG\n*     ..\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  x = NumRu::Lapack.zlacgv( n, x, incx, [: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_n = argv[0];
-  rblapack_x = argv[1];
-  rblapack_incx = argv[2];
-  if (argc == 3) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  n = NUM2INT(rblapack_n);
-  incx = NUM2INT(rblapack_incx);
-  if (!NA_IsNArray(rblapack_x))
-    rb_raise(rb_eArgError, "x (2th argument) must be NArray");
-  if (NA_RANK(rblapack_x) != 1)
-    rb_raise(rb_eArgError, "rank of x (2th argument) must be %d", 1);
-  if (NA_SHAPE0(rblapack_x) != (1+(n-1)*abs(incx)))
-    rb_raise(rb_eRuntimeError, "shape 0 of x must be %d", 1+(n-1)*abs(incx));
-  if (NA_TYPE(rblapack_x) != NA_DCOMPLEX)
-    rblapack_x = na_change_type(rblapack_x, NA_DCOMPLEX);
-  x = NA_PTR_TYPE(rblapack_x, doublecomplex*);
-  {
-    int shape[1];
-    shape[0] = 1+(n-1)*abs(incx);
-    rblapack_x_out__ = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
-  }
-  x_out__ = NA_PTR_TYPE(rblapack_x_out__, doublecomplex*);
-  MEMCPY(x_out__, x, doublecomplex, NA_TOTAL(rblapack_x));
-  rblapack_x = rblapack_x_out__;
-  x = x_out__;
-
-  zlacgv_(&n, x, &incx);
-
-  return rblapack_x;
-}
-
-void
-init_lapack_zlacgv(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "zlacgv", rblapack_zlacgv, -1);
-}

data/ext/zlacn2.c

@@ -1,103 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID zlacn2_(integer* n, doublecomplex* v, doublecomplex* x, doublereal* est, integer* kase, integer* isave);
-
-
-static VALUE
-rblapack_zlacn2(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_x;
-  doublecomplex *x; 
-  VALUE rblapack_est;
-  doublereal est; 
-  VALUE rblapack_kase;
-  integer kase; 
-  VALUE rblapack_isave;
-  integer *isave; 
-  VALUE rblapack_x_out__;
-  doublecomplex *x_out__;
-  VALUE rblapack_isave_out__;
-  integer *isave_out__;
-  doublecomplex *v;
-
-  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  x, est, kase, isave = NumRu::Lapack.zlacn2( x, est, kase, isave, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE )\n\n*  Purpose\n*  =======\n*\n*  ZLACN2 estimates the 1-norm of a square, complex matrix A.\n*  Reverse communication is used for evaluating matrix-vector products.\n*\n\n*  Arguments\n*  =========\n*\n*  N      (input) INTEGER\n*         The order of the matrix.  N >= 1.\n*\n*  V      (workspace) COMPLEX*16 array, dimension (N)\n*         On the final return, V = A*W,  where  EST = norm(V)/norm(W)\n*         (W is not returned).\n*\n*  X      (input/output) COMPLEX*16 array, dimension (N)\n*         On an intermediate return, X should be overwritten by\n*               A * X,   if KASE=1,\n*               A' * X,  if KASE=2,\n*         where A' is the conjugate transpose of A, and ZLACN2 must be\n*         re-called with all the other parameters unchanged.\n*\n*  EST    (input/output) DOUBLE PRECISION\n*         On entry with KASE = 1 or 2 and ISAVE(1) = 3, EST should be\n*         unchanged from the previous call to ZLACN2.\n*         On exit, EST is an estimate (a lower bound) for norm(A). \n*\n*  KASE   (input/output) INTEGER\n*         On the initial call to ZLACN2, KASE should be 0.\n*         On an intermediate return, KASE will be 1 or 2, indicating\n*         whether X should be overwritten by A * X  or A' * X.\n*         On the final return from ZLACN2, KASE will again be 0.\n*\n*  ISAVE  (input/output) INTEGER array, dimension (3)\n*         ISAVE is used to save variables between calls to ZLACN2\n*\n\n*  Further Details\n*  ======= =======\n*\n*  Contributed by Nick Higham, University of Manchester.\n*  Originally named CONEST, dated March 16, 1988.\n*\n*  Reference: N.J. Higham, \"FORTRAN codes for estimating the one-norm of\n*  a real or complex matrix, with applications to condition estimation\",\n*  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.\n*\n*  Last modified:  April, 1999\n*\n*  This is a thread safe version of ZLACON, which uses the array ISAVE\n*  in place of a SAVE statement, as follows:\n*\n*     ZLACON     ZLACN2\n*      JUMP     ISAVE(1)\n*      J        ISAVE(2)\n*      ITER     ISAVE(3)\n*\n*  =====================================================================\n*\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  x, est, kase, isave = NumRu::Lapack.zlacn2( x, est, kase, isave, [:usage => usage, :help => help])\n");
-      return Qnil;
-    } 
-  } else
-    rblapack_options = Qnil;
-  if (argc != 4 && argc != 4)
-    rb_raise(rb_eArgError,"wrong number of arguments (%d for 4)", argc);
-  rblapack_x = argv[0];
-  rblapack_est = argv[1];
-  rblapack_kase = argv[2];
-  rblapack_isave = argv[3];
-  if (argc == 4) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  if (!NA_IsNArray(rblapack_x))
-    rb_raise(rb_eArgError, "x (1th argument) must be NArray");
-  if (NA_RANK(rblapack_x) != 1)
-    rb_raise(rb_eArgError, "rank of x (1th argument) must be %d", 1);
-  n = NA_SHAPE0(rblapack_x);
-  if (NA_TYPE(rblapack_x) != NA_DCOMPLEX)
-    rblapack_x = na_change_type(rblapack_x, NA_DCOMPLEX);
-  x = NA_PTR_TYPE(rblapack_x, doublecomplex*);
-  kase = NUM2INT(rblapack_kase);
-  est = NUM2DBL(rblapack_est);
-  if (!NA_IsNArray(rblapack_isave))
-    rb_raise(rb_eArgError, "isave (4th argument) must be NArray");
-  if (NA_RANK(rblapack_isave) != 1)
-    rb_raise(rb_eArgError, "rank of isave (4th argument) must be %d", 1);
-  if (NA_SHAPE0(rblapack_isave) != (3))
-    rb_raise(rb_eRuntimeError, "shape 0 of isave must be %d", 3);
-  if (NA_TYPE(rblapack_isave) != NA_LINT)
-    rblapack_isave = na_change_type(rblapack_isave, NA_LINT);
-  isave = NA_PTR_TYPE(rblapack_isave, integer*);
-  {
-    int shape[1];
-    shape[0] = n;
-    rblapack_x_out__ = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
-  }
-  x_out__ = NA_PTR_TYPE(rblapack_x_out__, doublecomplex*);
-  MEMCPY(x_out__, x, doublecomplex, NA_TOTAL(rblapack_x));
-  rblapack_x = rblapack_x_out__;
-  x = x_out__;
-  {
-    int shape[1];
-    shape[0] = 3;
-    rblapack_isave_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
-  }
-  isave_out__ = NA_PTR_TYPE(rblapack_isave_out__, integer*);
-  MEMCPY(isave_out__, isave, integer, NA_TOTAL(rblapack_isave));
-  rblapack_isave = rblapack_isave_out__;
-  isave = isave_out__;
-  v = ALLOC_N(doublecomplex, (n));
-
-  zlacn2_(&n, v, x, &est, &kase, isave);
-
-  free(v);
-  rblapack_est = rb_float_new((double)est);
-  rblapack_kase = INT2NUM(kase);
-  return rb_ary_new3(4, rblapack_x, rblapack_est, rblapack_kase, rblapack_isave);
-}
-
-void
-init_lapack_zlacn2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "zlacn2", rblapack_zlacn2, -1);
-}

data/ext/zlacon.c

@@ -1,80 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID zlacon_(integer* n, doublecomplex* v, doublecomplex* x, doublereal* est, integer* kase);
-
-
-static VALUE
-rblapack_zlacon(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_x;
-  doublecomplex *x; 
-  VALUE rblapack_est;
-  doublereal est; 
-  VALUE rblapack_kase;
-  integer kase; 
-  VALUE rblapack_x_out__;
-  doublecomplex *x_out__;
-  doublecomplex *v;
-
-  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  x, est, kase = NumRu::Lapack.zlacon( x, est, kase, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLACON( N, V, X, EST, KASE )\n\n*  Purpose\n*  =======\n*\n*  ZLACON estimates the 1-norm of a square, complex matrix A.\n*  Reverse communication is used for evaluating matrix-vector products.\n*\n\n*  Arguments\n*  =========\n*\n*  N      (input) INTEGER\n*         The order of the matrix.  N >= 1.\n*\n*  V      (workspace) COMPLEX*16 array, dimension (N)\n*         On the final return, V = A*W,  where  EST = norm(V)/norm(W)\n*         (W is not returned).\n*\n*  X      (input/output) COMPLEX*16 array, dimension (N)\n*         On an intermediate return, X should be overwritten by\n*               A * X,   if KASE=1,\n*               A' * X,  if KASE=2,\n*         where A' is the conjugate transpose of A, and ZLACON must be\n*         re-called with all the other parameters unchanged.\n*\n*  EST    (input/output) DOUBLE PRECISION\n*         On entry with KASE = 1 or 2 and JUMP = 3, EST should be\n*         unchanged from the previous call to ZLACON.\n*         On exit, EST is an estimate (a lower bound) for norm(A). \n*\n*  KASE   (input/output) INTEGER\n*         On the initial call to ZLACON, KASE should be 0.\n*         On an intermediate return, KASE will be 1 or 2, indicating\n*         whether X should be overwritten by A * X  or A' * X.\n*         On the final return from ZLACON, KASE will again be 0.\n*\n\n*  Further Details\n*  ======= =======\n*\n*  Contributed by Nick Higham, University of Manchester.\n*  Originally named CONEST, dated March 16, 1988.\n*\n*  Reference: N.J. Higham, \"FORTRAN codes for estimating the one-norm of\n*  a real or complex matrix, with applications to condition estimation\",\n*  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.\n*\n*  Last modified:  April, 1999\n*\n*  =====================================================================\n*\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  x, est, kase = NumRu::Lapack.zlacon( x, est, kase, [: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_x = argv[0];
-  rblapack_est = argv[1];
-  rblapack_kase = argv[2];
-  if (argc == 3) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  if (!NA_IsNArray(rblapack_x))
-    rb_raise(rb_eArgError, "x (1th argument) must be NArray");
-  if (NA_RANK(rblapack_x) != 1)
-    rb_raise(rb_eArgError, "rank of x (1th argument) must be %d", 1);
-  n = NA_SHAPE0(rblapack_x);
-  if (NA_TYPE(rblapack_x) != NA_DCOMPLEX)
-    rblapack_x = na_change_type(rblapack_x, NA_DCOMPLEX);
-  x = NA_PTR_TYPE(rblapack_x, doublecomplex*);
-  kase = NUM2INT(rblapack_kase);
-  est = NUM2DBL(rblapack_est);
-  {
-    int shape[1];
-    shape[0] = n;
-    rblapack_x_out__ = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
-  }
-  x_out__ = NA_PTR_TYPE(rblapack_x_out__, doublecomplex*);
-  MEMCPY(x_out__, x, doublecomplex, NA_TOTAL(rblapack_x));
-  rblapack_x = rblapack_x_out__;
-  x = x_out__;
-  v = ALLOC_N(doublecomplex, (n));
-
-  zlacon_(&n, v, x, &est, &kase);
-
-  free(v);
-  rblapack_est = rb_float_new((double)est);
-  rblapack_kase = INT2NUM(kase);
-  return rb_ary_new3(3, rblapack_x, rblapack_est, rblapack_kase);
-}
-
-void
-init_lapack_zlacon(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "zlacon", rblapack_zlacon, -1);
-}

data/ext/zlacp2.c

@@ -1,77 +0,0 @@
-#include "rb_lapack.h"
-
-extern VOID zlacp2_(char* uplo, integer* m, integer* n, doublereal* a, integer* lda, doublecomplex* b, integer* ldb);
-
-
-static VALUE
-rblapack_zlacp2(int argc, VALUE *argv, VALUE self){
-  VALUE rblapack_uplo;
-  char uplo; 
-  VALUE rblapack_m;
-  integer m; 
-  VALUE rblapack_a;
-  doublereal *a; 
-  VALUE rblapack_b;
-  doublecomplex *b; 
-
-  integer lda;
-  integer n;
-  integer ldb;
-
-  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  b = NumRu::Lapack.zlacp2( uplo, m, a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLACP2( UPLO, M, N, A, LDA, B, LDB )\n\n*  Purpose\n*  =======\n*\n*  ZLACP2 copies all or part of a real two-dimensional matrix A to a\n*  complex matrix B.\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          Specifies the part of the matrix A to be copied to B.\n*          = 'U':      Upper triangular part\n*          = 'L':      Lower triangular part\n*          Otherwise:  All of the matrix A\n*\n*  M       (input) INTEGER\n*          The number of rows of the matrix A.  M >= 0.\n*\n*  N       (input) INTEGER\n*          The number of columns of the matrix A.  N >= 0.\n*\n*  A       (input) DOUBLE PRECISION array, dimension (LDA,N)\n*          The m by n matrix A.  If UPLO = 'U', only the upper trapezium\n*          is accessed; if UPLO = 'L', only the lower trapezium is\n*          accessed.\n*\n*  LDA     (input) INTEGER\n*          The leading dimension of the array A.  LDA >= max(1,M).\n*\n*  B       (output) COMPLEX*16 array, dimension (LDB,N)\n*          On exit, B = A in the locations specified by UPLO.\n*\n*  LDB     (input) INTEGER\n*          The leading dimension of the array B.  LDB >= max(1,M).\n*\n\n*  =====================================================================\n*\n*     .. Local Scalars ..\n      INTEGER            I, J\n*     ..\n*     .. External Functions ..\n      LOGICAL            LSAME\n      EXTERNAL           LSAME\n*     ..\n*     .. Intrinsic Functions ..\n      INTRINSIC          MIN\n*     ..\n\n");
-      return Qnil;
-    }
-    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
-      printf("%s\n", "USAGE:\n  b = NumRu::Lapack.zlacp2( uplo, m, a, [: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_uplo = argv[0];
-  rblapack_m = argv[1];
-  rblapack_a = argv[2];
-  if (argc == 3) {
-  } else if (rblapack_options != Qnil) {
-  } else {
-  }
-
-  uplo = StringValueCStr(rblapack_uplo)[0];
-  if (!NA_IsNArray(rblapack_a))
-    rb_raise(rb_eArgError, "a (3th argument) must be NArray");
-  if (NA_RANK(rblapack_a) != 2)
-    rb_raise(rb_eArgError, "rank of a (3th argument) must be %d", 2);
-  lda = NA_SHAPE0(rblapack_a);
-  n = NA_SHAPE1(rblapack_a);
-  if (NA_TYPE(rblapack_a) != NA_DFLOAT)
-    rblapack_a = na_change_type(rblapack_a, NA_DFLOAT);
-  a = NA_PTR_TYPE(rblapack_a, doublereal*);
-  m = NUM2INT(rblapack_m);
-  ldb = MAX(1,m);
-  {
-    int shape[2];
-    shape[0] = ldb;
-    shape[1] = n;
-    rblapack_b = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
-  }
-  b = NA_PTR_TYPE(rblapack_b, doublecomplex*);
-
-  zlacp2_(&uplo, &m, &n, a, &lda, b, &ldb);
-
-  return rblapack_b;
-}
-
-void
-init_lapack_zlacp2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
-  sHelp = sH;
-  sUsage = sU;
-  rblapack_ZERO = zero;
-
-  rb_define_module_function(mLapack, "zlacp2", rblapack_zlacp2, -1);
-}