Op_Conv_EF_base.cpp

/****************************************************************************
* Copyright (c) 2024, CEA
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*****************************************************************************/
 
#include <Op_Conv_EF_base.h>
 
#include <Milieu_base.h>
#include <Schema_Temps_base.h>
#include <Probleme_base.h>
#include <TRUSTTrav.h>
#include <Discretisation_base.h>
 
 
Implemente_base(Op_Conv_EF_base,"Op_Conv_EF_base",Operateur_Conv_base);
 
 
//// printOn
//
 
Sortie& Op_Conv_EF_base::printOn(Sortie& s ) const
{
  return s << que_suis_je() ;
}
 
 
//// readOn
//
 
Entree& Op_Conv_EF_base::readOn(Entree& s )
{
  return s ;
}
 
 
 
/*! @brief Defines whether psi is convected with phi*u or with u.
 *
 */
int  Op_Conv_EF_base::phi_u_transportant(const Equation_base& eq) const
{
  if (eq.inconnue().le_nom()=="vitesse")
    return 0;
  return 1;
}
 
 
void Op_Conv_EF_base::associer_vitesse(const Champ_base& vit)
{
  vitesse_ = ref_cast(Champ_Inc_base,vit);
}
 
const Champ_Inc_base& Op_Conv_EF_base::vitesse() const
{
  return vitesse_.valeur();
}
 
Champ_Inc_base& Op_Conv_EF_base::vitesse()
{
  return vitesse_.valeur();
}
 
double Op_Conv_EF_base::calculer_dt_stab() const
{
  Cerr<<__FILE__<<(int)__LINE__<<" dt_stab mal code "<<finl;
  double dt_stab=1e30;
  /*  const Domaine_Cl_EF& domaine_Cl_EF = la_zcl_EF.valeur();
  const Domaine_EF& domaine_EF = le_dom_EF.valeur();
  const DoubleVect& volumes_entrelaces = domaine_EF.volumes_entrelaces();
  const DoubleVect& volumes_entrelaces_Cl = domaine_Cl_EF.volumes_entrelaces_Cl();
  remplir_fluent();
 
 
  double dt_face,dt_stab =1.e30;
 
  // Process boundary conditions
  // If a face carries a Dirichlet condition, it is not taken into account
  // in the dt_stab computation
  for (int n_bord=0; n_bord<domaine_EF.nb_front_Cl(); n_bord++)
    {
      const Cond_lim& la_cl = domaine_Cl_EF.les_conditions_limites(n_bord);
      if ( (sub_type(Dirichlet,la_cl.valeur()))
     ||
     (sub_type(Dirichlet_homogene,la_cl.valeur()))
     )
  ;
      else
  {
    const Front_VF& le_bord = ref_cast(Front_VF,la_cl->frontiere_dis());
    int ndeb = le_bord.num_premiere_face();
    int nfin = ndeb + le_bord.nb_faces();
    for (int num_face=ndeb; num_face<nfin; num_face++) {
      dt_face = volumes_entrelaces_Cl(num_face)/(fluent[num_face]+1.e-30);
      dt_stab = (dt_face < dt_stab) ? dt_face : dt_stab;
    }
  }
    }
 
  // Process non-standard internal faces
  int ndeb = domaine_EF.premiere_face_int();
  int nfin = domaine_EF.premiere_face_std();
 
  for (int num_face=ndeb; num_face<nfin; num_face++)
    {
      dt_face = volumes_entrelaces_Cl(num_face)/(fluent[num_face]+1.e-30);
      dt_stab =(dt_face < dt_stab) ? dt_face : dt_stab;
    }
 
  // Process standard internal faces
  ndeb = nfin;
  nfin = domaine_EF.nb_faces();
  for (int num_face=ndeb; num_face<nfin; num_face++)
    {
      dt_face = volumes_entrelaces(num_face)/(fluent[num_face]+1.e-30);
      dt_stab =(dt_face < dt_stab) ? dt_face : dt_stab;
    }
  */
  dt_stab = Process::mp_min(dt_stab);
  // trick to work around the const type of the method
  Op_Conv_EF_base& op = ref_cast_non_const(Op_Conv_EF_base,*this);
  op.fixer_dt_stab_conv(dt_stab);
  return dt_stab;
}
 
//compute values of the operator stability time step for post-processing
//-discretise the storage space (at faces)
//  storage space named "localisation" to complete the Champ_Generique_base
//  storage space named "??" otherwise
//-compute values
//-verify in debug the compatibility with dt_stab used for the computation
// cf Op_Conv_EF_base::calculer_dt_stab() for the choice of dt_stab computation
 
void Op_Conv_EF_base::calculer_pour_post(Champ_base& espace_stockage,const Nom& option,int) const
{
  Cerr<<__FILE__<<(int)__LINE__<<" dt_stab mal code "<<finl;
  exit();
 
}
 
void Op_Conv_EF_base::associer_domaine_cl_dis(const Domaine_Cl_dis_base& domaine_cl_dis)
{
  const Domaine_Cl_EF& zclEF = ref_cast(Domaine_Cl_EF,domaine_cl_dis);
  la_zcl_EF = zclEF;
}
 
void Op_Conv_EF_base::associer(const Domaine_dis_base& domaine_dis,
                               const Domaine_Cl_dis_base& domaine_cl_dis,
                               const Champ_Inc_base& )
{
  const Domaine_EF& zEF = ref_cast(Domaine_EF,domaine_dis);
  const Domaine_Cl_EF& zclEF = ref_cast(Domaine_Cl_EF,domaine_cl_dis);
 
  le_dom_EF = zEF;
  la_zcl_EF = zclEF;
  /*
  fluent.resize(le_dom_EF->nb_faces());
  // Create the virtual space for fluent
  int nbjoints = zEF.nb_joints();
  int i;
  for(i=0;i<nbjoints;i++){
    const Joint& joint=zEF.joint(i);
    int PEvoisin = joint.PEvoisin();
    const ArrOfInt& esp_dist_face=joint.esp_dist_faces();
    fluent.ajoute_espace_distant(PEvoisin, esp_dist_face);
  }
  fluent.echange_espace_virtuel();
  */
}
 
 
int Op_Conv_EF_base::impr(Sortie& os) const
{
  return Op_EF_base::impr(os, *this );
}
 
DoubleTab& Op_Conv_EF_base::calculer(const DoubleTab& transporte,
                                     DoubleTab& resu) const
{
  resu = 0;
  return ajouter(transporte,resu);
}
void Op_Conv_EF_base::remplir_fluent() const
{
  // Fill the fluent array by calling ajouter.
  // This is expensive but at least it corrects (while waiting
  // to optimize) the problem of a convection time step
  // computed with past velocities.
  DoubleTrav tmp(equation().inconnue().valeurs());
  DoubleTab flux_bords_sauve(flux_bords_);  // Save flux_bords to avoid it being zeroed out
  ajouter(tmp,tmp);
  flux_bords_=flux_bords_sauve;
  // PL: This is really heavy, but how else? fluent depends
  // on the scheme, so one could code something like fluent=velocity*surface*porosity
  // in the present method
}
void Op_Conv_EF_base::completer()
{
  Operateur_Conv_base::completer();
  marque_elem(equation());
 
}