bridging.h

Go to the documentation of this file.

/* ./bridging/bridging.h 
**********************************
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.
***********************************/

#ifndef BRIDGING_H
#define BRIDGING_H

#include "bridging_interface.h"
#include "shape_matrix.h"
#include "ponderation.h"
#include "../geometry/spatial_grid.h"

template <typename DomainA, typename DomainC,unsigned int Dim,int Pond>
class Bridging : public BridgingInterface {

 public:
  Bridging<DomainA,DomainC,Dim,Pond>(DomainAtomicInterface & A,DomainContinuumInterface & C,int geomID):
    domC(static_cast<DomainC &>(C)),domA(static_cast<DomainA &>(A)),
    geom(GeomTools::Intersection(C.Geom(),A.Geom())),
    geom_fictif(static_cast<DomainA &>(A).GeomBoundary()),
    LocalGeom(Dim),
    atomes_rec(domA.getRefManager().RequestCreationSubSet("atomes_rec_subset")),atomes_fictifs(domA.getRefManager().RequestCreationSubSet("atomes_fictifs_subset")),
    P(*GeometryManager::GetGeometry(geomID))
    {
      DUMP("DUMP de la geometrie du recouvrement : \n" << geom,DBG_INFO);
      //      Boule & b = (Boule &)geom;
      positions = NULL;
      assoc_found = 0;
      assoc_found_fictifs = 0;
      Smatrix = NULL;
      Smatrix_fictifs = NULL;

      lambdasC= NULL;
      lambdasA = NULL;

      //      DUMP("le recouvrement trouve : [" << b.Rmin() << "," << b.Rmax() << "]");

      int temp =14;
      if (Dim == 1)
        temp = 1;
      if (Dim == 3)
        temp =15;

      division_grille[0] = temp;
      division_grille[1] = temp;
      division_grille[2] = temp;

      nb_partitions = 0;
    };

  virtual ~Bridging(){
    delete &geom; 
    if (lambdasC)
      delete [] lambdasC;
    if (lambdasA)
      delete [] lambdasA;
    if (Smatrix)
      delete Smatrix;
    if (Smatrix_fictifs) 
      delete Smatrix_fictifs; 
  }

  double *lambdasC;
  double *lambdasA;

  DomainC & domC;
  DomainA & domA;

  Geometrie & geom;
  Geometrie & geom_fictif;

  Cube LocalGeom;

  typedef typename DomainA::RefDof RefAtom;
  typedef typename DomainA::ContenerDofs ContenerAtoms;
  typedef typename DomainA::IteratorDofs IteratorAtoms;

  typedef typename DomainC::RefElt RefElt;
  typedef unsigned int RefNode;
  typedef typename DomainC::_Vec_ _Vec_;
  typedef typename DomainC::ContenerElems ContenerElems;
  typedef typename DomainC::IteratorElems IteratorElems;

  typedef ContenerTableauRefAtome<RefAtom> ContenerAtomsRec; 
  typedef ContenerTableauBaseType<RefNode> ContenerNodesRec;
  typedef ContenerTableau<typename DomainC::RefElt>  ContenerElemsRec;
  
  typedef IteratorTableauBaseType<RefNode> IteratorNodesRec; 
  typedef IteratorTableau<RefElt> IteratorElemsRec; 
  typedef IteratorTableau<RefAtom> IteratorAtomsRec; 

  void Dump(char * prefix);
  void Dump(char * file,ContenerTableau<RefAtom> & atomes,bool dumpWeights);
  void Dump(char * file,std::vector<double> & atomes_positions,std::vector<int> & suppfield);
  void Dump(char * file,std::vector<double> & atomes_positions,int * suppfield=NULL);
  void Dump(char * file,
            ContenerNodesRec & nodes,
            ContenerElemsRec & elems,bool dumpWeights);


  void SetParam(char * key,double value);

 protected:

  void DumpDistance();

  void BuildContinuWeight();
  void BuildAtomsWeight();
  void BuildShapeMatrix(double * positions,unsigned int nb_atoms);
  void BuildShapeMatrixFictifs(double * positions,unsigned int nb_atoms);
  virtual void CorrectSurfaceEffect();
  void BuildPositions();
  void BuildFictifsPositions();

  std::vector<int> assoc;
  std::vector<int> assoc_fictifs;

  ShapeMatrix<_Vec_,Dim> * Smatrix;
  ShapeMatrix<_Vec_,Dim> * Smatrix_fictifs;

  ContenerAtomsRec & atomes_rec;
  ContenerNodesRec noeuds_rec;
  ContenerElemsRec elems_rec;
  ContenerElemsRec elems_fictifs;
  ContenerNodesRec noeuds_fictifs;
  ContenerAtomsRec & atomes_fictifs;

  Ponderation<Pond> P;

  double * positions;
  unsigned int assoc_found;
  unsigned int assoc_found_fictifs;

  SpatialGrid<int,_Vec_,Dim> * grid;
  SpatialGrid<int,_Vec_,Dim> * grid_fictifs;

  
  void DumpAtome(double x,double y,double z);
  void rebuildAssoc(std::vector<int> & assoc);
  void filterContener(ContenerAtomsRec & atoms,std::vector<int> & v);
  void filterContenerElemsAndNodes(std::vector<unsigned int> & nb_atome_par_element,
                           ContenerElemsRec & elems,ContenerNodesRec & nodes,std::vector<int> & a,
                           double * lambda=NULL);
#ifdef DEBUG_BRIDGE
  void filterArray(double * array,unsigned int nmax,std::vector<int> & v);
#else
  void filterArray(double * array,std::vector<int> & v);
#endif

  int division_grille[3];

  int nb_partitions;
};

#endif //BRIDGING

---