-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmatrix.c
460 lines (402 loc) · 13.2 KB
/
matrix.c
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
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
#include "matrix.h"
#include "stdlib.h"
#include "stdio.h"
#include "assert.h"
#include "math.h"
Matrix mat_new(const unsigned int rows, const unsigned int columns) {
Matrix res = malloc(sizeof(Matrix_t));
res->rows = rows;
res->columns = columns;
res->data = calloc(rows*columns, sizeof(double));
return res;
}
Matrix mat_new_I(const unsigned int rowsColumns) {
Matrix res = mat_new(rowsColumns, rowsColumns);
mat_fill_diag(res, 1);
return res;
}
Matrix mat_copy(Matrix matA) {
Matrix res = mat_new(matA->rows, matA->columns);
mat_rewrite(res, matA);
return res;
}
Matrix mat_copy_submat(Matrix matA, const unsigned int frow, const unsigned int fcolumn,
const unsigned int rows, const unsigned int columns) {
assert(matA->rows >= frow + rows);
assert(matA->columns >= fcolumn + columns);
Matrix res = mat_new(rows, columns);
for (int i = 0; i < res->rows; i++) {
for (int j = 0; j < res->columns; j++) {
MAT_ELEM(res, i, j) = MAT_ELEM(matA, i + frow, j + fcolumn);
}
}
return res;
}
Matrix mat_from_array(const double *array, const unsigned int rows, const unsigned int columns) {
Matrix res = malloc(sizeof(Matrix_t));
res->rows = columns;
res->columns = columns;
res->data = array;
return res;
}
void mat_replace(Matrix matA, Matrix matB) {
free(matA->data);
matA->rows = matB->rows;
matA->columns = matB->columns;
matA->data = matB->data;
free(matB);
}
Vector mat_copy_column(Matrix matA, const unsigned int column) {
assert(matA->columns > column);
Vector res = vec_new(matA->rows);
for (int i = 0; i < matA->rows; i++) {
VEC_ELEM(res, i) = MAT_ELEM(matA, i, column);
}
return res;
}
void mat_paste_column(Matrix matA, Vector vecB, const unsigned int column) {
assert(matA->columns > column);
for (int i = 0; i < matA->rows; i++) {
MAT_ELEM(matA, i, column) = VEC_ELEM(vecB, i);
}
}
Vector mat_get_diag(Matrix matA) {
assert(matA->rows == matA->columns);
Vector res = vec_new(matA->rows);
for (int i = 0; i < matA->rows; i++) {
VEC_ELEM(res, i) = MAT_ELEM(matA, i, i);
}
return res;
}
void mat_fill(Matrix matA, double val) {
for (int i = 0; i < matA->rows * matA->columns; i++) {
MAT_ELEM_FLAT(matA, i) = val;
}
}
void mat_fill_diag(Matrix matA, double val) {
assert(matA->rows == matA->rows);
for (int i = 0; i < matA->rows; i++) {
MAT_ELEM(matA, i, i) = val;
}
}
void mat_rewrite(Matrix matA, Matrix matB) {
assert(matA->rows == matB->rows);
assert(matA->columns == matB->columns);
for (int i = 0; i < matA->rows * matA->columns; i++) {
MAT_ELEM_FLAT(matA, i) = MAT_ELEM_FLAT(matB, i);
}
}
Matrix mat_multiply(Matrix matA, Matrix matB) {
assert(matA->columns == matB->rows);
Matrix res = mat_new(matA->rows, matB->columns);
for (int i = 0; i < res->rows; i++) {
for (int j = 0; j < res->columns; j++) {
for (int k = 0; k < matA->columns; k++) {
MAT_ELEM(res, i, j) += MAT_ELEM(matA, i, k) * MAT_ELEM(matB, k, j);
}
}
}
return res;
}
void mat_multiply_vec3_into(Matrix matA, Vector vecB) {
assert(vecB->size == matA->columns);
assert(matA->rows == matA->columns);
double tempX = VEC_X(vecB);
double tempY = VEC_Y(vecB);
VEC_X(vecB) = MAT_ELEM(matA, 0, 0) * tempX + MAT_ELEM(matA, 0, 1) * tempY + MAT_ELEM(matA, 0, 2) * VEC_Z(vecB);
VEC_Y(vecB) = MAT_ELEM(matA, 1, 0) * tempX + MAT_ELEM(matA, 1, 1) * tempY + MAT_ELEM(matA, 1, 2) * VEC_Z(vecB);
VEC_Z(vecB) = MAT_ELEM(matA, 2, 0) * tempX + MAT_ELEM(matA, 2, 1) * tempY + MAT_ELEM(matA, 2, 2) * VEC_Z(vecB);
}
Matrix mat_multiply_MMT(Matrix matA) {
Matrix res = mat_new(matA->rows, matA->rows);
for (int i = 0; i < res->rows; i++) {
for (int j = 0; j < res->columns; j++) {
for (int k = 0; k < matA->columns; k++) {
MAT_ELEM(res, i, j) += MAT_ELEM(matA, i, k) * MAT_ELEM(matA, j, k);
}
}
}
return res;
}
Vector mat_multiply_vec(Matrix matA, Vector vecB) {
assert(matA->columns == vecB->size);
Vector res = vec_new(matA->rows);
for (int i = 0; i < res->size; i++) {
for (int k = 0; k < matA->columns; k++) {
VEC_ELEM(res, i) += MAT_ELEM(matA, i, k) * VEC_ELEM(vecB, k);
}
}
return res;
}
Vector vec_multiply_mat(Vector vecA, Matrix matB) {
assert(vecA->size == matB->rows);
Vector res = vec_new(matB->columns);
for (int i = 0; i < res->size; i++) {
for (int k = 0; k < matB->rows; k++) {
VEC_ELEM(res, i) += VEC_ELEM(vecA, k) * MAT_ELEM(matB, k, i);
}
}
return res;
}
void mat_add(Matrix matA, Matrix matB) {
assert(matA->rows == matB->rows);
assert(matA->columns == matB->columns);
for (int i = 0; i < matA->rows * matA->columns; i++) {
MAT_ELEM_FLAT(matA, i) += MAT_ELEM_FLAT(matB, i);
}
}
void mat_sub(Matrix matA, Matrix matB) {
assert(matA->rows == matB->rows);
assert(matA->columns == matB->columns);
for (int i = 0; i < matA->rows * matA->columns; i++) {
MAT_ELEM_FLAT(matA, i) -= MAT_ELEM_FLAT(matB, i);
}
}
Matrix mat_transpose(Matrix matA) {
Matrix res = mat_new(matA->columns, matA->rows);
for (int i = 0; i < res->rows; i++) {
for (int j = 0; j < res->columns; j++) {
MAT_ELEM(res, i, j) = MAT_ELEM(matA, j, i);
}
}
return res;
}
void mat_orthogonalize(Matrix matA) {
assert(matA->rows == matA->columns);
for (int i = 1; i < matA->columns; i++) {
Vector column = mat_copy_column(matA, i);
for (int j = 1; j < i; j++) {
Vector prevColumn = mat_copy_column(matA, j);
vec_multiply_scalar(prevColumn, vec_dot_product(prevColumn, column));
vec_sub(column, prevColumn);
vec_free(prevColumn);
}
vec_normalize(column);
mat_paste_column(matA, column, i);
vec_free(column);
}
}
bool mat_is_upper_triang(Matrix matA, double tol) {
assert(matA->rows == matA->columns);
for (int i = 0; i < matA->rows; i++) {
for (int j = 0; j < i; j++) {
if (fabs(MAT_ELEM(matA, i, j)) > tol) {
return false;
}
}
}
return true;
}
bool mat_check_nan(Matrix matA) {
for (int i = 0; i < matA->rows*matA->columns; i++) {
if (MAT_ELEM_FLAT(matA, i) != MAT_ELEM_FLAT(matA, i))
return true;
}
return false;
}
Vector mat_linsolve_upperr_triang(Matrix R, Vector b) {
assert(R->columns == b->size);
assert(R->rows == R->columns);
Vector solution = vec_new(b->size);
float back_substitute;
for (int i = b->size - 1; i >= 0; i--) {
back_substitute = 0;
for (int j = i+1; j <= b->size - 1; j++) {
back_substitute += VEC_ELEM(solution, j) * MAT_ELEM(R, i, j);
}
VEC_ELEM(solution, i) =
(VEC_ELEM(b, i) - back_substitute) / MAT_ELEM(R, i, i);
}
return solution;
}
bool mat_inv_4x4(Matrix matA) {
double inv[16], det;
double *m = matA->data;
inv[0] = m[5] * m[10] * m[15] -
m[5] * m[11] * m[14] -
m[9] * m[6] * m[15] +
m[9] * m[7] * m[14] +
m[13] * m[6] * m[11] -
m[13] * m[7] * m[10];
inv[4] = -m[4] * m[10] * m[15] +
m[4] * m[11] * m[14] +
m[8] * m[6] * m[15] -
m[8] * m[7] * m[14] -
m[12] * m[6] * m[11] +
m[12] * m[7] * m[10];
inv[8] = m[4] * m[9] * m[15] -
m[4] * m[11] * m[13] -
m[8] * m[5] * m[15] +
m[8] * m[7] * m[13] +
m[12] * m[5] * m[11] -
m[12] * m[7] * m[9];
inv[12] = -m[4] * m[9] * m[14] +
m[4] * m[10] * m[13] +
m[8] * m[5] * m[14] -
m[8] * m[6] * m[13] -
m[12] * m[5] * m[10] +
m[12] * m[6] * m[9];
inv[1] = -m[1] * m[10] * m[15] +
m[1] * m[11] * m[14] +
m[9] * m[2] * m[15] -
m[9] * m[3] * m[14] -
m[13] * m[2] * m[11] +
m[13] * m[3] * m[10];
inv[5] = m[0] * m[10] * m[15] -
m[0] * m[11] * m[14] -
m[8] * m[2] * m[15] +
m[8] * m[3] * m[14] +
m[12] * m[2] * m[11] -
m[12] * m[3] * m[10];
inv[9] = -m[0] * m[9] * m[15] +
m[0] * m[11] * m[13] +
m[8] * m[1] * m[15] -
m[8] * m[3] * m[13] -
m[12] * m[1] * m[11] +
m[12] * m[3] * m[9];
inv[13] = m[0] * m[9] * m[14] -
m[0] * m[10] * m[13] -
m[8] * m[1] * m[14] +
m[8] * m[2] * m[13] +
m[12] * m[1] * m[10] -
m[12] * m[2] * m[9];
inv[2] = m[1] * m[6] * m[15] -
m[1] * m[7] * m[14] -
m[5] * m[2] * m[15] +
m[5] * m[3] * m[14] +
m[13] * m[2] * m[7] -
m[13] * m[3] * m[6];
inv[6] = -m[0] * m[6] * m[15] +
m[0] * m[7] * m[14] +
m[4] * m[2] * m[15] -
m[4] * m[3] * m[14] -
m[12] * m[2] * m[7] +
m[12] * m[3] * m[6];
inv[10] = m[0] * m[5] * m[15] -
m[0] * m[7] * m[13] -
m[4] * m[1] * m[15] +
m[4] * m[3] * m[13] +
m[12] * m[1] * m[7] -
m[12] * m[3] * m[5];
inv[14] = -m[0] * m[5] * m[14] +
m[0] * m[6] * m[13] +
m[4] * m[1] * m[14] -
m[4] * m[2] * m[13] -
m[12] * m[1] * m[6] +
m[12] * m[2] * m[5];
inv[3] = -m[1] * m[6] * m[11] +
m[1] * m[7] * m[10] +
m[5] * m[2] * m[11] -
m[5] * m[3] * m[10] -
m[9] * m[2] * m[7] +
m[9] * m[3] * m[6];
inv[7] = m[0] * m[6] * m[11] -
m[0] * m[7] * m[10] -
m[4] * m[2] * m[11] +
m[4] * m[3] * m[10] +
m[8] * m[2] * m[7] -
m[8] * m[3] * m[6];
inv[11] = -m[0] * m[5] * m[11] +
m[0] * m[7] * m[9] +
m[4] * m[1] * m[11] -
m[4] * m[3] * m[9] -
m[8] * m[1] * m[7] +
m[8] * m[3] * m[5];
inv[15] = m[0] * m[5] * m[10] -
m[0] * m[6] * m[9] -
m[4] * m[1] * m[10] +
m[4] * m[2] * m[9] +
m[8] * m[1] * m[6] -
m[8] * m[2] * m[5];
det = m[0] * inv[0] + m[1] * inv[4] + m[2] * inv[8] + m[3] * inv[12];
if (det == 0)
return false;
det = 1.0 / det;
for (int i = 0; i < 16; i++)
MAT_ELEM_FLAT(matA, i) = inv[i] * det;
return true;
}
bool mat_inv_3x3(Matrix matA) {
double inv[9], det;
double *m = matA->data;
inv[0] = m[4] * m[8] - m[5] * m[7];
inv[1] = -m[1] * m[8] + m[2] * m[7];
inv[2] = m[1] * m[5] - m[2] * m[4];
inv[3] = -m[3] * m[8] + m[5] * m[6];
inv[4] = m[0] * m[8] - m[2] * m[6];
inv[5] = -m[0] * m[5] + m[2] * m[3];
inv[6] = m[3] * m[7] - m[4] * m[6];
inv[7] = -m[0] * m[7] + m[1] * m[6];
inv[8] = m[0] * m[4] - m[1] * m[3];
det = m[0] * inv[0] + m[1] * inv[3] + m[2] * inv[6];
if (det == 0)
return false;
det = 1.0 / det;
for (int i = 0; i < 9; i++)
MAT_ELEM_FLAT(matA, i) = inv[i] * det;
return true;
}
Matrix mat_rotation_x(float rad) {
Matrix res = mat_new(3, 3);
float cosA = cos(rad);
float sinA = sin(rad);
MAT_ELEM(res, 0, 0) = 1.0f;
MAT_ELEM(res, 0, 1) = 0.0f;
MAT_ELEM(res, 0, 2) = 0.0f;
MAT_ELEM(res, 1, 0) = 0.0f;
MAT_ELEM(res, 1, 1) = cosA;
MAT_ELEM(res, 1, 2) = -sinA;
MAT_ELEM(res, 2, 0) = 0.0f;
MAT_ELEM(res, 2, 1) = sinA;
MAT_ELEM(res, 2, 2) = cosA;
return res;
}
Matrix mat_rotation_y(float rad) {
Matrix res = mat_new(3, 3);
float cosA = cos(rad);
float sinA = sin(rad);
MAT_ELEM(res, 0, 0) = cosA;
MAT_ELEM(res, 0, 1) = 0.0f;
MAT_ELEM(res, 0, 2) = sinA;
MAT_ELEM(res, 1, 0) = 0.0f;
MAT_ELEM(res, 1, 1) = 1.0f;
MAT_ELEM(res, 1, 2) = 0.0f;
MAT_ELEM(res, 2, 0) = -sinA;
MAT_ELEM(res, 2, 1) = 0.0f;
MAT_ELEM(res, 2, 2) = cosA;
return res;
}
Matrix mat_rotation_z(float rad) {
Matrix res = mat_new(3, 3);
float cosA = cos(rad);
float sinA = sin(rad);
MAT_ELEM(res, 0, 0) = cosA;
MAT_ELEM(res, 0, 1) = -sinA;
MAT_ELEM(res, 0, 2) = 0.0f;
MAT_ELEM(res, 1, 0) = sinA;
MAT_ELEM(res, 1, 1) = cosA;
MAT_ELEM(res, 1, 2) = 0.0f;
MAT_ELEM(res, 2, 0) = 0.0f;
MAT_ELEM(res, 2, 1) = 0.0f;
MAT_ELEM(res, 2, 2) = 1.0f;
return res;
}
void mat_print(Matrix matA) {
if (matA == NULL) return;
printf("Size (%d, %d):\n", matA->rows, matA->columns);
for (int i = 0; i < matA->rows; i++) {
for (int j = 0; j < matA->columns; j++) {
printf("%.3f, ", MAT_ELEM(matA, i, j));
}
printf("\n");
}
}
void mat_free(Matrix matA) {
if (matA == NULL) return;
free(matA->data);
free(matA);
}
void mat_from_array_free(Matrix matA) {
if (matA != NULL)
free(matA);
}