1 // Copyright (c) 2017-2022, Lawrence Livermore National Security, LLC and other CEED contributors. 2 // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. 3 // 4 // SPDX-License-Identifier: BSD-2-Clause 5 // 6 // This file is part of CEED: http://github.com/ceed 7 8 CEED_QFUNCTION(setup_mass)(void *ctx, const CeedInt Q, 9 const CeedScalar *const *in, 10 CeedScalar *const *out) { 11 const CeedScalar *J = in[0], *weight = in[1]; 12 CeedScalar *rho = out[0]; 13 for (CeedInt i=0; i<Q; i++) { 14 rho[i] = weight[i] * (J[i+Q*0]*J[i+Q*3] - J[i+Q*1]*J[i+Q*2]); 15 } 16 return 0; 17 } 18 19 CEED_QFUNCTION(setup_diff)(void *ctx, const CeedInt Q, 20 const CeedScalar *const *in, 21 CeedScalar *const *out) { 22 // At every quadrature point, compute qw/det(J).adj(J).adj(J)^T and store 23 // the symmetric part of the result. 24 25 // in[0] is Jacobians with shape [2, nc=2, Q] 26 // in[1] is quadrature weights, size (Q) 27 const CeedScalar *J = in[0], *qw = in[1]; 28 29 // out[0] is qdata, size (Q) 30 CeedScalar *qd = out[0]; 31 32 // Quadrature point loop 33 for (CeedInt i=0; i<Q; i++) { 34 // J: 0 2 qd: 0 2 adj(J): J22 -J12 35 // 1 3 2 1 -J21 J11 36 const CeedScalar J11 = J[i+Q*0]; 37 const CeedScalar J21 = J[i+Q*1]; 38 const CeedScalar J12 = J[i+Q*2]; 39 const CeedScalar J22 = J[i+Q*3]; 40 const CeedScalar w = qw[i] / (J11*J22 - J21*J12); 41 qd[i+Q*0] = w * (J12*J12 + J22*J22); 42 qd[i+Q*1] = w * (J11*J11 + J21*J21); 43 qd[i+Q*2] = - w * (J11*J12 + J21*J22); 44 } 45 46 return 0; 47 } 48 49 CEED_QFUNCTION(apply)(void *ctx, const CeedInt Q, const CeedScalar *const *in, 50 CeedScalar *const *out) { 51 // in[0] is gradient u, shape [2, nc=1, Q] 52 // in[1] is mass quadrature data, size (Q) 53 // in[2] is Poisson quadrature data, size (3*Q) 54 // in[3] is u, size (Q) 55 const CeedScalar *du = in[0], *qd_mass = in[1], *qd_diff = in[2], *u = in[3]; 56 57 // out[0] is output to multiply against v, size (Q) 58 // out[1] is output to multiply against gradient v, shape [2, nc=1, Q] 59 CeedScalar *v = out[0], *dv = out[1]; 60 61 // Quadrature point loop 62 for (CeedInt i=0; i<Q; i++) { 63 // Mass 64 v[i] = qd_mass[i]*u[i]; 65 // Diff 66 const CeedScalar du0 = du[i+Q*0]; 67 const CeedScalar du1 = du[i+Q*1]; 68 dv[i+Q*0] = qd_diff[i+Q*0]*du0 + qd_diff[i+Q*2]*du1; 69 dv[i+Q*1] = qd_diff[i+Q*2]*du0 + qd_diff[i+Q*1]*du1; 70 } 71 72 return 0; 73 } 74 75 CEED_QFUNCTION(apply_lin)(void *ctx, const CeedInt Q, 76 const CeedScalar *const *in, 77 CeedScalar *const *out) { 78 // in[0] is gradient u, shape [2, nc=1, Q] 79 // in[1] is assembled quadrature data, size (9*Q) 80 // in[2] is u, size (Q) 81 const CeedScalar *du = in[0], *qd = in[1], *u = in[2]; 82 83 // out[0] is output to multiply against v, size (Q) 84 // out[1] is output to multiply against gradient v, shape [2, nc=1, Q] 85 CeedScalar *v = out[0], *dv = out[1]; 86 87 // Quadrature point loop 88 for (CeedInt i=0; i<Q; i++) { 89 const CeedScalar du0 = du[i+Q*0]; 90 const CeedScalar du1 = du[i+Q*1]; 91 v[i+Q*0] = qd[i+Q*0]*du0 + qd[i+Q*3]*du1 + qd[i+Q*6]*u[i]; 92 dv[i+Q*0] = qd[i+Q*1]*du0 + qd[i+Q*4]*du1 + qd[i+Q*7]*u[i]; 93 dv[i+Q*1] = qd[i+Q*2]*du0 + qd[i+Q*5]*du1 + qd[i+Q*8]*u[i]; 94 } 95 96 return 0; 97 } 98