KADATH
domain_shell_outer_adapted_nbr_conditions_boundary.cpp
1 /*
2  Copyright 2017 Philippe Grandclement
3 
4  This file is part of Kadath.
5 
6  Kadath is free software: you can redistribute it and/or modify
7  it under the terms of the GNU General Public License as published by
8  the Free Software Foundation, either version 3 of the License, or
9  (at your option) any later version.
10 
11  Kadath is distributed in the hope that it will be useful,
12  but WITHOUT ANY WARRANTY; without even the implied warranty of
13  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14  GNU General Public License for more details.
15 
16  You should have received a copy of the GNU General Public License
17  along with Kadath. If not, see <http://www.gnu.org/licenses/>.
18 */
19 
20 #include "headcpp.hpp"
21 #include "adapted.hpp"
22 #include "point.hpp"
23 #include "array_math.hpp"
24 #include "scalar.hpp"
25 #include "tensor_impl.hpp"
26 #include "tensor.hpp"
27 
28 namespace Kadath {
30 
31  int res = 0 ;
32  int kmin = 2*mlim + 2 ;
33 
34  for (int k=0 ; k<nbr_coefs(2) ; k++)
35  for (int j=0 ; j<nbr_coefs(1) ; j++) {
36  bool indic = true ;
37  // True coef in phi ?
38  if ((k==1) || (k==nbr_coefs(2)-1))
39  indic = false ;
40  // Get base in theta :
41  int baset = (*so.get_base().bases_1d[1])(k) ;
42  switch (baset) {
43  case COS_EVEN:
44  if ((j==0) && (k>=kmin))
45  indic = false ;
46  break ;
47  case COS_ODD:
48  if ((j==nbr_coefs(1)-1) || ((j==0) && (k>=kmin)))
49  indic = false ;
50  break ;
51  case SIN_EVEN:
52  if (((j==1)&&(k>=kmin+2)) || (j==0) || (j==nbr_coefs(1)-1))
53  indic = false ;
54  break ;
55  case SIN_ODD:
56  if (((j==0)&&(k>=kmin+2))||(j==nbr_coefs(1)-1))
57  indic = false ;
58  break ;
59  default:
60  cerr << "Unknow theta basis in Domain_shell_outer_adapted::nbr_conditions_val_boundary" << endl ;
61  abort() ;
62  }
63 
64  if (indic)
65  res ++ ;
66  }
67  return res ;
68 }
69 
70 Array<int> Domain_shell_outer_adapted::nbr_conditions_boundary (const Tensor& tt, int dom, int bound, int n_cmp, Array<int>** p_cmp) const {
71 
72  // Check boundary
73  if ((bound!=INNER_BC) && (bound!=OUTER_BC)) {
74  cerr << "Unknown boundary in Domain_shell_outer_adapted::nbr_conditions_boundary" << endl ;
75  abort() ;
76  }
77 
78  int size = (n_cmp==-1) ? tt.get_n_comp() : n_cmp ;
79  Array<int> res (size) ;
80  int val = tt.get_valence() ;
81  switch (val) {
82  case 0 :
83  if (!tt.is_m_order_affected())
84  res.set(0) = nbr_conditions_val_domain_boundary (tt()(dom), 0) ;
85  else
87  break ;
88  case 1 : {
89  bool found = false ;
90  // Cartesian basis
91  if (tt.get_basis().get_basis(dom)==CARTESIAN_BASIS) {
92  if (n_cmp==-1) {
93  res.set(0) = nbr_conditions_val_domain_boundary (tt(1)(dom), 0) ;
94  res.set(1) = nbr_conditions_val_domain_boundary (tt(2)(dom), 0) ;
95  res.set(2) = nbr_conditions_val_domain_boundary (tt(3)(dom), 0) ;
96  }
97  else for (int i=0 ; i<n_cmp ; i++) {
98  if ((*p_cmp[i])(0)==1)
99  res.set(i) = nbr_conditions_val_domain_boundary (tt(1)(dom), 0) ;
100  if ((*p_cmp[i])(0)==2)
101  res.set(i) = nbr_conditions_val_domain_boundary (tt(2)(dom), 0) ;
102  if ((*p_cmp[i])(0)==3)
103  res.set(i) = nbr_conditions_val_domain_boundary (tt(3)(dom), 0) ;
104  }
105  found = true ;
106  }
107  // Spherical coordinates
108  if (tt.get_basis().get_basis(dom)==SPHERICAL_BASIS) {
109  if (n_cmp==-1) {
110  res.set(0) = nbr_conditions_val_domain_boundary (tt(1)(dom), 0) ;
111  res.set(1) = nbr_conditions_val_domain_boundary (tt(2)(dom), 1) ;
112  res.set(2) = nbr_conditions_val_domain_boundary (tt(3)(dom), 1) ;
113  }
114  else for (int i=0 ; i<n_cmp ; i++) {
115  if ((*p_cmp[i])(0)==1)
116  res.set(i) = nbr_conditions_val_domain_boundary (tt(1)(dom), 0) ;
117  if ((*p_cmp[i])(0)==2)
118  res.set(i) = nbr_conditions_val_domain_boundary (tt(2)(dom), 1) ;
119  if ((*p_cmp[i])(0)==3)
120  res.set(i) = nbr_conditions_val_domain_boundary (tt(3)(dom), 1) ;
121  }
122  found = true ;
123  }
124  if (!found) {
125  cerr << "Unknown type of vector Domain_shell_outer_adapted::nbr_conditions_boundary" << endl ;
126  abort() ;
127  }
128  }
129  break ;
130  case 2 : {
131  bool found = false ;
132  // Cartesian basis and symetric
133  if ((tt.get_basis().get_basis(dom)==CARTESIAN_BASIS) && (tt.get_n_comp()==6)) {
134  if (n_cmp==-1) {
135  res.set(0) = nbr_conditions_val_domain_boundary (tt(1,1)(dom), 0) ;
136  res.set(1) = nbr_conditions_val_domain_boundary (tt(1,2)(dom), 0) ;
137  res.set(2) = nbr_conditions_val_domain_boundary (tt(1,3)(dom), 0) ;
138  res.set(3) = nbr_conditions_val_domain_boundary (tt(2,2)(dom), 0) ;
139  res.set(4) = nbr_conditions_val_domain_boundary (tt(2,3)(dom), 0) ;
140  res.set(5) = nbr_conditions_val_domain_boundary (tt(3,3)(dom), 0) ;
141  }
142  else for (int i=0 ; i<n_cmp ; i++) {
143  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==1))
144  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 1)(dom), 0) ;
145  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==2))
146  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 2)(dom), 0) ;
147  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==3))
148  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 3)(dom), 0) ;
149  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==2))
150  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 2)(dom), 0) ;
151  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==3))
152  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 3)(dom), 0) ;
153  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==3))
154  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 3)(dom), 0) ;
155  }
156  found = true ;
157  }
158  // Cartesian basis and not symetric
159  if ((tt.get_basis().get_basis(dom)==CARTESIAN_BASIS) && (tt.get_n_comp()==9)) {
160  if (n_cmp==-1) {
161  res.set(0) = nbr_conditions_val_domain_boundary (tt(1,1)(dom), 0) ;
162  res.set(1) = nbr_conditions_val_domain_boundary (tt(1,2)(dom), 0) ;
163  res.set(2) = nbr_conditions_val_domain_boundary (tt(1,3)(dom), 0) ;
164  res.set(3) = nbr_conditions_val_domain_boundary (tt(2,1)(dom), 0) ;
165  res.set(4) = nbr_conditions_val_domain_boundary (tt(2,2)(dom), 0) ;
166  res.set(5) = nbr_conditions_val_domain_boundary (tt(2,3)(dom), 0) ;
167  res.set(6) = nbr_conditions_val_domain_boundary (tt(3,1)(dom), 0) ;
168  res.set(7) = nbr_conditions_val_domain_boundary (tt(3,2)(dom), 0) ;
169  res.set(8) = nbr_conditions_val_domain_boundary (tt(3,3)(dom), 0) ;
170  }
171  else for (int i=0 ; i<n_cmp ; i++) {
172  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==1))
173  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 1)(dom), 0) ;
174  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==2))
175  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 2)(dom), 0) ;
176  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==3))
177  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 3)(dom), 0) ;
178  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==1))
179  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 1)(dom), 0) ;
180  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==2))
181  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 2)(dom), 0) ;
182  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==3))
183  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 3)(dom), 0) ;
184  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==1))
185  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 1)(dom), 0) ;
186  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==2))
187  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 2)(dom), 0) ;
188  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==3))
189  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 3)(dom), 0) ;
190  }
191  found = true ;
192  }
193  // Spherical coordinates and symetric
194  if ((tt.get_basis().get_basis(dom)==SPHERICAL_BASIS) && (tt.get_n_comp()==6)) {
195  if (n_cmp==-1) {
196  res.set(0) = nbr_conditions_val_domain_boundary (tt(1,1)(dom), 0) ;
197  res.set(1) = nbr_conditions_val_domain_boundary (tt(1,2)(dom), 1) ;
198  res.set(2) = nbr_conditions_val_domain_boundary (tt(1,3)(dom), 1) ;
199  res.set(3) = nbr_conditions_val_domain_boundary (tt(2,2)(dom), 2) ;
200  res.set(4) = nbr_conditions_val_domain_boundary (tt(2,3)(dom), 2) ;
201  res.set(5) = nbr_conditions_val_domain_boundary (tt(3,3)(dom), 2) ;
202  }
203  else for (int i=0 ; i<n_cmp ; i++) {
204  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==1))
205  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 1)(dom), 0) ;
206  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==2))
207  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 2)(dom), 1) ;
208  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==3))
209  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 3)(dom), 1) ;
210  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==2))
211  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 2)(dom), 2) ;
212  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==3))
213  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 3)(dom), 2) ;
214  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==3))
215  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 3)(dom), 2) ;
216  }
217  found = true ;
218  }
219  // Spherical coordinates and not symetric
220  if ((tt.get_basis().get_basis(dom)==SPHERICAL_BASIS) && (tt.get_n_comp()==9)) {
221  if (n_cmp==-1) {
222  res.set(0) = nbr_conditions_val_domain_boundary (tt(1,1)(dom), 0) ;
223  res.set(1) = nbr_conditions_val_domain_boundary (tt(1,2)(dom), 1) ;
224  res.set(2) = nbr_conditions_val_domain_boundary (tt(1,3)(dom), 1) ;
225  res.set(3) = nbr_conditions_val_domain_boundary (tt(2,1)(dom), 1) ;
226  res.set(4) = nbr_conditions_val_domain_boundary (tt(2,2)(dom), 2) ;
227  res.set(5) = nbr_conditions_val_domain_boundary (tt(2,3)(dom), 2) ;
228  res.set(6) = nbr_conditions_val_domain_boundary (tt(3,1)(dom), 1) ;
229  res.set(7) = nbr_conditions_val_domain_boundary (tt(3,2)(dom), 2) ;
230  res.set(8) = nbr_conditions_val_domain_boundary (tt(3,3)(dom), 2) ;
231 
232  }
233  else for (int i=0 ; i<n_cmp ; i++) {
234  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==1))
235  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 1)(dom), 0) ;
236  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==2))
237  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 2)(dom), 1) ;
238  if (((*p_cmp[i])(0)==1) && ((*p_cmp[i])(1)==3))
239  res.set(i) = nbr_conditions_val_domain_boundary (tt(1, 3)(dom), 1) ;
240  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==1))
241  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 1)(dom), 1) ;
242  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==2))
243  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 2)(dom), 2) ;
244  if (((*p_cmp[i])(0)==2) && ((*p_cmp[i])(1)==3))
245  res.set(i) = nbr_conditions_val_domain_boundary (tt(2, 3)(dom), 2) ;
246  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==1))
247  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 1)(dom), 1) ;
248  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==2))
249  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 2)(dom), 2) ;
250  if (((*p_cmp[i])(0)==3) && ((*p_cmp[i])(1)==3))
251  res.set(i) = nbr_conditions_val_domain_boundary (tt(3, 3)(dom), 2) ;
252  }
253  found = true ;
254  }
255  if (!found) {
256  cerr << "Unknown type of 2-tensor Domain_shell_outer_adapted::nbr_conditions_boundary" << endl ;
257  abort() ;
258  }
259  }
260  break ;
261  default :
262  cerr << "Valence " << val << " not implemented in Domain_shell_outer_adapted::nbr_conditions_boundary" << endl ;
263  break ;
264  }
265  return res ;
266 }
267 }
268 
reference set(const Index &pos)
Read/write of an element.
Definition: array.hpp:186
Bases_container bases_1d
Arrays containing the various basis of decomposition.
int get_basis(int nd) const
Read only the basis in a given domain.
Definition: base_tensor.hpp:93
virtual Array< int > nbr_conditions_boundary(const Tensor &, int, int, int n_cmp=-1, Array< int > **p_cmp=0x0) const
Computes number of discretized equations associated with a given tensorial equation on a boundary.
int nbr_conditions_val_domain_boundary(const Val_domain &eq, int mlim) const
Computes number of discretized equations associated with a given equation on a boundary.
Dim_array nbr_coefs
Number of coefficients.
Definition: space.hpp:66
int get_m_order() const
Returns .
Definition: tensor.hpp:737
Tensor handling.
Definition: tensor.hpp:149
bool is_m_order_affected() const
Checks whether the additional parameter order is affected (not very used).
Definition: tensor.hpp:323
const Param_tensor & get_parameters() const
Returns a pointer on the possible additional parameter.
Definition: tensor.hpp:311
const Base_tensor & get_basis() const
Returns the vectorial basis (triad) on which the components are defined.
Definition: tensor.hpp:504
int get_n_comp() const
Returns the number of stored components.
Definition: tensor.hpp:514
int get_valence() const
Returns the valence.
Definition: tensor.hpp:509
Class for storing the basis of decompositions of a field and its values on both the configuration and...
Definition: val_domain.hpp:69
const Base_spectral & get_base() const
Returns the basis of decomposition.
Definition: val_domain.hpp:122