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
|
#include "rb_lapack.h"
extern VOID dgetc2_(integer* n, doublereal* a, integer* lda, integer* ipiv, integer* jpiv, integer* info);
static VALUE
rblapack_dgetc2(int argc, VALUE *argv, VALUE self){
VALUE rblapack_a;
doublereal *a;
VALUE rblapack_ipiv;
integer *ipiv;
VALUE rblapack_jpiv;
integer *jpiv;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
doublereal *a_out__;
integer lda;
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 ipiv, jpiv, info, a = NumRu::Lapack.dgetc2( a, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE DGETC2( N, A, LDA, IPIV, JPIV, INFO )\n\n* Purpose\n* =======\n*\n* DGETC2 computes an LU factorization with complete pivoting of the\n* n-by-n matrix A. The factorization has the form A = 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* This is the Level 2 BLAS algorithm.\n*\n\n* Arguments\n* =========\n*\n* N (input) INTEGER\n* The order of the matrix A. N >= 0.\n*\n* A (input/output) DOUBLE PRECISION array, dimension (LDA, N)\n* On entry, the n-by-n matrix A to be factored.\n* On exit, the factors L and U from the factorization\n* A = P*L*U*Q; the unit diagonal elements of L are not stored.\n* If U(k, k) appears to be less than SMIN, U(k, k) is given the\n* value of SMIN, i.e., giving a nonsingular perturbed system.\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,N).\n*\n* IPIV (output) 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 (output) 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* INFO (output) INTEGER\n* = 0: successful exit\n* > 0: if INFO = k, U(k, k) is likely to produce owerflow if\n* we try to solve for x in Ax = b. So U is perturbed to\n* avoid the overflow.\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* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n ipiv, jpiv, info, a = NumRu::Lapack.dgetc2( a, [:usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 1 && argc != 1)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 1)", argc);
rblapack_a = argv[0];
if (argc == 1) {
} else if (rblapack_options != Qnil) {
} else {
}
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (1th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (1th 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*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_ipiv = na_make_object(NA_LINT, 1, shape, cNArray);
}
ipiv = NA_PTR_TYPE(rblapack_ipiv, integer*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_jpiv = na_make_object(NA_LINT, 1, shape, cNArray);
}
jpiv = NA_PTR_TYPE(rblapack_jpiv, integer*);
{
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__;
dgetc2_(&n, a, &lda, ipiv, jpiv, &info);
rblapack_info = INT2NUM(info);
return rb_ary_new3(4, rblapack_ipiv, rblapack_jpiv, rblapack_info, rblapack_a);
}
void
init_lapack_dgetc2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "dgetc2", rblapack_dgetc2, -1);
}
|
