source: src/base/interface.cpp@ 0bd47e

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

Work.
  • Property mode set to 100644
File size: 5.5 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 interface.cpp
21 * @author Julian Iseringhausen <isering@ins.uni-bonn.de>
22 * @date Mon Apr 18 12:55:48 2011
23 *
24 * @brief VMG::Interface
25 *
26 */
27
28#ifdef HAVE_CONFIG_H
29#include <config.h>
30#endif
31
32#include <algorithm>
33#include <cmath>
34
35#include "base/helper.hpp"
36#include "base/interface.hpp"
37
38using namespace VMG;
39
40void Interface::InitInterface(const Vector& box_offset, const vmg_float& box_size,
41 const int& max_boundary_nodes, const vmg_float& alpha)
42{
43 Index num_cells, size_factor;
44 Index add_node = Index(bc[0]==Periodic ? 0 : 1,
45 bc[1]==Periodic ? 0 : 1,
46 bc[2]==Periodic ? 0 : 1);
47
48 const Vector box_center = box_offset + 0.5 * box_size;
49
50 /*
51 * Get Extents
52 */
53 if (bc[0] == Open || bc[1] == Open || bc[2] == Open) {
54
55 while (global.size() == 0 ||
56 (bc[0] == Open && global.back().GlobalSizeNew()[0] > max_boundary_nodes) ||
57 (bc[1] == Open && global.back().GlobalSizeNew()[1] > max_boundary_nodes) ||
58 (bc[2] == Open && global.back().GlobalSizeNew()[2] > max_boundary_nodes)) {
59
60 global.push_back(GlobalIndices());
61 extent.push_back(SpatialExtent());
62
63 for (int j=0; j<3; ++j)
64 size_factor[j] = (bc[j] == Open ? Helper::intpow(2, static_cast<int>(log(pow(alpha, global.size())) / log(2.0) + 1.0)) : 1);
65
66 num_cells = Helper::intpow(2,levelMax-global.size()+1) * size_factor;
67
68 extent.back().Size() = box_size * static_cast<Vector>(size_factor);
69 extent.back().Begin() = box_center - 0.5 * extent.back().Size();
70 extent.back().End() = extent.back().Begin() + extent.back().Size();
71 extent.back().MeshWidth() = extent.back().Size() / num_cells;
72
73 global.back().LocalSize() = num_cells + add_node;
74 global.back().LocalBegin() = -1 * num_cells / 2;
75 global.back().LocalEnd() = num_cells/2 + add_node;
76
77 global.back().GlobalSizeNew() = global.back().LocalSize();
78 global.back().GlobalBegin() = global.back().LocalBegin();
79 global.back().GlobalEnd() = global.back().LocalEnd();
80
81 global.back().GlobalSizeFinest() = Helper::intpow(2, global.size()-1)*num_cells + add_node;
82 global.back().GlobalBeginFinest() = -1 * ((Helper::intpow(2, global.size()-1)*num_cells) / 2);
83 global.back().GlobalEndFinest() = (Helper::intpow(2, global.size()-1)*num_cells) / 2 + add_node;
84
85 global.back().BoundaryType() = LocallyRefined;
86
87 }
88
89 for (int i=global.size()-1; i>0; --i) {
90 if (global[i].GlobalSizeFinest().Max() > global[i-1].GlobalSizeFinest().Max()) {
91 global[i].BoundaryType() = GlobalMax;
92 break;
93 }else {
94 global[i].BoundaryType() = GlobalCoarsened;
95 }
96 }
97 } else {
98
99 num_cells = Helper::intpow(2, levelMax);
100
101 global.push_back(GlobalIndices());
102 extent.push_back(SpatialExtent());
103
104 extent.back().Size() = box_size;
105 extent.back().Begin() = box_center - 0.5 * extent.back().Size();
106 extent.back().End() = extent.back().Begin() + extent.back().Size();
107 extent.back().MeshWidth() = extent.back().Size() / num_cells;
108
109 global.back().LocalSize() = num_cells + add_node;
110 global.back().LocalBegin() = -1 * num_cells/2;
111 global.back().LocalEnd() = num_cells/2 + add_node;
112
113 global.back().GlobalSizeNew() = global.back().LocalSize();
114 global.back().GlobalBegin() = global.back().LocalBegin();
115 global.back().GlobalEnd() = global.back().LocalEnd();
116
117 global.back().GlobalSizeFinest() = global.back().LocalSize();
118 global.back().GlobalBeginFinest() = global.back().LocalBegin();
119 global.back().GlobalEndFinest() = global.back().LocalEnd();
120
121 global.back().BoundaryType() = GlobalMax;
122
123 }
124
125
126 while (global.back().GlobalSizeNew().Min() > Helper::intpow(2, levelMin)+1) {
127
128 num_cells /= 2;
129
130 global.push_back(GlobalIndices());
131 extent.push_back(SpatialExtent());
132
133 extent.back().Size() = (++extent.rbegin())->Size();
134 extent.back().Begin() = (++extent.rbegin())->Begin();
135 extent.back().End() = (++extent.rbegin())->End();
136 extent.back().MeshWidth() = 2.0 * (++extent.rbegin())->MeshWidth();
137
138 global.back().LocalSize() = num_cells + add_node;
139 global.back().LocalBegin() = -1 * num_cells/2;
140 global.back().LocalEnd() = num_cells/2 + add_node;
141
142 global.back().GlobalSizeNew() = global.back().LocalSize();
143 global.back().GlobalBegin() = global.back().LocalBegin();
144 global.back().GlobalEnd() = global.back().LocalEnd();
145
146 global.back().GlobalSizeFinest() = (++global.rbegin())->GlobalSizeFinest();
147 global.back().GlobalBeginFinest() = (++global.rbegin())->GlobalBeginFinest();
148 global.back().GlobalEndFinest() = (++global.rbegin())->GlobalEndFinest();
149
150 global.back().BoundaryType() = GlobalCoarsened;
151
152 }
153
154 levelMin = levelMax - global.size() + 1;
155}
Note: See TracBrowser for help on using the repository browser.