-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_metric.js
74 lines (69 loc) · 2.21 KB
/
_metric.js
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
(function() {
var calcEigr = require('./eigen/real_eig').calcEigr;
var fun = require('./util/pattern_match').fun;
function cloneMatrix(a) {
var output = [];
a.forEach(function(row) {
output.push(row.slice(0));
});
return output;
}
function transpose(m) {
var output = [];
for (var i = 0; i < m.length; i++) {
output.push([]);
}
for (var i = 0; i < m.length; i++) {
for (var j = 0; j < m[i].length; j++) {
output[i][j] = m[j][i];
}
}
return output;
}
function isDiagonal(m) {
for (var i = 0; i < m.length; i++) {
for (var j = 0; j < m[i].length; j++) {
if (i !== j && m[i][j] !== 0.0) return false;
}
}
return true;
}
function matrixEqual(m1, m2) {
if (m1.length !== m2.length) return false;
for (var i = 0; i < m1.length; i++) {
if (m1[i].length !== m2[i].length) return false;
for (var j = 0; j < m1[i].length; j++) {
if (m1[i][j] !== m2[i][j]) return false;
}
}
return true;
}
function isSymmetric(m) {
return matrixEqual(m, transpose(m));
}
function Metric(m) {
this.matrix = cloneMatrix(m);
if (!isSymmetric(this.matrix)) {
throw new Error("The metric matrix must be symmetric");
}
// compute eigen value decomposition
this.eig = calcEigr(cloneMatrix(this.matrix));
this.invEigMatrix = transpose(this.eig.matrix);
this.eigenMetric = this.eig.wr.slice(0);
this.isDiagonal = isDiagonal(this.matrix);
if (!this.isDiagonal) {
this.isEuclidean = this.isAntiEuclidean = false;
} else {
this.isEuclidean = this.isAntiEuclidean = true;
for (var i = 0; i < this.matrix.length; i++) {
if (this.matrix[i][i] !== 1.0) {
this.isEuclidean = false;
}
if (this.matrix[i][i] !== -1.0) {
this.isAntiEuclidean = false;
}
}
}
}
exports.Metric = Metric;
})();