11#include "FunctionSpace.h"
14#include <dolfinx/graph/AdjacencyList.h>
15#include <dolfinx/la/utils.h>
16#include <dolfinx/mesh/Geometry.h>
17#include <dolfinx/mesh/Mesh.h>
18#include <dolfinx/mesh/Topology.h>
24namespace dolfinx::fem::impl
31 std::span<const std::int32_t> cells,
32 const std::function<
void(
const std::span<T>&,
33 const std::span<const std::uint32_t>&,
34 std::int32_t,
int)>& dof_transform,
36 const std::function<
void(
const std::span<T>&,
37 const std::span<const std::uint32_t>&,
38 std::int32_t,
int)>& dof_transform_to_transpose,
40 std::span<const std::int8_t> bc0, std::span<const std::int8_t> bc1,
41 FEkernel<T> auto kernel, std::span<const T> coeffs,
int cstride,
42 std::span<const T> constants, std::span<const std::uint32_t> cell_info)
49 const std::size_t num_dofs_g = geometry.
cmap().
dim();
50 std::span<const double> x = geometry.
x();
53 const int num_dofs0 = dofmap0.
links(0).size();
54 const int num_dofs1 = dofmap1.
links(0).size();
55 const int ndim0 = bs0 * num_dofs0;
56 const int ndim1 = bs1 * num_dofs1;
57 std::vector<T> Ae(ndim0 * ndim1);
59 std::vector<scalar_value_type_t<T>> coordinate_dofs(3 * num_dofs_g);
62 for (std::size_t index = 0; index < cells.size(); ++index)
64 std::int32_t c = cells[index];
67 auto x_dofs = x_dofmap.
links(c);
68 for (std::size_t i = 0; i < x_dofs.size(); ++i)
70 std::copy_n(std::next(x.begin(), 3 * x_dofs[i]), 3,
71 std::next(coordinate_dofs.begin(), 3 * i));
75 std::fill(Ae.begin(), Ae.end(), 0);
76 kernel(Ae.data(), coeffs.data() + index * cstride, constants.data(),
77 coordinate_dofs.data(),
nullptr,
nullptr);
79 dof_transform(_Ae, cell_info, c, ndim1);
80 dof_transform_to_transpose(_Ae, cell_info, c, ndim0);
83 auto dofs0 = dofmap0.
links(c);
84 auto dofs1 = dofmap1.
links(c);
87 for (
int i = 0; i < num_dofs0; ++i)
89 for (
int k = 0; k < bs0; ++k)
91 if (bc0[bs0 * dofs0[i] + k])
94 const int row = bs0 * i + k;
95 std::fill_n(std::next(Ae.begin(), ndim1 * row), ndim1, 0.0);
103 for (
int j = 0; j < num_dofs1; ++j)
105 for (
int k = 0; k < bs1; ++k)
107 if (bc1[bs1 * dofs1[j] + k])
110 const int col = bs1 * j + k;
111 for (
int row = 0; row < ndim0; ++row)
112 Ae[row * ndim1 + col] = 0.0;
118 mat_set(dofs0, dofs1, Ae);
124void assemble_exterior_facets(
126 std::span<const std::int32_t> facets,
127 const std::function<
void(
const std::span<T>&,
128 const std::span<const std::uint32_t>&,
129 std::int32_t,
int)>& dof_transform,
131 const std::function<
void(
const std::span<T>&,
132 const std::span<const std::uint32_t>&,
133 std::int32_t,
int)>& dof_transform_to_transpose,
135 std::span<const std::int8_t> bc0, std::span<const std::int8_t> bc1,
136 FEkernel<T> auto kernel, std::span<const T> coeffs,
int cstride,
137 std::span<const T> constants, std::span<const std::uint32_t> cell_info)
144 const std::size_t num_dofs_g = geometry.
cmap().
dim();
145 std::span<const double> x = geometry.
x();
148 std::vector<scalar_value_type_t<T>> coordinate_dofs(3 * num_dofs_g);
149 const int num_dofs0 = dofmap0.
links(0).size();
150 const int num_dofs1 = dofmap1.
links(0).size();
151 const int ndim0 = bs0 * num_dofs0;
152 const int ndim1 = bs1 * num_dofs1;
153 std::vector<T> Ae(ndim0 * ndim1);
154 std::span<T> _Ae(Ae);
155 assert(facets.size() % 2 == 0);
156 for (std::size_t index = 0; index < facets.size(); index += 2)
158 std::int32_t
cell = facets[index];
159 std::int32_t local_facet = facets[index + 1];
163 for (std::size_t i = 0; i < x_dofs.size(); ++i)
165 std::copy_n(std::next(x.begin(), 3 * x_dofs[i]), 3,
166 std::next(coordinate_dofs.begin(), 3 * i));
170 std::fill(Ae.begin(), Ae.end(), 0);
171 kernel(Ae.data(), coeffs.data() + index / 2 * cstride, constants.data(),
172 coordinate_dofs.data(), &local_facet,
nullptr);
174 dof_transform(_Ae, cell_info,
cell, ndim1);
175 dof_transform_to_transpose(_Ae, cell_info,
cell, ndim0);
182 for (
int i = 0; i < num_dofs0; ++i)
184 for (
int k = 0; k < bs0; ++k)
186 if (bc0[bs0 * dofs0[i] + k])
189 const int row = bs0 * i + k;
190 std::fill_n(std::next(Ae.begin(), ndim1 * row), ndim1, 0.0);
197 for (
int j = 0; j < num_dofs1; ++j)
199 for (
int k = 0; k < bs1; ++k)
201 if (bc1[bs1 * dofs1[j] + k])
204 const int col = bs1 * j + k;
205 for (
int row = 0; row < ndim0; ++row)
206 Ae[row * ndim1 + col] = 0.0;
212 mat_set(dofs0, dofs1, Ae);
218void assemble_interior_facets(
220 int num_cell_facets, std::span<const std::int32_t> facets,
221 const std::function<
void(
const std::span<T>&,
222 const std::span<const std::uint32_t>&,
223 std::int32_t,
int)>& dof_transform,
224 const DofMap& dofmap0,
int bs0,
225 const std::function<
void(
const std::span<T>&,
226 const std::span<const std::uint32_t>&,
227 std::int32_t,
int)>& dof_transform_to_transpose,
228 const DofMap& dofmap1,
int bs1, std::span<const std::int8_t> bc0,
229 std::span<const std::int8_t> bc1,
FEkernel<T> auto kernel,
230 std::span<const T> coeffs,
int cstride, std::span<const int> offsets,
231 std::span<const T> constants, std::span<const std::uint32_t> cell_info,
232 const std::function<std::uint8_t(std::size_t)>& get_perm)
239 const std::size_t num_dofs_g = geometry.
cmap().
dim();
240 std::span<const double> x = geometry.
x();
243 using X = scalar_value_type_t<T>;
244 std::vector<X> coordinate_dofs(2 * num_dofs_g * 3);
245 std::span<X> cdofs0(coordinate_dofs.data(), num_dofs_g * 3);
246 std::span<X> cdofs1(coordinate_dofs.data() + num_dofs_g * 3, num_dofs_g * 3);
248 std::vector<T> Ae, be;
249 std::vector<T> coeff_array(2 * offsets.back());
250 assert(offsets.back() == cstride);
253 std::vector<std::int32_t> dmapjoint0, dmapjoint1;
254 assert(facets.size() % 4 == 0);
255 for (std::size_t index = 0; index < facets.size(); index += 4)
257 std::array<std::int32_t, 2> cells = {facets[index], facets[index + 2]};
258 std::array<std::int32_t, 2> local_facet
259 = {facets[index + 1], facets[index + 3]};
262 auto x_dofs0 = x_dofmap.
links(cells[0]);
263 for (std::size_t i = 0; i < x_dofs0.size(); ++i)
265 std::copy_n(std::next(x.begin(), 3 * x_dofs0[i]), 3,
266 std::next(cdofs0.begin(), 3 * i));
268 auto x_dofs1 = x_dofmap.
links(cells[1]);
269 for (std::size_t i = 0; i < x_dofs1.size(); ++i)
271 std::copy_n(std::next(x.begin(), 3 * x_dofs1[i]), 3,
272 std::next(cdofs1.begin(), 3 * i));
276 std::span<const std::int32_t> dmap0_cell0 = dofmap0.cell_dofs(cells[0]);
277 std::span<const std::int32_t> dmap0_cell1 = dofmap0.cell_dofs(cells[1]);
278 dmapjoint0.resize(dmap0_cell0.size() + dmap0_cell1.size());
279 std::copy(dmap0_cell0.begin(), dmap0_cell0.end(), dmapjoint0.begin());
280 std::copy(dmap0_cell1.begin(), dmap0_cell1.end(),
281 std::next(dmapjoint0.begin(), dmap0_cell0.size()));
283 std::span<const std::int32_t> dmap1_cell0 = dofmap1.cell_dofs(cells[0]);
284 std::span<const std::int32_t> dmap1_cell1 = dofmap1.cell_dofs(cells[1]);
285 dmapjoint1.resize(dmap1_cell0.size() + dmap1_cell1.size());
286 std::copy(dmap1_cell0.begin(), dmap1_cell0.end(), dmapjoint1.begin());
287 std::copy(dmap1_cell1.begin(), dmap1_cell1.end(),
288 std::next(dmapjoint1.begin(), dmap1_cell0.size()));
290 const int num_rows = bs0 * dmapjoint0.size();
291 const int num_cols = bs1 * dmapjoint1.size();
294 Ae.resize(num_rows * num_cols);
295 std::fill(Ae.begin(), Ae.end(), 0);
297 const std::array perm{
298 get_perm(cells[0] * num_cell_facets + local_facet[0]),
299 get_perm(cells[1] * num_cell_facets + local_facet[1])};
300 kernel(Ae.data(), coeffs.data() + index / 2 * cstride, constants.data(),
301 coordinate_dofs.data(), local_facet.data(), perm.data());
303 std::span<T> _Ae(Ae);
304 std::span<T> sub_Ae0 = _Ae.subspan(bs0 * dmap0_cell0.size() * num_cols,
305 bs0 * dmap0_cell1.size() * num_cols);
307 = _Ae.subspan(bs1 * dmap1_cell0.size(),
308 num_rows * num_cols - bs1 * dmap1_cell0.size());
315 dof_transform(_Ae, cell_info, cells[0], num_cols);
316 dof_transform(sub_Ae0, cell_info, cells[1], num_cols);
317 dof_transform_to_transpose(_Ae, cell_info, cells[0], num_rows);
318 dof_transform_to_transpose(sub_Ae1, cell_info, cells[1], num_rows);
323 for (std::size_t i = 0; i < dmapjoint0.size(); ++i)
325 for (
int k = 0; k < bs0; ++k)
327 if (bc0[bs0 * dmapjoint0[i] + k])
330 std::fill_n(std::next(Ae.begin(), num_cols * (bs0 * i + k)),
338 for (std::size_t j = 0; j < dmapjoint1.size(); ++j)
340 for (
int k = 0; k < bs1; ++k)
342 if (bc1[bs1 * dmapjoint1[j] + k])
345 for (
int m = 0; m < num_rows; ++m)
346 Ae[m * num_cols + bs1 * j + k] = 0.0;
352 mat_set(dmapjoint0, dmapjoint1, Ae);
364 const std::map<std::pair<IntegralType, int>,
365 std::pair<std::span<const T>,
int>>& coefficients,
366 std::span<const std::int8_t> bc0, std::span<const std::int8_t> bc1)
368 std::shared_ptr<const mesh::Mesh> mesh = a.
mesh();
372 std::shared_ptr<const fem::DofMap> dofmap0
374 std::shared_ptr<const fem::DofMap> dofmap1
379 const int bs0 = dofmap0->bs();
381 const int bs1 = dofmap1->bs();
383 std::shared_ptr<const fem::FiniteElement> element0
385 std::shared_ptr<const fem::FiniteElement> element1
387 const std::function<void(
const std::span<T>&,
388 const std::span<const std::uint32_t>&, std::int32_t,
390 = element0->get_dof_transformation_function<T>();
391 const std::function<void(
const std::span<T>&,
392 const std::span<const std::uint32_t>&, std::int32_t,
393 int)>& dof_transform_to_transpose
394 = element1->get_dof_transformation_to_transpose_function<T>();
396 const bool needs_transformation_data
397 = element0->needs_dof_transformations()
398 or element1->needs_dof_transformations()
400 std::span<const std::uint32_t> cell_info;
401 if (needs_transformation_data)
403 mesh->topology_mutable().create_entity_permutations();
404 cell_info = std::span(mesh->topology().get_cell_permutation_info());
411 const std::vector<std::int32_t>& cells = a.
cell_domains(i);
412 impl::assemble_cells(mat_set, mesh->geometry(), cells, dof_transform, dofs0,
413 bs0, dof_transform_to_transpose, dofs1, bs1, bc0, bc1,
414 fn, coeffs, cstride, constants, cell_info);
420 const auto& [coeffs, cstride]
423 impl::assemble_exterior_facets(
424 mat_set, mesh->geometry(), facets, dof_transform, dofs0, bs0,
425 dof_transform_to_transpose, dofs1, bs1, bc0, bc1, fn, coeffs, cstride,
426 constants, cell_info);
431 std::function<std::uint8_t(std::size_t)> get_perm;
434 mesh->topology_mutable().create_entity_permutations();
435 const std::vector<std::uint8_t>& perms
436 = mesh->topology().get_facet_permutations();
437 get_perm = [&perms](std::size_t i) {
return perms[i]; };
440 get_perm = [](std::size_t) {
return 0; };
443 mesh->topology().dim() - 1);
448 const auto& [coeffs, cstride]
451 impl::assemble_interior_facets(
452 mat_set, mesh->geometry(), num_cell_facets, facets, dof_transform,
453 *dofmap0, bs0, dof_transform_to_transpose, *dofmap1, bs1, bc0, bc1,
454 fn, coeffs, cstride, c_offsets, constants, cell_info, get_perm);
Degree-of-freedom map representations and tools.
int dim() const
The dimension of the geometry element space.
Definition: CoordinateElement.cpp:183
Degree-of-freedom map.
Definition: DofMap.h:72
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: AdjacencyList.h:27
std::span< T > links(int node)
Get the links (edges) for given node.
Definition: AdjacencyList.h:109
Geometry stores the geometry imposed on a mesh.
Definition: Geometry.h:29
const graph::AdjacencyList< std::int32_t > & dofmap() const
DOF map.
Definition: Geometry.cpp:21
std::span< const double > x() const
Access geometry degrees-of-freedom data (const version).
Definition: Geometry.cpp:33
const fem::CoordinateElement & cmap() const
The element that describes the geometry map.
Definition: Geometry.cpp:35
Finite element cell kernel concept.
Definition: utils.h:82
Matrix accumulate/set concept for functions that can be used in assemblers to accumulate or set value...
Definition: utils.h:28
@ interior_facet
Interior facet.
@ exterior_facet
Exterior facet.
int cell_num_entities(CellType type, int dim)
Number of entities of dimension dim.
Definition: cell_types.cpp:139