-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.cpp
107 lines (94 loc) · 2.71 KB
/
util.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
/*
* Copyright (c) 2010 Daisuke Okanohara
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above Copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above Copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the authors nor the names of its contributors
* may be used to endorse or promote products derived from this
* software without specific prior written permission.
*/
#include <iostream>
#include <time.h>
#include "util.hpp"
using namespace std;
using namespace Eigen;
namespace REDSVD {
const double SVD_EPS = 0.000001;
double Util::getSec(){
//MLM: commented 3
//timeval tv;
//gettimeofday(&tv, NULL);
//return tv.tv_sec + (double)tv.tv_usec*1e-6;
//MLM: added 1
return 1;
}
void Util::sampleTwoGaussian(double& f1, double& f2){
double v1 = (double)(rand() + 1.0) / ((double)RAND_MAX+2.0);
double v2 = (double)(rand() + 1.0) / ((double)RAND_MAX+2.0);
double len = sqrt(-2.0 * log(v1));
f1 = len * cos(2.0 * M_PI * v2);
f2 = len * sin(2.0 * M_PI * v2);
}
void Util::sampleGaussianMat(MatrixXd& mat){
for (int i = 0; i < mat.rows(); ++i){
int j = 0;
for ( ; j+1 < mat.cols(); j += 2){
double f1, f2;
sampleTwoGaussian(f1, f2);
mat(i,j ) = f1;
mat(i,j+1) = f2;
}
for (; j < mat.cols(); j ++){
double f1, f2;
sampleTwoGaussian(f1, f2);
mat(i, j) = f1;
}
}
}
void Util::processGramSchmidt(MatrixXd& mat){
for (int i = 0; i < mat.cols(); ++i){
for (int j = 0; j < i; ++j){
double r = mat.col(i).dot(mat.col(j));
mat.col(i) -= r * mat.col(j);
}
double norm = mat.col(i).norm();
if (norm < SVD_EPS){
for (int k = i; k < mat.cols(); ++k){
mat.col(k).setZero();
}
return;
}
mat.col(i) *= (1.0 / norm);
}
}
void Util::convertFV2Mat(const vector<fv_t>& fvs, REDSVD::SMatrixXd& A){
int maxID = 0;
size_t nonZeroNum = 0;
for (size_t i = 0; i < fvs.size(); ++i){
const fv_t& fv(fvs[i]);
for (size_t j = 0; j < fv.size(); ++j){
maxID = max(fv[j].first+1, maxID);
}
nonZeroNum += fv.size();
}
A.resize(fvs.size(), maxID);
A.reserve(nonZeroNum);
for (size_t i = 0; i < fvs.size(); ++i){
A.startVec(i);
const fv_t& fv(fvs[i]);
for (size_t j = 0; j < fv.size(); ++j){
A.insertBack(i, fv[j].first) = fv[j].second;
}
}
A.finalize();
}
}