4 #ifndef DUNE_PDELAB_CONFORMINGCONSTRAINTS_HH
5 #define DUNE_PDELAB_CONFORMINGCONSTRAINTS_HH
10 #include <dune/common/exceptions.hh>
12 #include <dune/geometry/referenceelements.hh>
13 #include <dune/geometry/type.hh>
15 #include <dune/grid/common/grid.hh>
17 #include <dune/localfunctions/common/interfaceswitch.hh>
19 #include <dune/typetree/typetree.hh>
51 template<
typename P,
typename IG,
typename LFS,
typename T>
52 void boundary (
const P& param,
const IG&
ig,
const LFS& lfs, T& trafo)
const
54 typedef FiniteElementInterfaceSwitch<
55 typename LFS::Traits::FiniteElementType
57 typedef FieldVector<
typename IG::ctype, IG::dimension-1> FaceCoord;
59 const int face = ig.indexInInside();
62 Dune::GeometryType gt = ig.inside().type();
63 typedef typename IG::ctype DT;
64 const int dim = IG::Entity::dimension;
65 const Dune::ReferenceElement<DT,dim>& refelem = Dune::ReferenceElements<DT,dim>::general(gt);
67 const Dune::ReferenceElement<DT,dim-1> &
68 face_refelem = Dune::ReferenceElements<DT,dim-1>::general(ig.geometry().type());
71 typename T::RowType empty;
73 const FaceCoord testpoint = face_refelem.position(0,0);
76 if (!param.isDirichlet(ig,testpoint))
80 i<std::size_t(FESwitch::coefficients(lfs.finiteElement()).size());
85 FESwitch::coefficients(lfs.finiteElement()).localKey(i).codim();
87 if (codim==0)
continue;
89 for (
int j=0; j<refelem.size(face,1,codim); j++){
91 if (static_cast<int>(FESwitch::coefficients(lfs.finiteElement()).
92 localKey(i).subEntity())
93 == refelem.subEntity(face,1,j,codim))
94 trafo[lfs.dofIndex(i)] = empty;
112 template<
typename IG,
typename LFS,
typename T>
115 typedef FiniteElementInterfaceSwitch<
116 typename LFS::Traits::FiniteElementType
120 const int face = ig.indexInInside();
123 Dune::GeometryType gt = ig.inside().type();
124 typedef typename IG::ctype DT;
125 const int dim = IG::Entity::dimension;
127 const Dune::ReferenceElement<DT,dim>& refelem = Dune::ReferenceElements<DT,dim>::general(gt);
130 typename T::RowType empty;
133 for (
size_t i=0; i<FESwitch::coefficients(lfs.finiteElement()).size();
138 FESwitch::coefficients(lfs.finiteElement()).localKey(i).codim();
140 if (codim==0)
continue;
142 for (
int j=0; j<refelem.size(face,1,codim); j++)
143 if (FESwitch::coefficients(lfs.finiteElement()).localKey(i).
144 subEntity() == std::size_t(refelem.subEntity(face,1,j,codim)))
145 trafo[lfs.dofIndex(i)] = empty;
151 template<
typename GV>
163 template<
typename P,
typename EG,
typename LFS,
typename T>
164 void volume (
const P& param,
const EG&
eg,
const LFS& lfs, T& trafo)
const
166 typedef FiniteElementInterfaceSwitch<
167 typename LFS::Traits::FiniteElementType
170 auto entity = eg.entity();
173 if (entity.partitionType()==Dune::InteriorEntity)
176 typedef typename FESwitch::Coefficients Coefficients;
177 const Coefficients& coeffs = FESwitch::coefficients(lfs.finiteElement());
180 typename T::RowType empty;
182 const ReferenceElement<typename GV::ctype,GV::dimension>& ref_el =
183 ReferenceElements<typename GV::ctype,GV::dimension>::general(entity.type());
186 for (
size_t i = 0; i < coeffs.size(); ++i)
188 size_t codim = coeffs.localKey(i).codim();
189 size_t sub_entity = coeffs.localKey(i).subEntity();
191 size_t entity_index = _gv.indexSet().subIndex(entity,sub_entity,codim);
192 size_t gt_index = GlobalGeometryTypeIndex::index(ref_el.type(sub_entity,codim));
194 size_t index = _gt_offsets[gt_index] + entity_index;
198 trafo[lfs.dofIndex(i)] = empty;
206 std::fill(_gt_offsets.begin(),_gt_offsets.end(),0);
208 for (
size_t codim = 0; codim <= GV::dimension; ++codim)
210 if (gfs.ordering().contains(codim))
212 for (
auto gt : _gv.indexSet().types(codim))
213 _gt_offsets[GlobalGeometryTypeIndex::index(gt) + 1] = _gv.indexSet().size(gt);
217 std::partial_sum(_gt_offsets.begin(),_gt_offsets.end(),_gt_offsets.begin());
219 _ghosts.assign(_gt_offsets.back(),
true);
221 typedef typename GV::template Codim<0>::
222 template Partition<Interior_Partition>::Iterator Iterator;
224 for(Iterator it = _gv.template begin<0, Interior_Partition>(),
225 end = _gv.template end<0, Interior_Partition>();
231 const ReferenceElement<typename GV::ctype,GV::dimension>& ref_el =
232 ReferenceElements<typename GV::ctype,GV::dimension>::general(entity.type());
234 for (
size_t codim = 0; codim <= GV::dimension; ++codim)
235 if (gfs.ordering().contains(codim))
237 for (
int i = 0; i < ref_el.size(codim); ++i)
239 size_t entity_index = _gv.indexSet().subIndex(entity,i,codim);
240 size_t gt_index = GlobalGeometryTypeIndex::index(ref_el.type(i,codim));
241 size_t index = _gt_offsets[gt_index] + entity_index;
243 _ghosts[index] =
false;
252 , _rank(gv.comm().rank())
253 , _gt_offsets(GlobalGeometryTypeIndex::size(GV::dimension) + 1)
260 std::vector<bool> _ghosts;
261 std::vector<size_t> _gt_offsets;
extend conforming constraints class by processor boundary
Definition: conforming.hh:152
Definition: conforming.hh:39
Definition: conforming.hh:41
Dirichlet Constraints construction.
Definition: conforming.hh:36
const IG & ig
Definition: constraints.hh:147
void volume(const P ¶m, const EG &eg, const LFS &lfs, T &trafo) const
volume constraints
Definition: conforming.hh:164
void compute_ghosts(const GFS &gfs)
Definition: conforming.hh:204
Definition: conforming.hh:104
Definition: conforming.hh:40
Definition: adaptivity.hh:27
static const int dim
Definition: adaptivity.hh:83
void processor(const IG &ig, const LFS &lfs, T &trafo) const
processor constraints
Definition: conforming.hh:113
void boundary(const P ¶m, const IG &ig, const LFS &lfs, T &trafo) const
boundary constraints
Definition: conforming.hh:52
NonoverlappingConformingDirichletConstraints(const GV &gv)
Definition: conforming.hh:250
Definition: conforming.hh:155
extend conforming constraints class by processor boundary
Definition: conforming.hh:101
const EG & eg
Definition: constraints.hh:280
Definition: conforming.hh:42