-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmatrix_base.h
104 lines (83 loc) · 1.87 KB
/
matrix_base.h
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
//
// Created by 彭伟浩 on 2018/7/1.
/*
*
*
*
*
* */
//
#ifndef MATRIX_MATRIX_H
#define MATRIX_MATRIX_H
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#define dex(matrix, a, b) matrix.data[a*matrix.c+b]
#define matrix_malloc(a,b) malloc(a*b*sizeof(double))
typedef struct {
int r;
int c;
double *data;
} matrix;
void matrix_multiply(matrix a, matrix b, matrix result) {
if(a.c != b.r){
fprintf(stderr,"矩阵一的行和矩阵二的列不相等,无法相乘");
return;
}
double sum = 0;
result.r = a.r;
result.c = b.c;
int n = a.c;
for (int i = 0; i < b.c; ++i) { //遍历b的列
for (int j = 0; j < a.r; ++j) { //遍历a的行
for (int k = 0; k < n; ++k) {
sum=sum+dex(a,j,k)*dex(b,k,i);
}
dex(result,j,i)=sum;
sum=0;
}
}
}
void eye(matrix m){ //单位矩阵
for (int i = 0; i < m.r; ++i) {
for (int j = 0; j < m.c; ++j) {
if(i == j)
dex(m,i,j)=1;
else
dex(m,i,j)=0;
}
}
}
matrix d_eye(int a){
matrix m;
m.c=a;
m.r=a;
m.data=malloc(a*a*sizeof(double));
eye(m);
return m;
}
void matrix_print(matrix m){
for (int i = 0; i < m.r; ++i) {
for (int j = 0; j < m.c; ++j) {
printf("%7.3f",dex(m,i,j));
}
printf("\n");
}
}
void join_row_matrix(matrix a, matrix b, matrix result){
if(a.r != b.r){
fprintf(stderr,"矩阵一的行和矩阵二的行不相等,无法进行拼接");
return;
}
int j;
for (int i = 0; i < a.r; ++i) {
for (j = 0; j < a.c; ++j) {
dex(result,i,j)=dex(a,i,j);
}
for ( ; j < b.c; ++j) {
dex(result,i,j)=dex(b,i,j-a.c);
}
}
}
#endif //MATRIX_MATRIX_H