-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.c
More file actions
178 lines (161 loc) · 4.03 KB
/
matrix.c
File metadata and controls
178 lines (161 loc) · 4.03 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
void initMat(){
srand(time(NULL));
}
void matrixAllocate(matrix* mat, int m, int n){
mat->m = m;
mat->n = n;
mat->array = (double*)calloc(m*n, sizeof(double));
}
int matrixCopy(matrix* dst, matrix* src){
if ((dst->n != src->n) || (dst->m != src->m)){
printf("(%d, %d) != (%d, %d)\n",dst->m,dst->n,src->m,src->n);
printf("matrixCopy wrong dimension\n");
return -1;
}
int m = dst->m; int n = dst->n;
double* dPointer = dst->array;
double* sPointer = src->array;
for (int i = 0; i < m; i++){
for (int j = 0; j < n; j++){
dPointer[i*n + j] = sPointer[i*n + j];
}
}
return 0;
}
void matrixRandFill(matrix* mat, int min, int max){
int m = mat->m; int n = mat->n;
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
mat->array[i*n + j] = gaussian();
}
}
}
void matrixScalar(matrix* mat, double scalar){
int m = mat->m; int n = mat->n;
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
mat->array[i*n + j] *= scalar;
}
}
}
int matrixTranspose(matrix* mat){
double* matrix = mat->array;
int m = mat->m; int n = mat->n;
double* newMat = malloc(sizeof(double) * m*n);
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
newMat[j*m + i] = matrix[i*n + j];
}
}
mat->n = mat->m;
mat->m = n;
free(mat->array);
mat->array = newMat;
return 0;
}
int matrixSigmoid(matrix* A){
if (A->n != 1){
perror("Cannot do sigmoid");
return -1;
};
for(int i = 0; i < A->m; i++){
A->array[i] = sigmoid(A->array[i]);
}
return 0;
}
int matrixSigmoidPrime(matrix* A){
if (A->n != 1){
perror("Cannot do sigmoid prime");
return -1;
};
for(int i = 0; i < A->m; i++){
A->array[i] = sigmoidPrime(A->array[i]);
}
return 0;
}
int matrixMultNoDelete(matrix* A, matrix* B, matrix* out){
if ((A->n != B->m)||(A->m != out->m)||(B->n != out->n)){
printf("(%d, %d) x (%d, %d) != (%d, %d)",A->m,A->n,B->n,B->m,out->m,out->n);
perror("matrixMult error: sizes incorrect");
return -1;
}
int am = A->m; int an = A->n; int bn = B->n;
for(int i = 0; i < am; i++){
for(int j = 0; j < bn; j++){
float temp = 0;
for(int k = 0; k < an; k++){
temp += A->array[i*an + k] * B->array[k*bn + j];
}
out->array[i*bn + j] += temp;
}
}
return 0;
}
int matrixMult(matrix* A, matrix* B, matrix* out){
if ((A->n != B->m)||(A->m != out->m)||(B->n != out->n)){
printf("(%d, %d) x (%d, %d) != (%d, %d)",A->m,A->n,B->n,B->m,out->m,out->n);
perror("matrixMult error: sizes incorrect");
return -1;
}
int am = A->m; int an = A->n; int bn = B->n;
for(int i = 0; i < am; i++){
for(int j = 0; j < bn; j++){
float temp = 0;
for(int k = 0; k < an; k++){
temp += A->array[i*an + k] * B->array[k*bn + j];
}
out->array[i*bn + j] = temp;
}
}
return 0;
}
int matrixAdd(matrix* dst, matrix* src){ //in place,a s opposed to matrix multiply???
if ((dst->n != src->n) || (dst->m != src->m)){
perror("matrixAdd wrong dimension");
return -1;
}
int m = dst->m; int n = dst->n;
double* dpointer = dst->array;
double* spointer = src->array;
for (int i = 0; i < m; i++){
for (int j = 0; j < n; j++){
dpointer[i*n + j] += spointer[i*n + j];
}
}
return 0;
}
int matrixHamProd(matrix* dst, matrix* src){ //in place,a s opposed to matrix multiply???
if ((dst->n != src->n) || (dst->m != src->m)){
perror("matrixAdd wrong dimension");
return -1;
}
int m = dst->m; int n = dst->n;
double* dpointer = dst->array;
double* spointer = src->array;
for (int i = 0; i < m; i++){
for (int j = 0; j < n; j++){
dpointer[i * n + j] *= spointer[i*n + j];
}
}
return 0;
}
void matrixPrint(matrix* mat) {
int m = mat->m; int n = mat->n;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
printf(" %lf ", mat->array[i*n + j]);
}
printf("\n");
}
}
void matrixNonZeros(matrix* mat) {
int m = mat->m; int n = mat->n;
int nonzeros = 0;
for (int i = 0; i < m *n; i++) {
if (mat->array[i]){ nonzeros++;};
}
printf("%d nonzeros \n", nonzeros);
}
void matrixFree(matrix* mat) {
free(mat->array); // Free the array of rows
}