1*9ba83ac0SJeremy L Thompson // Copyright (c) 2017-2026, Lawrence Livermore National Security, LLC and other CEED contributors. 2a0154adeSJed Brown // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. 3a0154adeSJed Brown // 4a0154adeSJed Brown // SPDX-License-Identifier: BSD-2-Clause 5a0154adeSJed Brown // 6a0154adeSJed Brown // This file is part of CEED: http://github.com/ceed 7a0154adeSJed Brown 8a0154adeSJed Brown /** 9ea61e9acSJeremy L Thompson @brief Ceed QFunction for applying the geometric data for the 3D Poisson on a vector system with three components operator 10a0154adeSJed Brown **/ 11c0b5abf0SJeremy L Thompson #include <ceed/types.h> 12c9c2c079SJeremy L Thompson 132b730f8bSJeremy L Thompson CEED_QFUNCTION(Vector3Poisson3DApply)(void *ctx, const CeedInt Q, const CeedScalar *const *in, CeedScalar *const *out) { 14a0154adeSJed Brown // in[0] is gradient u, shape [3, nc=3, Q] 15a0154adeSJed Brown // in[1] is quadrature data, size (6*Q) 162b730f8bSJeremy L Thompson const CeedScalar(*ug)[3][CEED_Q_VLA] = (const CeedScalar(*)[3][CEED_Q_VLA])in[0], (*q_data)[CEED_Q_VLA] = (const CeedScalar(*)[CEED_Q_VLA])in[1]; 17a0154adeSJed Brown // out[0] is output to multiply against gradient v, shape [3, nc=3, Q] 18a0154adeSJed Brown CeedScalar(*vg)[3][CEED_Q_VLA] = (CeedScalar(*)[3][CEED_Q_VLA])out[0]; 19a0154adeSJed Brown 20a0154adeSJed Brown const CeedInt dim = 3, num_comp = 3; 21a0154adeSJed Brown 22a0154adeSJed Brown // Quadrature point loop 232b730f8bSJeremy L Thompson CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { 24a0154adeSJed Brown // Read qdata (dXdxdXdxT symmetric matrix) 25a0154adeSJed Brown // Stored in Voigt convention 26a0154adeSJed Brown // 0 5 4 27a0154adeSJed Brown // 5 1 3 28a0154adeSJed Brown // 4 3 2 292b730f8bSJeremy L Thompson const CeedScalar dXdxdXdxT[3][3] = { 302b730f8bSJeremy L Thompson {q_data[0][i], q_data[5][i], q_data[4][i]}, 312b730f8bSJeremy L Thompson {q_data[5][i], q_data[1][i], q_data[3][i]}, 322b730f8bSJeremy L Thompson {q_data[4][i], q_data[3][i], q_data[2][i]} 33a0154adeSJed Brown }; 34a0154adeSJed Brown 35a0154adeSJed Brown // Apply Poisson Operator 36a0154adeSJed Brown // j = direction of vg 37a0154adeSJed Brown for (CeedInt j = 0; j < dim; j++) 38a0154adeSJed Brown for (CeedInt c = 0; c < num_comp; c++) 392b730f8bSJeremy L Thompson vg[j][c][i] = (ug[0][c][i] * dXdxdXdxT[0][j] + ug[1][c][i] * dXdxdXdxT[1][j] + ug[2][c][i] * dXdxdXdxT[2][j]); 40a0154adeSJed Brown } // End of Quadrature Point Loop 41a0154adeSJed Brown 42a0154adeSJed Brown return CEED_ERROR_SUCCESS; 43a0154adeSJed Brown } 44