Champ_P0_VDF.cpp

/****************************************************************************
* Copyright (c) 2023, 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 <LecFicDiffuse.h>
#include <Champ_P0_VDF.h>
#include <Domaine_VDF.h>
 
Implemente_instanciable(Champ_P0_VDF,"Champ_P0_VDF",Champ_Inc_P0_base);
 
Sortie& Champ_P0_VDF::printOn(Sortie& s) const { return s << que_suis_je() << " " << le_nom(); }
Entree& Champ_P0_VDF::readOn(Entree& s) { return s ; }
 
const Domaine_VDF& Champ_P0_VDF::domaine_VDF() const
{
  return ref_cast(Domaine_VDF, le_dom_VF.valeur());
}
 
DoubleTab& Champ_P0_VDF::remplir_coord_noeuds(DoubleTab& positions) const
{
  const Domaine_VDF& domaine_vdf = ref_cast(Domaine_VDF, domaine_dis_base());
  const DoubleTab& xp = domaine_vdf.xp();
  int nb_poly = domaine_vdf.nb_elem();
  if ((xp.dimension(0) == nb_poly) && (xp.dimension(1) == dimension))
    positions.ref(xp);
  else
    {
      const Domaine& domaine = domaine_vdf.domaine();
      positions.resize(nb_poly, dimension);
      domaine.calculer_centres_gravite(positions);
    }
  return positions;
}
 
/*! @brief Returns the P0-average of the field, i.e. the sum, divided by the total domain volume,
 *
 * @brief of the piecewise-constant values multiplied by the element volumes.
 *
 * @param porosite_elem Porosity at elements.
 * @return Average value vector.
 */
DoubleVect Champ_P0_VDF::moyenne(const DoubleVect& porosite_elem) const
{
  const DoubleVect& volumes = domaine_VDF().volumes();
  const DoubleTab& val = valeurs();
 
  int k, nb_compo = nb_comp();
  DoubleVect moy(nb_compo);
  moy = 0;
  double coef, sum_vol = 0;
 
  for (int num_elem = 0; num_elem < domaine_VDF().nb_elem(); num_elem++)
    {
      coef = porosite_elem(num_elem) * volumes(num_elem);
      for (k = 0; k < nb_compo; k++)
        moy[k] += val(num_elem, k) * coef;
      sum_vol += coef;
    }
 
  moy /= sum_vol;
  return moy;
}
 
/*! @brief Computes the P0-average of the k-th component of the field.
 *
 * @param porosite_elem Porosity at elements.
 * @param ncomp Component index.
 * @return Average value of the component.
 */
double Champ_P0_VDF::moyenne(const DoubleVect& porosite_elem, int ncomp) const
{
  const DoubleVect& volumes = domaine_VDF().volumes();
  const DoubleTab& val = valeurs();
 
  double moy = 0;
  double coef, sum_vol = 0;
 
  for (int num_elem = 0; num_elem < domaine_VDF().nb_elem(); num_elem++)
    {
      coef = porosite_elem(num_elem) * volumes(num_elem);
      moy += val(num_elem, ncomp) * coef;
      sum_vol += coef;
    }
  moy /= sum_vol;
  return moy;
}
 
/*! @brief Writes the field in IJK format.
 *
 * @param os Output stream.
 * @param ncomp Component index to print.
 * @return 1 on success.
 */
int Champ_P0_VDF::imprime(Sortie& os, int ncomp) const
{
  // valeur_au_ijk(xi,yj,zk,valeurs,ncomp);
  // principle: create a point array depending on whether the field is element-based or face-based
  // with a grid built from xi,yj,zk read from a file
  // sub_type(Champ_P0, *this): grid built from (xi+xi+1)/2, etc...
  // Otherwise: grid built from xi, xi+1, etc...
  // Loop over ni,nj,nk
  // K=
  //     I=1 I=2 I=3 I=4
  // J=10 Vij
  // J=9
  // ...
  int ni,nj,nk=-1;
  int ii,jj,k;
  int np,elem;
  int cmax=7;
  DoubleVect xi,yj,zk;
  DoubleTab Grille;
  //Reading xi,yj,zk from a .xiyjzk file
  Nom nomfic(nom_du_cas());
  nomfic+=".xiyjzk";
  LecFicDiffuse ficijk(nomfic);
  ficijk >> xi;
  ni=xi.size();
  ficijk >> yj;
  nj=yj.size();
  if (dimension==3)
    {
      ficijk >> zk;
      nk=zk.size();
    }
  if (ncomp == 1)
    {
      if (dimension==3)
        {
          // Grid ordered at element centers
          np=(ni-1)*(nj-1)*(nk-1);
          Grille.resize(np,dimension);
          for(k=0; k<nk-1; k++)
            for(ii=0; ii<ni-1; ii++)
              for(jj=0; jj<nj-1; jj++)
                {
                  elem=jj+(nj-1)*(ii+k*(ni-1));
                  Grille(elem,0)=0.5*(xi(ii)+xi(ii+1));
                  Grille(elem,1)=0.5*(yj(jj)+yj(jj+1));
                  Grille(elem,2)=0.5*(zk(k)+zk(k+1));
                }
          DoubleTab tab_valeurs(np, nb_compo_);
          valeur_aux(Grille, tab_valeurs);
          for(k=0; k<nk-1; k++)
            {
              os << finl;
              os << "Coupe a K= " << k << finl;
              int n1=0,n2=0;
              while (n2<ni-1)
                {
                  n1=n2;
                  n2=std::min(ni-1,n2+cmax);
                  os << finl;
                  os << "I=     ";
                  for(int i=n1; i<n2; i++)
                    os << i << "              ";
                  os << finl;
                  for(int j=nj-2; j>-1; j--)
                    {
                      os << "J= " << j << " ";
                      for(int i=n1; i<n2; i++)
                        {
                          elem=j+(nj-1)*(i+k*(ni-1));
                          os << tab_valeurs(elem,0) << " ";
                        }
                      os << finl;
                    }
                }
            }
        }
      else if (dimension==2)
        {
          np=(ni-1)*(nj-1);
          Grille.resize(np,dimension);
          for(ii=0; ii<ni-1; ii++)
            for(jj=0; jj<nj-1; jj++)
              {
                elem=jj+(nj-1)*ii;
                Grille(elem,0)=0.5*(xi(ii)+xi(ii+1));
                Grille(elem,1)=0.5*(yj(jj)+yj(jj+1));
              }
          DoubleTab tab_valeurs(np, nb_compo_);
          valeur_aux(Grille, tab_valeurs);
          int n1=0,n2=0;
          while (n2<ni-1)
            {
              n1=n2;
              n2=std::min(ni-1,n2+cmax);
              os << finl;
              os << "I=     ";
              for(int i=n1; i<n2; i++)
                os << i << "              ";
              os << finl;
              for(int j=nj-2; j>-1; j--)
                {
                  os << "J= " << j << " ";
                  for(int i=n1; i<n2; i++)
                    {
                      elem=j+(nj-1)*i;
                      os << tab_valeurs(elem,0) << " ";
                    }
                  os << finl;
                }
            }
        }
    }
  else
    {
      Cerr << "Champ_P0_VDF::imprime_P0_VDF with nb_compo_>1 not implemented." << finl;
      exit();
    }
  return 1;
}
 
/*! @brief Computes the spatial integral of one component of the field over the corresponding domain.
 *
 * @param ncomp Index of the component to integrate in space.
 * @return Value of the integral.
 */
double Champ_P0_VDF::integrale_espace(int ncomp) const
{
  double integr = 0.;
  const DoubleVect& volumes = domaine_VDF().volumes();
  int nb_elem = domaine_VDF().nb_elem();
  int elem;
  const DoubleTab& val = valeurs();
  assert(ncomp < val.line_size());
 
  for (elem = 0; elem < nb_elem; elem++)
    integr += val(elem, ncomp) * volumes(elem);
 
  return integr;
}