1*dbac3b9fSNatalie Beams // Copyright (c) 2017-2022, Lawrence Livermore National Security, LLC and other CEED contributors. 2*dbac3b9fSNatalie Beams // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. 3*dbac3b9fSNatalie Beams // 4*dbac3b9fSNatalie Beams // SPDX-License-Identifier: BSD-2-Clause 5*dbac3b9fSNatalie Beams // 6*dbac3b9fSNatalie Beams // This file is part of CEED: http://github.com/ceed 7*dbac3b9fSNatalie Beams 8*dbac3b9fSNatalie Beams #include <ceed.h> 9*dbac3b9fSNatalie Beams 10*dbac3b9fSNatalie Beams CEED_QFUNCTION(setup)(void *ctx, const CeedInt Q, 11*dbac3b9fSNatalie Beams const CeedScalar *const *in, 12*dbac3b9fSNatalie Beams CeedScalar *const *out) { 13*dbac3b9fSNatalie Beams // At every quadrature point, compute qw/det(J).adj(J).adj(J)^T and store 14*dbac3b9fSNatalie Beams // the symmetric part of the result. 15*dbac3b9fSNatalie Beams 16*dbac3b9fSNatalie Beams // in[0] is Jacobians with shape [2, nc=2, Q] 17*dbac3b9fSNatalie Beams // in[1] is quadrature weights, size (Q) 18*dbac3b9fSNatalie Beams const CeedScalar *J = in[0], *qw = in[1]; 19*dbac3b9fSNatalie Beams 20*dbac3b9fSNatalie Beams // out[0] is qdata, size (Q) 21*dbac3b9fSNatalie Beams CeedScalar *qd = out[0]; 22*dbac3b9fSNatalie Beams 23*dbac3b9fSNatalie Beams // Quadrature point loop 24*dbac3b9fSNatalie Beams for (CeedInt i=0; i<Q; i++) { 25*dbac3b9fSNatalie Beams // J: 0 2 qd: 0 2 adj(J): J22 -J12 26*dbac3b9fSNatalie Beams // 1 3 2 1 -J21 J11 27*dbac3b9fSNatalie Beams const CeedScalar J11 = J[i+Q*0]; 28*dbac3b9fSNatalie Beams const CeedScalar J21 = J[i+Q*1]; 29*dbac3b9fSNatalie Beams const CeedScalar J12 = J[i+Q*2]; 30*dbac3b9fSNatalie Beams const CeedScalar J22 = J[i+Q*3]; 31*dbac3b9fSNatalie Beams const CeedScalar w = qw[i] / (J11*J22 - J21*J12); 32*dbac3b9fSNatalie Beams qd[i+Q*0] = w * (J12*J12 + J22*J22); 33*dbac3b9fSNatalie Beams qd[i+Q*2] = w * (J11*J11 + J21*J21); 34*dbac3b9fSNatalie Beams qd[i+Q*1] = - w * (J11*J12 + J21*J22); 35*dbac3b9fSNatalie Beams } 36*dbac3b9fSNatalie Beams 37*dbac3b9fSNatalie Beams return 0; 38*dbac3b9fSNatalie Beams } 39*dbac3b9fSNatalie Beams 40*dbac3b9fSNatalie Beams CEED_QFUNCTION(diff)(void *ctx, const CeedInt Q, const CeedScalar *const *in, 41*dbac3b9fSNatalie Beams CeedScalar *const *out) { 42*dbac3b9fSNatalie Beams // in[0] is gradient u, shape [2, nc=2, Q] 43*dbac3b9fSNatalie Beams // in[1] is quadrature data, size (3*Q) 44*dbac3b9fSNatalie Beams const CeedScalar *du = in[0], *qd = in[1]; 45*dbac3b9fSNatalie Beams 46*dbac3b9fSNatalie Beams // out[0] is output to multiply against gradient v, shape [2, nc=2, Q] 47*dbac3b9fSNatalie Beams CeedScalar *dv = out[0]; 48*dbac3b9fSNatalie Beams 49*dbac3b9fSNatalie Beams // Quadrature point loop 50*dbac3b9fSNatalie Beams for (CeedInt i=0; i<Q; i++) { 51*dbac3b9fSNatalie Beams // Component loop 52*dbac3b9fSNatalie Beams for (CeedInt c = 0; c < 2; c++) { 53*dbac3b9fSNatalie Beams const CeedScalar du0 = du[i+c*Q+2*Q*0]; 54*dbac3b9fSNatalie Beams const CeedScalar du1 = du[i+c*Q+2*Q*1]; 55*dbac3b9fSNatalie Beams dv[i+c*Q+2*Q*0] = qd[i+Q*0]*du0 + qd[i+Q*2]*du1; 56*dbac3b9fSNatalie Beams dv[i+c*Q+2*Q*1] = qd[i+Q*2]*du0 + qd[i+Q*1]*du1; 57*dbac3b9fSNatalie Beams } 58*dbac3b9fSNatalie Beams } 59*dbac3b9fSNatalie Beams 60*dbac3b9fSNatalie Beams return 0; 61*dbac3b9fSNatalie Beams } 62