formefaible.cpp

Go to the documentation of this file.

/* ./bridging/formefaible.cpp 
**********************************
Copyright INRIA and CEA 

author : Guillaume ANCIAUX (anciaux@labri.fr, g.anciaux@laposte.net)

The LibMultiScale is a C++ parallel framework for the multiscale
coupling methods dedicated to material simulations. This framework
provides an API which makes it possible to program coupled simulations
and integration of already existing codes.

This Project is done in a collaboration between INRIA Futurs Bordeaux
within ScAlApplix team and CEA/DPTA Ile de France. 

This software is governed by the CeCILL-C license under French law and
abiding by the rules of distribution of free software.  You can  use, 
modify and/ or redistribute the software under the terms of the CeCILL-C
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info". 

As a counterpart to the access to the source code and  rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty  and the software's author,  the holder of the
economic rights,  and the successive licensors  have only  limited
liability. 

In this respect, the user's attention is drawn to the risks associated
with loading,  using,  modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean  that it is complicated to manipulate,  and  that  also
therefore means  that it is reserved for developers  and  experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or 
data to be ensured and,  more generally, to use and operate it in the 
same conditions as regards security. 

The fact that you are presently reading this means that you have had
knowledge of the CeCILL-C license and that you accept its terms.
***********************************/

#define NEED_STAMP
#define NEED_LAMMPS
#define NEED_LIBMESH
#define NEED_MD1D

#define ORDRE LINEAR
#define ZERO_LIMIT 1e-5

#define LOCAL_MODULE MOD_COUPLING

template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::Init(){

  DUMP("Computing freedom degrees weight",DBG_INFO);
  Parent::BuildAtomsWeight();
  Parent::BuildContinuWeight();  

  DUMP("Computing initial constraint",DBG_INFO);
  unsigned int taille = Parent::noeuds_rec.nbElem();

  DUMP("Building Shape matrix",DBG_INFO);

  Parent::BuildPositions();
  Parent::BuildShapeMatrix(Parent::positions,Parent::atomes_rec.nbElem());
  delete [] Parent::positions;

  Parent::BuildFictifsPositions();
  Parent::BuildShapeMatrix(Parent::positions,Parent::atomes_fictifs.nbElem());
  delete [] Parent::positions;

  /* corrige les pondération pour tenir compte de la masse */
  /* aussi pour mettre en place l'offset minimal */

  DUMP("Correcting weights",DBG_INFO);
  CorrectWeights();

  A = new FullMatrix(taille,taille);
  A->zero();
  rhs = new Vector(taille);
  rhs->zero();

  DUMP("Computing Continu Constraint Matrix",DBG_INFO);
  BuildContinuConstraintMatrix();

  DUMP("Computing Atoms Constraint Matrix",DBG_INFO);
  BuildAtomsConstraintMatrix();

}

template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::Stucking(){
  /* c l'implementation de la methode generique qui
     colle les deux domaines ensemble sur la zone de 
     recouvrement */

   STARTTIMER();
   BuildContinuRHS();
   BuildAtomsRHS();
   STOPTIMER("BuildRHS");
  
   STARTTIMER();
   SolveConstraint();
   STOPTIMER("Solving constraint");
  
   STARTTIMER();
   ApplyContinuCorrection();
   ApplyAtomsCorrection();
   STOPTIMER("Correcting");
}

template <typename DomainA, typename DomainC,unsigned int Dim>
 void FormeFaible<DomainA,DomainC,Dim>::BuildContinuConstraintMatrix(){

  // creation de la matrice de pseudo mass (mass matric without rho coef)
  unsigned int taille = Parent::noeuds_rec.nbElem();
  PM = new FullMatrix(taille,taille);
  //zeroing
  PM->zero();

  // preparing course on elements in bridging zone
  typename Parent::IteratorElemsRec & itc = Parent::elems_rec.GetIterator();
  typename Parent::RefElt el = itc.GetFirst();
  MechaContLibMesh<Dim> & model = static_cast<MechaContLibMesh<Dim>&>(Parent::domC.getModel());

  std::vector<double> JxW;
  std::vector<std::vector<double> > shapes;
  std::vector<unsigned int> nodes;

  while (!itc.end()){

    model.ComputeShapesForIntegration(el,JxW,shapes);
    unsigned int integ_size = JxW.size();    
    
    model.GlobalIndexes(el,nodes);
    unsigned int nb_nodes = nodes.size();

    for (unsigned int i=0; i<nb_nodes; i++)
      for (unsigned int j=0; j<nb_nodes; j++)
        {
          int i_rec = Parent::noeuds_rec.Recherche(nodes[i]);
          int j_rec = Parent::noeuds_rec.Recherche(nodes[j]);

          if (i_rec == -1 || j_rec == -1){
            int tmp=-1;
            if (i_rec == -1)
              tmp = nodes[i];
            if (j_rec == -1)
              tmp = nodes[j];
                    
            FATAL("huge pbroblem here for index " << tmp);
          }

          for (unsigned int qp=0; qp<integ_size; qp++)
            {
              
              
              DUMP("PM(" << i_rec << "," << j_rec << ") += " << JxW[qp] << "*" << shapes[i][qp] 
                   << "*" << shapes[j][qp] << "=" << JxW[qp]*shapes[i][qp]*shapes[j][qp],DBG_ALL);
              (*PM)(i_rec,j_rec) += JxW[qp]*shapes[i][qp]*shapes[j][qp];
              
            }
        }
    el = itc.GetNext();
  }

  PM->PrintToFile("PM.mat");

  for (unsigned int i = 0; i < taille ; ++i)
    for (unsigned int j = 0; j < taille ; ++j)
      for (unsigned int k = 0; k < taille ; ++k)
      {
        (*A)(i,j) += (*PM)(i,k)*(*PM)(j,k)/Parent::lambdasC[k];
      }


  A->PrintToFile("A.mat");



}

template <typename DomainA, typename DomainC,unsigned int Dim>
 void FormeFaible<DomainA,DomainC,Dim>::BuildAtomsConstraintMatrix(){

  A->zero();
  Parent::Smatrix->buildFormeFaibleCMatrix(*A,Parent::lambdasA);

  //#if PRIORITY<=5
  A->PrintToFile("constraint.mat");
  //#endif

  A->FactoLU();
}


template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::BuildContinuRHS(){

  rhs->zero();
  
  typename Parent::RefNode n;
  typename Parent::_Vec_ & v = Parent::domC.getDofs().V();

  unsigned int taille = Parent::noeuds_rec.nbElem();

  for (unsigned int i = 0 ; i < taille ; ++i)
    for (unsigned int j = 0 ; j < taille ; ++j)
    {
      n = Parent::noeuds_rec.Get(j);
      (*rhs)(i) -= v(n)*(*PM)(i,j);
    }


}

 template <typename DomainA, typename DomainC,unsigned int Dim>  
 void FormeFaible<DomainA,DomainC,Dim>::BuildAtomsRHS(){

   Parent::CorrectSurfaceEffect();
  
   typename Parent::IteratorAtomsRec & itrec = Parent::atomes_rec.GetIterator();
   typename Parent::RefAtom at;
   
   at = itrec.GetFirst();
   
   unsigned int at_index=0;
   
   while (!itrec.end())
     {
       Parent::Smatrix->build_least_square_rhs(rhs,at_index,Parent::assoc[at_index],at.vitesse(0));
       at = itrec.GetNext();
       ++at_index;
     }
   
 }

template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::SolveConstraint(){

  A->Solve(rhs);
}


template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::ApplyContinuCorrection(){

  unsigned int taille = Parent::noeuds_rec.nbElem();
  typename Parent::_Vec_ & v = Parent::domC.getDofs().V();
  typename Parent::RefNode n;

  for (unsigned int i = 0; i < taille ; ++i)
    for (unsigned int k = 0; k < taille ; ++k)
      {
        n = Parent::noeuds_rec.Get(i);
        v.add(n,(*PM)(i,k)*(*rhs)(k)/Parent::lambdasC[i]);
      }
}

template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::ApplyAtomsCorrection(){

   typename Parent::IteratorAtomsRec & itrec = Parent::atomes_rec.GetIterator();
   typename Parent::RefAtom at;
   
   at = itrec.GetFirst();
   
   unsigned int at_index=0;
   
   while (!itrec.end())
     {
       Parent::Smatrix->correct_forme_faible(at.vitesse(0),*rhs,Parent::lambdasA,at_index,Parent::assoc[at_index]);
       at = itrec.GetNext();
       ++at_index;
     }
 }



template <typename DomainA, typename DomainC,unsigned int Dim>
void FormeFaible<DomainA,DomainC,Dim>::CorrectWeights(){
  /* corrige les pondération pour tenir compte de la masse */
  /* aussi pour mettre en place l'offset minimal */

  unsigned int nb = Parent::noeuds_rec.nbElem();

  if (!nb){FATAL("On a trouve aucun noeud dans le recouvrement");}
  DUMP("On a trouve " << nb << " noeuds concernes dans " << Parent::elems_rec.nbElem() << " elements",DBG_DETAIL);

  MechaContLibMesh<Dim> & model = static_cast<MechaContLibMesh<Dim> &>(Parent::domC.getModel());

#ifdef ALPHA_INSIDE
  typename Parent::_Vec_ * alpha = NULL;

  if (dynamic_cast<MechaContLibMeshArlequin*>(&model)){
    alpha = dynamic_cast<MechaContLibMeshArlequin&>(model).Alpha();
  }
#endif

  typename Parent::IteratorNodesRec & itrec = Parent::noeuds_rec.GetIterator();
  typename Parent::RefNode n = itrec.GetFirst();
  int j = 0;

  while (!itrec.end())
    {
      if (Parent::lambdasC[j] < ZERO_LIMIT)
        Parent::lambdasC[j] = offset_min;
      DUMP("lambdasC[" << n << "]=" << Parent::lambdasC[j],DBG_ALL);

#ifdef ALPHA_INSIDE
      if (alpha)
        (*alpha).set(n,lambdasC[j]); 
#endif

      Parent::lambdasC[j] *= model.Mass(n); 

      n = itrec.GetNext();
      ++j;
    }

  //les atomes 

  nb = Parent::atomes_rec.nbElem();
  if (!nb){FATAL("On a trouve aucun atome dans le recouvrement");}
  DUMP("On a touve " << nb << " atomes concernes",DBG_DETAIL);
 
  typename Parent::IteratorAtomsRec & itrec2 = Parent::atomes_rec.GetIterator();
  typename Parent::RefAtom at = itrec2.GetFirst();
  int i = 0;

  while (!itrec2.end())
    {
      if (Parent::lambdasA[i] < ZERO_LIMIT)
        Parent::lambdasA[i] = offset_min;
      DUMP("lambdasA[" << i << "]=" << Parent::lambdasA[i],DBG_ALL);

#ifdef ALPHA_INSIDE
      at.alpha() = lambdasA[i];
#endif

      Parent::lambdasA[i] *= at.masse();

      at = itrec2.GetNext();
      ++i;
    }

}

#ifdef USING_STAMP
template class FormeFaible<DomainStamp,DomainLibMesh<1>,1>;
template class FormeFaible<DomainStamp,DomainLibMesh<2>,2>;
#endif
#ifdef USING_LAMMPS
template class FormeFaible<DomainLammps,DomainLibMesh<2>,2>;
template class FormeFaible<DomainLammps,DomainLibMesh<3>,3>;
#endif
template class FormeFaible<DomainMD1D,DomainLibMesh<1>,1>;

---