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