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