A mapping category defines a set of similar mapping operations performed when mapping
a field from the source mesh to the target mesh. Table 1
shows the four possible mapping categories. The following factors determine the
mapping category:
- the field's physics properties (for example, intensive quantity if the
property does not depend on the amount of matter, or extensive if the
property depends on the amount of matter), and
- the position where the field is evaluated.
Within a mapping category, there might be one or more algorithms.
Table 1. Mapping Categories
| Category |
Source Field |
Target Field |
| Nodal |
Integration
Point |
Nodal |
Integration Point |
| Intensive |
Extensive |
Intensive |
Intensive |
Extensive |
Intensive |
| 1 |
|
|
|
|
|
|
| 2 |
|
|
|
|
|
|
| 3 |
|
|
|
|
|
|
| 4 |
|
|
|
|
|
|
The four mapping categories are described below. To simplify the discussion, the term
"element" is used to represent an element for a volume domain and a surface facet
for a surface domain.
- Mapping Category 1: Interpolation based on the element's shape
function
-
Applicable when mapping intensive nodal fields from the source mesh
to either intensive nodal or integration-point fields on the target
mesh. Examples include mapping nodal displacements between meshes or
mapping nodal velocity on a structural mesh to the cell-center
velocity of a fluid mesh.
If the source mesh is element-based, the target node or integration
point is projected onto the source mesh. The search algorithm finds
the closest source element and the location within the source
element where the target point is projected. The target field is
then interpolated using the source element's shape function. If the
source mesh is discrete, a similar algorithm is employed using a
point-cloud search algorithm.
- Mapping Category 2: Interpolation based on the target element's shape
function
-
Applicable when mapping extensive nodal fields to extensive fields;
for example, mapping nodal forces between source and target
meshes.
If the source mesh is element based, the source node is projected
onto the target mesh. The search algorithm finds the closest target
element and the location within the target element where the source
node is projected. The source field is then distributed using the
target element's shape function.
If the target mesh is discrete, a similar algorithm is employed using
a point-cloud search algorithm. The point-cloud search algorithm
finds the closest target nodes and forms a virtual element to
distribute the field values. In this case, the total quantity is
conserved across the interface; however, the distribution might be
less accurate.
- Mapping Category 3: Extrapolation followed by interpolation on the
source element
-
Applicable when mapping intensive integration-point fields to either
intensive nodal or integration-point fields on the target mesh. An
example is mapping stresses between source and target meshes.
The source mesh must be element based. The field is first
extrapolated to each element's nodes on the source mesh. The search
algorithm projects the target node or integration point onto the
source mesh and finds the closest source element. The target field
is then interpolated using the source element's shape function.
- Mapping Category 4: Integration of intensive to extensive fields
-
This category is applicable when mapping intensive fields to
extensive fields (for example, mapping surface traction vector to
nodal forces). This mapping category uses one of two available
integration algorithms: the subelement or the global conservative
algorithms.
The subelement algorithm provides conservative mapping with a smooth
distribution. It requires that the target mesh is element based.
Each target element is divided into subelements. For each
subelement, this algorithm locates the source field values according
to the procedure described in Mapping Category 1 and sums the values
over all the subelements. The number of subelements is determined
automatically to provide accurate results.
The global conservative algorithm provides conservative results over
the entire region. It requires that the target mesh is element
based. This algorithm is computationally less expensive than the
subelements algorithm; however, the mapped field might show an
uneven distribution in some cases. The global conservative algorithm
makes the source field conserved by integrating the field over the
source elements and then, for every source node, computes field
values according to the procedure described in Mapping Category
2.
The mapping algorithm is determined automatically by the SIMULIA Co-Simulation Services based on the source and target fields. You can overwrite the default setting by
providing a mapping specification in the Co-Simulation Configuration
file (see Mapping Specification).