1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
|
#include "rb_lapack.h"
extern VOID zupmtr_(char* side, char* uplo, char* trans, integer* m, integer* n, doublecomplex* ap, doublecomplex* tau, doublecomplex* c, integer* ldc, doublecomplex* work, integer* info);
static VALUE
rblapack_zupmtr(int argc, VALUE *argv, VALUE self){
VALUE rblapack_side;
char side;
VALUE rblapack_uplo;
char uplo;
VALUE rblapack_trans;
char trans;
VALUE rblapack_m;
integer m;
VALUE rblapack_ap;
doublecomplex *ap;
VALUE rblapack_tau;
doublecomplex *tau;
VALUE rblapack_c;
doublecomplex *c;
VALUE rblapack_info;
integer info;
VALUE rblapack_c_out__;
doublecomplex *c_out__;
doublecomplex *work;
integer ldc;
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 info, c = NumRu::Lapack.zupmtr( side, uplo, trans, m, ap, tau, c, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE ZUPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, INFO )\n\n* Purpose\n* =======\n*\n* ZUPMTR overwrites the general complex M-by-N matrix C with\n*\n* SIDE = 'L' SIDE = 'R'\n* TRANS = 'N': Q * C C * Q\n* TRANS = 'C': Q**H * C C * Q**H\n*\n* where Q is a complex unitary matrix of order nq, with nq = m if\n* SIDE = 'L' and nq = n if SIDE = 'R'. Q is defined as the product of\n* nq-1 elementary reflectors, as returned by ZHPTRD using packed\n* storage:\n*\n* if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);\n*\n* if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).\n*\n\n* Arguments\n* =========\n*\n* SIDE (input) CHARACTER*1\n* = 'L': apply Q or Q**H from the Left;\n* = 'R': apply Q or Q**H from the Right.\n*\n* UPLO (input) CHARACTER*1\n* = 'U': Upper triangular packed storage used in previous\n* call to ZHPTRD;\n* = 'L': Lower triangular packed storage used in previous\n* call to ZHPTRD.\n*\n* TRANS (input) CHARACTER*1\n* = 'N': No transpose, apply Q;\n* = 'C': Conjugate transpose, apply Q**H.\n*\n* M (input) INTEGER\n* The number of rows of the matrix C. M >= 0.\n*\n* N (input) INTEGER\n* The number of columns of the matrix C. N >= 0.\n*\n* AP (input) COMPLEX*16 array, dimension\n* (M*(M+1)/2) if SIDE = 'L'\n* (N*(N+1)/2) if SIDE = 'R'\n* The vectors which define the elementary reflectors, as\n* returned by ZHPTRD. AP is modified by the routine but\n* restored on exit.\n*\n* TAU (input) COMPLEX*16 array, dimension (M-1) if SIDE = 'L'\n* or (N-1) if SIDE = 'R'\n* TAU(i) must contain the scalar factor of the elementary\n* reflector H(i), as returned by ZHPTRD.\n*\n* C (input/output) COMPLEX*16 array, dimension (LDC,N)\n* On entry, the M-by-N matrix C.\n* On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q.\n*\n* LDC (input) INTEGER\n* The leading dimension of the array C. LDC >= max(1,M).\n*\n* WORK (workspace) COMPLEX*16 array, dimension\n* (N) if SIDE = 'L'\n* (M) if SIDE = 'R'\n*\n* INFO (output) INTEGER\n* = 0: successful exit\n* < 0: if INFO = -i, the i-th argument had an illegal value\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n info, c = NumRu::Lapack.zupmtr( side, uplo, trans, m, ap, tau, c, [: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_side = argv[0];
rblapack_uplo = argv[1];
rblapack_trans = argv[2];
rblapack_m = argv[3];
rblapack_ap = argv[4];
rblapack_tau = argv[5];
rblapack_c = argv[6];
if (argc == 7) {
} else if (rblapack_options != Qnil) {
} else {
}
side = StringValueCStr(rblapack_side)[0];
trans = StringValueCStr(rblapack_trans)[0];
if (!NA_IsNArray(rblapack_c))
rb_raise(rb_eArgError, "c (7th argument) must be NArray");
if (NA_RANK(rblapack_c) != 2)
rb_raise(rb_eArgError, "rank of c (7th argument) must be %d", 2);
ldc = NA_SHAPE0(rblapack_c);
n = NA_SHAPE1(rblapack_c);
if (NA_TYPE(rblapack_c) != NA_DCOMPLEX)
rblapack_c = na_change_type(rblapack_c, NA_DCOMPLEX);
c = NA_PTR_TYPE(rblapack_c, doublecomplex*);
uplo = StringValueCStr(rblapack_uplo)[0];
m = NUM2INT(rblapack_m);
if (!NA_IsNArray(rblapack_tau))
rb_raise(rb_eArgError, "tau (6th argument) must be NArray");
if (NA_RANK(rblapack_tau) != 1)
rb_raise(rb_eArgError, "rank of tau (6th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_tau) != (m-1))
rb_raise(rb_eRuntimeError, "shape 0 of tau must be %d", m-1);
if (NA_TYPE(rblapack_tau) != NA_DCOMPLEX)
rblapack_tau = na_change_type(rblapack_tau, NA_DCOMPLEX);
tau = NA_PTR_TYPE(rblapack_tau, doublecomplex*);
if (!NA_IsNArray(rblapack_ap))
rb_raise(rb_eArgError, "ap (5th argument) must be NArray");
if (NA_RANK(rblapack_ap) != 1)
rb_raise(rb_eArgError, "rank of ap (5th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_ap) != (m*(m+1)/2))
rb_raise(rb_eRuntimeError, "shape 0 of ap must be %d", m*(m+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*);
{
na_shape_t shape[2];
shape[0] = ldc;
shape[1] = n;
rblapack_c_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
}
c_out__ = NA_PTR_TYPE(rblapack_c_out__, doublecomplex*);
MEMCPY(c_out__, c, doublecomplex, NA_TOTAL(rblapack_c));
rblapack_c = rblapack_c_out__;
c = c_out__;
work = ALLOC_N(doublecomplex, (lsame_(&side,"L") ? n : lsame_(&side,"R") ? m : 0));
zupmtr_(&side, &uplo, &trans, &m, &n, ap, tau, c, &ldc, work, &info);
free(work);
rblapack_info = INT2NUM(info);
return rb_ary_new3(2, rblapack_info, rblapack_c);
}
void
init_lapack_zupmtr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "zupmtr", rblapack_zupmtr, -1);
}
|