treecode_rte/treecode_rte.h at master · lowrank/treecode_rte · GitHub

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
//
// Created by lurker on 9/26/19.
//

#ifndef TREECODE_RTE_H
#define TREECODE_RTE_H

#include "utility/Profiler.h"
#include "treecode.h"

class treecode_rte {
public:
    index_t time_steps;
    scalar_t T;
    scalar_t h;
    index_t  N;
    scalar_t MAC;
    index_t nChebshev;
    scalar_t kappa;


    TreeCode tc;
    index_t nSource;
    index_t rank;
    index_t maxLevel;

    vector<scalar_t> mu_t; // predefined.
    vector<scalar_t> mu_s; // predefined.

    std::function<scalar_t (scalar_t, point&)> sourceFunc; // only mid-point samples are needed

    vector<TreeCode> rhs;
    vector<Vector> solution;

    treecode_rte(index_t _time_steps, scalar_t _T, index_t _N, index_t _nChebyshev, vector<point> &_source,
                 index_t _nSource, index_t _rank, index_t _maxLevel, scalar_t _MAC);
    ~treecode_rte();

    void compute();

    scalar_t interaction(index_t step, index_t pointId, index_t  rootId);
    index_t getRow(scalar_t y);
    index_t getCol(scalar_t x);
    scalar_t getIntegral(scalar_t x0, scalar_t y0, scalar_t x1, scalar_t y1);
    scalar_t getLocalIntegral(scalar_t x0, scalar_t y0, scalar_t x1, scalar_t y1);
    scalar_t getAttribute(scalar_t x, scalar_t y);
    scalar_t integral_block(scalar_t a, scalar_t b);
    scalar_t kernel(point& r0, point& r1);

    void output(const std::string filename);

};


#endif //TREECODE_RTE_H