ruby-lapack 1.7 → 1.7.1

data/ext/zlaqr4.c

@@ -0,0 +1,147 @@
+#include "rb_lapack.h"
+
+extern VOID zlaqr4_(logical* wantt, logical* wantz, integer* n, integer* ilo, integer* ihi, doublecomplex* h, integer* ldh, doublecomplex* w, integer* iloz, integer* ihiz, doublecomplex* z, integer* ldz, doublecomplex* work, integer* lwork, integer* info);
+
+
+static VALUE
+rblapack_zlaqr4(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_wantt;
+  logical wantt; 
+  VALUE rblapack_wantz;
+  logical wantz; 
+  VALUE rblapack_ilo;
+  integer ilo; 
+  VALUE rblapack_h;
+  doublecomplex *h; 
+  VALUE rblapack_iloz;
+  integer iloz; 
+  VALUE rblapack_ihiz;
+  integer ihiz; 
+  VALUE rblapack_z;
+  doublecomplex *z; 
+  VALUE rblapack_lwork;
+  integer lwork; 
+  VALUE rblapack_w;
+  doublecomplex *w; 
+  VALUE rblapack_work;
+  doublecomplex *work; 
+  VALUE rblapack_info;
+  integer info; 
+  VALUE rblapack_h_out__;
+  doublecomplex *h_out__;
+  VALUE rblapack_z_out__;
+  doublecomplex *z_out__;
+
+  integer ldh;
+  integer n;
+  integer ldz;
+  integer ihi;
+
+  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  w, work, info, h, z = NumRu::Lapack.zlaqr4( wantt, wantz, ilo, h, iloz, ihiz, z, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )\n\n*     Purpose\n*     =======\n*\n*     ZLAQR4 computes the eigenvalues of a Hessenberg matrix H\n*     and, optionally, the matrices T and Z from the Schur decomposition\n*     H = Z T Z**H, where T is an upper triangular matrix (the\n*     Schur form), and Z is the unitary matrix of Schur vectors.\n*\n*     Optionally Z may be postmultiplied into an input unitary\n*     matrix Q so that this routine can give the Schur factorization\n*     of a matrix A which has been reduced to the Hessenberg form H\n*     by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.\n*\n\n*     Arguments\n*     =========\n*\n*     WANTT   (input) LOGICAL\n*          = .TRUE. : the full Schur form T is required;\n*          = .FALSE.: only eigenvalues are required.\n*\n*     WANTZ   (input) LOGICAL\n*          = .TRUE. : the matrix of Schur vectors Z is required;\n*          = .FALSE.: Schur vectors are not required.\n*\n*     N     (input) INTEGER\n*           The order of the matrix H.  N .GE. 0.\n*\n*     ILO   (input) INTEGER\n*     IHI   (input) INTEGER\n*           It is assumed that H is already upper triangular in rows\n*           and columns 1:ILO-1 and IHI+1:N and, if ILO.GT.1,\n*           H(ILO,ILO-1) is zero. ILO and IHI are normally set by a\n*           previous call to ZGEBAL, and then passed to ZGEHRD when the\n*           matrix output by ZGEBAL is reduced to Hessenberg form.\n*           Otherwise, ILO and IHI should be set to 1 and N,\n*           respectively.  If N.GT.0, then 1.LE.ILO.LE.IHI.LE.N.\n*           If N = 0, then ILO = 1 and IHI = 0.\n*\n*     H     (input/output) COMPLEX*16 array, dimension (LDH,N)\n*           On entry, the upper Hessenberg matrix H.\n*           On exit, if INFO = 0 and WANTT is .TRUE., then H\n*           contains the upper triangular matrix T from the Schur\n*           decomposition (the Schur form). If INFO = 0 and WANT is\n*           .FALSE., then the contents of H are unspecified on exit.\n*           (The output value of H when INFO.GT.0 is given under the\n*           description of INFO below.)\n*\n*           This subroutine may explicitly set H(i,j) = 0 for i.GT.j and\n*           j = 1, 2, ... ILO-1 or j = IHI+1, IHI+2, ... N.\n*\n*     LDH   (input) INTEGER\n*           The leading dimension of the array H. LDH .GE. max(1,N).\n*\n*     W        (output) COMPLEX*16 array, dimension (N)\n*           The computed eigenvalues of H(ILO:IHI,ILO:IHI) are stored\n*           in W(ILO:IHI). If WANTT is .TRUE., then the eigenvalues are\n*           stored in the same order as on the diagonal of the Schur\n*           form returned in H, with W(i) = H(i,i).\n*\n*     Z     (input/output) COMPLEX*16 array, dimension (LDZ,IHI)\n*           If WANTZ is .FALSE., then Z is not referenced.\n*           If WANTZ is .TRUE., then Z(ILO:IHI,ILOZ:IHIZ) is\n*           replaced by Z(ILO:IHI,ILOZ:IHIZ)*U where U is the\n*           orthogonal Schur factor of H(ILO:IHI,ILO:IHI).\n*           (The output value of Z when INFO.GT.0 is given under\n*           the description of INFO below.)\n*\n*     LDZ   (input) INTEGER\n*           The leading dimension of the array Z.  if WANTZ is .TRUE.\n*           then LDZ.GE.MAX(1,IHIZ).  Otherwize, LDZ.GE.1.\n*\n*     WORK  (workspace/output) COMPLEX*16 array, dimension LWORK\n*           On exit, if LWORK = -1, WORK(1) returns an estimate of\n*           the optimal value for LWORK.\n*\n*     LWORK (input) INTEGER\n*           The dimension of the array WORK.  LWORK .GE. max(1,N)\n*           is sufficient, but LWORK typically as large as 6*N may\n*           be required for optimal performance.  A workspace query\n*           to determine the optimal workspace size is recommended.\n*\n*           If LWORK = -1, then ZLAQR4 does a workspace query.\n*           In this case, ZLAQR4 checks the input parameters and\n*           estimates the optimal workspace size for the given\n*           values of N, ILO and IHI.  The estimate is returned\n*           in WORK(1).  No error message related to LWORK is\n*           issued by XERBLA.  Neither H nor Z are accessed.\n*\n*\n*     INFO  (output) INTEGER\n*             =  0:  successful exit\n*           .GT. 0:  if INFO = i, ZLAQR4 failed to compute all of\n*                the eigenvalues.  Elements 1:ilo-1 and i+1:n of WR\n*                and WI contain those eigenvalues which have been\n*                successfully computed.  (Failures are rare.)\n*\n*                If INFO .GT. 0 and WANT is .FALSE., then on exit,\n*                the remaining unconverged eigenvalues are the eigen-\n*                values of the upper Hessenberg matrix rows and\n*                columns ILO through INFO of the final, output\n*                value of H.\n*\n*                If INFO .GT. 0 and WANTT is .TRUE., then on exit\n*\n*           (*)  (initial value of H)*U  = U*(final value of H)\n*\n*                where U is a unitary matrix.  The final\n*                value of  H is upper Hessenberg and triangular in\n*                rows and columns INFO+1 through IHI.\n*\n*                If INFO .GT. 0 and WANTZ is .TRUE., then on exit\n*\n*                  (final value of Z(ILO:IHI,ILOZ:IHIZ)\n*                   =  (initial value of Z(ILO:IHI,ILOZ:IHIZ)*U\n*\n*                where U is the unitary matrix in (*) (regard-\n*                less of the value of WANTT.)\n*\n*                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not\n*                accessed.\n*\n\n*     ================================================================\n*     Based on contributions by\n*        Karen Braman and Ralph Byers, Department of Mathematics,\n*        University of Kansas, USA\n*\n*     ================================================================\n*     References:\n*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR\n*       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3\n*       Performance, SIAM Journal of Matrix Analysis, volume 23, pages\n*       929--947, 2002.\n*\n*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR\n*       Algorithm Part II: Aggressive Early Deflation, SIAM Journal\n*       of Matrix Analysis, volume 23, pages 948--973, 2002.\n*\n*     ================================================================\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  w, work, info, h, z = NumRu::Lapack.zlaqr4( wantt, wantz, ilo, h, iloz, ihiz, z, [:lwork => lwork, :usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 7 && argc != 8)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 7)", argc);
+  rblapack_wantt = argv[0];
+  rblapack_wantz = argv[1];
+  rblapack_ilo = argv[2];
+  rblapack_h = argv[3];
+  rblapack_iloz = argv[4];
+  rblapack_ihiz = argv[5];
+  rblapack_z = argv[6];
+  if (argc == 8) {
+    rblapack_lwork = argv[7];
+  } else if (rblapack_options != Qnil) {
+    rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
+  } else {
+    rblapack_lwork = Qnil;
+  }
+
+  wantt = (rblapack_wantt == Qtrue);
+  ilo = NUM2INT(rblapack_ilo);
+  iloz = NUM2INT(rblapack_iloz);
+  wantz = (rblapack_wantz == Qtrue);
+  ihiz = NUM2INT(rblapack_ihiz);
+  ldz = wantz ? MAX(1,ihiz) : 1;
+  if (!NA_IsNArray(rblapack_h))
+    rb_raise(rb_eArgError, "h (4th argument) must be NArray");
+  if (NA_RANK(rblapack_h) != 2)
+    rb_raise(rb_eArgError, "rank of h (4th argument) must be %d", 2);
+  ldh = NA_SHAPE0(rblapack_h);
+  n = NA_SHAPE1(rblapack_h);
+  if (NA_TYPE(rblapack_h) != NA_DCOMPLEX)
+    rblapack_h = na_change_type(rblapack_h, NA_DCOMPLEX);
+  h = NA_PTR_TYPE(rblapack_h, doublecomplex*);
+  if (rblapack_lwork == Qnil)
+    lwork = n;
+  else {
+    lwork = NUM2INT(rblapack_lwork);
+  }
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (7th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 2)
+    rb_raise(rb_eArgError, "rank of z (7th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_z) != ldz)
+    rb_raise(rb_eRuntimeError, "shape 0 of z must be wantz ? MAX(1,ihiz) : 1");
+  ihi = NA_SHAPE1(rblapack_z);
+  if (NA_TYPE(rblapack_z) != NA_DCOMPLEX)
+    rblapack_z = na_change_type(rblapack_z, NA_DCOMPLEX);
+  z = NA_PTR_TYPE(rblapack_z, doublecomplex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = n;
+    rblapack_w = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
+  }
+  w = NA_PTR_TYPE(rblapack_w, doublecomplex*);
+  {
+    na_shape_t shape[1];
+    shape[0] = MAX(1,lwork);
+    rblapack_work = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
+  }
+  work = NA_PTR_TYPE(rblapack_work, doublecomplex*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldh;
+    shape[1] = n;
+    rblapack_h_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  h_out__ = NA_PTR_TYPE(rblapack_h_out__, doublecomplex*);
+  MEMCPY(h_out__, h, doublecomplex, NA_TOTAL(rblapack_h));
+  rblapack_h = rblapack_h_out__;
+  h = h_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldz;
+    shape[1] = ihi;
+    rblapack_z_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  z_out__ = NA_PTR_TYPE(rblapack_z_out__, doublecomplex*);
+  MEMCPY(z_out__, z, doublecomplex, NA_TOTAL(rblapack_z));
+  rblapack_z = rblapack_z_out__;
+  z = z_out__;
+
+  zlaqr4_(&wantt, &wantz, &n, &ilo, &ihi, h, &ldh, w, &iloz, &ihiz, z, &ldz, work, &lwork, &info);
+
+  rblapack_info = INT2NUM(info);
+  return rb_ary_new3(5, rblapack_w, rblapack_work, rblapack_info, rblapack_h, rblapack_z);
+}
+
+void
+init_lapack_zlaqr4(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlaqr4", rblapack_zlaqr4, -1);
+}

data/ext/zlaqr5.c

@@ -0,0 +1,179 @@
+#include "rb_lapack.h"
+
+extern VOID zlaqr5_(logical* wantt, logical* wantz, integer* kacc22, integer* n, integer* ktop, integer* kbot, integer* nshfts, doublecomplex* s, doublecomplex* h, integer* ldh, integer* iloz, integer* ihiz, doublecomplex* z, integer* ldz, doublecomplex* v, integer* ldv, doublecomplex* u, integer* ldu, integer* nv, doublecomplex* wv, integer* ldwv, integer* nh, doublecomplex* wh, integer* ldwh);
+
+
+static VALUE
+rblapack_zlaqr5(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_wantt;
+  logical wantt; 
+  VALUE rblapack_wantz;
+  logical wantz; 
+  VALUE rblapack_kacc22;
+  integer kacc22; 
+  VALUE rblapack_ktop;
+  integer ktop; 
+  VALUE rblapack_kbot;
+  integer kbot; 
+  VALUE rblapack_s;
+  doublecomplex *s; 
+  VALUE rblapack_h;
+  doublecomplex *h; 
+  VALUE rblapack_iloz;
+  integer iloz; 
+  VALUE rblapack_ihiz;
+  integer ihiz; 
+  VALUE rblapack_z;
+  doublecomplex *z; 
+  VALUE rblapack_ldz;
+  integer ldz; 
+  VALUE rblapack_nv;
+  integer nv; 
+  VALUE rblapack_nh;
+  integer nh; 
+  VALUE rblapack_s_out__;
+  doublecomplex *s_out__;
+  VALUE rblapack_h_out__;
+  doublecomplex *h_out__;
+  VALUE rblapack_z_out__;
+  doublecomplex *z_out__;
+  doublecomplex *v;
+  doublecomplex *u;
+  doublecomplex *wv;
+  doublecomplex *wh;
+
+  integer nshfts;
+  integer ldh;
+  integer n;
+  integer ldv;
+  integer ldu;
+  integer ldwv;
+  integer ldwh;
+
+  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  s, h, z = NumRu::Lapack.zlaqr5( wantt, wantz, kacc22, ktop, kbot, s, h, iloz, ihiz, z, ldz, nv, nh, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S, H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV, WV, LDWV, NH, WH, LDWH )\n\n*     This auxiliary subroutine called by ZLAQR0 performs a\n*     single small-bulge multi-shift QR sweep.\n*\n\n*      WANTT  (input) logical scalar\n*             WANTT = .true. if the triangular Schur factor\n*             is being computed.  WANTT is set to .false. otherwise.\n*\n*      WANTZ  (input) logical scalar\n*             WANTZ = .true. if the unitary Schur factor is being\n*             computed.  WANTZ is set to .false. otherwise.\n*\n*      KACC22 (input) integer with value 0, 1, or 2.\n*             Specifies the computation mode of far-from-diagonal\n*             orthogonal updates.\n*        = 0: ZLAQR5 does not accumulate reflections and does not\n*             use matrix-matrix multiply to update far-from-diagonal\n*             matrix entries.\n*        = 1: ZLAQR5 accumulates reflections and uses matrix-matrix\n*             multiply to update the far-from-diagonal matrix entries.\n*        = 2: ZLAQR5 accumulates reflections, uses matrix-matrix\n*             multiply to update the far-from-diagonal matrix entries,\n*             and takes advantage of 2-by-2 block structure during\n*             matrix multiplies.\n*\n*      N      (input) integer scalar\n*             N is the order of the Hessenberg matrix H upon which this\n*             subroutine operates.\n*\n*      KTOP   (input) integer scalar\n*      KBOT   (input) integer scalar\n*             These are the first and last rows and columns of an\n*             isolated diagonal block upon which the QR sweep is to be\n*             applied. It is assumed without a check that\n*                       either KTOP = 1  or   H(KTOP,KTOP-1) = 0\n*             and\n*                       either KBOT = N  or   H(KBOT+1,KBOT) = 0.\n*\n*      NSHFTS (input) integer scalar\n*             NSHFTS gives the number of simultaneous shifts.  NSHFTS\n*             must be positive and even.\n*\n*      S      (input/output) COMPLEX*16 array of size (NSHFTS)\n*             S contains the shifts of origin that define the multi-\n*             shift QR sweep.  On output S may be reordered.\n*\n*      H      (input/output) COMPLEX*16 array of size (LDH,N)\n*             On input H contains a Hessenberg matrix.  On output a\n*             multi-shift QR sweep with shifts SR(J)+i*SI(J) is applied\n*             to the isolated diagonal block in rows and columns KTOP\n*             through KBOT.\n*\n*      LDH    (input) integer scalar\n*             LDH is the leading dimension of H just as declared in the\n*             calling procedure.  LDH.GE.MAX(1,N).\n*\n*      ILOZ   (input) INTEGER\n*      IHIZ   (input) INTEGER\n*             Specify the rows of Z to which transformations must be\n*             applied if WANTZ is .TRUE.. 1 .LE. ILOZ .LE. IHIZ .LE. N\n*\n*      Z      (input/output) COMPLEX*16 array of size (LDZ,IHI)\n*             If WANTZ = .TRUE., then the QR Sweep unitary\n*             similarity transformation is accumulated into\n*             Z(ILOZ:IHIZ,ILO:IHI) from the right.\n*             If WANTZ = .FALSE., then Z is unreferenced.\n*\n*      LDZ    (input) integer scalar\n*             LDA is the leading dimension of Z just as declared in\n*             the calling procedure. LDZ.GE.N.\n*\n*      V      (workspace) COMPLEX*16 array of size (LDV,NSHFTS/2)\n*\n*      LDV    (input) integer scalar\n*             LDV is the leading dimension of V as declared in the\n*             calling procedure.  LDV.GE.3.\n*\n*      U      (workspace) COMPLEX*16 array of size\n*             (LDU,3*NSHFTS-3)\n*\n*      LDU    (input) integer scalar\n*             LDU is the leading dimension of U just as declared in the\n*             in the calling subroutine.  LDU.GE.3*NSHFTS-3.\n*\n*      NH     (input) integer scalar\n*             NH is the number of columns in array WH available for\n*             workspace. NH.GE.1.\n*\n*      WH     (workspace) COMPLEX*16 array of size (LDWH,NH)\n*\n*      LDWH   (input) integer scalar\n*             Leading dimension of WH just as declared in the\n*             calling procedure.  LDWH.GE.3*NSHFTS-3.\n*\n*      NV     (input) integer scalar\n*             NV is the number of rows in WV agailable for workspace.\n*             NV.GE.1.\n*\n*      WV     (workspace) COMPLEX*16 array of size\n*             (LDWV,3*NSHFTS-3)\n*\n*      LDWV   (input) integer scalar\n*             LDWV is the leading dimension of WV as declared in the\n*             in the calling subroutine.  LDWV.GE.NV.\n*\n\n*     ================================================================\n*     Based on contributions by\n*        Karen Braman and Ralph Byers, Department of Mathematics,\n*        University of Kansas, USA\n*\n*     ================================================================\n*     Reference:\n*\n*     K. Braman, R. Byers and R. Mathias, The Multi-Shift QR\n*     Algorithm Part I: Maintaining Well Focused Shifts, and\n*     Level 3 Performance, SIAM Journal of Matrix Analysis,\n*     volume 23, pages 929--947, 2002.\n*\n*     ================================================================\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  s, h, z = NumRu::Lapack.zlaqr5( wantt, wantz, kacc22, ktop, kbot, s, h, iloz, ihiz, z, ldz, nv, nh, [:usage => usage, :help => help])\n");
+      return Qnil;
+    } 
+  } else
+    rblapack_options = Qnil;
+  if (argc != 13 && argc != 13)
+    rb_raise(rb_eArgError,"wrong number of arguments (%d for 13)", argc);
+  rblapack_wantt = argv[0];
+  rblapack_wantz = argv[1];
+  rblapack_kacc22 = argv[2];
+  rblapack_ktop = argv[3];
+  rblapack_kbot = argv[4];
+  rblapack_s = argv[5];
+  rblapack_h = argv[6];
+  rblapack_iloz = argv[7];
+  rblapack_ihiz = argv[8];
+  rblapack_z = argv[9];
+  rblapack_ldz = argv[10];
+  rblapack_nv = argv[11];
+  rblapack_nh = argv[12];
+  if (argc == 13) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  wantt = (rblapack_wantt == Qtrue);
+  kacc22 = NUM2INT(rblapack_kacc22);
+  kbot = NUM2INT(rblapack_kbot);
+  if (!NA_IsNArray(rblapack_h))
+    rb_raise(rb_eArgError, "h (7th argument) must be NArray");
+  if (NA_RANK(rblapack_h) != 2)
+    rb_raise(rb_eArgError, "rank of h (7th argument) must be %d", 2);
+  ldh = NA_SHAPE0(rblapack_h);
+  n = NA_SHAPE1(rblapack_h);
+  if (NA_TYPE(rblapack_h) != NA_DCOMPLEX)
+    rblapack_h = na_change_type(rblapack_h, NA_DCOMPLEX);
+  h = NA_PTR_TYPE(rblapack_h, doublecomplex*);
+  ihiz = NUM2INT(rblapack_ihiz);
+  ldz = NUM2INT(rblapack_ldz);
+  nh = NUM2INT(rblapack_nh);
+  ldv = 3;
+  wantz = (rblapack_wantz == Qtrue);
+  if (!NA_IsNArray(rblapack_s))
+    rb_raise(rb_eArgError, "s (6th argument) must be NArray");
+  if (NA_RANK(rblapack_s) != 1)
+    rb_raise(rb_eArgError, "rank of s (6th argument) must be %d", 1);
+  nshfts = NA_SHAPE0(rblapack_s);
+  if (NA_TYPE(rblapack_s) != NA_DCOMPLEX)
+    rblapack_s = na_change_type(rblapack_s, NA_DCOMPLEX);
+  s = NA_PTR_TYPE(rblapack_s, doublecomplex*);
+  if (!NA_IsNArray(rblapack_z))
+    rb_raise(rb_eArgError, "z (10th argument) must be NArray");
+  if (NA_RANK(rblapack_z) != 2)
+    rb_raise(rb_eArgError, "rank of z (10th argument) must be %d", 2);
+  if (NA_SHAPE0(rblapack_z) != (wantz ? ldz : 0))
+    rb_raise(rb_eRuntimeError, "shape 0 of z must be %d", wantz ? ldz : 0);
+  if (NA_SHAPE1(rblapack_z) != (wantz ? ihiz : 0))
+    rb_raise(rb_eRuntimeError, "shape 1 of z must be %d", wantz ? ihiz : 0);
+  if (NA_TYPE(rblapack_z) != NA_DCOMPLEX)
+    rblapack_z = na_change_type(rblapack_z, NA_DCOMPLEX);
+  z = NA_PTR_TYPE(rblapack_z, doublecomplex*);
+  ldwh = 3*nshfts-3;
+  ldu = 3*nshfts-3;
+  ktop = NUM2INT(rblapack_ktop);
+  nv = NUM2INT(rblapack_nv);
+  iloz = NUM2INT(rblapack_iloz);
+  ldwv = nv;
+  {
+    na_shape_t shape[1];
+    shape[0] = nshfts;
+    rblapack_s_out__ = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
+  }
+  s_out__ = NA_PTR_TYPE(rblapack_s_out__, doublecomplex*);
+  MEMCPY(s_out__, s, doublecomplex, NA_TOTAL(rblapack_s));
+  rblapack_s = rblapack_s_out__;
+  s = s_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = ldh;
+    shape[1] = n;
+    rblapack_h_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  h_out__ = NA_PTR_TYPE(rblapack_h_out__, doublecomplex*);
+  MEMCPY(h_out__, h, doublecomplex, NA_TOTAL(rblapack_h));
+  rblapack_h = rblapack_h_out__;
+  h = h_out__;
+  {
+    na_shape_t shape[2];
+    shape[0] = wantz ? ldz : 0;
+    shape[1] = wantz ? ihiz : 0;
+    rblapack_z_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  z_out__ = NA_PTR_TYPE(rblapack_z_out__, doublecomplex*);
+  MEMCPY(z_out__, z, doublecomplex, NA_TOTAL(rblapack_z));
+  rblapack_z = rblapack_z_out__;
+  z = z_out__;
+  v = ALLOC_N(doublecomplex, (ldv)*(nshfts/2));
+  u = ALLOC_N(doublecomplex, (ldu)*(3*nshfts-3));
+  wv = ALLOC_N(doublecomplex, (ldwv)*(3*nshfts-3));
+  wh = ALLOC_N(doublecomplex, (ldwh)*(MAX(1,nh)));
+
+  zlaqr5_(&wantt, &wantz, &kacc22, &n, &ktop, &kbot, &nshfts, s, h, &ldh, &iloz, &ihiz, z, &ldz, v, &ldv, u, &ldu, &nv, wv, &ldwv, &nh, wh, &ldwh);
+
+  free(v);
+  free(u);
+  free(wv);
+  free(wh);
+  return rb_ary_new3(3, rblapack_s, rblapack_h, rblapack_z);
+}
+
+void
+init_lapack_zlaqr5(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlaqr5", rblapack_zlaqr5, -1);
+}

data/ext/zlaqsb.c

@@ -0,0 +1,101 @@
+#include "rb_lapack.h"
+
+extern VOID zlaqsb_(char* uplo, integer* n, integer* kd, doublecomplex* ab, integer* ldab, doublereal* s, doublereal* scond, doublereal* amax, char* equed);
+
+
+static VALUE
+rblapack_zlaqsb(int argc, VALUE *argv, VALUE self){
+  VALUE rblapack_uplo;
+  char uplo; 
+  VALUE rblapack_kd;
+  integer kd; 
+  VALUE rblapack_ab;
+  doublecomplex *ab; 
+  VALUE rblapack_s;
+  doublereal *s; 
+  VALUE rblapack_scond;
+  doublereal scond; 
+  VALUE rblapack_amax;
+  doublereal amax; 
+  VALUE rblapack_equed;
+  char equed; 
+  VALUE rblapack_ab_out__;
+  doublecomplex *ab_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  equed, ab = NumRu::Lapack.zlaqsb( uplo, kd, ab, s, scond, amax, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n      SUBROUTINE ZLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )\n\n*  Purpose\n*  =======\n*\n*  ZLAQSB equilibrates a symmetric band matrix A using the scaling\n*  factors in the vector S.\n*\n\n*  Arguments\n*  =========\n*\n*  UPLO    (input) CHARACTER*1\n*          Specifies whether the upper or lower triangular part of the\n*          symmetric matrix A is stored.\n*          = 'U':  Upper triangular\n*          = 'L':  Lower triangular\n*\n*  N       (input) INTEGER\n*          The order of the matrix A.  N >= 0.\n*\n*  KD      (input) INTEGER\n*          The number of super-diagonals of the matrix A if UPLO = 'U',\n*          or the number of sub-diagonals if UPLO = 'L'.  KD >= 0.\n*\n*  AB      (input/output) COMPLEX*16 array, dimension (LDAB,N)\n*          On entry, the upper or lower triangle of the symmetric band\n*          matrix A, stored in the first KD+1 rows of the array.  The\n*          j-th column of A is stored in the j-th column of the array AB\n*          as follows:\n*          if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for max(1,j-kd)<=i<=j;\n*          if UPLO = 'L', AB(1+i-j,j)    = A(i,j) for j<=i<=min(n,j+kd).\n*\n*          On exit, if INFO = 0, the triangular factor U or L from the\n*          Cholesky factorization A = U'*U or A = L*L' of the band\n*          matrix A, in the same storage format as A.\n*\n*  LDAB    (input) INTEGER\n*          The leading dimension of the array AB.  LDAB >= KD+1.\n*\n*  S       (input) DOUBLE PRECISION array, dimension (N)\n*          The scale factors for A.\n*\n*  SCOND   (input) DOUBLE PRECISION\n*          Ratio of the smallest S(i) to the largest S(i).\n*\n*  AMAX    (input) DOUBLE PRECISION\n*          Absolute value of largest matrix entry.\n*\n*  EQUED   (output) CHARACTER*1\n*          Specifies whether or not equilibration was done.\n*          = 'N':  No equilibration.\n*          = 'Y':  Equilibration was done, i.e., A has been replaced by\n*                  diag(S) * A * diag(S).\n*\n*  Internal Parameters\n*  ===================\n*\n*  THRESH is a threshold value used to decide if scaling should be done\n*  based on the ratio of the scaling factors.  If SCOND < THRESH,\n*  scaling is done.\n*\n*  LARGE and SMALL are threshold values used to decide if scaling should\n*  be done based on the absolute size of the largest matrix element.\n*  If AMAX > LARGE or AMAX < SMALL, scaling is done.\n*\n\n*  =====================================================================\n*\n\n");
+      return Qnil;
+    }
+    if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
+      printf("%s\n", "USAGE:\n  equed, ab = NumRu::Lapack.zlaqsb( uplo, kd, ab, s, scond, amax, [: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_kd = argv[1];
+  rblapack_ab = argv[2];
+  rblapack_s = argv[3];
+  rblapack_scond = argv[4];
+  rblapack_amax = argv[5];
+  if (argc == 6) {
+  } else if (rblapack_options != Qnil) {
+  } else {
+  }
+
+  uplo = StringValueCStr(rblapack_uplo)[0];
+  if (!NA_IsNArray(rblapack_ab))
+    rb_raise(rb_eArgError, "ab (3th argument) must be NArray");
+  if (NA_RANK(rblapack_ab) != 2)
+    rb_raise(rb_eArgError, "rank of ab (3th argument) must be %d", 2);
+  ldab = NA_SHAPE0(rblapack_ab);
+  n = NA_SHAPE1(rblapack_ab);
+  if (NA_TYPE(rblapack_ab) != NA_DCOMPLEX)
+    rblapack_ab = na_change_type(rblapack_ab, NA_DCOMPLEX);
+  ab = NA_PTR_TYPE(rblapack_ab, doublecomplex*);
+  scond = NUM2DBL(rblapack_scond);
+  kd = NUM2INT(rblapack_kd);
+  amax = NUM2DBL(rblapack_amax);
+  if (!NA_IsNArray(rblapack_s))
+    rb_raise(rb_eArgError, "s (4th argument) must be NArray");
+  if (NA_RANK(rblapack_s) != 1)
+    rb_raise(rb_eArgError, "rank of s (4th argument) must be %d", 1);
+  if (NA_SHAPE0(rblapack_s) != n)
+    rb_raise(rb_eRuntimeError, "shape 0 of s must be the same as shape 1 of ab");
+  if (NA_TYPE(rblapack_s) != NA_DFLOAT)
+    rblapack_s = na_change_type(rblapack_s, NA_DFLOAT);
+  s = NA_PTR_TYPE(rblapack_s, doublereal*);
+  {
+    na_shape_t shape[2];
+    shape[0] = ldab;
+    shape[1] = n;
+    rblapack_ab_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
+  }
+  ab_out__ = NA_PTR_TYPE(rblapack_ab_out__, doublecomplex*);
+  MEMCPY(ab_out__, ab, doublecomplex, NA_TOTAL(rblapack_ab));
+  rblapack_ab = rblapack_ab_out__;
+  ab = ab_out__;
+
+  zlaqsb_(&uplo, &n, &kd, ab, &ldab, s, &scond, &amax, &equed);
+
+  rblapack_equed = rb_str_new(&equed,1);
+  return rb_ary_new3(2, rblapack_equed, rblapack_ab);
+}
+
+void
+init_lapack_zlaqsb(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
+  sHelp = sH;
+  sUsage = sU;
+  rblapack_ZERO = zero;
+
+  rb_define_module_function(mLapack, "zlaqsb", rblapack_zlaqsb, -1);
+}

data/ext/zlaqsp.c

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