DOLFINx 0.10.0
DOLFINx C++ interface
Loading...
Searching...
No Matches
assemble_scalar_impl.h
1// Copyright (C) 2019-2025 Garth N. Wells and Paul T. Kühner
2//
3// This file is part of DOLFINx (https://www.fenicsproject.org)
4//
5// SPDX-License-Identifier: LGPL-3.0-or-later
6
7#pragma once
8
9#include "Constant.h"
10#include "Form.h"
11#include "FunctionSpace.h"
12#include "utils.h"
13#include <algorithm>
14#include <basix/mdspan.hpp>
15#include <dolfinx/common/IndexMap.h>
16#include <dolfinx/mesh/Geometry.h>
17#include <dolfinx/mesh/Mesh.h>
18#include <dolfinx/mesh/Topology.h>
19#include <memory>
20#include <vector>
21
22namespace dolfinx::fem::impl
23{
25template <dolfinx::scalar T>
26T assemble_cells(mdspan2_t x_dofmap,
27 md::mdspan<const scalar_value_t<T>,
28 md::extents<std::size_t, md::dynamic_extent, 3>>
29 x,
30 std::span<const std::int32_t> cells, FEkernel<T> auto fn,
31 std::span<const T> constants,
32 md::mdspan<const T, md::dextents<std::size_t, 2>> coeffs,
33 std::span<scalar_value_t<T>> cdofs_b)
34{
35 T value(0);
36 if (cells.empty())
37 return value;
38
39 assert(cdofs_b.size() >= 3 * x_dofmap.extent(1));
40
41 // Iterate over all cells
42 for (std::size_t index = 0; index < cells.size(); ++index)
43 {
44 std::int32_t c = cells[index];
45
46 // Get cell coordinates/geometry
47 auto x_dofs = md::submdspan(x_dofmap, c, md::full_extent);
48 for (std::size_t i = 0; i < x_dofs.size(); ++i)
49 std::copy_n(&x(x_dofs[i], 0), 3, std::next(cdofs_b.begin(), 3 * i));
50
51 fn(&value, &coeffs(index, 0), constants.data(), cdofs_b.data(), nullptr,
52 nullptr, nullptr);
53 }
54
55 return value;
56}
57
68template <dolfinx::scalar T>
69T assemble_entities(
70 mdspan2_t x_dofmap,
71 md::mdspan<const scalar_value_t<T>,
72 md::extents<std::size_t, md::dynamic_extent, 3>>
73 x,
74 md::mdspan<const std::int32_t,
75 md::extents<std::size_t, md::dynamic_extent, 2>>
76 entities,
77 FEkernel<T> auto fn, std::span<const T> constants,
78 md::mdspan<const T, md::dextents<std::size_t, 2>> coeffs,
79 md::mdspan<const std::uint8_t, md::dextents<std::size_t, 2>> perms,
80 std::span<scalar_value_t<T>> cdofs_b)
81{
82 T value(0);
83 if (entities.empty())
84 return value;
85
86 assert(cdofs_b.size() >= 3 * x_dofmap.extent(1));
87
88 // Iterate over all facets
89 for (std::size_t f = 0; f < entities.extent(0); ++f)
90 {
91 std::int32_t cell = entities(f, 0);
92 std::int32_t local_entity = entities(f, 1);
93
94 // Get cell coordinates/geometry
95 auto x_dofs = md::submdspan(x_dofmap, cell, md::full_extent);
96 for (std::size_t i = 0; i < x_dofs.size(); ++i)
97 std::copy_n(&x(x_dofs[i], 0), 3, std::next(cdofs_b.begin(), 3 * i));
98
99 // Permutations
100 std::uint8_t perm = perms.empty() ? 0 : perms(cell, local_entity);
101 fn(&value, &coeffs(f, 0), constants.data(), cdofs_b.data(), &local_entity,
102 &perm, nullptr);
103 }
104
105 return value;
106}
107
109template <dolfinx::scalar T>
110T assemble_interior_facets(
111 mdspan2_t x_dofmap,
112 md::mdspan<const scalar_value_t<T>,
113 md::extents<std::size_t, md::dynamic_extent, 3>>
114 x,
115 md::mdspan<const std::int32_t,
116 md::extents<std::size_t, md::dynamic_extent, 2, 2>>
117 facets,
118 FEkernel<T> auto fn, std::span<const T> constants,
119 md::mdspan<const T, md::extents<std::size_t, md::dynamic_extent, 2,
120 md::dynamic_extent>>
121 coeffs,
122 md::mdspan<const std::uint8_t, md::dextents<std::size_t, 2>> perms,
123 std::span<scalar_value_t<T>> cdofs_b)
124{
125 T value(0);
126 if (facets.empty())
127 return value;
128
129 // Create data structures used in assembly
130 assert(cdofs_b.size() >= 2 * 3 * x_dofmap.extent(1));
131 auto cdofs0 = cdofs_b.first(3 * x_dofmap.extent(1));
132 auto cdofs1 = cdofs_b.last(3 * x_dofmap.extent(1));
133
134 // Iterate over all facets
135 for (std::size_t f = 0; f < facets.extent(0); ++f)
136 {
137 std::array cells = {facets(f, 0, 0), facets(f, 1, 0)};
138 std::array local_facet = {facets(f, 0, 1), facets(f, 1, 1)};
139
140 // Get cell geometry
141 auto x_dofs0 = md::submdspan(x_dofmap, cells[0], md::full_extent);
142 for (std::size_t i = 0; i < x_dofs0.size(); ++i)
143 std::copy_n(&x(x_dofs0[i], 0), 3, std::next(cdofs0.begin(), 3 * i));
144 auto x_dofs1 = md::submdspan(x_dofmap, cells[1], md::full_extent);
145 for (std::size_t i = 0; i < x_dofs1.size(); ++i)
146 std::copy_n(&x(x_dofs1[i], 0), 3, std::next(cdofs1.begin(), 3 * i));
147
148 std::array perm = perms.empty()
149 ? std::array<std::uint8_t, 2>{0, 0}
150 : std::array{perms(cells[0], local_facet[0]),
151 perms(cells[1], local_facet[1])};
152 fn(&value, &coeffs(f, 0, 0), constants.data(), cdofs_b.data(),
153 local_facet.data(), perm.data(), nullptr);
154 }
155
156 return value;
157}
158
160template <dolfinx::scalar T, std::floating_point U>
161T assemble_scalar(
162 const fem::Form<T, U>& M, mdspan2_t x_dofmap,
163 md::mdspan<const scalar_value_t<T>,
164 md::extents<std::size_t, md::dynamic_extent, 3>>
165 x,
166 std::span<const T> constants,
167 const std::map<std::pair<IntegralType, int>,
168 std::pair<std::span<const T>, int>>& coefficients)
169{
170 std::shared_ptr<const mesh::Mesh<U>> mesh = M.mesh();
171 assert(mesh);
172
173 std::vector<scalar_value_t<T>> cdofs_b(2 * 3 * x_dofmap.extent(1));
174
175 T value = 0;
176 for (int i = 0; i < M.num_integrals(IntegralType::cell, 0); ++i)
177 {
178 auto fn = M.kernel(IntegralType::cell, i, 0);
179 assert(fn);
180 auto& [coeffs, cstride] = coefficients.at({IntegralType::cell, i});
181 std::span<const std::int32_t> cells = M.domain(IntegralType::cell, i, 0);
182 assert(cells.size() * cstride == coeffs.size());
183 value += impl::assemble_cells(
184 x_dofmap, x, cells, fn, constants,
185 md::mdspan(coeffs.data(), cells.size(), cstride), cdofs_b);
186 }
187
188 mesh::CellType cell_type = mesh->topology()->cell_type();
189 int num_facets_per_cell
190 = mesh::cell_num_entities(cell_type, mesh->topology()->dim() - 1);
191 md::mdspan<const std::uint8_t, md::dextents<std::size_t, 2>> facet_perms;
192 if (M.needs_facet_permutations())
193 {
194 mesh->topology_mutable()->create_entity_permutations();
195 const std::vector<std::uint8_t>& p
196 = mesh->topology()->get_facet_permutations();
197 facet_perms = md::mdspan(p.data(), p.size() / num_facets_per_cell,
198 num_facets_per_cell);
199 }
200
201 for (int i = 0; i < M.num_integrals(IntegralType::interior_facet, 0); ++i)
202 {
203 auto fn = M.kernel(IntegralType::interior_facet, i, 0);
204 assert(fn);
205 auto& [coeffs, cstride]
206 = coefficients.at({IntegralType::interior_facet, i});
207 std::span facets = M.domain(IntegralType::interior_facet, i, 0);
208
209 constexpr std::size_t num_adjacent_cells = 2;
210 // Two values per each adj. cell (cell index and local facet index).
211 constexpr std::size_t shape1 = 2 * num_adjacent_cells;
212
213 assert((facets.size() / shape1) * 2 * cstride == coeffs.size());
214 value += impl::assemble_interior_facets(
215 x_dofmap, x,
216 md::mdspan<const std::int32_t,
217 md::extents<std::size_t, md::dynamic_extent, 2, 2>>(
218 facets.data(), facets.size() / shape1, 2, 2),
219 fn, constants,
220 md::mdspan<const T, md::extents<std::size_t, md::dynamic_extent, 2,
221 md::dynamic_extent>>(
222 coeffs.data(), facets.size() / shape1, 2, cstride),
223 facet_perms, cdofs_b);
224 }
225
226 for (auto itg_type : {fem::IntegralType::exterior_facet,
228 {
229 md::mdspan<const std::uint8_t, md::dextents<std::size_t, 2>> perms
231 ? facet_perms
232 : md::mdspan<const std::uint8_t, md::dextents<std::size_t, 2>>{};
233
234 for (int i = 0; i < M.num_integrals(itg_type, 0); ++i)
235 {
236 auto fn = M.kernel(itg_type, i, 0);
237 assert(fn);
238 auto& [coeffs, cstride] = coefficients.at({itg_type, i});
239
240 std::span entities = M.domain(itg_type, i, 0);
241
242 // Two values per each adj. cell (cell index and local entity index).
243 assert((entities.size() / 2) * cstride == coeffs.size());
244 value += impl::assemble_entities(
245 x_dofmap, x,
246 md::mdspan<const std::int32_t,
247 md::extents<std::size_t, md::dynamic_extent, 2>>(
248 entities.data(), entities.size() / 2, 2),
249 fn, constants,
250 md::mdspan(coeffs.data(), entities.size() / 2, cstride), perms,
251 cdofs_b);
252 }
253 }
254
255 return value;
256}
257
258} // namespace dolfinx::fem::impl
Functions supporting finite element method operations.
void cells(la::SparsityPattern &pattern, std::array< std::span< const std::int32_t >, 2 > cells, std::array< std::reference_wrapper< const DofMap >, 2 > dofmaps)
Iterate over cells and insert entries into sparsity pattern.
Definition sparsitybuild.cpp:16
@ vertex
Vertex.
Definition Form.h:43
@ interior_facet
Interior facet.
Definition Form.h:42
@ ridge
Ridge.
Definition Form.h:44
@ cell
Cell.
Definition Form.h:40
@ exterior_facet
Facet.
Definition Form.h:41
CellType
Cell type identifier.
Definition cell_types.h:22
int cell_num_entities(CellType type, int dim)
Definition cell_types.cpp:139