-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmatrix.cpp
239 lines (194 loc) · 5.46 KB
/
matrix.cpp
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
#include <math.h>
#include "matrix.h"
// Vector /////////////////////////////////////////////////////////////////////
Vector::Vector(const Vector& v) {
size = v.size;
array = new double[size];
for(int i=0; i<size; i++) array[i] = v.array[i];
}
Vector& Vector::operator=(const Vector& v) {
if(size != v.size)
std::cerr << "Sizes differ in Vector::operator=(const Vector&)";
for(int i=0; i<size; i++) array[i] = v.array[i];
return *this;
}
Vector& Vector::operator=(double x) {
for(int i=0; i<size; i++) array[i] = x;
return *this;
}
// NOTE: this is an unsafe assignment, as the size of the array that will be copied cannot be checked.
Vector& Vector::operator=(double* a){
for(int i=0; i<size; i++) array[i] = a[i];
return *this;
}
// NOTE: this is safe
Vector& Vector::operator=(std::vector<double>& a){
if(size != a.size())
std::cerr << "Sizes differ in Vector::operator=(std::vector<double>&)";
for(int i=0; i<size; i++) array[i] = a[i];
return *this;
}
Vector& Vector::operator+=(const Vector& v) {
if(size != v.size)
std::cerr << "Sizes differ in Vector::operator+=(const Vector&)";
for(int i=0; i<size; i++) array[i] += v.array[i];
return *this;
}
Vector& Vector::operator-=(const Vector& v) {
if(size != v.size)
std::cerr << "Sizes differ in Vector::operator-=(const Vector&)";
for(int i=0; i<size; i++) array[i] -= v.array[i];
return *this;
}
Vector& Vector::operator*=(double x) {
for(int i=0; i<size; i++) array[i] *= x;
return *this;
}
Vector& Vector::operator/=(double x) {
for(int i=0; i<size; i++) array[i] /= x;
return *this;
}
double Vector::operator*(const Vector& v) const {
int n = size;
if(size > v.size) n = v.size;
double dot = 0;
for(int i=0; i<n; i++) dot += array[i]*v.array[i];
return dot;
}
// Matrix /////////////////////////////////////////////////////////////////////
Matrix::Matrix(const Matrix& m) {
size[0] = m.size[0];
size[1] = m.size[1];
array = new double[size[0]*size[1]];
for(int i=0; i<size[0]*size[1]; i++) array[i] = m.array[i];
}
Matrix& Matrix::operator=(const Matrix& m) {
if(size[0] != m.size[0] || size[1] != m.size[1])
std::cerr << "Sizes differ in Matrix::operator=(const Matrix&)";
for(int i=0; i<size[0]*size[1]; i++) array[i] = m.array[i];
return *this;
}
Matrix& Matrix::operator=(double x) {
for(int i=0; i<size[0]*size[1]; i++) array[i] = x;
return *this;
}
Matrix& Matrix::operator+=(const Matrix& m) {
if(size[0] != m.size[0] || size[1] != m.size[1])
std::cerr << "Sizes differ in Matrix::operator+=(const Matrix&)";
for(int i=0; i<size[0]*size[1]; i++) array[i] += m.array[i];
return *this;
}
Matrix& Matrix::operator-=(const Matrix& m) {
if(size[0] != m.size[0] || size[1] != m.size[1])
std::cerr << "Sizes differ in Matrix::operator-=(const Matrix&)";
for(int i=0; i<size[0]*size[1]; i++) array[i] -= m.array[i];
return *this;
}
Matrix& Matrix::operator*=(double x) {
for(int i=0; i<size[0]*size[1]; i++) array[i] *= x;
return *this;
}
Matrix& Matrix::operator/=(double x) {
for(int i=0; i<size[0]*size[1]; i++) array[i] /= x;
return *this;
}
// Permutation ////////////////////////////////////////////////////////////////
void Permutation::identity() {
for(int i=0; i<size; i++) array[i] = i;
my_parity = 1;
}
void Permutation::swap(int i, int j) {
int k = array[i];
array[i] = array[j];
array[j] = k;
my_parity *= -1;
}
void Permutation::permute(Vector& b) const {
if(size > b.n()) return;
Vector c(b.n());
for(int i=0; i<size; i++) c(i) = b(array[i]);
for(int i=0; i<size; i++) b(i) = c(i);
}
// Miscellaneous //////////////////////////////////////////////////////////////
std::ostream& operator<< (std::ostream& os, const Vector& v) {
for(int i=0; i<v.n(); i++) {
os << v(i);
if((i+1)%5) {
os << " ";
} else {
os << "\n";
}
}
return os;
}
std::ostream& operator<< (std::ostream& os, const Matrix& m) {
for(int i=0; i<m.n(0); i++) {
for(int j=0; j<m.n(1); j++) {
os << m(i,j);
if((j+1)%5) {
os << " ";
} else {
os << "\n";
}
}
os << "\n";
}
return os;
}
std::istream& operator>> (std::istream& is, Vector& v) {
for(int i=0; i<v.n(); i++) is >> v(i);
return is;
}
std::istream& operator>> (std::istream& is, Matrix& m) {
for(int i=0; i<m.n(0); i++)
for(int j=0; j<m.n(1); j++) {
is >> m(i,j);
}
return is;
}
double l2norm(const Vector& v) {
double norm = 0;
for(int i=0; i<v.n(); i++) norm += v(i)*v(i);
return sqrt(norm);
}
double maxNorm(const Vector& v) {
double norm = 0;
for(int i=0; i<v.n(); i++) {
double a = fabs(v(i));
if(norm < a) norm = a;
}
return norm;
}
double maxNorm(const Matrix& m) {
double norm = 0;
for(int i=0; i<m.n(0); i++) {
double sum=0;
for(int j=0; j<m.n(1); j++) sum += fabs(m(i,j));
if(norm < sum) norm = sum;
}
return norm;
}
double scDot(const Vector& v1, const Vector& v2) { return v1*v2; }
int matVecMult(const Matrix& M, const Vector& x, Vector& y) {
if(M.n(0) != y.n() || M.n(1) != x.n()) return 1;
for(int i=0; i<y.n(); i++) {
double sum = 0;
for(int j=0; j<x.n(); j++) {
sum += M(i,j)*x(j);
}
y(i) = sum;
}
return 0;
}
int matMatMult(const Matrix& A, const Matrix& B, Matrix& C) {
if(A.n(0) != C.n(0) || B.n(1) != C.n(1) || A.n(1) != B.n(0)) return 1;
for(int j=0; j<C.n(1); j++)
for(int i=0; i<C.n(0); i++) {
double sum = 0;
for(int k=0; k<A.n(1); k++) {
sum += A(i,k)*B(k,j);
}
C(i,j) = sum;
}
return 0;
}