KADATH
eq_order.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 "system_of_eqs.hpp"
21 #include "ope_eq.hpp"
22 #include "term_eq.hpp"
23 #include "scalar.hpp"
24 #include "tensor_impl.hpp"
25 namespace Kadath {
26 Eq_order::Eq_order(const Domain* zedom, int dd, int ord, Ope_eq* so, int nused, Array<int>** pused) : Equation(zedom, dd, 1, nused, pused) {
27  order = ord ;
28  parts[0] = so ;
29 }
30 
32 }
33 
34 void Eq_order::export_val (int& conte, Term_eq** residus, Array<double>& sec, int& pos_res) const {
35 
36  assert (residus[conte]->get_type_data()==TERM_T) ;
37  dom->export_tau (residus[conte]->get_val_t(), ndom, order, sec, pos_res, *n_cond, n_cmp_used, p_cmp_used) ;
38  conte ++ ;
39 }
40 
41 void Eq_order::export_der (int& conte, Term_eq** residus, Array<double>& sec, int& pos_res) const {
42 
43  assert (residus[conte]->get_type_data()==TERM_T) ;
44  dom->export_tau (residus[conte]->get_der_t(), ndom, order, sec, pos_res, *n_cond, n_cmp_used, p_cmp_used) ;
45  conte ++ ;
46 }
47 
50 }
51 
52 bool Eq_order::take_into_account (int target) const {
53  if (target == ndom)
54  return true ;
55  else
56  return false ;
57 }
58 
59 }
Abstract class that implements the fonctionnalities common to all the type of domains.
Definition: space.hpp:60
virtual void export_tau(const Tensor &eq, int dom, int order, Array< double > &res, int &pos_res, const Array< int > &ncond, int n_cmp=-1, Array< int > **p_cmp=0x0) const
Exports all the residual equations corresponding to a tensorial one in the bulk.
Definition: domain.cpp:1533
virtual Array< int > nbr_conditions(const Tensor &eq, int dom, int order, int n_cmp=-1, Array< int > **p_cmp=0x0) const
Computes number of discretized equations associated with a given tensorial equation in the bulk.
Definition: domain.cpp:1504
bool take_into_account(int) const override
Check whether the variation of the residual has to be taken into account when computing a given colum...
Definition: eq_order.cpp:52
void export_der(int &, Term_eq **, Array< double > &, int &) const override
Generates the discretized variations, from the various Term_eq computed by the equation.
Definition: eq_order.cpp:41
int order
Order of the equation.
virtual ~Eq_order()
Destructor.
Definition: eq_order.cpp:31
void export_val(int &, Term_eq **, Array< double > &, int &) const override
Generates the discretized errors, from the various Term_eq computed by the equation.
Definition: eq_order.cpp:34
Array< int > do_nbr_conditions(const Tensor &tt) const override
Computes the number of conditions associated with the equation.
Definition: eq_order.cpp:48
Eq_order(const Domain *dom, int nd, int ord, Ope_eq *ope, int n_cmp=-1, Array< int > **p_cmp=nullptr)
Constructor.
Definition: eq_order.cpp:26
Class implementing an equation.
const Domain * dom
Pointer on the Domain where the equation is defined.
Array< int > ** p_cmp_used
Array of pointer on the indices of the used components.
int ndom
Number of the domain.
int n_cmp_used
Number of components used (by default the same thing as n_comp).
Array< int > * n_cond
Number of discretized equations, component by component.
MMPtr_array< Ope_eq > parts
Array of pointers on the various terms.
Abstract class that describes the various operators that can appear in the equations.
Definition: ope_eq.hpp:32
Tensor handling.
Definition: tensor.hpp:149
This class is intended to describe the manage objects appearing in the equations.
Definition: term_eq.hpp:62