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 #ifndef bps_h 9 #define bps_h 10 11 #include <math.h> 12 13 #ifndef M_PI 14 #define M_PI 3.14159265358979323846 15 #endif 16 17 // ***************************************************************************** 18 // BP 1 19 // ***************************************************************************** 20 CEED_QFUNCTION(masssetupf)(void *ctx, CeedInt Q, const CeedScalar *const *in, 21 CeedScalar *const *out) { 22 CeedScalar *qdata = out[0], *rhs = out[1]; 23 const CeedScalar *x = in[0]; 24 const CeedScalar *J = in[1]; 25 const CeedScalar *w = in[2]; 26 27 // Quadrature Point Loop 28 for (CeedInt i=0; i<Q; i++) { 29 CeedScalar det = (J[i+Q*0]*(J[i+Q*4]*J[i+Q*8] - J[i+Q*5]*J[i+Q*7]) - 30 J[i+Q*1]*(J[i+Q*3]*J[i+Q*8] - J[i+Q*5]*J[i+Q*6]) + 31 J[i+Q*2]*(J[i+Q*3]*J[i+Q*7] - J[i+Q*4]*J[i+Q*6])); 32 qdata[i] = det * w[i]; 33 rhs[i] = qdata[i] * sqrt(x[i]*x[i] + x[i+Q]*x[i+Q] + x[i+2*Q]*x[i+2*Q]); 34 } // End of Quadrature Point Loop 35 return 0; 36 } 37 38 CEED_QFUNCTION(massf)(void *ctx, CeedInt Q, const CeedScalar *const *in, 39 CeedScalar *const *out) { 40 const CeedScalar *u = in[0]; 41 const CeedScalar *qdata = in[1]; 42 CeedScalar *v = out[0]; 43 44 // Quadrature Point Loop 45 for (CeedInt i=0; i<Q; i++) 46 v[i] = qdata[i] * u[i]; 47 48 return 0; 49 } 50 // ***************************************************************************** 51 // BP 3 52 // ***************************************************************************** 53 CEED_QFUNCTION(diffsetupf)(void *ctx, CeedInt Q, const CeedScalar *const *in, 54 CeedScalar *const *out) { 55 const CeedScalar *x = in[0]; 56 const CeedScalar *J = in[1]; 57 const CeedScalar *w = in[2]; 58 CeedScalar *qdata = out[0], *rhs = out[1]; 59 60 // Quadrature Point Loop 61 for (CeedInt i=0; i<Q; i++) { 62 // Stored in Voigt convention 63 // 0 5 4 64 // 5 1 3 65 // 4 3 2 66 const CeedScalar J11 = J[i+Q*0]; 67 const CeedScalar J21 = J[i+Q*1]; 68 const CeedScalar J31 = J[i+Q*2]; 69 const CeedScalar J12 = J[i+Q*3]; 70 const CeedScalar J22 = J[i+Q*4]; 71 const CeedScalar J32 = J[i+Q*5]; 72 const CeedScalar J13 = J[i+Q*6]; 73 const CeedScalar J23 = J[i+Q*7]; 74 const CeedScalar J33 = J[i+Q*8]; 75 const CeedScalar A11 = J22*J33 - J23*J32; 76 const CeedScalar A12 = J13*J32 - J12*J33; 77 const CeedScalar A13 = J12*J23 - J13*J22; 78 const CeedScalar A21 = J23*J31 - J21*J33; 79 const CeedScalar A22 = J11*J33 - J13*J31; 80 const CeedScalar A23 = J13*J21 - J11*J23; 81 const CeedScalar A31 = J21*J32 - J22*J31; 82 const CeedScalar A32 = J12*J31 - J11*J32; 83 const CeedScalar A33 = J11*J22 - J12*J21; 84 const CeedScalar qw = w[i] / (J11*A11 + J21*A12 + J31*A13); 85 qdata[i+Q*0] = qw * (A11*A11 + A12*A12 + A13*A13); 86 qdata[i+Q*1] = qw * (A21*A21 + A22*A22 + A23*A23); 87 qdata[i+Q*2] = qw * (A31*A31 + A32*A32 + A33*A33); 88 qdata[i+Q*3] = qw * (A21*A31 + A22*A32 + A23*A33); 89 qdata[i+Q*4] = qw * (A11*A31 + A12*A32 + A13*A33); 90 qdata[i+Q*5] = qw * (A11*A21 + A12*A22 + A13*A23); 91 const CeedScalar c[3] = { 0, 1., 2. }; 92 const CeedScalar k[3] = { 1., 2., 3. }; 93 const CeedScalar rho = w[i] * (J11*A11 + J21*A12 + J31*A13); 94 rhs[i] = rho * M_PI*M_PI * (k[0]*k[0] + k[1]*k[1] + k[2]*k[2]) * 95 sin(M_PI*(c[0] + k[0]*x[i+Q*0])) * 96 sin(M_PI*(c[1] + k[1]*x[i+Q*1])) * 97 sin(M_PI*(c[2] + k[2]*x[i+Q*2])); 98 } // End of Quadrature Point Loop 99 return 0; 100 } 101 102 CEED_QFUNCTION(diffusionf)(void *ctx, CeedInt Q, const CeedScalar *const *in, 103 CeedScalar *const *out) { 104 const CeedScalar *ug = in[0]; 105 const CeedScalar *qdata = in[1]; 106 CeedScalar *vg = out[0]; 107 108 // Quadrature Point Loop 109 for (CeedInt i=0; i<Q; i++) { 110 const CeedScalar ug0 = ug[i+Q*0]; 111 const CeedScalar ug1 = ug[i+Q*1]; 112 const CeedScalar ug2 = ug[i+Q*2]; 113 vg[i+Q*0] = qdata[i+Q*0]*ug0 + qdata[i+Q*5]*ug1 + qdata[i+Q*4]*ug2; 114 vg[i+Q*1] = qdata[i+Q*5]*ug0 + qdata[i+Q*1]*ug1 + qdata[i+Q*3]*ug2; 115 vg[i+Q*2] = qdata[i+Q*4]*ug0 + qdata[i+Q*3]*ug1 + qdata[i+Q*2]*ug2; 116 } // End of Quadrature Point Loop 117 return 0; 118 } 119 120 #endif // bps_h 121