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
|
#include "rb_lapack.h"
extern VOID cgttrf_(integer* n, complex* dl, complex* d, complex* du, complex* du2, integer* ipiv, integer* info);
static VALUE
rblapack_cgttrf(int argc, VALUE *argv, VALUE self){
VALUE rblapack_dl;
complex *dl;
VALUE rblapack_d;
complex *d;
VALUE rblapack_du;
complex *du;
VALUE rblapack_du2;
complex *du2;
VALUE rblapack_ipiv;
integer *ipiv;
VALUE rblapack_info;
integer info;
VALUE rblapack_dl_out__;
complex *dl_out__;
VALUE rblapack_d_out__;
complex *d_out__;
VALUE rblapack_du_out__;
complex *du_out__;
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 du2, ipiv, info, dl, d, du = NumRu::Lapack.cgttrf( dl, d, du, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE CGTTRF( N, DL, D, DU, DU2, IPIV, INFO )\n\n* Purpose\n* =======\n*\n* CGTTRF computes an LU factorization of a complex tridiagonal matrix A\n* using elimination with partial pivoting and row interchanges.\n*\n* The factorization has the form\n* A = L * U\n* where L is a product of permutation and unit lower bidiagonal\n* matrices and U is upper triangular with nonzeros in only the main\n* diagonal and first two superdiagonals.\n*\n\n* Arguments\n* =========\n*\n* N (input) INTEGER\n* The order of the matrix A.\n*\n* DL (input/output) COMPLEX array, dimension (N-1)\n* On entry, DL must contain the (n-1) sub-diagonal elements of\n* A.\n*\n* On exit, DL is overwritten by the (n-1) multipliers that\n* define the matrix L from the LU factorization of A.\n*\n* D (input/output) COMPLEX array, dimension (N)\n* On entry, D must contain the diagonal elements of A.\n*\n* On exit, D is overwritten by the n diagonal elements of the\n* upper triangular matrix U from the LU factorization of A.\n*\n* DU (input/output) COMPLEX array, dimension (N-1)\n* On entry, DU must contain the (n-1) super-diagonal elements\n* of A.\n*\n* On exit, DU is overwritten by the (n-1) elements of the first\n* super-diagonal of U.\n*\n* DU2 (output) COMPLEX array, dimension (N-2)\n* On exit, DU2 is overwritten by the (n-2) elements of the\n* second super-diagonal of U.\n*\n* IPIV (output) INTEGER array, dimension (N)\n* The pivot indices; for 1 <= i <= n, row i of the matrix was\n* interchanged with row IPIV(i). IPIV(i) will always be either\n* i or i+1; IPIV(i) = i indicates a row interchange was not\n* required.\n*\n* INFO (output) INTEGER\n* = 0: successful exit\n* < 0: if INFO = -k, the k-th argument had an illegal value\n* > 0: if INFO = k, U(k,k) is exactly zero. The factorization\n* has been completed, but the factor U is exactly\n* singular, and division by zero will occur if it is used\n* to solve a system of equations.\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n du2, ipiv, info, dl, d, du = NumRu::Lapack.cgttrf( dl, d, du, [: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_dl = argv[0];
rblapack_d = argv[1];
rblapack_du = argv[2];
if (argc == 3) {
} else if (rblapack_options != Qnil) {
} else {
}
if (!NA_IsNArray(rblapack_d))
rb_raise(rb_eArgError, "d (2th argument) must be NArray");
if (NA_RANK(rblapack_d) != 1)
rb_raise(rb_eArgError, "rank of d (2th argument) must be %d", 1);
n = NA_SHAPE0(rblapack_d);
if (NA_TYPE(rblapack_d) != NA_SCOMPLEX)
rblapack_d = na_change_type(rblapack_d, NA_SCOMPLEX);
d = NA_PTR_TYPE(rblapack_d, complex*);
if (!NA_IsNArray(rblapack_dl))
rb_raise(rb_eArgError, "dl (1th argument) must be NArray");
if (NA_RANK(rblapack_dl) != 1)
rb_raise(rb_eArgError, "rank of dl (1th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_dl) != (n-1))
rb_raise(rb_eRuntimeError, "shape 0 of dl must be %d", n-1);
if (NA_TYPE(rblapack_dl) != NA_SCOMPLEX)
rblapack_dl = na_change_type(rblapack_dl, NA_SCOMPLEX);
dl = NA_PTR_TYPE(rblapack_dl, complex*);
if (!NA_IsNArray(rblapack_du))
rb_raise(rb_eArgError, "du (3th argument) must be NArray");
if (NA_RANK(rblapack_du) != 1)
rb_raise(rb_eArgError, "rank of du (3th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_du) != (n-1))
rb_raise(rb_eRuntimeError, "shape 0 of du must be %d", n-1);
if (NA_TYPE(rblapack_du) != NA_SCOMPLEX)
rblapack_du = na_change_type(rblapack_du, NA_SCOMPLEX);
du = NA_PTR_TYPE(rblapack_du, complex*);
{
na_shape_t shape[1];
shape[0] = n-2;
rblapack_du2 = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
}
du2 = NA_PTR_TYPE(rblapack_du2, complex*);
{
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-1;
rblapack_dl_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
}
dl_out__ = NA_PTR_TYPE(rblapack_dl_out__, complex*);
MEMCPY(dl_out__, dl, complex, NA_TOTAL(rblapack_dl));
rblapack_dl = rblapack_dl_out__;
dl = dl_out__;
{
na_shape_t shape[1];
shape[0] = n;
rblapack_d_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
}
d_out__ = NA_PTR_TYPE(rblapack_d_out__, complex*);
MEMCPY(d_out__, d, complex, NA_TOTAL(rblapack_d));
rblapack_d = rblapack_d_out__;
d = d_out__;
{
na_shape_t shape[1];
shape[0] = n-1;
rblapack_du_out__ = na_make_object(NA_SCOMPLEX, 1, shape, cNArray);
}
du_out__ = NA_PTR_TYPE(rblapack_du_out__, complex*);
MEMCPY(du_out__, du, complex, NA_TOTAL(rblapack_du));
rblapack_du = rblapack_du_out__;
du = du_out__;
cgttrf_(&n, dl, d, du, du2, ipiv, &info);
rblapack_info = INT2NUM(info);
return rb_ary_new3(6, rblapack_du2, rblapack_ipiv, rblapack_info, rblapack_dl, rblapack_d, rblapack_du);
}
void
init_lapack_cgttrf(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "cgttrf", rblapack_cgttrf, -1);
}
|
