source: src/units/particle/bspline.hpp@ 881e4b

Last change on this file since 881e4b was 881e4b, checked in by Julian Iseringhausen <isering@…>, 13 years ago

Adapted Bspline class to open boundary conditions.

  • Property mode set to 100644
File size: 6.1 KB
Line 
1/*
2 * vmg - a versatile multigrid solver
3 * Copyright (C) 2012 Institute for Numerical Simulation, University of Bonn
4 *
5 * vmg is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
9 *
10 * vmg is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
17 */
18
19/**
20 * @file bspline.hpp
21 * @author Julian Iseringhausen <isering@ins.uni-bonn.de>
22 * @date Mon Nov 21 13:27:22 2011
23 *
24 * @brief B-Splines for molecular dynamics.
25 *
26 */
27
28#ifndef BSPLINE_HPP_
29#define BSPLINE_HPP_
30
31#include <cmath>
32
33#include "base/helper.hpp"
34#include "base/index.hpp"
35#include "base/polynomial.hpp"
36#include "base/vector.hpp"
37#include "grid/grid.hpp"
38#include "units/particle/particle.hpp"
39
40namespace VMG
41{
42
43namespace Particle
44{
45
46class BSpline
47{
48public:
49 BSpline(const int& near_field_cells, const vmg_float& h);
50
51 vmg_float EvaluateSpline(const vmg_float& val) const
52 {
53 for (unsigned int i=0; i<intervals.size(); ++i)
54 if (val < intervals[i])
55 return spline_nom[i](val) / spline_denom[i](val);
56 return 0.0;
57 }
58
59 void SetSpline(Grid& grid, const Particle& p) const
60 {
61 assert(p.Pos().X() >= grid.Extent().Begin().X() && p.Pos().X() < grid.Extent().End().X());
62 assert(p.Pos().Y() >= grid.Extent().Begin().Y() && p.Pos().Y() < grid.Extent().End().Y());
63 assert(p.Pos().Z() >= grid.Extent().Begin().Z() && p.Pos().Z() < grid.Extent().End().Z());
64
65 vmg_float* vals = new vmg_float[Helper::intpow(2*near_field_cells+1,3)];
66
67 vmg_float temp_val;
68 vmg_float int_val = 0.0;
69 int c = 0;
70
71 const int index_global_x = grid.Global().GlobalBegin().X() + std::floor((p.Pos().X() - grid.Extent().Begin().X()) / grid.Extent().MeshWidth().X());
72 const int index_global_y = grid.Global().GlobalBegin().Y() + std::floor((p.Pos().Y() - grid.Extent().Begin().Y()) / grid.Extent().MeshWidth().Y());
73 const int index_global_z = grid.Global().GlobalBegin().Z() + std::floor((p.Pos().Z() - grid.Extent().Begin().Z()) / grid.Extent().MeshWidth().Z());
74
75 assert(index_global_x >= grid.Global().LocalBegin().X() && index_global_x < grid.Global().LocalEnd().X());
76 assert(index_global_y >= grid.Global().LocalBegin().Y() && index_global_y < grid.Global().LocalEnd().Y());
77 assert(index_global_z >= grid.Global().LocalBegin().Z() && index_global_z < grid.Global().LocalEnd().Z());
78
79 const int index_local_x = index_global_x - grid.Global().LocalBegin().X() + grid.Local().HaloSize1().X();
80 const int index_local_y = index_global_y - grid.Global().LocalBegin().Y() + grid.Local().HaloSize1().Y();
81 const int index_local_z = index_global_z - grid.Global().LocalBegin().Z() + grid.Local().HaloSize1().Z();
82
83 assert(index_local_x >= grid.Local().Begin().X() && index_local_x < grid.Local().End().X());
84 assert(index_local_y >= grid.Local().Begin().Y() && index_local_y < grid.Local().End().Y());
85 assert(index_local_z >= grid.Local().Begin().Z() && index_local_z < grid.Local().End().Z());
86
87 const vmg_float pos_beg_x = grid.Extent().Begin().X() + grid.Extent().MeshWidth().X() * (index_global_x - grid.Global().GlobalBegin().X() - near_field_cells) - p.Pos().X();
88 const vmg_float pos_beg_y = grid.Extent().Begin().Y() + grid.Extent().MeshWidth().Y() * (index_global_y - grid.Global().GlobalBegin().Y() - near_field_cells) - p.Pos().Y();
89 const vmg_float pos_beg_z = grid.Extent().Begin().Z() + grid.Extent().MeshWidth().Z() * (index_global_z - grid.Global().GlobalBegin().Z() - near_field_cells) - p.Pos().Z();
90
91 const vmg_float& h_x = grid.Extent().MeshWidth().X();
92 const vmg_float& h_y = grid.Extent().MeshWidth().Y();
93 const vmg_float& h_z = grid.Extent().MeshWidth().Z();
94
95 // Iterate over all grid points which lie in the support of the interpolating B-Spline
96 vmg_float dir_x = pos_beg_x;
97 for (int i=-1*near_field_cells; i<=near_field_cells; ++i) {
98 vmg_float dir_y = pos_beg_y;
99 for (int j=-1*near_field_cells; j<=near_field_cells; ++j) {
100 vmg_float dir_z = pos_beg_z;
101 for (int k=-1*near_field_cells; k<=near_field_cells; ++k) {
102
103 // Compute distance from grid point to particle
104 temp_val = EvaluateSpline(std::sqrt(dir_x*dir_x+dir_y*dir_y+dir_z*dir_z));
105 vals[c++] = temp_val * p.Charge();
106 int_val += temp_val;
107
108 dir_z += h_z;
109 }
110 dir_y += h_y;
111 }
112 dir_x += h_x;
113 }
114
115 // Reciprocal value of the numerically integrated spline
116 int_val = 1.0 / (int_val * h_x * h_y * h_z);
117
118 c = 0;
119 for (int i=-1*near_field_cells; i<=near_field_cells; ++i)
120 for (int j=-1*near_field_cells; j<=near_field_cells; ++j)
121 for (int k=-1*near_field_cells; k<=near_field_cells; ++k)
122 grid(index_local_x + i,
123 index_local_y + j,
124 index_local_z + k) += vals[c++] * int_val;
125
126 delete [] vals;
127 }
128
129 vmg_float EvaluatePotential(const vmg_float& val) const
130 {
131 for (unsigned int i=0; i<intervals.size(); ++i)
132 if (val < intervals[i])
133 return potential_nom[i](val) / potential_denom[i](val);
134 return potential_nom.back()(val) / potential_denom.back()(val);
135 }
136
137 vmg_float EvaluateField(const vmg_float& val) const
138 {
139 for (unsigned int i=0; i<intervals.size(); ++i)
140 if (val < intervals[i])
141 return field_nom[i](val) / field_denom[i](val);
142 return 0.0;
143 }
144
145 const vmg_float& GetAntiDerivativeAtZero() const
146 {
147 return antid;
148 }
149
150private:
151 std::vector<Polynomial> spline_nom, spline_denom;
152 std::vector<Polynomial> potential_nom, potential_denom;
153 std::vector<Polynomial> field_nom, field_denom;
154 vmg_float antid;
155 std::vector<vmg_float> intervals;
156
157 const vmg_float R;
158 const int near_field_cells;
159};
160
161}
162
163}
164
165#endif /* BSPLINE_HPP_ */
Note: See TracBrowser for help on using the repository browser.