|
dune-grid 2.12-git
|
Loading...
Searching...
No Matches
parmetisgridpartitioner.hh
Go to the documentation of this file.
1// SPDX-FileCopyrightText: Copyright © DUNE Project contributors, see file LICENSE.md in module root
71 idx_type ncommonnodes = 2; // number of nodes elements must have in common to be considered adjacent to each other
75 std::vector<real_type> tpwgts(ncon*nparts, 1./nparts); // load per subdomain and weight (same load on every process)
76 std::vector<real_type> ubvec(ncon, 1.05); // weight tolerance (same weight tolerance for every weight there is)
83 // Create and fill arrays "eptr", where eptr[i] is the number of vertices that belong to the i-th element, and
90 const size_t curNumVertices = referenceElement<double, dimension>(element.type()).size(dimension);
130 static std::vector<unsigned> repartition(const GridView& gv, const Dune::MPIHelper& mpihelper, real_type itr = 1000) {
147 std::vector<real_type> tpwgts(ncon*nparts, 1./nparts); // load per subdomain and weight (same load on every process)
148 std::vector<real_type> ubvec(ncon, 1.05); // weight tolerance (same weight tolerance for every weight there is)
195 // At this point, interiorPart contains a target rank for each interior element, and they are sorted
198 // b) Use the element index for the actual ordering. Since there may be different types of elements,
217#warning "You seem to be using the ParMETIS emulation layer of scotch, which does not work with this file."
Dune::ParameterTree options
Mapper for multiple codim and multiple geometry types.
std::ptrdiff_t index() const
#define DUNE_THROW(E,...)
int idx_t
Provides a globally unique index for all entities of a distributed Dune grid.
MCMGLayout mcmgElementLayout()
layout for elements (codim-0 entities)
Definition mcmgmapper.hh:97
constexpr Interior interior
PartitionSet for the interior partition.
Definition partitionset.hh:271
Include standard header files.
int size() const
int rank() const
static MPICommunicator getCommunicator()
static MPICommunicator getLocalCommunicator()
T back(T... args)
T data(T... args)
T distance(T... args)
T fill(T... args)
T partition(T... args)
T push_back(T... args)
Legal Statements / Impressum | Hosted by TU Dresden & Uni Heidelberg | Generated by
1.9.8