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
|
#include "rb_lapack.h"
extern VOID dgels_(char* trans, integer* m, integer* n, integer* nrhs, doublereal* a, integer* lda, doublereal* b, integer* ldb, doublereal* work, integer* lwork, integer* info);
static VALUE
rblapack_dgels(int argc, VALUE *argv, VALUE self){
VALUE rblapack_trans;
char trans;
VALUE rblapack_a;
doublereal *a;
VALUE rblapack_b;
doublereal *b;
VALUE rblapack_lwork;
integer lwork;
VALUE rblapack_work;
doublereal *work;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
doublereal *a_out__;
VALUE rblapack_b_out__;
doublereal *b_out__;
integer lda;
integer n;
integer m;
integer nrhs;
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 work, info, a, b = NumRu::Lapack.dgels( trans, a, b, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE DGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, INFO )\n\n* Purpose\n* =======\n*\n* DGELS solves overdetermined or underdetermined real linear systems\n* involving an M-by-N matrix A, or its transpose, using a QR or LQ\n* factorization of A. It is assumed that A has full rank.\n*\n* The following options are provided:\n*\n* 1. If TRANS = 'N' and m >= n: find the least squares solution of\n* an overdetermined system, i.e., solve the least squares problem\n* minimize || B - A*X ||.\n*\n* 2. If TRANS = 'N' and m < n: find the minimum norm solution of\n* an underdetermined system A * X = B.\n*\n* 3. If TRANS = 'T' and m >= n: find the minimum norm solution of\n* an undetermined system A**T * X = B.\n*\n* 4. If TRANS = 'T' and m < n: find the least squares solution of\n* an overdetermined system, i.e., solve the least squares problem\n* minimize || B - A**T * X ||.\n*\n* Several right hand side vectors b and solution vectors x can be\n* handled in a single call; they are stored as the columns of the\n* M-by-NRHS right hand side matrix B and the N-by-NRHS solution\n* matrix X.\n*\n\n* Arguments\n* =========\n*\n* TRANS (input) CHARACTER*1\n* = 'N': the linear system involves A;\n* = 'T': the linear system involves A**T.\n*\n* M (input) INTEGER\n* The number of rows of the matrix A. M >= 0.\n*\n* N (input) INTEGER\n* The number of columns of the matrix A. N >= 0.\n*\n* NRHS (input) INTEGER\n* The number of right hand sides, i.e., the number of\n* columns of the matrices B and X. NRHS >=0.\n*\n* A (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n* On entry, the M-by-N matrix A.\n* On exit,\n* if M >= N, A is overwritten by details of its QR\n* factorization as returned by DGEQRF;\n* if M < N, A is overwritten by details of its LQ\n* factorization as returned by DGELQF.\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,M).\n*\n* B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS)\n* On entry, the matrix B of right hand side vectors, stored\n* columnwise; B is M-by-NRHS if TRANS = 'N', or N-by-NRHS\n* if TRANS = 'T'.\n* On exit, if INFO = 0, B is overwritten by the solution\n* vectors, stored columnwise:\n* if TRANS = 'N' and m >= n, rows 1 to n of B contain the least\n* squares solution vectors; the residual sum of squares for the\n* solution in each column is given by the sum of squares of\n* elements N+1 to M in that column;\n* if TRANS = 'N' and m < n, rows 1 to N of B contain the\n* minimum norm solution vectors;\n* if TRANS = 'T' and m >= n, rows 1 to M of B contain the\n* minimum norm solution vectors;\n* if TRANS = 'T' and m < n, rows 1 to M of B contain the\n* least squares solution vectors; the residual sum of squares\n* for the solution in each column is given by the sum of\n* squares of elements M+1 to N in that column.\n*\n* LDB (input) INTEGER\n* The leading dimension of the array B. LDB >= MAX(1,M,N).\n*\n* WORK (workspace/output) DOUBLE PRECISION array, dimension (MAX(1,LWORK))\n* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n*\n* LWORK (input) INTEGER\n* The dimension of the array WORK.\n* LWORK >= max( 1, MN + max( MN, NRHS ) ).\n* For optimal performance,\n* LWORK >= max( 1, MN + max( MN, NRHS )*NB ).\n* where MN = min(M,N) and NB is the optimum block size.\n*\n* If LWORK = -1, then a workspace query is assumed; the routine\n* only calculates the optimal size of the WORK array, returns\n* this value as the first entry of the WORK array, and no error\n* message related to LWORK is issued by XERBLA.\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, the i-th diagonal element of the\n* triangular factor of A is zero, so that A does not have\n* full rank; the least squares solution could not be\n* computed.\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n work, info, a, b = NumRu::Lapack.dgels( trans, a, b, [:lwork => lwork, :usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 3 && argc != 4)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 3)", argc);
rblapack_trans = argv[0];
rblapack_a = argv[1];
rblapack_b = argv[2];
if (argc == 4) {
rblapack_lwork = argv[3];
} else if (rblapack_options != Qnil) {
rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
} else {
rblapack_lwork = Qnil;
}
trans = StringValueCStr(rblapack_trans)[0];
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);
n = NA_SHAPE1(rblapack_a);
if (NA_TYPE(rblapack_a) != NA_DFLOAT)
rblapack_a = na_change_type(rblapack_a, NA_DFLOAT);
a = NA_PTR_TYPE(rblapack_a, doublereal*);
m = lda;
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);
if (NA_SHAPE0(rblapack_b) != m)
rb_raise(rb_eRuntimeError, "shape 0 of b must be lda");
nrhs = NA_SHAPE1(rblapack_b);
if (NA_TYPE(rblapack_b) != NA_DFLOAT)
rblapack_b = na_change_type(rblapack_b, NA_DFLOAT);
b = NA_PTR_TYPE(rblapack_b, doublereal*);
ldb = MAX(m,n);
if (rblapack_lwork == Qnil)
lwork = MIN(m,n) + MAX(MIN(m,n),nrhs);
else {
lwork = NUM2INT(rblapack_lwork);
}
{
na_shape_t shape[1];
shape[0] = MAX(1,lwork);
rblapack_work = na_make_object(NA_DFLOAT, 1, shape, cNArray);
}
work = NA_PTR_TYPE(rblapack_work, doublereal*);
{
na_shape_t shape[2];
shape[0] = lda;
shape[1] = n;
rblapack_a_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
}
a_out__ = NA_PTR_TYPE(rblapack_a_out__, doublereal*);
MEMCPY(a_out__, a, doublereal, NA_TOTAL(rblapack_a));
rblapack_a = rblapack_a_out__;
a = a_out__;
{
na_shape_t shape[2];
shape[0] = MAX(m, n);
shape[1] = nrhs;
rblapack_b_out__ = na_make_object(NA_DFLOAT, 2, shape, cNArray);
}
b_out__ = NA_PTR_TYPE(rblapack_b_out__, doublereal*);
{
VALUE __shape__[3];
__shape__[0] = m < n ? rb_range_new(rblapack_ZERO, INT2NUM(m), Qtrue) : Qtrue;
__shape__[1] = Qtrue;
__shape__[2] = rblapack_b;
na_aset(3, __shape__, rblapack_b_out__);
}
rblapack_b = rblapack_b_out__;
b = b_out__;
dgels_(&trans, &m, &n, &nrhs, a, &lda, b, &ldb, work, &lwork, &info);
rblapack_info = INT2NUM(info);
{
VALUE __shape__[2];
__shape__[0] = m < n ? Qtrue : rb_range_new(rblapack_ZERO, INT2NUM(n), Qtrue);
__shape__[1] = Qtrue;
rblapack_b = na_aref(2, __shape__, rblapack_b);
}
return rb_ary_new3(4, rblapack_work, rblapack_info, rblapack_a, rblapack_b);
}
void
init_lapack_dgels(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "dgels", rblapack_dgels, -1);
}
|
