1 // Copyright (c) 2017-2018, Lawrence Livermore National Security, LLC. 2 // Produced at the Lawrence Livermore National Laboratory. LLNL-CODE-734707. 3 // All Rights reserved. See files LICENSE and NOTICE for details. 4 // 5 // This file is part of CEED, a collection of benchmarks, miniapps, software 6 // libraries and APIs for efficient high-order finite element and spectral 7 // element discretizations for exascale applications. For more information and 8 // source code availability see http://github.com/ceed. 9 // 10 // The CEED research is supported by the Exascale Computing Project 17-SC-20-SC, 11 // a collaborative effort of two U.S. Department of Energy organizations (Office 12 // of Science and the National Nuclear Security Administration) responsible for 13 // the planning and preparation of a capable exascale ecosystem, including 14 // software, applications, hardware, advanced system engineering and early 15 // testbed platforms, in support of the nation's exascale computing imperative. 16 17 CEED_QFUNCTION(setup_mass)(void *ctx, const CeedInt Q, 18 const CeedScalar *const *in, 19 CeedScalar *const *out) { 20 const CeedScalar *J = in[0], *weight = in[1]; 21 CeedScalar *rho = out[0]; 22 for (CeedInt i=0; i<Q; i++) { 23 rho[i] = weight[i] * (J[i+Q*0]*J[i+Q*3] - J[i+Q*1]*J[i+Q*2]); 24 } 25 return 0; 26 } 27 28 CEED_QFUNCTION(setup_diff)(void *ctx, const CeedInt Q, 29 const CeedScalar *const *in, 30 CeedScalar *const *out) { 31 // At every quadrature point, compute qw/det(J).adj(J).adj(J)^T and store 32 // the symmetric part of the result. 33 34 // in[0] is Jacobians with shape [2, nc=2, Q] 35 // in[1] is quadrature weights, size (Q) 36 const CeedScalar *J = in[0], *qw = in[1]; 37 38 // out[0] is qdata, size (Q) 39 CeedScalar *qd = out[0]; 40 41 // Quadrature point loop 42 for (CeedInt i=0; i<Q; i++) { 43 // J: 0 2 qd: 0 2 adj(J): J22 -J12 44 // 1 3 2 1 -J21 J11 45 const CeedScalar J11 = J[i+Q*0]; 46 const CeedScalar J21 = J[i+Q*1]; 47 const CeedScalar J12 = J[i+Q*2]; 48 const CeedScalar J22 = J[i+Q*3]; 49 const CeedScalar w = qw[i] / (J11*J22 - J21*J12); 50 qd[i+Q*0] = w * (J12*J12 + J22*J22); 51 qd[i+Q*1] = w * (J11*J11 + J21*J21); 52 qd[i+Q*2] = - w * (J11*J12 + J21*J22); 53 } 54 55 return 0; 56 } 57 58 CEED_QFUNCTION(apply)(void *ctx, const CeedInt Q, const CeedScalar *const *in, 59 CeedScalar *const *out) { 60 // in[0] is gradient u, shape [2, nc=1, Q] 61 // in[1] is mass quadrature data, size (Q) 62 // in[2] is Poisson quadrature data, size (3*Q) 63 // in[3] is u, size (Q) 64 const CeedScalar *du = in[0], *qd_mass = in[1], *qd_diff = in[2], *u = in[3]; 65 66 // out[0] is output to multiply against v, size (Q) 67 // out[1] is output to multiply against gradient v, shape [2, nc=1, Q] 68 CeedScalar *v = out[0], *dv = out[1]; 69 70 // Quadrature point loop 71 for (CeedInt i=0; i<Q; i++) { 72 // Mass 73 v[i] = qd_mass[i]*u[i]; 74 // Diff 75 const CeedScalar du0 = du[i+Q*0]; 76 const CeedScalar du1 = du[i+Q*1]; 77 dv[i+Q*0] = qd_diff[i+Q*0]*du0 + qd_diff[i+Q*2]*du1; 78 dv[i+Q*1] = qd_diff[i+Q*2]*du0 + qd_diff[i+Q*1]*du1; 79 } 80 81 return 0; 82 } 83 84 CEED_QFUNCTION(apply_lin)(void *ctx, const CeedInt Q, 85 const CeedScalar *const *in, 86 CeedScalar *const *out) { 87 // in[0] is gradient u, shape [2, nc=1, Q] 88 // in[1] is assembled quadrature data, size (9*Q) 89 // in[2] is u, size (Q) 90 const CeedScalar *du = in[0], *qd = in[1], *u = in[2]; 91 92 // out[0] is output to multiply against v, size (Q) 93 // out[1] is output to multiply against gradient v, shape [2, nc=1, Q] 94 CeedScalar *v = out[0], *dv = out[1]; 95 96 // Quadrature point loop 97 for (CeedInt i=0; i<Q; i++) { 98 const CeedScalar du0 = du[i+Q*0]; 99 const CeedScalar du1 = du[i+Q*1]; 100 v[i+Q*0] = qd[i+Q*0]*du0 + qd[i+Q*3]*du1 + qd[i+Q*6]*u[i]; 101 dv[i+Q*0] = qd[i+Q*1]*du0 + qd[i+Q*4]*du1 + qd[i+Q*7]*u[i]; 102 dv[i+Q*1] = qd[i+Q*2]*du0 + qd[i+Q*5]*du1 + qd[i+Q*8]*u[i]; 103 } 104 105 return 0; 106 } 107