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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
|
#include "rb_lapack.h"
extern VOID cgesvx_(char* fact, char* trans, integer* n, integer* nrhs, complex* a, integer* lda, complex* af, integer* ldaf, integer* ipiv, char* equed, real* r, real* c, complex* b, integer* ldb, complex* x, integer* ldx, real* rcond, real* ferr, real* berr, complex* work, real* rwork, integer* info);
static VALUE
rblapack_cgesvx(int argc, VALUE *argv, VALUE self){
VALUE rblapack_fact;
char fact;
VALUE rblapack_trans;
char trans;
VALUE rblapack_a;
complex *a;
VALUE rblapack_b;
complex *b;
VALUE rblapack_af;
complex *af;
VALUE rblapack_ipiv;
integer *ipiv;
VALUE rblapack_equed;
char equed;
VALUE rblapack_r;
real *r;
VALUE rblapack_c;
real *c;
VALUE rblapack_x;
complex *x;
VALUE rblapack_rcond;
real rcond;
VALUE rblapack_ferr;
real *ferr;
VALUE rblapack_berr;
real *berr;
VALUE rblapack_rwork;
real *rwork;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
complex *a_out__;
VALUE rblapack_af_out__;
complex *af_out__;
VALUE rblapack_ipiv_out__;
integer *ipiv_out__;
VALUE rblapack_r_out__;
real *r_out__;
VALUE rblapack_c_out__;
real *c_out__;
VALUE rblapack_b_out__;
complex *b_out__;
complex *work;
integer lda;
integer n;
integer ldb;
integer nrhs;
integer ldaf;
integer ldx;
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 x, rcond, ferr, berr, rwork, info, a, af, ipiv, equed, r, c, b = NumRu::Lapack.cgesvx( fact, trans, a, b, [:af => af, :ipiv => ipiv, :equed => equed, :r => r, :c => c, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE CGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )\n\n* Purpose\n* =======\n*\n* CGESVX uses the LU factorization to compute the solution to a complex\n* system of linear equations\n* A * X = B,\n* where A is an N-by-N matrix and X and B are N-by-NRHS matrices.\n*\n* Error bounds on the solution and a condition estimate are also\n* provided.\n*\n* Description\n* ===========\n*\n* The following steps are performed:\n*\n* 1. If FACT = 'E', real scaling factors are computed to equilibrate\n* the system:\n* TRANS = 'N': diag(R)*A*diag(C) *inv(diag(C))*X = diag(R)*B\n* TRANS = 'T': (diag(R)*A*diag(C))**T *inv(diag(R))*X = diag(C)*B\n* TRANS = 'C': (diag(R)*A*diag(C))**H *inv(diag(R))*X = diag(C)*B\n* Whether or not the system will be equilibrated depends on the\n* scaling of the matrix A, but if equilibration is used, A is\n* overwritten by diag(R)*A*diag(C) and B by diag(R)*B (if TRANS='N')\n* or diag(C)*B (if TRANS = 'T' or 'C').\n*\n* 2. If FACT = 'N' or 'E', the LU decomposition is used to factor the\n* matrix A (after equilibration if FACT = 'E') as\n* A = P * L * U,\n* where P is a permutation matrix, L is a unit lower triangular\n* matrix, and U is upper triangular.\n*\n* 3. If some U(i,i)=0, so that U is exactly singular, then the routine\n* returns with INFO = i. Otherwise, the factored form of A is used\n* to estimate the condition number of the matrix A. If the\n* reciprocal of the condition number is less than machine precision,\n* INFO = N+1 is returned as a warning, but the routine still goes on\n* to solve for X and compute error bounds as described below.\n*\n* 4. The system of equations is solved for X using the factored form\n* of A.\n*\n* 5. Iterative refinement is applied to improve the computed solution\n* matrix and calculate error bounds and backward error estimates\n* for it.\n*\n* 6. If equilibration was used, the matrix X is premultiplied by\n* diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so\n* that it solves the original system before equilibration.\n*\n\n* Arguments\n* =========\n*\n* FACT (input) CHARACTER*1\n* Specifies whether or not the factored form of the matrix A is\n* supplied on entry, and if not, whether the matrix A should be\n* equilibrated before it is factored.\n* = 'F': On entry, AF and IPIV contain the factored form of A.\n* If EQUED is not 'N', the matrix A has been\n* equilibrated with scaling factors given by R and C.\n* A, AF, and IPIV are not modified.\n* = 'N': The matrix A will be copied to AF and factored.\n* = 'E': The matrix A will be equilibrated if necessary, then\n* copied to AF and factored.\n*\n* TRANS (input) CHARACTER*1\n* Specifies the form of the system of equations:\n* = 'N': A * X = B (No transpose)\n* = 'T': A**T * X = B (Transpose)\n* = 'C': A**H * X = B (Conjugate transpose)\n*\n* N (input) INTEGER\n* The number of linear equations, i.e., the order of the\n* matrix A. N >= 0.\n*\n* NRHS (input) INTEGER\n* The number of right hand sides, i.e., the number of columns\n* of the matrices B and X. NRHS >= 0.\n*\n* A (input/output) COMPLEX array, dimension (LDA,N)\n* On entry, the N-by-N matrix A. If FACT = 'F' and EQUED is\n* not 'N', then A must have been equilibrated by the scaling\n* factors in R and/or C. A is not modified if FACT = 'F' or\n* 'N', or if FACT = 'E' and EQUED = 'N' on exit.\n*\n* On exit, if EQUED .ne. 'N', A is scaled as follows:\n* EQUED = 'R': A := diag(R) * A\n* EQUED = 'C': A := A * diag(C)\n* EQUED = 'B': A := diag(R) * A * diag(C).\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,N).\n*\n* AF (input or output) COMPLEX array, dimension (LDAF,N)\n* If FACT = 'F', then AF is an input argument and on entry\n* contains the factors L and U from the factorization\n* A = P*L*U as computed by CGETRF. If EQUED .ne. 'N', then\n* AF is the factored form of the equilibrated matrix A.\n*\n* If FACT = 'N', then AF is an output argument and on exit\n* returns the factors L and U from the factorization A = P*L*U\n* of the original matrix A.\n*\n* If FACT = 'E', then AF is an output argument and on exit\n* returns the factors L and U from the factorization A = P*L*U\n* of the equilibrated matrix A (see the description of A for\n* the form of the equilibrated matrix).\n*\n* LDAF (input) INTEGER\n* The leading dimension of the array AF. LDAF >= max(1,N).\n*\n* IPIV (input or output) INTEGER array, dimension (N)\n* If FACT = 'F', then IPIV is an input argument and on entry\n* contains the pivot indices from the factorization A = P*L*U\n* as computed by CGETRF; row i of the matrix was interchanged\n* with row IPIV(i).\n*\n* If FACT = 'N', then IPIV is an output argument and on exit\n* contains the pivot indices from the factorization A = P*L*U\n* of the original matrix A.\n*\n* If FACT = 'E', then IPIV is an output argument and on exit\n* contains the pivot indices from the factorization A = P*L*U\n* of the equilibrated matrix A.\n*\n* EQUED (input or output) CHARACTER*1\n* Specifies the form of equilibration that was done.\n* = 'N': No equilibration (always true if FACT = 'N').\n* = 'R': Row equilibration, i.e., A has been premultiplied by\n* diag(R).\n* = 'C': Column equilibration, i.e., A has been postmultiplied\n* by diag(C).\n* = 'B': Both row and column equilibration, i.e., A has been\n* replaced by diag(R) * A * diag(C).\n* EQUED is an input argument if FACT = 'F'; otherwise, it is an\n* output argument.\n*\n* R (input or output) REAL array, dimension (N)\n* The row scale factors for A. If EQUED = 'R' or 'B', A is\n* multiplied on the left by diag(R); if EQUED = 'N' or 'C', R\n* is not accessed. R is an input argument if FACT = 'F';\n* otherwise, R is an output argument. If FACT = 'F' and\n* EQUED = 'R' or 'B', each element of R must be positive.\n*\n* C (input or output) REAL array, dimension (N)\n* The column scale factors for A. If EQUED = 'C' or 'B', A is\n* multiplied on the right by diag(C); if EQUED = 'N' or 'R', C\n* is not accessed. C is an input argument if FACT = 'F';\n* otherwise, C is an output argument. If FACT = 'F' and\n* EQUED = 'C' or 'B', each element of C must be positive.\n*\n* B (input/output) COMPLEX array, dimension (LDB,NRHS)\n* On entry, the N-by-NRHS right hand side matrix B.\n* On exit,\n* if EQUED = 'N', B is not modified;\n* if TRANS = 'N' and EQUED = 'R' or 'B', B is overwritten by\n* diag(R)*B;\n* if TRANS = 'T' or 'C' and EQUED = 'C' or 'B', B is\n* overwritten by diag(C)*B.\n*\n* LDB (input) INTEGER\n* The leading dimension of the array B. LDB >= max(1,N).\n*\n* X (output) COMPLEX array, dimension (LDX,NRHS)\n* If INFO = 0 or INFO = N+1, the N-by-NRHS solution matrix X\n* to the original system of equations. Note that A and B are\n* modified on exit if EQUED .ne. 'N', and the solution to the\n* equilibrated system is inv(diag(C))*X if TRANS = 'N' and\n* EQUED = 'C' or 'B', or inv(diag(R))*X if TRANS = 'T' or 'C'\n* and EQUED = 'R' or 'B'.\n*\n* LDX (input) INTEGER\n* The leading dimension of the array X. LDX >= max(1,N).\n*\n* RCOND (output) REAL\n* The estimate of the reciprocal condition number of the matrix\n* A after equilibration (if done). If RCOND is less than the\n* machine precision (in particular, if RCOND = 0), the matrix\n* is singular to working precision. This condition is\n* indicated by a return code of INFO > 0.\n*\n* FERR (output) REAL array, dimension (NRHS)\n* The estimated forward error bound for each solution vector\n* X(j) (the j-th column of the solution matrix X).\n* If XTRUE is the true solution corresponding to X(j), FERR(j)\n* is an estimated upper bound for the magnitude of the largest\n* element in (X(j) - XTRUE) divided by the magnitude of the\n* largest element in X(j). The estimate is as reliable as\n* the estimate for RCOND, and is almost always a slight\n* overestimate of the true error.\n*\n* BERR (output) REAL array, dimension (NRHS)\n* The componentwise relative backward error of each solution\n* vector X(j) (i.e., the smallest relative change in\n* any element of A or B that makes X(j) an exact solution).\n*\n* WORK (workspace) COMPLEX array, dimension (2*N)\n*\n* RWORK (workspace/output) REAL array, dimension (2*N)\n* On exit, RWORK(1) contains the reciprocal pivot growth\n* factor norm(A)/norm(U). The \"max absolute element\" norm is\n* used. If RWORK(1) is much less than 1, then the stability\n* of the LU factorization of the (equilibrated) matrix A\n* could be poor. This also means that the solution X, condition\n* estimator RCOND, and forward error bound FERR could be\n* unreliable. If factorization fails with 0<INFO<=N, then\n* RWORK(1) contains the reciprocal pivot growth factor for the\n* leading INFO columns of A.\n*\n* INFO (output) INTEGER\n* = 0: successful exit\n* < 0: if INFO = -i, the i-th argument had an illegal value\n* > 0: if INFO = i, and i is\n* <= N: U(i,i) is exactly zero. The factorization has\n* been completed, but the factor U is exactly\n* singular, so the solution and error bounds\n* could not be computed. RCOND = 0 is returned.\n* = N+1: U is nonsingular, but RCOND is less than machine\n* precision, meaning that the matrix is singular\n* to working precision. Nevertheless, the\n* solution and error bounds are computed because\n* there are a number of situations where the\n* computed solution can be more accurate than the\n* value of RCOND would suggest.\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n x, rcond, ferr, berr, rwork, info, a, af, ipiv, equed, r, c, b = NumRu::Lapack.cgesvx( fact, trans, a, b, [:af => af, :ipiv => ipiv, :equed => equed, :r => r, :c => c, :usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 4 && argc != 9)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 4)", argc);
rblapack_fact = argv[0];
rblapack_trans = argv[1];
rblapack_a = argv[2];
rblapack_b = argv[3];
if (argc == 9) {
rblapack_af = argv[4];
rblapack_ipiv = argv[5];
rblapack_equed = argv[6];
rblapack_r = argv[7];
rblapack_c = argv[8];
} else if (rblapack_options != Qnil) {
rblapack_af = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("af")));
rblapack_ipiv = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("ipiv")));
rblapack_equed = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("equed")));
rblapack_r = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("r")));
rblapack_c = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("c")));
} else {
rblapack_af = Qnil;
rblapack_ipiv = Qnil;
rblapack_equed = Qnil;
rblapack_r = Qnil;
rblapack_c = Qnil;
}
fact = StringValueCStr(rblapack_fact)[0];
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (3th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (3th argument) must be %d", 2);
lda = NA_SHAPE0(rblapack_a);
n = NA_SHAPE1(rblapack_a);
if (NA_TYPE(rblapack_a) != NA_SCOMPLEX)
rblapack_a = na_change_type(rblapack_a, NA_SCOMPLEX);
a = NA_PTR_TYPE(rblapack_a, complex*);
if (rblapack_ipiv != Qnil) {
if (!NA_IsNArray(rblapack_ipiv))
rb_raise(rb_eArgError, "ipiv (option) must be NArray");
if (NA_RANK(rblapack_ipiv) != 1)
rb_raise(rb_eArgError, "rank of ipiv (option) must be %d", 1);
if (NA_SHAPE0(rblapack_ipiv) != n)
rb_raise(rb_eRuntimeError, "shape 0 of ipiv must be the same as shape 1 of a");
if (NA_TYPE(rblapack_ipiv) != NA_LINT)
rblapack_ipiv = na_change_type(rblapack_ipiv, NA_LINT);
ipiv = NA_PTR_TYPE(rblapack_ipiv, integer*);
}
if (rblapack_r != Qnil) {
if (!NA_IsNArray(rblapack_r))
rb_raise(rb_eArgError, "r (option) must be NArray");
if (NA_RANK(rblapack_r) != 1)
rb_raise(rb_eArgError, "rank of r (option) must be %d", 1);
if (NA_SHAPE0(rblapack_r) != n)
rb_raise(rb_eRuntimeError, "shape 0 of r must be the same as shape 1 of a");
if (NA_TYPE(rblapack_r) != NA_SFLOAT)
rblapack_r = na_change_type(rblapack_r, NA_SFLOAT);
r = NA_PTR_TYPE(rblapack_r, real*);
}
ldx = n;
trans = StringValueCStr(rblapack_trans)[0];
if (rblapack_equed != Qnil) {
equed = StringValueCStr(rblapack_equed)[0];
}
ldaf = n;
if (!NA_IsNArray(rblapack_b))
rb_raise(rb_eArgError, "b (4th argument) must be NArray");
if (NA_RANK(rblapack_b) != 2)
rb_raise(rb_eArgError, "rank of b (4th argument) must be %d", 2);
ldb = NA_SHAPE0(rblapack_b);
nrhs = NA_SHAPE1(rblapack_b);
if (NA_TYPE(rblapack_b) != NA_SCOMPLEX)
rblapack_b = na_change_type(rblapack_b, NA_SCOMPLEX);
b = NA_PTR_TYPE(rblapack_b, complex*);
if (rblapack_c != Qnil) {
if (!NA_IsNArray(rblapack_c))
rb_raise(rb_eArgError, "c (option) must be NArray");
if (NA_RANK(rblapack_c) != 1)
rb_raise(rb_eArgError, "rank of c (option) must be %d", 1);
if (NA_SHAPE0(rblapack_c) != n)
rb_raise(rb_eRuntimeError, "shape 0 of c must be the same as shape 1 of a");
if (NA_TYPE(rblapack_c) != NA_SFLOAT)
rblapack_c = na_change_type(rblapack_c, NA_SFLOAT);
c = NA_PTR_TYPE(rblapack_c, real*);
}
if (rblapack_af != Qnil) {
if (!NA_IsNArray(rblapack_af))
rb_raise(rb_eArgError, "af (option) must be NArray");
if (NA_RANK(rblapack_af) != 2)
rb_raise(rb_eArgError, "rank of af (option) must be %d", 2);
if (NA_SHAPE0(rblapack_af) != ldaf)
rb_raise(rb_eRuntimeError, "shape 0 of af must be n");
if (NA_SHAPE1(rblapack_af) != n)
rb_raise(rb_eRuntimeError, "shape 1 of af must be the same as shape 1 of a");
if (NA_TYPE(rblapack_af) != NA_SCOMPLEX)
rblapack_af = na_change_type(rblapack_af, NA_SCOMPLEX);
af = NA_PTR_TYPE(rblapack_af, complex*);
}
{
na_shape_t shape[2];
shape[0] = ldx;
shape[1] = nrhs;
rblapack_x = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
}
x = NA_PTR_TYPE(rblapack_x, complex*);
{
na_shape_t shape[1];
shape[0] = nrhs;
rblapack_ferr = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
ferr = NA_PTR_TYPE(rblapack_ferr, real*);
{
na_shape_t shape[1];
shape[0] = nrhs;
rblapack_berr = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
berr = NA_PTR_TYPE(rblapack_berr, real*);
{
na_shape_t shape[1];
shape[0] = 2*n;
rblapack_rwork = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
rwork = NA_PTR_TYPE(rblapack_rwork, real*);
{
na_shape_t shape[2];
shape[0] = lda;
shape[1] = n;
rblapack_a_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
}
a_out__ = NA_PTR_TYPE(rblapack_a_out__, complex*);
MEMCPY(a_out__, a, complex, NA_TOTAL(rblapack_a));
rblapack_a = rblapack_a_out__;
a = a_out__;
{
na_shape_t shape[2];
shape[0] = ldaf;
shape[1] = n;
rblapack_af_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
}
af_out__ = NA_PTR_TYPE(rblapack_af_out__, complex*);
if (rblapack_af != Qnil) {
MEMCPY(af_out__, af, complex, NA_TOTAL(rblapack_af));
}
rblapack_af = rblapack_af_out__;
af = af_out__;
{
na_shape_t shape[1];
shape[0] = n;
rblapack_ipiv_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
}
ipiv_out__ = NA_PTR_TYPE(rblapack_ipiv_out__, integer*);
if (rblapack_ipiv != Qnil) {
MEMCPY(ipiv_out__, ipiv, integer, NA_TOTAL(rblapack_ipiv));
}
rblapack_ipiv = rblapack_ipiv_out__;
ipiv = ipiv_out__;
{
na_shape_t shape[1];
shape[0] = n;
rblapack_r_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
r_out__ = NA_PTR_TYPE(rblapack_r_out__, real*);
if (rblapack_r != Qnil) {
MEMCPY(r_out__, r, real, NA_TOTAL(rblapack_r));
}
rblapack_r = rblapack_r_out__;
r = r_out__;
{
na_shape_t shape[1];
shape[0] = n;
rblapack_c_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
c_out__ = NA_PTR_TYPE(rblapack_c_out__, real*);
if (rblapack_c != Qnil) {
MEMCPY(c_out__, c, real, NA_TOTAL(rblapack_c));
}
rblapack_c = rblapack_c_out__;
c = c_out__;
{
na_shape_t shape[2];
shape[0] = ldb;
shape[1] = nrhs;
rblapack_b_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
}
b_out__ = NA_PTR_TYPE(rblapack_b_out__, complex*);
MEMCPY(b_out__, b, complex, NA_TOTAL(rblapack_b));
rblapack_b = rblapack_b_out__;
b = b_out__;
work = ALLOC_N(complex, (2*n));
cgesvx_(&fact, &trans, &n, &nrhs, a, &lda, af, &ldaf, ipiv, &equed, r, c, b, &ldb, x, &ldx, &rcond, ferr, berr, work, rwork, &info);
free(work);
rblapack_rcond = rb_float_new((double)rcond);
rblapack_info = INT2NUM(info);
rblapack_equed = rb_str_new(&equed,1);
return rb_ary_new3(13, rblapack_x, rblapack_rcond, rblapack_ferr, rblapack_berr, rblapack_rwork, rblapack_info, rblapack_a, rblapack_af, rblapack_ipiv, rblapack_equed, rblapack_r, rblapack_c, rblapack_b);
}
void
init_lapack_cgesvx(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "cgesvx", rblapack_cgesvx, -1);
}
|
