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
|
#include "rb_lapack.h"
extern VOID zgehd2_(integer* n, integer* ilo, integer* ihi, doublecomplex* a, integer* lda, doublecomplex* tau, doublecomplex* work, integer* info);
static VALUE
rblapack_zgehd2(int argc, VALUE *argv, VALUE self){
VALUE rblapack_ilo;
integer ilo;
VALUE rblapack_ihi;
integer ihi;
VALUE rblapack_a;
doublecomplex *a;
VALUE rblapack_tau;
doublecomplex *tau;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
doublecomplex *a_out__;
doublecomplex *work;
integer lda;
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 tau, info, a = NumRu::Lapack.zgehd2( ilo, ihi, a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE ZGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO )\n\n* Purpose\n* =======\n*\n* ZGEHD2 reduces a complex general matrix A to upper Hessenberg form H\n* by a unitary similarity transformation: Q' * A * Q = H .\n*\n\n* Arguments\n* =========\n*\n* N (input) INTEGER\n* The order of the matrix A. N >= 0.\n*\n* ILO (input) INTEGER\n* IHI (input) INTEGER\n* It is assumed that A is already upper triangular in rows\n* and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally\n* set by a previous call to ZGEBAL; otherwise they should be\n* set to 1 and N respectively. See Further Details.\n* 1 <= ILO <= IHI <= max(1,N).\n*\n* A (input/output) COMPLEX*16 array, dimension (LDA,N)\n* On entry, the n by n general matrix to be reduced.\n* On exit, the upper triangle and the first subdiagonal of A\n* are overwritten with the upper Hessenberg matrix H, and the\n* elements below the first subdiagonal, with the array TAU,\n* represent the unitary matrix Q as a product of elementary\n* reflectors. See Further Details.\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,N).\n*\n* TAU (output) COMPLEX*16 array, dimension (N-1)\n* The scalar factors of the elementary reflectors (see Further\n* Details).\n*\n* WORK (workspace) COMPLEX*16 array, dimension (N)\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* Further Details\n* ===============\n*\n* The matrix Q is represented as a product of (ihi-ilo) elementary\n* reflectors\n*\n* Q = H(ilo) H(ilo+1) . . . H(ihi-1).\n*\n* Each H(i) has the form\n*\n* H(i) = I - tau * v * v'\n*\n* where tau is a complex scalar, and v is a complex vector with\n* v(1:i) = 0, v(i+1) = 1 and v(ihi+1:n) = 0; v(i+2:ihi) is stored on\n* exit in A(i+2:ihi,i), and tau in TAU(i).\n*\n* The contents of A are illustrated by the following example, with\n* n = 7, ilo = 2 and ihi = 6:\n*\n* on entry, on exit,\n*\n* ( a a a a a a a ) ( a a h h h h a )\n* ( a a a a a a ) ( a h h h h a )\n* ( a a a a a a ) ( h h h h h h )\n* ( a a a a a a ) ( v2 h h h h h )\n* ( a a a a a a ) ( v2 v3 h h h h )\n* ( a a a a a a ) ( v2 v3 v4 h h h )\n* ( a ) ( a )\n*\n* where a denotes an element of the original matrix A, h denotes a\n* modified element of the upper Hessenberg matrix H, and vi denotes an\n* element of the vector defining H(i).\n*\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n tau, info, a = NumRu::Lapack.zgehd2( ilo, ihi, 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_ilo = argv[0];
rblapack_ihi = argv[1];
rblapack_a = argv[2];
if (argc == 3) {
} else if (rblapack_options != Qnil) {
} else {
}
ilo = NUM2INT(rblapack_ilo);
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*);
ihi = NUM2INT(rblapack_ihi);
{
na_shape_t shape[1];
shape[0] = n-1;
rblapack_tau = na_make_object(NA_DCOMPLEX, 1, shape, cNArray);
}
tau = NA_PTR_TYPE(rblapack_tau, doublecomplex*);
{
na_shape_t 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__;
work = ALLOC_N(doublecomplex, (n));
zgehd2_(&n, &ilo, &ihi, a, &lda, tau, work, &info);
free(work);
rblapack_info = INT2NUM(info);
return rb_ary_new3(3, rblapack_tau, rblapack_info, rblapack_a);
}
void
init_lapack_zgehd2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "zgehd2", rblapack_zgehd2, -1);
}
|
