220 mooseAssert(elem,
"The supplied element is a nullptr.");
222 const auto W_elem = computeElementPrimitiveVariables(elem);
223 const Point x_elem = elem->vertex_average();
224 const RealVectorValue dir = (elem->node_ref(1) - elem->node_ref(0)).unit();
226 std::vector<Point> x_neighbor;
227 std::vector<std::vector<GenericReal<is_ad>>> W_neighbor;
228 getNeighborPrimitiveVariables(elem, W_neighbor, x_neighbor);
230 return getElementSlopes(W_elem, x_elem, dir, W_neighbor, x_neighbor);
260 const Point & x_elem,
261 const RealVectorValue & dir,
263 const std::vector<Point> & x_neighbor)
const
265 mooseAssert(x_neighbor.size() == W_neighbor.size(),
266 "Neighbor positions size must equal neighbor solutions size.");
268 using std::abs, std::min, std::max;
271 const unsigned int n_slopes = W_elem.size();
274 std::vector<std::vector<GenericReal<is_ad>>> slopes_one_sided;
275 for (
unsigned int i = 0; i < W_neighbor.size(); i++)
277 const Real dx = (x_elem - x_neighbor[i]) * dir;
279 std::vector<GenericReal<is_ad>> slopes(n_slopes, 0.0);
280 for (
unsigned int m = 0; m < n_slopes; m++)
281 slopes[m] = (W_elem[m] - W_neighbor[i][m]) / dx;
283 slopes_one_sided.push_back(slopes);
287 std::vector<GenericReal<is_ad>> slopes_central(n_slopes, 0.0);
288 if (W_neighbor.size() == 2)
290 const Real dx = (x_neighbor[0] - x_neighbor[1]) * dir;
291 for (
unsigned int m = 0; m < n_slopes; m++)
292 slopes_central[m] = (W_neighbor[0][m] - W_neighbor[1][m]) / dx;
294 else if (W_neighbor.size() == 1)
296 slopes_one_sided.push_back(slopes_one_sided[0]);
297 slopes_central = slopes_one_sided[0];
301 slopes_one_sided.push_back(slopes_central);
302 slopes_one_sided.push_back(slopes_central);
306 std::vector<GenericReal<is_ad>> slopes_limited(n_slopes, 0.0);
318 slopes_limited = slopes_central;
324 for (
unsigned int m = 0; m < n_slopes; m++)
326 if ((slopes_one_sided[0][m] * slopes_one_sided[1][m]) > 0.0)
328 if (abs(slopes_one_sided[0][m]) < abs(slopes_one_sided[1][m]))
329 slopes_limited[m] = slopes_one_sided[0][m];
331 slopes_limited[m] = slopes_one_sided[1][m];
339 for (
unsigned int m = 0; m < n_slopes; m++)
341 if (slopes_central[m] > 0.0 && slopes_one_sided[0][m] > 0.0 && slopes_one_sided[1][m] > 0.0)
343 min(slopes_central[m], 2.0 * min(slopes_one_sided[0][m], slopes_one_sided[1][m]));
344 else if (slopes_central[m] < 0.0 && slopes_one_sided[0][m] < 0.0 &&
345 slopes_one_sided[1][m] < 0.0)
347 max(slopes_central[m], 2.0 * max(slopes_one_sided[0][m], slopes_one_sided[1][m]));
354 for (
unsigned int m = 0; m < n_slopes; m++)
360 if (slopes_one_sided[1][m] > 0.0 && slopes_one_sided[0][m] > 0.0)
361 slope1 = min(slopes_one_sided[1][m], 2.0 * slopes_one_sided[0][m]);
362 else if (slopes_one_sided[1][m] < 0.0 && slopes_one_sided[0][m] < 0.0)
363 slope1 = max(slopes_one_sided[1][m], 2.0 * slopes_one_sided[0][m]);
366 if (slopes_one_sided[1][m] > 0.0 && slopes_one_sided[0][m] > 0.0)
367 slope2 = min(2.0 * slopes_one_sided[1][m], slopes_one_sided[0][m]);
368 else if (slopes_one_sided[1][m] < 0.0 && slopes_one_sided[0][m] < 0.0)
369 slope2 = max(2.0 * slopes_one_sided[1][m], slopes_one_sided[0][m]);
372 if (slope1 > 0.0 && slope2 > 0.0)
373 slopes_limited[m] = max(slope1, slope2);
374 else if (slope1 < 0.0 && slope2 < 0.0)
375 slopes_limited[m] = min(slope1, slope2);
380 mooseError(
"Unknown slope reconstruction scheme");
383 return slopes_limited;