1 | import { isMatrix } from '../../utils/is';
|
2 | import { clone } from '../../utils/object';
|
3 | import { format } from '../../utils/string';
|
4 | import { factory } from '../../utils/factory';
|
5 | var name = 'det';
|
6 | var dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];
|
7 | export var createDet = factory(name, dependencies, function (_ref) {
|
8 | var typed = _ref.typed,
|
9 | matrix = _ref.matrix,
|
10 | subtract = _ref.subtract,
|
11 | multiply = _ref.multiply,
|
12 | unaryMinus = _ref.unaryMinus,
|
13 | lup = _ref.lup;
|
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 | return typed(name, {
|
41 | any: function any(x) {
|
42 | return clone(x);
|
43 | },
|
44 | 'Array | Matrix': function det(x) {
|
45 | var size;
|
46 |
|
47 | if (isMatrix(x)) {
|
48 | size = x.size();
|
49 | } else if (Array.isArray(x)) {
|
50 | x = matrix(x);
|
51 | size = x.size();
|
52 | } else {
|
53 |
|
54 | size = [];
|
55 | }
|
56 |
|
57 | switch (size.length) {
|
58 | case 0:
|
59 |
|
60 | return clone(x);
|
61 |
|
62 | case 1:
|
63 |
|
64 | if (size[0] === 1) {
|
65 | return clone(x.valueOf()[0]);
|
66 | } else {
|
67 | throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
|
68 | }
|
69 |
|
70 | case 2:
|
71 | {
|
72 |
|
73 | var rows = size[0];
|
74 | var cols = size[1];
|
75 |
|
76 | if (rows === cols) {
|
77 | return _det(x.clone().valueOf(), rows, cols);
|
78 | } else {
|
79 | throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
|
80 | }
|
81 | }
|
82 |
|
83 | default:
|
84 |
|
85 | throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');
|
86 | }
|
87 | }
|
88 | });
|
89 | |
90 |
|
91 |
|
92 |
|
93 |
|
94 |
|
95 |
|
96 |
|
97 |
|
98 | function _det(matrix, rows, cols) {
|
99 | if (rows === 1) {
|
100 |
|
101 | return clone(matrix[0][0]);
|
102 | } else if (rows === 2) {
|
103 |
|
104 |
|
105 | return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
|
106 | } else {
|
107 |
|
108 | var decomp = lup(matrix);
|
109 |
|
110 | var det = decomp.U[0][0];
|
111 |
|
112 | for (var _i = 1; _i < rows; _i++) {
|
113 | det = multiply(det, decomp.U[_i][_i]);
|
114 | }
|
115 |
|
116 |
|
117 |
|
118 | var evenCycles = 0;
|
119 | var i = 0;
|
120 | var visited = [];
|
121 |
|
122 | while (true) {
|
123 | while (visited[i]) {
|
124 | i++;
|
125 | }
|
126 |
|
127 | if (i >= rows) break;
|
128 | var j = i;
|
129 | var cycleLen = 0;
|
130 |
|
131 | while (!visited[decomp.p[j]]) {
|
132 | visited[decomp.p[j]] = true;
|
133 | j = decomp.p[j];
|
134 | cycleLen++;
|
135 | }
|
136 |
|
137 | if (cycleLen % 2 === 0) {
|
138 | evenCycles++;
|
139 | }
|
140 | }
|
141 |
|
142 | return evenCycles % 2 === 0 ? det : unaryMinus(det);
|
143 | }
|
144 | }
|
145 | }); |
\ | No newline at end of file |