1*a0154adeSJed Brown // Copyright (c) 2017-2022, Lawrence Livermore National Security, LLC and other CEED contributors. 2*a0154adeSJed Brown // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. 3*a0154adeSJed Brown // 4*a0154adeSJed Brown // SPDX-License-Identifier: BSD-2-Clause 5*a0154adeSJed Brown // 6*a0154adeSJed Brown // This file is part of CEED: http://github.com/ceed 7*a0154adeSJed Brown 8*a0154adeSJed Brown /** 9*a0154adeSJed Brown @brief Ceed QFunction for applying the 2D Poisson operator 10*a0154adeSJed Brown on a vector system with three components 11*a0154adeSJed Brown **/ 12*a0154adeSJed Brown 13*a0154adeSJed Brown #ifndef vectorpoisson2dapply_h 14*a0154adeSJed Brown #define vectorpoisson2dapply_h 15*a0154adeSJed Brown 16*a0154adeSJed Brown CEED_QFUNCTION(Vector3Poisson2DApply)(void *ctx, const CeedInt Q, 17*a0154adeSJed Brown const CeedScalar *const *in, 18*a0154adeSJed Brown CeedScalar *const *out) { 19*a0154adeSJed Brown // *INDENT-OFF* 20*a0154adeSJed Brown // in[0] is gradient u, shape [2, nc=3, Q] 21*a0154adeSJed Brown // in[1] is quadrature data, size (3*Q) 22*a0154adeSJed Brown const CeedScalar (*ug)[3][CEED_Q_VLA] = (const CeedScalar(*)[3][CEED_Q_VLA])in[0], 23*a0154adeSJed Brown (*q_data)[CEED_Q_VLA] = (const CeedScalar(*)[CEED_Q_VLA])in[1]; 24*a0154adeSJed Brown // out[0] is output to multiply against gradient v, shape [2, nc=3, Q] 25*a0154adeSJed Brown CeedScalar (*vg)[3][CEED_Q_VLA] = (CeedScalar(*)[3][CEED_Q_VLA])out[0]; 26*a0154adeSJed Brown // *INDENT-ON* 27*a0154adeSJed Brown 28*a0154adeSJed Brown const CeedInt dim = 2, num_comp = 3; 29*a0154adeSJed Brown 30*a0154adeSJed Brown // Quadrature point loop 31*a0154adeSJed Brown CeedPragmaSIMD 32*a0154adeSJed Brown for (CeedInt i=0; i<Q; i++) { 33*a0154adeSJed Brown // Read qdata (dXdxdXdxT symmetric matrix) 34*a0154adeSJed Brown // Stored in Voigt convention 35*a0154adeSJed Brown // 0 2 36*a0154adeSJed Brown // 2 1 37*a0154adeSJed Brown // *INDENT-OFF* 38*a0154adeSJed Brown const CeedScalar dXdxdXdxT[2][2] = {{q_data[0][i], 39*a0154adeSJed Brown q_data[2][i]}, 40*a0154adeSJed Brown {q_data[2][i], 41*a0154adeSJed Brown q_data[1][i]} 42*a0154adeSJed Brown }; 43*a0154adeSJed Brown // *INDENT-ON* 44*a0154adeSJed Brown 45*a0154adeSJed Brown // Apply Poisson operator 46*a0154adeSJed Brown // j = direction of vg 47*a0154adeSJed Brown for (CeedInt j=0; j<dim; j++) 48*a0154adeSJed Brown for (CeedInt c=0; c<num_comp; c++) 49*a0154adeSJed Brown vg[j][c][i] = (ug[0][c][i] * dXdxdXdxT[0][j] + 50*a0154adeSJed Brown ug[1][c][i] * dXdxdXdxT[1][j]); 51*a0154adeSJed Brown } // End of Quadrature Point Loop 52*a0154adeSJed Brown 53*a0154adeSJed Brown return CEED_ERROR_SUCCESS; 54*a0154adeSJed Brown } 55*a0154adeSJed Brown 56*a0154adeSJed Brown #endif // vectorpoisson2dapply_h 57