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 static void buildmats(CeedScalar *q_ref, CeedScalar *q_weight, 18 CeedScalar *interp, 19 CeedScalar *grad) { 20 CeedInt P = 6, Q = 4; 21 22 q_ref[0] = 0.2; 23 q_ref[1] = 0.6; 24 q_ref[2] = 1./3.; 25 q_ref[3] = 0.2; 26 q_ref[4] = 0.2; 27 q_ref[5] = 0.2; 28 q_ref[6] = 1./3.; 29 q_ref[7] = 0.6; 30 q_weight[0] = 25./96.; 31 q_weight[1] = 25./96.; 32 q_weight[2] = -27./96.; 33 q_weight[3] = 25./96.; 34 35 // Loop over quadrature points 36 for (int i=0; i<Q; i++) { 37 CeedScalar x1 = q_ref[0*Q+i], x2 = q_ref[1*Q+i]; 38 // Interp 39 interp[i*P+0] = 2.*(x1+x2-1.)*(x1+x2-1./2.); 40 interp[i*P+1] = -4.*x1*(x1+x2-1.); 41 interp[i*P+2] = 2.*x1*(x1-1./2.); 42 interp[i*P+3] = -4.*x2*(x1+x2-1.); 43 interp[i*P+4] = 4.*x1*x2; 44 interp[i*P+5] = 2.*x2*(x2-1./2.); 45 // Grad 46 grad[(i+0)*P+0] = 2.*(1.*(x1+x2-1./2.)+(x1+x2-1.)*1.); 47 grad[(i+Q)*P+0] = 2.*(1.*(x1+x2-1./2.)+(x1+x2-1.)*1.); 48 grad[(i+0)*P+1] = -4.*(1.*(x1+x2-1.)+x1*1.); 49 grad[(i+Q)*P+1] = -4.*(x1*1.); 50 grad[(i+0)*P+2] = 2.*(1.*(x1-1./2.)+x1*1.); 51 grad[(i+Q)*P+2] = 2.*0.; 52 grad[(i+0)*P+3] = -4.*(x2*1.); 53 grad[(i+Q)*P+3] = -4.*(1.*(x1+x2-1.)+x2*1.); 54 grad[(i+0)*P+4] = 4.*(1.*x2); 55 grad[(i+Q)*P+4] = 4.*(x1*1.); 56 grad[(i+0)*P+5] = 2.*0.; 57 grad[(i+Q)*P+5] = 2.*(1.*(x2-1./2.)+x2*1.); 58 } 59 } 60