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