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
120
121
122
123
124
125
126
127
128
|
#include "rb_lapack.h"
extern VOID zggbal_(char* job, integer* n, doublecomplex* a, integer* lda, doublecomplex* b, integer* ldb, integer* ilo, integer* ihi, doublereal* lscale, doublereal* rscale, doublereal* work, integer* info);
static VALUE
rblapack_zggbal(int argc, VALUE *argv, VALUE self){
VALUE rblapack_job;
char job;
VALUE rblapack_a;
doublecomplex *a;
VALUE rblapack_b;
doublecomplex *b;
VALUE rblapack_ilo;
integer ilo;
VALUE rblapack_ihi;
integer ihi;
VALUE rblapack_lscale;
doublereal *lscale;
VALUE rblapack_rscale;
doublereal *rscale;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
doublecomplex *a_out__;
VALUE rblapack_b_out__;
doublecomplex *b_out__;
doublereal *work;
integer lda;
integer n;
integer ldb;
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 ilo, ihi, lscale, rscale, info, a, b = NumRu::Lapack.zggbal( job, a, b, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE ZGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE, RSCALE, WORK, INFO )\n\n* Purpose\n* =======\n*\n* ZGGBAL balances a pair of general complex matrices (A,B). This\n* involves, first, permuting A and B by similarity transformations to\n* isolate eigenvalues in the first 1 to ILO$-$1 and last IHI+1 to N\n* elements on the diagonal; and second, applying a diagonal similarity\n* transformation to rows and columns ILO to IHI to make the rows\n* and columns as close in norm as possible. Both steps are optional.\n*\n* Balancing may reduce the 1-norm of the matrices, and improve the\n* accuracy of the computed eigenvalues and/or eigenvectors in the\n* generalized eigenvalue problem A*x = lambda*B*x.\n*\n\n* Arguments\n* =========\n*\n* JOB (input) CHARACTER*1\n* Specifies the operations to be performed on A and B:\n* = 'N': none: simply set ILO = 1, IHI = N, LSCALE(I) = 1.0\n* and RSCALE(I) = 1.0 for i=1,...,N;\n* = 'P': permute only;\n* = 'S': scale only;\n* = 'B': both permute and scale.\n*\n* N (input) INTEGER\n* The order of the matrices A and B. N >= 0.\n*\n* A (input/output) COMPLEX*16 array, dimension (LDA,N)\n* On entry, the input matrix A.\n* On exit, A is overwritten by the balanced matrix.\n* If JOB = 'N', A is not referenced.\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,N).\n*\n* B (input/output) COMPLEX*16 array, dimension (LDB,N)\n* On entry, the input matrix B.\n* On exit, B is overwritten by the balanced matrix.\n* If JOB = 'N', B is not referenced.\n*\n* LDB (input) INTEGER\n* The leading dimension of the array B. LDB >= max(1,N).\n*\n* ILO (output) INTEGER\n* IHI (output) INTEGER\n* ILO and IHI are set to integers such that on exit\n* A(i,j) = 0 and B(i,j) = 0 if i > j and\n* j = 1,...,ILO-1 or i = IHI+1,...,N.\n* If JOB = 'N' or 'S', ILO = 1 and IHI = N.\n*\n* LSCALE (output) DOUBLE PRECISION array, dimension (N)\n* Details of the permutations and scaling factors applied\n* to the left side of A and B. If P(j) is the index of the\n* row interchanged with row j, and D(j) is the scaling factor\n* applied to row j, then\n* LSCALE(j) = P(j) for J = 1,...,ILO-1\n* = D(j) for J = ILO,...,IHI\n* = P(j) for J = IHI+1,...,N.\n* The order in which the interchanges are made is N to IHI+1,\n* then 1 to ILO-1.\n*\n* RSCALE (output) DOUBLE PRECISION array, dimension (N)\n* Details of the permutations and scaling factors applied\n* to the right side of A and B. If P(j) is the index of the\n* column interchanged with column j, and D(j) is the scaling\n* factor applied to column j, then\n* RSCALE(j) = P(j) for J = 1,...,ILO-1\n* = D(j) for J = ILO,...,IHI\n* = P(j) for J = IHI+1,...,N.\n* The order in which the interchanges are made is N to IHI+1,\n* then 1 to ILO-1.\n*\n* WORK (workspace) REAL array, dimension (lwork)\n* lwork must be at least max(1,6*N) when JOB = 'S' or 'B', and\n* at least 1 when JOB = 'N' or 'P'.\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* See R.C. WARD, Balancing the generalized eigenvalue problem,\n* SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.\n*\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n ilo, ihi, lscale, rscale, info, a, b = NumRu::Lapack.zggbal( job, a, b, [: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_job = argv[0];
rblapack_a = argv[1];
rblapack_b = argv[2];
if (argc == 3) {
} else if (rblapack_options != Qnil) {
} else {
}
job = StringValueCStr(rblapack_job)[0];
if (!NA_IsNArray(rblapack_b))
rb_raise(rb_eArgError, "b (3th argument) must be NArray");
if (NA_RANK(rblapack_b) != 2)
rb_raise(rb_eArgError, "rank of b (3th argument) must be %d", 2);
ldb = NA_SHAPE0(rblapack_b);
n = NA_SHAPE1(rblapack_b);
if (NA_TYPE(rblapack_b) != NA_DCOMPLEX)
rblapack_b = na_change_type(rblapack_b, NA_DCOMPLEX);
b = NA_PTR_TYPE(rblapack_b, doublecomplex*);
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (2th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (2th argument) must be %d", 2);
lda = NA_SHAPE0(rblapack_a);
if (NA_SHAPE1(rblapack_a) != n)
rb_raise(rb_eRuntimeError, "shape 1 of a must be the same as shape 1 of b");
if (NA_TYPE(rblapack_a) != NA_DCOMPLEX)
rblapack_a = na_change_type(rblapack_a, NA_DCOMPLEX);
a = NA_PTR_TYPE(rblapack_a, doublecomplex*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_lscale = na_make_object(NA_DFLOAT, 1, shape, cNArray);
}
lscale = NA_PTR_TYPE(rblapack_lscale, doublereal*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_rscale = na_make_object(NA_DFLOAT, 1, shape, cNArray);
}
rscale = NA_PTR_TYPE(rblapack_rscale, doublereal*);
{
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__;
{
na_shape_t shape[2];
shape[0] = ldb;
shape[1] = n;
rblapack_b_out__ = na_make_object(NA_DCOMPLEX, 2, shape, cNArray);
}
b_out__ = NA_PTR_TYPE(rblapack_b_out__, doublecomplex*);
MEMCPY(b_out__, b, doublecomplex, NA_TOTAL(rblapack_b));
rblapack_b = rblapack_b_out__;
b = b_out__;
work = ALLOC_N(doublereal, ((lsame_(&job,"S")||lsame_(&job,"B")) ? MAX(1,6*n) : (lsame_(&job,"N")||lsame_(&job,"P")) ? 1 : 0));
zggbal_(&job, &n, a, &lda, b, &ldb, &ilo, &ihi, lscale, rscale, work, &info);
free(work);
rblapack_ilo = INT2NUM(ilo);
rblapack_ihi = INT2NUM(ihi);
rblapack_info = INT2NUM(info);
return rb_ary_new3(7, rblapack_ilo, rblapack_ihi, rblapack_lscale, rblapack_rscale, rblapack_info, rblapack_a, rblapack_b);
}
void
init_lapack_zggbal(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "zggbal", rblapack_zggbal, -1);
}
|
