-
Notifications
You must be signed in to change notification settings - Fork 0
/
fmm.cpp
148 lines (130 loc) · 3.87 KB
/
fmm.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
#include "fmm.h"
FMM::FMM(std::vector<Element*> const & src_elements,
std::vector<Element*> const & tgt_elements,
unsigned int exp_terms,
unsigned int loc_terms,
unsigned int max_cell_elements,
bool src_eq_tgt) :
m_src_elements(src_elements),
m_tgt_elements(tgt_elements),
m_tree(0),
m_exp_terms(exp_terms),
m_loc_terms(loc_terms),
m_max_cell_elements(max_cell_elements),
m_make_prec(false)
{
// we assume that source elements have ascending order by id
for(int i = 0; i<src_elements.size(); i++)
{
assert(src_elements[i]->get_id() == i);
}
if(src_eq_tgt)
{
// and if source are targets that they have the same ordering
for(int i = 0; i<tgt_elements.size(); i++)
{
assert(tgt_elements[i]->get_id() == i);
}
// source, that is target, is counted twice --> double criterion for
// subdivision of cell
m_max_cell_elements =max_cell_elements << 1;
}
m_elements.insert(m_elements.begin(), m_src_elements.begin(), m_src_elements.end());
m_elements.insert(m_elements.begin(), m_tgt_elements.begin(), m_tgt_elements.end());
}
std::vector<Element*> const & FMM::get_src_elements() const
{
return m_src_elements;
}
std::vector<Element*> const & FMM::get_tgt_elements() const
{
return m_tgt_elements;
}
void FMM::set_kernel(Kernel const & kernel)
{
m_kernel = &kernel;
}
const std::vector<arma::mat> &FMM::get_precond() const
{
if(!m_precond.size())
{
std::cerr << "No preconditioner has been computed" << std::endl;
return m_precond;
}
assert(m_precond.size() == m_tree->get_leaves().size());
return m_precond;
}
std::vector<Element*> const & FMM::get_permuted_elements()
{
if (!m_perm_el.empty())
{
return m_perm_el;
}
std::vector<Cell*> const & leaves = m_tree->get_leaves();
std::vector<Cell*>::const_iterator it = leaves.begin();
m_perm_el.reserve(m_src_elements.size());
for (; it != leaves.end(); ++it)
{
std::vector<Element*> const & cell_el = (*it)->get_source_elements();
m_perm_el.insert(m_perm_el.end(), cell_el.begin(), cell_el.end());
}
m_permutation.resize(m_perm_el.size(),0);
for(int i = 0; i<m_permutation.size(); i++)
{
unsigned int id = m_perm_el[i]->get_id();
assert(id < m_perm_el.size());
m_permutation[i] = id;
}
assert(m_perm_el.size() == m_src_elements.size());
return m_perm_el;
}
const std::vector<unsigned int>& FMM::get_element_permutation()
{
if(!m_permutation.empty())
{
return m_permutation;
}
get_permuted_elements();
return m_permutation;
}
const std::vector<unsigned int> & FMM::get_prec_block_starts() const
{
return m_prec_block_starts;
}
std::pair<double, Point> FMM::get_bounding_cube(std::vector<Element*> const & elements)
{
std::vector<Element*>::const_iterator it = elements.begin();
Point min, max, center;
min = elements.front()->get_position();
max = min;
for(;it!=elements.end(); ++it)
{
Element* cur_el = *it;
for(int i = 0; i<min.get_dimension(); i++)
{
Point cur_el_pos = cur_el->get_position();
if (cur_el_pos[i] < min[i])
{
min[i] = cur_el_pos[i];
}
if (cur_el_pos[i] > max[i])
{
max[i] = cur_el_pos[i];
}
}
}
double max_dist = 0;
center = max;
for (int i = 0; i< min.get_dimension(); i++)
{
double dist = max[i]-min[i];
center[i] = (max[i]+min[i])/2;
if (dist > max_dist)
{
max_dist = dist;
}
}
//extend cube a little bit in all directions to be sure to contain all elements
max_dist = 1.05*max_dist;
return std::make_pair(max_dist,center);
}