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
|
#include "rb_lapack.h"
extern VOID clartg_(complex* f, complex* g, real* cs, complex* sn, complex* r);
static VALUE
rblapack_clartg(int argc, VALUE *argv, VALUE self){
VALUE rblapack_f;
complex f;
VALUE rblapack_g;
complex g;
VALUE rblapack_cs;
real cs;
VALUE rblapack_sn;
complex sn;
VALUE rblapack_r;
complex r;
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 cs, sn, r = NumRu::Lapack.clartg( f, g, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE CLARTG( F, G, CS, SN, R )\n\n* Purpose\n* =======\n*\n* CLARTG generates a plane rotation so that\n*\n* [ CS SN ] [ F ] [ R ]\n* [ __ ] . [ ] = [ ] where CS**2 + |SN|**2 = 1.\n* [ -SN CS ] [ G ] [ 0 ]\n*\n* This is a faster version of the BLAS1 routine CROTG, except for\n* the following differences:\n* F and G are unchanged on return.\n* If G=0, then CS=1 and SN=0.\n* If F=0, then CS=0 and SN is chosen so that R is real.\n*\n\n* Arguments\n* =========\n*\n* F (input) COMPLEX\n* The first component of vector to be rotated.\n*\n* G (input) COMPLEX\n* The second component of vector to be rotated.\n*\n* CS (output) REAL\n* The cosine of the rotation.\n*\n* SN (output) COMPLEX\n* The sine of the rotation.\n*\n* R (output) COMPLEX\n* The nonzero component of the rotated vector.\n*\n\n* Further Details\n* ======= =======\n*\n* 3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel\n*\n* This version has a few statements commented out for thread safety\n* (machine parameters are computed on each entry). 10 feb 03, SJH.\n*\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n cs, sn, r = NumRu::Lapack.clartg( f, g, [:usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 2 && argc != 2)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 2)", argc);
rblapack_f = argv[0];
rblapack_g = argv[1];
if (argc == 2) {
} else if (rblapack_options != Qnil) {
} else {
}
f.r = (real)NUM2DBL(rb_funcall(rblapack_f, rb_intern("real"), 0));
f.i = (real)NUM2DBL(rb_funcall(rblapack_f, rb_intern("imag"), 0));
g.r = (real)NUM2DBL(rb_funcall(rblapack_g, rb_intern("real"), 0));
g.i = (real)NUM2DBL(rb_funcall(rblapack_g, rb_intern("imag"), 0));
clartg_(&f, &g, &cs, &sn, &r);
rblapack_cs = rb_float_new((double)cs);
rblapack_sn = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(sn.r)), rb_float_new((double)(sn.i)));
rblapack_r = rb_funcall(rb_gv_get("Complex"), rb_intern("new"), 2, rb_float_new((double)(r.r)), rb_float_new((double)(r.i)));
return rb_ary_new3(3, rblapack_cs, rblapack_sn, rblapack_r);
}
void
init_lapack_clartg(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "clartg", rblapack_clartg, -1);
}
|
