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
|
#include "rb_lapack.h"
extern VOID sspgst_(integer* itype, char* uplo, integer* n, real* ap, real* bp, integer* info);
static VALUE
rblapack_sspgst(int argc, VALUE *argv, VALUE self){
VALUE rblapack_itype;
integer itype;
VALUE rblapack_uplo;
char uplo;
VALUE rblapack_n;
integer n;
VALUE rblapack_ap;
real *ap;
VALUE rblapack_bp;
real *bp;
VALUE rblapack_info;
integer info;
VALUE rblapack_ap_out__;
real *ap_out__;
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, ap = NumRu::Lapack.sspgst( itype, uplo, n, ap, bp, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE SSPGST( ITYPE, UPLO, N, AP, BP, INFO )\n\n* Purpose\n* =======\n*\n* SSPGST reduces a real symmetric-definite generalized eigenproblem\n* to standard form, using packed storage.\n*\n* If ITYPE = 1, the problem is A*x = lambda*B*x,\n* and A is overwritten by inv(U**T)*A*inv(U) or inv(L)*A*inv(L**T)\n*\n* If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or\n* B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L.\n*\n* B must have been previously factorized as U**T*U or L*L**T by SPPTRF.\n*\n\n* Arguments\n* =========\n*\n* ITYPE (input) INTEGER\n* = 1: compute inv(U**T)*A*inv(U) or inv(L)*A*inv(L**T);\n* = 2 or 3: compute U*A*U**T or L**T*A*L.\n*\n* UPLO (input) CHARACTER*1\n* = 'U': Upper triangle of A is stored and B is factored as\n* U**T*U;\n* = 'L': Lower triangle of A is stored and B is factored as\n* L*L**T.\n*\n* N (input) INTEGER\n* The order of the matrices A and B. N >= 0.\n*\n* AP (input/output) REAL 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, if INFO = 0, the transformed matrix, stored in the\n* same format as A.\n*\n* BP (input) REAL array, dimension (N*(N+1)/2)\n* The triangular factor from the Cholesky factorization of B,\n* stored in the same format as A, as returned by SPPTRF.\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, ap = NumRu::Lapack.sspgst( itype, uplo, n, ap, bp, [: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_itype = argv[0];
rblapack_uplo = argv[1];
rblapack_n = argv[2];
rblapack_ap = argv[3];
rblapack_bp = argv[4];
if (argc == 5) {
} else if (rblapack_options != Qnil) {
} else {
}
itype = NUM2INT(rblapack_itype);
n = NUM2INT(rblapack_n);
if (!NA_IsNArray(rblapack_bp))
rb_raise(rb_eArgError, "bp (5th argument) must be NArray");
if (NA_RANK(rblapack_bp) != 1)
rb_raise(rb_eArgError, "rank of bp (5th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_bp) != (n*(n+1)/2))
rb_raise(rb_eRuntimeError, "shape 0 of bp must be %d", n*(n+1)/2);
if (NA_TYPE(rblapack_bp) != NA_SFLOAT)
rblapack_bp = na_change_type(rblapack_bp, NA_SFLOAT);
bp = NA_PTR_TYPE(rblapack_bp, real*);
uplo = StringValueCStr(rblapack_uplo)[0];
if (!NA_IsNArray(rblapack_ap))
rb_raise(rb_eArgError, "ap (4th argument) must be NArray");
if (NA_RANK(rblapack_ap) != 1)
rb_raise(rb_eArgError, "rank of ap (4th 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_SFLOAT)
rblapack_ap = na_change_type(rblapack_ap, NA_SFLOAT);
ap = NA_PTR_TYPE(rblapack_ap, real*);
{
na_shape_t shape[1];
shape[0] = n*(n+1)/2;
rblapack_ap_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
ap_out__ = NA_PTR_TYPE(rblapack_ap_out__, real*);
MEMCPY(ap_out__, ap, real, NA_TOTAL(rblapack_ap));
rblapack_ap = rblapack_ap_out__;
ap = ap_out__;
sspgst_(&itype, &uplo, &n, ap, bp, &info);
rblapack_info = INT2NUM(info);
return rb_ary_new3(2, rblapack_info, rblapack_ap);
}
void
init_lapack_sspgst(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "sspgst", rblapack_sspgst, -1);
}
|
