1 // Copyright (c) 2017-2024, 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 /// @file 9 /// libCEED QFunctions for diffusion operator example using PETSc 10 11 #include <ceed.h> 12 #include <math.h> 13 14 // ----------------------------------------------------------------------------- 15 // This QFunction sets up the rhs and true solution for the problem 16 // ----------------------------------------------------------------------------- 17 CEED_QFUNCTION(SetupDiffRhs3)(void *ctx, CeedInt Q, const CeedScalar *const *in, CeedScalar *const *out) { 18 #ifndef M_PI 19 #define M_PI 3.14159265358979323846 20 #endif 21 const CeedScalar *x = in[0], *w = in[1]; 22 CeedScalar *true_soln = out[0], *rhs = out[1]; 23 24 // Quadrature Point Loop 25 CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { 26 const CeedScalar c[3] = {0, 1., 2.}; 27 const CeedScalar k[3] = {1., 2., 3.}; 28 29 // Component 1 30 true_soln[i + 0 * Q] = 31 sin(M_PI * (c[0] + k[0] * x[i + Q * 0])) * sin(M_PI * (c[1] + k[1] * x[i + Q * 1])) * sin(M_PI * (c[2] + k[2] * x[i + Q * 2])); 32 // Component 2 33 true_soln[i + 1 * Q] = 2 * true_soln[i + 0 * Q]; 34 // Component 3 35 true_soln[i + 2 * Q] = 3 * true_soln[i + 0 * Q]; 36 37 // Component 1 38 rhs[i + 0 * Q] = w[i + Q * 0] * M_PI * M_PI * (k[0] * k[0] + k[1] * k[1] + k[2] * k[2]) * true_soln[i + 0 * Q]; 39 // Component 2 40 rhs[i + 1 * Q] = 2 * rhs[i + 0 * Q]; 41 // Component 3 42 rhs[i + 2 * Q] = 3 * rhs[i + 0 * Q]; 43 } // End of Quadrature Point Loop 44 45 return 0; 46 } 47 48 // ----------------------------------------------------------------------------- 49 // This QFunction applies the diffusion operator for a vector field of 3 components. 50 // 51 // Inputs: 52 // ug - Input vector Jacobian at quadrature points 53 // q_data - Geometric factors 54 // 55 // Output: 56 // vJ - Output vector (test functions) Jacobian at quadrature points 57 // ----------------------------------------------------------------------------- 58 CEED_QFUNCTION(Diff3)(void *ctx, CeedInt Q, const CeedScalar *const *in, CeedScalar *const *out) { 59 const CeedScalar *ug = in[0], *qd = in[1]; 60 CeedScalar *vg = out[0]; 61 62 // Quadrature Point Loop 63 CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { 64 // Read spatial derivatives of u components 65 const CeedScalar uJ[3][3] = { 66 {ug[i + (0 + 0 * 3) * Q], ug[i + (0 + 1 * 3) * Q], ug[i + (0 + 2 * 3) * Q]}, 67 {ug[i + (1 + 0 * 3) * Q], ug[i + (1 + 1 * 3) * Q], ug[i + (1 + 2 * 3) * Q]}, 68 {ug[i + (2 + 0 * 3) * Q], ug[i + (2 + 1 * 3) * Q], ug[i + (2 + 2 * 3) * Q]} 69 }; 70 // Read q_data (dXdxdXdx_T symmetric matrix) 71 const CeedScalar dXdxdXdx_T[3][3] = { 72 {qd[i + 1 * Q], qd[i + 2 * Q], qd[i + 3 * Q]}, 73 {qd[i + 2 * Q], qd[i + 4 * Q], qd[i + 5 * Q]}, 74 {qd[i + 3 * Q], qd[i + 5 * Q], qd[i + 6 * Q]} 75 }; 76 77 for (int k = 0; k < 3; k++) { // k = component 78 for (int j = 0; j < 3; j++) { // j = direction of vg 79 vg[i + (k + j * 3) * Q] = (uJ[k][0] * dXdxdXdx_T[0][j] + uJ[k][1] * dXdxdXdx_T[1][j] + uJ[k][2] * dXdxdXdx_T[2][j]); 80 } 81 } 82 } // End of Quadrature Point Loop 83 84 return 0; 85 } 86 // ----------------------------------------------------------------------------- 87