/
ThreeDeePolynomial.cxx
239 lines (182 loc) · 6.84 KB
/
ThreeDeePolynomial.cxx
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
/* -------------------------------------------------------------------------- */
/* ThreeDeePolynomial.cc */
/* */
/* 3D polynomial basic routines. */
/* */
/* A.Kisselev, PNPI, St.Petersburg, Russia. */
/* e-mail: kisselev@hermes.desy.de */
/* -------------------------------------------------------------------------- */
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
// Yes, need ThreeDeePolySpace definition as well;
#include <ThreeDeePolySpace.h>
/* ========================================================================== */
ThreeDeePolynomial::ThreeDeePolynomial(ThreeDeePolySpace *_space)
{
// Check later, whether this is really needed;
memset(this, 0x00, sizeof(ThreeDeePolynomial));
space = _space;
linear = new double [space->dim];
memset(linear, 0x00, space->dim*sizeof(double));
cff = new double** [space->_max_power[_X_]];
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
cff[ix] = new double* [space->_max_power[_Y_]];
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
cff[ix][iy] = new double [space->_max_power[_Z_]];
memset(cff[ix][iy], 0x00, space->_max_power[_Z_]*sizeof(double));
} /*for*/
} /*for*/
} /* ThreeDeePolynomial::ThreeDeePolynomial */
/* ========================================================================== */
double ThreeDeePolynomial::value(double xx[3])
{
double ret = 0.0, argx[space->_max_power[_X_]];
double argy[space->_max_power[_Y_]], argz[space->_max_power[_Z_]];
if (off) return 0.0;
/* Well, I was not able to make it looking better; */
/* pow() is very slow on the other hand; */
argx[0] = argy[0] = argz[0] = 1.;
for(int ik=1; ik<space->_max_power[_X_]; ik++)
argx[ik] = argx[ik-1]*xx[_X_];
for(int ik=1; ik<space->_max_power[_Y_]; ik++)
argy[ik] = argy[ik-1]*xx[_Y_];
for(int ik=1; ik<space->_max_power[_Z_]; ik++)
argz[ik] = argz[ik-1]*xx[_Z_];
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
if (!PARITY_CHECK(space, _X_, ix)) continue;
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
if (!PARITY_CHECK(space, _Y_, iy)) continue;
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
{
if (!PARITY_CHECK(space, _Z_, iz)) continue;
ret += cff[ix][iy][iz]*argx[ix]*argy[iy]*argz[iz];
} /*for iz*/
} /*for iy*/
} /*for ix*/
return ret;
} /* ThreeDeePolynomial::value */
/* ========================================================================== */
double ThreeDeePolynomial::linearValue(double xx[3])
{
double ret = 0.0;
if (off) return 0.;
for(int ik=0; ik<space->dim; ik++)
ret += linear[ik]*space->basis[ik]->value(xx);
return ret;
} /* ThreeDeePolynomial::linearValue */
/* ========================================================================== */
int ThreeDeePolynomial::normalize()
{
// Looks ugly, I agree;
double norm = sqrtl(space->polyProduct(this, this));
if (!norm || (space->norm_cutoff && norm < space->norm_cutoff))
{
for(int ix=0; ix<space->_max_power[_X_]; ix++)
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
cff[ix][iy][iz] = 0.;
off = 1;
return -1;
} /*if*/
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
if (!PARITY_CHECK(space, _X_, ix)) continue;
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
if (!PARITY_CHECK(space, _Y_, iy)) continue;
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
{
if (!PARITY_CHECK(space, _Z_, iz)) continue;
cff[ix][iy][iz] /= norm;
} /*for iz*/
} /*for iy*/
} /*for ix*/
return 0;
} /* ThreeDeePolynomial::normalize */
/* -------------------------------------------------------------------------- */
void ThreeDeePolynomial::multiply(double _cff)
{
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
if (!PARITY_CHECK(space, _X_, ix)) continue;
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
if (!PARITY_CHECK(space, _Y_, iy)) continue;
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
{
if (!PARITY_CHECK(space, _Z_, iz)) continue;
cff[ix][iy][iz] *= _cff;
} /*for iz*/
} /*for iy*/
} /*for ix*/
} /* ThreeDeePolynomial::multiply */
/* -------------------------------------------------------------------------- */
void ThreeDeePolynomial::increment(ThreeDeePolynomial *incr)
{
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
if (!PARITY_CHECK(space, _X_, ix)) continue;
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
if (!PARITY_CHECK(space, _Y_, iy)) continue;
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
{
if (!PARITY_CHECK(space, _Z_, iz)) continue;
cff[ix][iy][iz] += incr->cff[ix][iy][iz];
} /*for iz*/
} /*for iy*/
} /*for ix*/
} /* ThreeDeePolynomial::increment */
/* ========================================================================== */
void ThreeDeePolynomial::convertLinearToCff()
{
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
if (!PARITY_CHECK(space, _X_, ix)) continue;
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
if (!PARITY_CHECK(space, _Y_, iy)) continue;
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
{
if (!PARITY_CHECK(space, _Z_, iz)) continue;
cff[ix][iy][iz] = 0.;
// Or should I rather use poly_multiply() & poly_add()?;
for(int ii=0; ii<space->dim; ii++)
cff[ix][iy][iz] += linear[ii]*space->basis[ii]->cff[ix][iy][iz];
} /*for iz*/
} /*for iy*/
} /*for ix*/
} /* ThreeDeePolynomial::convertLinearToCff */
/* ========================================================================== */
/* Has this ever been checked?..; */
int ThreeDeePolynomial::calculateGradient(ThreeDeePolynomial *gradient[3])
{
for(int ik=0; ik<3; ik++)
{
ThreeDeePolynomial *comp = gradient[ik];
for(int ix=0; ix<space->_max_power[_X_]; ix++)
{
if (!PARITY_CHECK(space, _X_, ix)) continue;
for(int iy=0; iy<space->_max_power[_Y_]; iy++)
{
if (!PARITY_CHECK(space, _Y_, iy)) continue;
for(int iz=0; iz<space->_max_power[_Z_]; iz++)
{
if (!PARITY_CHECK(space, _Z_, iz)) continue;
if (ik == _X_ && ix >= 1) comp->cff[ix-1][iy ][iz ] = ix*cff[ix][iy][iz];
if (ik == _Y_ && iy >= 1) comp->cff[ix ][iy-1][iz ] = iy*cff[ix][iy][iz];
if (ik == _Z_ && iz >= 1) comp->cff[ix ][iy ][iz-1] = iz*cff[ix][iy][iz];
} /*for iz*/
} /*for iy*/
} /*for ix*/
} /*for ik*/
return 0;
} /* ThreeDeePolynomial::calculateGradient */
/* ========================================================================== */