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
|
/*
* ilut.cpp: ILUT plugin for FreeFem++ wrapping GMM++ functions.
* Copyright (C) 2008, Alessandro Proverbio and David Radice.
*
* ilut.cpp is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 2.1
* as published by the Free Software Foundation;
*
* ilut.cpp is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with ilut.cpp; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
//ff-c++-LIBRARY-dep: gmm
//ff-c++-cpp-dep:
#include <cmath>
#include <iostream>
#include "AFunction.hpp"
#include "RNM.hpp"
#include "error.hpp"
#include <gmm/gmm.h>
#include <vector>
#define ILUT_K_FILLIN 5
#define ILUT_EPS 1e-6
#define PRINT(VAR) cout << VAR << endl
using namespace std;
using namespace gmm;
typedef ilut_precond<row_matrix<rsvector<double> > > my_ilut_precond;
class ILUT;
class ILUT_Matrix {
private:
long * _i;
long * _j;
double * _c;
long _nelem;
long _size;
public:
ILUT_Matrix(KN<long> * const & i,
KN<long> * const & j,
KN<double> * const & c): _i(*i),
_j(*j),
_c(*c),
_nelem(c->N()) {
_size=max(i->max(),j->max());
++_size;
}
friend class ILUT;
};
class ILUT_Vector {
private:
double * _v;
long _size;
public:
ILUT_Vector(KN<double> * const & c) : _v(*c),_size(c->N()) {}
friend class ILUT;
};
class ILUT {
private:
static my_ilut_precond * p;
static long size;
public:
static long make_ilut_precond(ILUT_Matrix const & m) {
row_matrix<rsvector<double> > A(m._size,m._size);
row_matrix<wsvector<double> > w_A(m._size,m._size);
for(long k(0);k<m._nelem;++k) {
w_A[m._i[k]][m._j[k]]=m._c[k];
}
copy(w_A,A); // A <-- w_A
delete p;
p = new my_ilut_precond(A,ILUT_K_FILLIN,ILUT_EPS);
size=m._size;
return 0;
}
static void apply_ilut_precond(ILUT_Vector const & v,
KN<double> * const & x) {
vector<double> vv(size);
vector<double> xx(size);
for(long k=0;k<size;++k) {
vv[k]=v._v[k];
}
mult(*p,vv,xx); // xx <-- p.solve(vv)
for(long k=0;k<size;++k) {
(*x)[k]=xx[k];
}
// If used for the full vector fill the remaining components
for(long k=0;k+size<x->N();++k) {
(*x)[k+size]=v._v[k+size];
}
}
};
my_ilut_precond * ILUT::p=0;
long ILUT::size=0;
long * make_ilut_precond_eq(long * const & errorcode,
ILUT_Matrix const & mat) {
*errorcode=ILUT::make_ilut_precond(mat);
return errorcode;
}
KN<double> * apply_ilut_precond_eq(KN<double> * const & x,
ILUT_Vector const & vec) {
ILUT::apply_ilut_precond(vec, x);
return x;
}
ILUT_Matrix make_ilut_precond(KN<long> * const & i,
KN<long> * const & j,
KN<double> * const & v) {
return ILUT_Matrix(i,j,v);
}
ILUT_Vector apply_ilut_precond(KN<double> * const & v) {
return ILUT_Vector(v);
}
static void Load_Init() {
if(verbosity) cout << " -- load ilut init : " << endl;
Dcl_Type<ILUT_Matrix>();
Dcl_Type<ILUT_Vector>();
Global.Add("applyIlutPrecond","(",new OneOperator1_<ILUT_Vector,KN<double>* >(apply_ilut_precond));
Global.Add("makeIlutPrecond","(", new OneOperator3_<ILUT_Matrix,KN<long> *,KN<long> *,KN<double> *>(make_ilut_precond));
TheOperators->Add("=", new OneOperator2_<long *,long *,ILUT_Matrix>(make_ilut_precond_eq));
TheOperators->Add("=", new OneOperator2_<KN<double> *, KN<double> *,ILUT_Vector>(apply_ilut_precond_eq));
}
LOADFUNC(Load_Init)
|
