This repository was archived by the owner on Nov 23, 2019. It is now read-only.
forked from yayahjb/ncdist
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMatD7.cpp
More file actions
419 lines (350 loc) · 13 KB
/
MatD7.cpp
File metadata and controls
419 lines (350 loc) · 13 KB
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
#include "LRL_CoordinateConversionMatrices.h"
#include "D7.h"
#include "MatD7.h"
#include "MatG6.h"
#include "MatMN.h"
#include "MatN.h"
#include <algorithm>
#include <string>
#include <vector>
#pragma warning( disable : 4702) // unreachable code
#pragma warning( disable : 4100) // unreferenced formal parameter
std::vector<MatD7> MatD7::vD7_Refl = MatD7::GetReflections();
MatD7::MatD7(void)
: m_mat(49)
{}
//MatD7::MatD7(const LRL_Cell& m)
// : m_mat(49)
//{throw;}
MatD7::MatD7(const MatS6& m)
: MatD7()
{
const MatMN mnS6 = m;
const MatMN mn = LRL_CoordinateConversionMatrices::D7_FROM_S6 * mnS6 * LRL_CoordinateConversionMatrices::S6_FROM_D7;
m_mat.SetVector( mn.GetVector());
m_mat.SetDim(49);
m_mat.SetRowDim(7);
}
MatD7::MatD7(const MatD7& m)
: m_mat(m.m_mat)
{}
MatD7::MatD7(const MatG6& m)
: MatD7()
{
const MatMN mn = LRL_CoordinateConversionMatrices::D7_FROM_G6 * m * LRL_CoordinateConversionMatrices::G6_FROM_D7;
m_mat.SetVector(mn.GetVector());
}
MatD7::MatD7(const MatN& m)
: m_mat(m)
{}
MatD7::MatD7(const MatMN& m)
: m_mat(m.GetDim())
{
if (m.GetColDim() != m.GetRowDim()) throw;
const size_t n = m.GetRowDim();
m_mat.resize(n);
m_mat.SetVector(m.GetVector());
m_mat.SetDim(n*n);
m_mat.SetRowDim(n);
}
MatD7::MatD7(const std::string& s)
: MatD7()
{
MatN mn ( m_mat.FromString(s));
(*this).m_mat = mn;
}
MatD7::MatD7(const std::vector<double>& v)
: MatD7()
{
for (size_t i = 0; i < 49; ++i) {
m_mat[i] = v[i];
}
}
MatD7& MatD7::operator= (const MatB4& m) {
m_mat.resize(49);
throw("we don't know how to do this");
return *this;
}
MatD7& MatD7::operator= (const MatS6& m) {
m_mat.resize(49);
m_mat.SetVector((LRL_CoordinateConversionMatrices::D7_FROM_S6 * m * LRL_CoordinateConversionMatrices::S6_FROM_D7).GetVector());;
return *this;
}
MatD7& MatD7::operator= (const MatD7& v) {
m_mat.resize(49);
m_mat = v.m_mat;
return *this;
}
MatD7& MatD7::operator= (const MatG6& m) {
m_mat.resize(49);
m_mat.SetVector((LRL_CoordinateConversionMatrices::D7_FROM_G6 * m * LRL_CoordinateConversionMatrices::G6_FROM_D7).GetVector());;
return *this;
}
MatD7& MatD7::operator+= (const MatD7& d) {
for (size_t i = 0; i < 49; ++i) m_mat[i] += d[i];
return *this;
}
MatD7& MatD7::operator-= (const MatD7& d) {
for (size_t i = 0; i < 49; ++i) m_mat[i] -= d[i];
return *this;
}
bool MatD7::operator== (const MatD7& m) const {
for (size_t i = 0; i < 49; ++i) if( m_mat[i] != m[i]) return false;
return true;
}
bool MatD7::operator!= (const MatD7& m) const {
return !((*this) == m);
}
MatD7& MatD7::operator/= (const double d) {
for (size_t i = 0; i < 49; ++i) m_mat[i] /= d;
return *this;
}
MatD7& MatD7::operator*= (const double d) {
for (size_t i = 0; i < 49; ++i) m_mat[i] *= d;
return *this;
}
MatD7 MatD7::operator+ (const MatD7& v) const {
MatD7 m(*this);
return (m += v);
}
MatD7 MatD7::operator- (const MatD7& v) const {
MatD7 m(*this);
return (m -= v);
}
MatD7 MatD7::operator- (void) const { // unary
MatD7 m(*this);
m.m_mat = -m.m_mat;
return m; // unary
}
MatD7 MatD7::operator* (const MatD7& m2) const {
MatD7 m(*this);
m.m_mat *= m2.m_mat;
return m;
}
MatD7 MatD7::operator* (const double d) const {
MatD7 m(*this);
for (size_t i = 0; i < 49; ++i) m.m_mat[i] *= d;
return m;
}
MatD7 MatD7::operator/ (const double d) const {
MatD7 m(*this);
for (size_t i = 0; i < 49; ++i) m.m_mat[i] /= d;
return m;
}
MatD7 operator*(const double d, const MatD7& m) {
return m*d;
}
MatD7 operator/(const double d, const MatD7& m) {
return m / d;
}
D7 MatD7::operator* (const D7& v) const {
D7 d7 = m_mat * v.GetVector();
d7.SetValid(v.GetValid());
return d7;
}
double MatD7::operator[] (const size_t n) const {
return m_mat[n];
}
double& MatD7::operator[] (const size_t n) {
return m_mat[n];
}
double MatD7::DistanceBetween(const MatD7& v1, const MatD7& v2) {
return ((v1 - v2).norm());
}
size_t MatD7::size(void) const {
return 49;
}
double MatD7::norm() const {
double sum = 0.0;
for (size_t i = 0; i < 49; ++i) sum += m_mat[i]* m_mat[i];
return sqrt(sum);
}
double MatD7::norm(const MatD7& t) const {
return t.norm();
}
double MatD7::Norm() const {
return norm();
}
double MatD7::Norm(const MatD7& t) const {
return t.norm();
}
bool MatD7::IsUnit() const {
long row = -1;
for (size_t i = 0; i < 49; ++i) {
long column = i % 7;
if (column == 0) ++row;
if (column == row && m_mat[i] != 1.0) return false;
if (column != row && m_mat[i] != 0.0) return false;
}
return true;
}
MatD7 MatD7::Eye() {
MatD7 m;
for (size_t i = 0; i<49; ++i)
m.m_mat[i] = 0.0;
for (size_t i = 0; i<49; i += 8)
m.m_mat[i] = 1.0;
return m;
}
MatD7 MatD7::Zero(void) {
MatD7 m;
for (size_t i = 0; i < 49; ++i)
m[i] = 0.0;
return m;
}
MatD7 MatD7::transpose(const MatD7& m2) const {
// transpose a symmetrical matrix
const int size = 7;
MatD7 m;
for (int count = 0; count<size*size; ++count) {
const int transposeIndex = count / size + size*(count%size); //'=int(rowindex/6) +6*colIndex)
if (count >= transposeIndex) {
m[transposeIndex] = m2[count];
m[count] = m2[transposeIndex];
}
}
return m;
}
void MatD7::transpose(void) {
// transpose a symmetrical matrix
const int size = 7;
MatD7& m(*this);
MatD7 m2(*this);
for (int count = 0; count<size*size; ++count) {
const int transposeIndex = count / size + size*(count%size); //'=int(rowindex/6) +6*colIndex)
if (count >= transposeIndex) {
m[transposeIndex] = m2[count];
m[count] = m2[transposeIndex];
}
}
}
double MatD7::at(const size_t n) const {
return m_mat[n];
}
MatD7 MatD7::unit(void) {
m_mat.resize(49);
for (size_t i = 0; i < 49; ++i)
m_mat[i] = 0.0;
for (size_t i = 0; i < 49; i += 7+1)
m_mat[i] = 1.0;
return *this;
}
MatD7 MatD7::unit(const MatD7& min) {
MatD7 m(min);
for (size_t i = 0; i < 49; ++i)
m.m_mat[i] = 0.0;
for (size_t i = 0; i < 49; i += 7+1)
m.m_mat[i] = 1.0;
return m;
}
//static const MatD7 mReducer( "0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0");
static std::vector<MatD7> vReducer;
bool IsBetter(const MatD7& m1, const MatD7& m2) {
return m1.norm() < m2.norm();
}
MatD7 MatD7::Reduce(void) const {
if (vReducer.empty()) {
vReducer.push_back(MatD7("1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"));
vReducer.push_back(MatD7("0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"));
vReducer.push_back(MatD7("0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"));
vReducer.push_back(MatD7("0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"));
vReducer.push_back(MatD7("0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0"));
vReducer.push_back(MatD7("0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1 0 0 0 0 0 0 0"));
vReducer.push_back(MatD7("0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 -1 -1 -1"));
}
MatD7 mToReduce(*this);
double mNorm = mToReduce.norm();
const double testValue = 1.0E-6 * mNorm;
double lastNorm = mNorm;
int count = 0;
while (count <1 || mNorm - lastNorm > testValue) {
++count;
for (size_t nloops = 1; nloops < 4; ++nloops) {
for (size_t i = 0; i < vReducer.size(); ++i) {
const MatD7 m1 = mToReduce - vReducer[i];
const MatD7 m2 = mToReduce + vReducer[i];
if (IsBetter(m1, mToReduce))
mToReduce = m1;
if (IsBetter(m2, mToReduce))
mToReduce = m2;
}
}
}
return mToReduce;
}
const double t1[10] = { 2, 0, 0, 0, 0, 1, 1, 1, 0, 0 };
const double t2[10] = { 0, 2, 0, 0, 1, 0, 1, 0, 1, 0 };
const double t3[10] = { 0, 0, 2, 0, 1, 1, 0, 0, 0, 1 };
const double t4[10] = { 0, 0, 0, 2, 0, 0, 0, 1, 1, 1 };
//const double tx[10] = { 1, 1, 1, -1, 1, 1, 1, 0, 0, 0 };
void FixColumnMinus7(MatD7& m, const size_t start, const double v[7]) {
for (size_t i = start, j = 0; i<start + 7; ++i, ++j)
m[i] += v[j];
}
void FixColumnPlus7(MatD7& m, const size_t start, const double v[7]) {
for (size_t i = start, j = 0; i<start + 7; ++i, ++j)
m[i] -= v[j];
}
void FixSixColumnsOneAndOneZero(MatD7& m, const size_t start) {
for (size_t i = start; i < start + 7; ++i)
m[i] = m[i] == 0.0 ? 1.0 : 0.0;
}
// special function for simplifying 7-space transformation matrices
void MatD7::ReplaceTwosInRows7x7( MatD7& m ) {
for( size_t i=0; i<49; i = i+7 ) {
if ( m[i+0] == -2.0 ) FixColumnMinus7( m, i, t1 );
if ( m[i+1] == -2.0 ) FixColumnMinus7( m, i, t2 );
if ( m[i+2] == -2.0 ) FixColumnMinus7( m, i, t3 );
if ( m[i+3] == -2.0 ) FixColumnMinus7( m, i, t4 );
if ( m[i+0] == 2.0 ) FixColumnPlus7( m, i, t1 );
if ( m[i+1] == 2.0 ) FixColumnPlus7( m, i, t2 );
if ( m[i+2] == 2.0 ) FixColumnPlus7( m, i, t3 );
if ( m[i+3] == 2.0 ) FixColumnPlus7( m, i, t4 );
double sumAbs = 0.0;
double sum = 0.0;
double maxAbs = 0.0;
double fourSum = 0;
for (size_t j = i; j < i + 7; ++j) {
const double mj = m[j];
sumAbs += std::abs(mj);
sum += mj;
maxAbs = std::max(maxAbs, std::abs(mj));
if (j < i + 4) fourSum += mj;
}
const double d = m[i + 6];
if (sumAbs == 6 && sum == 0 && maxAbs == 1) FixSixColumnsOneAndOneZero(m, i);
}
}
MatD7 MatD7::GetReflection(const size_t n) {
if (vD7_Refl.empty()) GetReflections();
return vD7_Refl[n];
}
std::vector<MatD7> MatD7::GetReflections() {
if (vD7_Refl.empty()) {
vD7_Refl.push_back(MatD7("1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0"));
vD7_Refl.push_back(MatD7("0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1"));
vD7_Refl.push_back(MatD7("0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0"));
vD7_Refl.push_back(MatD7("0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0"));
}
return vD7_Refl;
}