forked from PierreSenellart/matrix_tutorial
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.c
More file actions
131 lines (110 loc) · 2.55 KB
/
matrix.c
File metadata and controls
131 lines (110 loc) · 2.55 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
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include "matrix.h"
#define PRINT_PRECISION "6"
#define PRINT_DECIMAL_PRECISION "2"
matrix matrix_create(unsigned n1, unsigned n2, scalar v)
{
matrix m={n1,n2,true,NULL};
if(n1==0 || n2==0)
return m;
else if(SIZE_MAX / n1 <= n2)
m.ok = false;
else if (!(m.data=calloc(((size_t) n1)*n2, sizeof(scalar))))
m.ok = false;
else {
for(unsigned i=0; i<n1; ++i)
for(unsigned j=0; j<n2; ++j)
*matrix_get(m,i,j) = v;
}
return m;
}
matrix matrix_identity(unsigned n)
{
matrix m = matrix_create(n, n, 0.);
if(!m.ok)
return m;
for(unsigned i=0; i<n; ++i)
*matrix_get(m, i, i) = 1.;
return m;
}
void matrix_destroy(matrix m)
{
if(m.ok) {
m.ok = false;
free(m.data);
}
}
scalar *matrix_get(matrix m, unsigned i, unsigned j)
{
if(!m.ok || i>m.n1 || i>m.n2)
return NULL;
return &m.data[i*m.n2+j];
}
matrix matrix_add(matrix m, matrix n)
{
matrix res={0,0,false,NULL};
if(m.n1!=n.n1 || m.n2!=n.n2 || !m.ok || !n.ok)
return res;
res=matrix_create(m.n1, m.n2, 0.);
for(unsigned i=0; i<m.n1; ++i)
for(unsigned j=0; j<m.n2; ++j)
*matrix_get(res, i, j) = *matrix_get(m, i, j) + *matrix_get(n, i, j);
return res;
}
void matrix_print(FILE *f, matrix m)
{
if(!m.ok)
fprintf(f, "Invalid matrix\n");
else {
for(unsigned i=0; i<m.n1; ++i) {
for(unsigned j=0; j<m.n2; ++j)
fprintf(
f,
"%"PRINT_PRECISION"."PRINT_DECIMAL_PRECISION"f ",
*matrix_get(m, i, j));
fprintf(f, "\n");
}
}
}
matrix fast_pow(matrix m, unsigned n) {
if (n == 0) {
return matrix_identity(m.n1);
}
matrix res = fast_pow(m, n >> 1);
matrix res2 = mul_matrix(res, res);
matrix_destroy(res);
res = res2;
if (n & 1) {
matrix res3 = mul_matrix(res, m);
matrix_destroy(res);
res = res3;
}
return res;
}
matrix scal_mul(matrix m, scalar l) {
matrix res = matrix_create(m.n1, m.n2, 0.0);
for (unsigned i = 0; i < m.n1; i++) {
for (unsigned j = 0; j < m.n2; j++) {
*matrix_get(res, i, j) = l * *matrix_get(m, i, j);
}
}
return res;
}
matrix mul_matrix(matrix a, matrix b)
{
matrix res = {0,0,false,NULL};
if (a.n2 != b.n1 || !a.ok || !b.ok) {
return res;
}
res = matrix_create(a.n1,b.n2,0.);
for(unsigned i=0; i<res.n1; ++i) {
for(unsigned j=0; j<res.n2; j++) {
for(unsigned k=0; k<a.n2; k++) {
*matrix_get(res, i, j) = *matrix_get(res, i, j) + (*matrix_get(a, i, k)) * (*matrix_get(b, k, j));
}
}
}
return res;
}