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
117
118
119
|
#include "rb_lapack.h"
extern VOID slatdf_(integer* ijob, integer* n, real* z, integer* ldz, real* rhs, real* rdsum, real* rdscal, integer* ipiv, integer* jpiv);
static VALUE
rblapack_slatdf(int argc, VALUE *argv, VALUE self){
VALUE rblapack_ijob;
integer ijob;
VALUE rblapack_z;
real *z;
VALUE rblapack_rhs;
real *rhs;
VALUE rblapack_rdsum;
real rdsum;
VALUE rblapack_rdscal;
real rdscal;
VALUE rblapack_ipiv;
integer *ipiv;
VALUE rblapack_jpiv;
integer *jpiv;
VALUE rblapack_rhs_out__;
real *rhs_out__;
integer ldz;
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 rhs, rdsum, rdscal = NumRu::Lapack.slatdf( ijob, z, rhs, rdsum, rdscal, ipiv, jpiv, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE SLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, JPIV )\n\n* Purpose\n* =======\n*\n* SLATDF uses the LU factorization of the n-by-n matrix Z computed by\n* SGETC2 and computes a contribution to the reciprocal Dif-estimate\n* by solving Z * x = b for x, and choosing the r.h.s. b such that\n* the norm of x is as large as possible. On entry RHS = b holds the\n* contribution from earlier solved sub-systems, and on return RHS = x.\n*\n* The factorization of Z returned by SGETC2 has the form Z = P*L*U*Q,\n* where P and Q are permutation matrices. L is lower triangular with\n* unit diagonal elements and U is upper triangular.\n*\n\n* Arguments\n* =========\n*\n* IJOB (input) INTEGER\n* IJOB = 2: First compute an approximative null-vector e\n* of Z using SGECON, e is normalized and solve for\n* Zx = +-e - f with the sign giving the greater value\n* of 2-norm(x). About 5 times as expensive as Default.\n* IJOB .ne. 2: Local look ahead strategy where all entries of\n* the r.h.s. b is chosen as either +1 or -1 (Default).\n*\n* N (input) INTEGER\n* The number of columns of the matrix Z.\n*\n* Z (input) REAL array, dimension (LDZ, N)\n* On entry, the LU part of the factorization of the n-by-n\n* matrix Z computed by SGETC2: Z = P * L * U * Q\n*\n* LDZ (input) INTEGER\n* The leading dimension of the array Z. LDA >= max(1, N).\n*\n* RHS (input/output) REAL array, dimension N.\n* On entry, RHS contains contributions from other subsystems.\n* On exit, RHS contains the solution of the subsystem with\n* entries acoording to the value of IJOB (see above).\n*\n* RDSUM (input/output) REAL\n* On entry, the sum of squares of computed contributions to\n* the Dif-estimate under computation by STGSYL, where the\n* scaling factor RDSCAL (see below) has been factored out.\n* On exit, the corresponding sum of squares updated with the\n* contributions from the current sub-system.\n* If TRANS = 'T' RDSUM is not touched.\n* NOTE: RDSUM only makes sense when STGSY2 is called by STGSYL.\n*\n* RDSCAL (input/output) REAL\n* On entry, scaling factor used to prevent overflow in RDSUM.\n* On exit, RDSCAL is updated w.r.t. the current contributions\n* in RDSUM.\n* If TRANS = 'T', RDSCAL is not touched.\n* NOTE: RDSCAL only makes sense when STGSY2 is called by\n* STGSYL.\n*\n* IPIV (input) INTEGER array, dimension (N).\n* The pivot indices; for 1 <= i <= N, row i of the\n* matrix has been interchanged with row IPIV(i).\n*\n* JPIV (input) INTEGER array, dimension (N).\n* The pivot indices; for 1 <= j <= N, column j of the\n* matrix has been interchanged with column JPIV(j).\n*\n\n* Further Details\n* ===============\n*\n* Based on contributions by\n* Bo Kagstrom and Peter Poromaa, Department of Computing Science,\n* Umea University, S-901 87 Umea, Sweden.\n*\n* This routine is a further developed implementation of algorithm\n* BSOLVE in [1] using complete pivoting in the LU factorization.\n*\n* [1] Bo Kagstrom and Lars Westin,\n* Generalized Schur Methods with Condition Estimators for\n* Solving the Generalized Sylvester Equation, IEEE Transactions\n* on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751.\n*\n* [2] Peter Poromaa,\n* On Efficient and Robust Estimators for the Separation\n* between two Regular Matrix Pairs with Applications in\n* Condition Estimation. Report IMINF-95.05, Departement of\n* Computing Science, Umea University, S-901 87 Umea, Sweden, 1995.\n*\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n rhs, rdsum, rdscal = NumRu::Lapack.slatdf( ijob, z, rhs, rdsum, rdscal, ipiv, jpiv, [: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_ijob = argv[0];
rblapack_z = argv[1];
rblapack_rhs = argv[2];
rblapack_rdsum = argv[3];
rblapack_rdscal = argv[4];
rblapack_ipiv = argv[5];
rblapack_jpiv = argv[6];
if (argc == 7) {
} else if (rblapack_options != Qnil) {
} else {
}
ijob = NUM2INT(rblapack_ijob);
if (!NA_IsNArray(rblapack_rhs))
rb_raise(rb_eArgError, "rhs (3th argument) must be NArray");
if (NA_RANK(rblapack_rhs) != 1)
rb_raise(rb_eArgError, "rank of rhs (3th argument) must be %d", 1);
n = NA_SHAPE0(rblapack_rhs);
if (NA_TYPE(rblapack_rhs) != NA_SFLOAT)
rblapack_rhs = na_change_type(rblapack_rhs, NA_SFLOAT);
rhs = NA_PTR_TYPE(rblapack_rhs, real*);
rdscal = (real)NUM2DBL(rblapack_rdscal);
if (!NA_IsNArray(rblapack_jpiv))
rb_raise(rb_eArgError, "jpiv (7th argument) must be NArray");
if (NA_RANK(rblapack_jpiv) != 1)
rb_raise(rb_eArgError, "rank of jpiv (7th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_jpiv) != n)
rb_raise(rb_eRuntimeError, "shape 0 of jpiv must be the same as shape 0 of rhs");
if (NA_TYPE(rblapack_jpiv) != NA_LINT)
rblapack_jpiv = na_change_type(rblapack_jpiv, NA_LINT);
jpiv = NA_PTR_TYPE(rblapack_jpiv, integer*);
if (!NA_IsNArray(rblapack_z))
rb_raise(rb_eArgError, "z (2th argument) must be NArray");
if (NA_RANK(rblapack_z) != 2)
rb_raise(rb_eArgError, "rank of z (2th argument) must be %d", 2);
ldz = NA_SHAPE0(rblapack_z);
if (NA_SHAPE1(rblapack_z) != n)
rb_raise(rb_eRuntimeError, "shape 1 of z must be the same as shape 0 of rhs");
if (NA_TYPE(rblapack_z) != NA_SFLOAT)
rblapack_z = na_change_type(rblapack_z, NA_SFLOAT);
z = NA_PTR_TYPE(rblapack_z, real*);
if (!NA_IsNArray(rblapack_ipiv))
rb_raise(rb_eArgError, "ipiv (6th argument) must be NArray");
if (NA_RANK(rblapack_ipiv) != 1)
rb_raise(rb_eArgError, "rank of ipiv (6th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_ipiv) != n)
rb_raise(rb_eRuntimeError, "shape 0 of ipiv must be the same as shape 0 of rhs");
if (NA_TYPE(rblapack_ipiv) != NA_LINT)
rblapack_ipiv = na_change_type(rblapack_ipiv, NA_LINT);
ipiv = NA_PTR_TYPE(rblapack_ipiv, integer*);
rdsum = (real)NUM2DBL(rblapack_rdsum);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_rhs_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
rhs_out__ = NA_PTR_TYPE(rblapack_rhs_out__, real*);
MEMCPY(rhs_out__, rhs, real, NA_TOTAL(rblapack_rhs));
rblapack_rhs = rblapack_rhs_out__;
rhs = rhs_out__;
slatdf_(&ijob, &n, z, &ldz, rhs, &rdsum, &rdscal, ipiv, jpiv);
rblapack_rdsum = rb_float_new((double)rdsum);
rblapack_rdscal = rb_float_new((double)rdscal);
return rb_ary_new3(3, rblapack_rhs, rblapack_rdsum, rblapack_rdscal);
}
void
init_lapack_slatdf(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "slatdf", rblapack_slatdf, -1);
}
|
