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
|
#include "rb_lapack.h"
extern VOID dlasr_(char* side, char* pivot, char* direct, integer* m, integer* n, doublereal* c, doublereal* s, doublereal* a, integer* lda);
static VALUE
rblapack_dlasr(int argc, VALUE *argv, VALUE self){
VALUE rblapack_side;
char side;
VALUE rblapack_pivot;
char pivot;
VALUE rblapack_direct;
char direct;
VALUE rblapack_m;
integer m;
VALUE rblapack_c;
doublereal *c;
VALUE rblapack_s;
doublereal *s;
VALUE rblapack_a;
doublereal *a;
VALUE rblapack_a_out__;
doublereal *a_out__;
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 a = NumRu::Lapack.dlasr( side, pivot, direct, m, c, s, a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE DLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA )\n\n* Purpose\n* =======\n*\n* DLASR applies a sequence of plane rotations to a real matrix A,\n* from either the left or the right.\n* \n* When SIDE = 'L', the transformation takes the form\n* \n* A := P*A\n* \n* and when SIDE = 'R', the transformation takes the form\n* \n* A := A*P**T\n* \n* where P is an orthogonal matrix consisting of a sequence of z plane\n* rotations, with z = M when SIDE = 'L' and z = N when SIDE = 'R',\n* and P**T is the transpose of P.\n* \n* When DIRECT = 'F' (Forward sequence), then\n* \n* P = P(z-1) * ... * P(2) * P(1)\n* \n* and when DIRECT = 'B' (Backward sequence), then\n* \n* P = P(1) * P(2) * ... * P(z-1)\n* \n* where P(k) is a plane rotation matrix defined by the 2-by-2 rotation\n* \n* R(k) = ( c(k) s(k) )\n* = ( -s(k) c(k) ).\n* \n* When PIVOT = 'V' (Variable pivot), the rotation is performed\n* for the plane (k,k+1), i.e., P(k) has the form\n* \n* P(k) = ( 1 )\n* ( ... )\n* ( 1 )\n* ( c(k) s(k) )\n* ( -s(k) c(k) )\n* ( 1 )\n* ( ... )\n* ( 1 )\n* \n* where R(k) appears as a rank-2 modification to the identity matrix in\n* rows and columns k and k+1.\n* \n* When PIVOT = 'T' (Top pivot), the rotation is performed for the\n* plane (1,k+1), so P(k) has the form\n* \n* P(k) = ( c(k) s(k) )\n* ( 1 )\n* ( ... )\n* ( 1 )\n* ( -s(k) c(k) )\n* ( 1 )\n* ( ... )\n* ( 1 )\n* \n* where R(k) appears in rows and columns 1 and k+1.\n* \n* Similarly, when PIVOT = 'B' (Bottom pivot), the rotation is\n* performed for the plane (k,z), giving P(k) the form\n* \n* P(k) = ( 1 )\n* ( ... )\n* ( 1 )\n* ( c(k) s(k) )\n* ( 1 )\n* ( ... )\n* ( 1 )\n* ( -s(k) c(k) )\n* \n* where R(k) appears in rows and columns k and z. The rotations are\n* performed without ever forming P(k) explicitly.\n*\n\n* Arguments\n* =========\n*\n* SIDE (input) CHARACTER*1\n* Specifies whether the plane rotation matrix P is applied to\n* A on the left or the right.\n* = 'L': Left, compute A := P*A\n* = 'R': Right, compute A:= A*P**T\n*\n* PIVOT (input) CHARACTER*1\n* Specifies the plane for which P(k) is a plane rotation\n* matrix.\n* = 'V': Variable pivot, the plane (k,k+1)\n* = 'T': Top pivot, the plane (1,k+1)\n* = 'B': Bottom pivot, the plane (k,z)\n*\n* DIRECT (input) CHARACTER*1\n* Specifies whether P is a forward or backward sequence of\n* plane rotations.\n* = 'F': Forward, P = P(z-1)*...*P(2)*P(1)\n* = 'B': Backward, P = P(1)*P(2)*...*P(z-1)\n*\n* M (input) INTEGER\n* The number of rows of the matrix A. If m <= 1, an immediate\n* return is effected.\n*\n* N (input) INTEGER\n* The number of columns of the matrix A. If n <= 1, an\n* immediate return is effected.\n*\n* C (input) DOUBLE PRECISION array, dimension\n* (M-1) if SIDE = 'L'\n* (N-1) if SIDE = 'R'\n* The cosines c(k) of the plane rotations.\n*\n* S (input) DOUBLE PRECISION array, dimension\n* (M-1) if SIDE = 'L'\n* (N-1) if SIDE = 'R'\n* The sines s(k) of the plane rotations. The 2-by-2 plane\n* rotation part of the matrix P(k), R(k), has the form\n* R(k) = ( c(k) s(k) )\n* ( -s(k) c(k) ).\n*\n* A (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n* The M-by-N matrix A. On exit, A is overwritten by P*A if\n* SIDE = 'R' or by A*P**T if SIDE = 'L'.\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,M).\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n a = NumRu::Lapack.dlasr( side, pivot, direct, m, c, s, a, [: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_pivot = argv[1];
rblapack_direct = argv[2];
rblapack_m = argv[3];
rblapack_c = argv[4];
rblapack_s = argv[5];
rblapack_a = argv[6];
if (argc == 7) {
} else if (rblapack_options != Qnil) {
} else {
}
side = StringValueCStr(rblapack_side)[0];
direct = StringValueCStr(rblapack_direct)[0];
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (7th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (7th 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*);
pivot = StringValueCStr(rblapack_pivot)[0];
m = NUM2INT(rblapack_m);
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);
if (NA_SHAPE0(rblapack_s) != (m-1))
rb_raise(rb_eRuntimeError, "shape 0 of s must be %d", m-1);
if (NA_TYPE(rblapack_s) != NA_DFLOAT)
rblapack_s = na_change_type(rblapack_s, NA_DFLOAT);
s = NA_PTR_TYPE(rblapack_s, doublereal*);
if (!NA_IsNArray(rblapack_c))
rb_raise(rb_eArgError, "c (5th argument) must be NArray");
if (NA_RANK(rblapack_c) != 1)
rb_raise(rb_eArgError, "rank of c (5th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_c) != (m-1))
rb_raise(rb_eRuntimeError, "shape 0 of c must be %d", m-1);
if (NA_TYPE(rblapack_c) != NA_DFLOAT)
rblapack_c = na_change_type(rblapack_c, NA_DFLOAT);
c = NA_PTR_TYPE(rblapack_c, doublereal*);
{
na_shape_t shape[2];
shape[0] = lda;
shape[1] = n;
rblapack_a_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
}
a_out__ = NA_PTR_TYPE(rblapack_a_out__, doublereal*);
MEMCPY(a_out__, a, doublereal, NA_TOTAL(rblapack_a));
rblapack_a = rblapack_a_out__;
a = a_out__;
dlasr_(&side, &pivot, &direct, &m, &n, c, s, a, &lda);
return rblapack_a;
}
void
init_lapack_dlasr(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "dlasr", rblapack_dlasr, -1);
}
|
