-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathCholesky.h
73 lines (61 loc) · 1.39 KB
/
Cholesky.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
// Copyright 2014-2015 Isis Innovation Limited and the authors of InfiniTAM
#pragma once
#include <vector>
namespace ORUtils
{
class Cholesky
{
private:
std::vector<float> cholesky;
int size, rank;
public:
Cholesky(const float *mat, int size)
{
this->size = size;
this->cholesky.resize(size*size);
for (int i = 0; i < size * size; i++) cholesky[i] = mat[i];
for (int c = 0; c < size; c++)
{
float inv_diag = 1;
for (int r = c; r < size; r++)
{
float val = cholesky[c + r * size];
for (int c2 = 0; c2 < c; c2++)
val -= cholesky[c + c2 * size] * cholesky[c2 + r * size];
if (r == c)
{
cholesky[c + r * size] = val;
if (val == 0) { rank = r; }
inv_diag = 1.0f / val;
}
else
{
cholesky[r + c * size] = val;
cholesky[c + r * size] = val * inv_diag;
}
}
}
rank = size;
}
void Backsub(float *result, const float *v) const
{
std::vector<float> y(size);
for (int i = 0; i < size; i++)
{
float val = v[i];
for (int j = 0; j < i; j++) val -= cholesky[j + i * size] * y[j];
y[i] = val;
}
for (int i = 0; i < size; i++) y[i] /= cholesky[i + i * size];
for (int i = size - 1; i >= 0; i--)
{
float val = y[i];
for (int j = i + 1; j < size; j++) val -= cholesky[i + j * size] * result[j];
result[i] = val;
}
}
~Cholesky(void)
{
}
};
}