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