Newer
Older
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
/*
*
* matrix_op.c -- Basic Matrix transform/split operations
*
* Author: Petros Anastasiadis(panastas@cslab.ece.ntua.gr)
*
*/
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include "matrix_op.h"
void vec_init(double *v, size_t n, double val)
{
size_t i;
for (i = 0; i < n; ++i) {
v[i] = val;
}
}
void vec_init_rand(double *v, size_t n, double max)
{
srand48(42); // should only be called once
size_t i;
for (i = 0; i < n; ++i) {
v[i] = max*(double) drand48();
}
}
void vec_init_rand_p(double *v, size_t n, size_t np, double max)
{
srand48(42); // should only be called once
size_t i;
for (i = 0; i < n; ++i) {
v[i] = (double) drand48();
}
for (i = n; i < np; ++i) {
v[i] = 0.0;
}
}
void matrix_init_rand(double **v, size_t n, size_t m, double max)
{
srand48(42); // should only be called once
size_t i,j;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
v[i][j] = max*(double) drand48();
}
void ser_matrix_init_rand(double *v, size_t n, size_t m, double max)
{
srand48(42); // should only be called once
size_t i,j;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
v[i*m+j] = max*(double) drand48();
}
void ser_matrix_init_rand_p(double *v, size_t n, size_t m, size_t np, double max)
{
srand48(42); // should only be called once
size_t i,j;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
v[i*m+j] = max*(double) drand48();
for (i = n*m; i < n*m+np; ++i) v[i] = 0.0;
}
void matrix_col_major(double *M, double *A, size_t n, size_t m)
{
size_t i,j;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
A[j*n+i] = M[i*m+j];
}
void matrix_row_major(double **M, double *A, size_t n, size_t m)
{
size_t i,j;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
A[i*n+j] = M[i][j];
}
void regenerate_matrix_coo(double **M, int *I, int *cooCol, double *cooVal, int n, int m, int n_z)
{
int i;
for (i = 0; i < n_z; ++i) M[I[i]][cooCol[i]] = cooVal[i];
}