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