| /libCEED/examples/python/ |
| H A D | tutorial-2-elemrestriction.ipynb | 7 "# libCEED for Python examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 18 "## Setting up libCEED for Python\n", 19 "\n", 36 "## CeedElemRestriction\n", 37 "\n", 38 …ntation](https://libceed.org/en/latest/libCEEDapi.html#finite-element-operator-decomposition)).\n", 39 "\n", [all …]
|
| H A D | tutorial-5-operator.ipynb | 7 "# libCEED for Python examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 18 "## Setting up libCEED for Python\n", 19 "\n", 36 "## CeedOperator\n", 37 "\n", 54 "import libceed\n", 55 "import numpy as np\n", [all …]
|
| H A D | tutorial-3-basis.ipynb | 7 "# libCEED for Python examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 18 "## Setting up libCEED for Python\n", 19 "\n", 36 "## CeedBasis\n", 37 "\n", 54 "%matplotlib inline\n", 55 "import numpy as np\n", [all …]
|
| H A D | tutorial-1-vector.ipynb | 7 "# libCEED for Python examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 18 "## Setting up libCEED for Python\n", 19 "\n", 36 "## CeedVector\n", 37 "\n", 38 …edVectors constitute the main data structure and serve as input/output for `libceed.Operator`. \n", 39 "\n", [all …]
|
| H A D | tutorial-4-qfunction.ipynb | 7 "# libCEED for Python examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 18 "## Setting up libCEED for Python\n", 19 "\n", 36 "## CeedQFunction\n", 37 "\n", 38 … quadrature points. Hence, QFunctions are independent from element shape, resolution and order.\n", 39 "\n", [all …]
|
| H A D | tutorial-6-shell.ipynb | 7 "# Standalone libCEED examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 18 "## Common notation\n", 19 "\n", 20 "For most of our examples, the spatial discretization\n", 21 "uses high-order finite elements/spectral elements, namely, the high-order Lagrange\n", 22 "polynomials defined over $P$ non-uniformly spaced nodes, the\n", 23 "Gauss-Legendre-Lobatto (GLL) points, and quadrature points $\\{q_i\\}_{i=1}^Q$, with\n", [all …]
|
| H A D | tutorial-0-ceed.ipynb | 7 "# libCEED for Python examples\n", 8 "\n", 9 …oject.org/) (CEED) of the [Exascale Computing Project](https://www.exascaleproject.org/) (ECP).\n", 10 "\n", 41 "## Ceed\n", 42 "\n", 43 …In libCEED, Ceeds represent library context representing control of logical hardware resources.\n", 44 "\n", 54 "import libceed\n", 55 "\n",
|
| /libCEED/python/tests/ |
| H A D | test-1-vector.py | 36 n = 10 37 x = ceed.Vector(n) 39 a = np.arange(10, 10 + n, dtype=ceed.scalar_type()) 43 for i in range(n): 53 n = 10 54 x = ceed.Vector(n) 56 a = np.arange(10, 10 + n, dtype=ceed.scalar_type()) 67 x = ceed.Vector(n) 80 n = 10 81 x = ceed.Vector(n) [all …]
|
| /libCEED/backends/memcheck/ |
| H A D | ceed-memcheck-restriction.c | 61 for (CeedSize n = 0; n < elem_size; n++) { in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core() local 63 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core() 64 … uu[n * strides[0] + k * strides[1] + CeedIntMin(e + j, num_elem - 1) * (CeedSize)strides[2]]; in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core() 119 CeedSize n = 0; in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() local 122 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() 123 uu[impl->offsets[j + n * block_size + e * elem_size] + k * comp_stride] * in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() 124 impl->curl_orients[j + (3 * n + 1) * block_size + e * 3 * elem_size] + in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() 125 uu[impl->offsets[j + (n + 1) * block_size + e * elem_size] + k * comp_stride] * in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() 126 impl->curl_orients[j + (3 * n + 2) * block_size + e * 3 * elem_size]; in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() 128 for (n = 1; n < elem_size - 1; n++) { in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() [all …]
|
| /libCEED/include/ceed/jit-source/magma/ |
| H A D | magma-basis-interp-deriv-nontensor.h | 14 static __device__ __inline__ void magma_basis_nontensor_device_n(const int n, CeedScalar const *dA,… in magma_basis_nontensor_device_n() argument 19 const int nblocks = (n + NB - 1) / NB; in magma_basis_nontensor_device_n() 20 const int myn = min(NB, n - id * NB); in magma_basis_nontensor_device_n() 49 dC += Q * n; in magma_basis_nontensor_device_n() 57 static __device__ __inline__ void magma_basis_nontensor_device_t(const int n, CeedScalar const *dA,… in magma_basis_nontensor_device_t() argument 62 const int nblocks = (n + NB - 1) / NB; in magma_basis_nontensor_device_t() 63 const int myn = min(NB, n - id * NB); in magma_basis_nontensor_device_t() 90 dB += Q * n; in magma_basis_nontensor_device_t() 103 static __device__ __inline__ void magma_basis_nontensor_device_ta(const int n, const CeedScalar *dA… in magma_basis_nontensor_device_ta() argument 108 const int nblocks = (n + NB - 1) / NB; in magma_basis_nontensor_device_ta() [all …]
|
| H A D | magma-common-nontensor.h | 70 static __device__ __inline__ void read_B_g2s_1D_nosync(const int tx, const int n, const T *dB, T *s… in read_B_g2s_1D_nosync() argument 73 if (n != NB) { in read_B_g2s_1D_nosync() 74 for (i = 0; i < Q * n - P; i += P) { in read_B_g2s_1D_nosync() 83 if (i + tx < Q * n) { in read_B_g2s_1D_nosync() 94 static __device__ __inline__ void write_C_r2g_1D_nosync(const int tx, const int n, T rC[NB], T *dC)… in write_C_r2g_1D_nosync() argument 95 if (n != NB) { in write_C_r2g_1D_nosync() 96 for (int i = 0; i < n; i++) { in write_C_r2g_1D_nosync() 113 static __device__ __inline__ void sum_C_r2g_1D_nosync(const int tx, const int n, T rC[NB], T *dC) { in sum_C_r2g_1D_nosync() argument 114 if (n != NB) { in sum_C_r2g_1D_nosync() 115 for (int i = 0; i < n; i++) { in sum_C_r2g_1D_nosync()
|
| /libCEED/backends/ref/ |
| H A D | ceed-ref-restriction.c | 32 for (CeedSize n = 0; n < elem_size; n++) { in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() local 34 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() 35 … uu[n + k * elem_size + CeedIntMin(e + j, num_elem - 1) * elem_size * (CeedSize)num_comp]; in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() 47 for (CeedSize n = 0; n < elem_size; n++) { in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() local 49 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() 50 … uu[n * strides[0] + k * strides[1] + CeedIntMin(e + j, num_elem - 1) * (CeedSize)strides[2]]; in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() 106 CeedSize n = 0; in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core() local 109 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core() 110 uu[impl->offsets[j + n * block_size + e * elem_size] + k * comp_stride] * in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core() 111 impl->curl_orients[j + (3 * n + 1) * block_size + e * 3 * elem_size] + in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core() [all …]
|
| /libCEED/backends/magma/ |
| H A D | ceed-magma-gemm-nontensor.cpp | 24 …mm(magma_trans_t trans_A, magma_trans_t trans_B, magma_int_t m, magma_int_t n, magma_int_t k, Ceed… in magmablas_gemm() argument 28 …magmablas_sgemm(trans_A, trans_B, m, n, k, (float)alpha, (const float *)d_A, ldda, (const float *)… in magmablas_gemm() 31 …magmablas_dgemm(trans_A, trans_B, m, n, k, (double)alpha, (const double *)d_A, ldda, (const double… in magmablas_gemm() 38 …_strided(magma_trans_t trans_A, magma_trans_t trans_B, magma_int_t m, magma_int_t n, magma_int_t k, in magmablas_gemm_batched_strided() argument 43 …magmablas_sgemm_batched_strided(trans_A, trans_B, m, n, k, (float)alpha, (const float *)d_A, ldda,… in magmablas_gemm_batched_strided() 46 …magmablas_dgemm_batched_strided(trans_A, trans_B, m, n, k, (double)alpha, (const double *)d_A, ldd… in magmablas_gemm_batched_strided() 53 …mm(magma_trans_t trans_A, magma_trans_t trans_B, magma_int_t m, magma_int_t n, magma_int_t k, Ceed… in devblas_gemm() argument 57 …magma_sgemm(trans_A, trans_B, m, n, k, (float)alpha, (const float *)d_A, ldda, (const float *)d_B,… in devblas_gemm() 59 …magma_dgemm(trans_A, trans_B, m, n, k, (double)alpha, (const double *)d_A, ldda, (const double *)d… in devblas_gemm() 66 …_strided(magma_trans_t trans_A, magma_trans_t trans_B, magma_int_t m, magma_int_t n, magma_int_t k, in devblas_gemm_batched_strided() argument [all …]
|
| /libCEED/interface/ |
| H A D | ceed-basis.c | 48 static int CeedChebyshevPolynomialsAtPoint(CeedScalar x, CeedInt n, CeedScalar *chebyshev_x) { in CeedChebyshevPolynomialsAtPoint() argument 51 for (CeedInt i = 2; i < n; i++) chebyshev_x[i] = 2 * x * chebyshev_x[i - 1] - chebyshev_x[i - 2]; in CeedChebyshevPolynomialsAtPoint() 66 static int CeedChebyshevDerivativeAtPoint(CeedScalar x, CeedInt n, CeedScalar *chebyshev_dx) { in CeedChebyshevDerivativeAtPoint() argument 73 for (CeedInt i = 2; i < n; i++) { in CeedChebyshevDerivativeAtPoint() 99 …eflect(CeedScalar *A, const CeedScalar *v, CeedScalar b, CeedInt m, CeedInt n, CeedInt row, CeedIn… in CeedHouseholderReflect() argument 100 for (CeedInt j = 0; j < n; j++) { in CeedHouseholderReflect() 129 …CeedScalar c, CeedScalar s, CeedTransposeMode t_mode, CeedInt i, CeedInt k, CeedInt m, CeedInt n) { in CeedGivensRotation() argument 130 CeedInt stride_j = 1, stride_ik = m, num_its = n; in CeedGivensRotation() 133 stride_j = n; in CeedGivensRotation() 163 static int CeedScalarView(const char *name, const char *fp_fmt, CeedInt m, CeedInt n, const CeedSca… in CeedScalarView() argument [all …]
|
| /libCEED/examples/fluids/qfunctions/ |
| H A D | stg_shur14.h | 136 for (CeedInt n = 0; n < nmodes; n++) { in CalcSpectrum() local 137 const CeedScalar dkappa = n == 0 ? kappa[0] : kappa[n] - kappa[n - 1]; in CalcSpectrum() 138 qn[n] = Calc_qn(kappa[n], dkappa, keta, kcut, ke, 1.0); in CalcSpectrum() 139 Ektot += qn[n]; in CalcSpectrum() 143 for (CeedInt n = 0; n < nmodes; n++) qn[n] /= Ektot; in CalcSpectrum() local 167 CeedPragmaSIMD for (CeedInt n = 0; n < nmodes; n++) { in StgShur14Calc() local 168 xhat[0] = (X[0] - stg_ctx->u0 * t) * Max(2 * kappa[0] / kappa[n], 0.1); in StgShur14Calc() 170 for (CeedInt i = 0; i < 3; i++) xdotd += d[i * nmodes + n] * xhat[i]; in StgShur14Calc() 171 const CeedScalar cos_kxdp = cos(kappa[n] * xdotd + phi[n]); in StgShur14Calc() 172 vp[0] += sqrt(qn[n]) * sigma[0 * nmodes + n] * cos_kxdp; in StgShur14Calc() [all …]
|
| /libCEED/julia/LibCEED.jl/test/ |
| H A D | rundevtests.jl | 23 n = getnumnodes(b) 24 offsets = Vector{CeedInt}(0:n-1) 25 r = create_elem_restriction(c, 1, n, 1, 1, n, offsets) 35 v = rand(CeedScalar, n) 37 v2 = CeedVector(c, n)
|
| H A D | runtests.jl | 64 n = 10 66 v = CeedVector(c, n) 67 @test size(v) == (n,) 68 @test length(v) == n 69 @test axes(v) == (1:n,) 76 v1 = rand(CeedScalar, n) 92 @test summarystr(v) == "$n-element CeedVector" 114 w1 = rand(CeedScalar, n) 115 w2 = rand(CeedScalar, n) 116 w3 = rand(CeedScalar, n) [all …]
|
| /libCEED/julia/LibCEED.jl/.style/ |
| H A D | ceed_style.jl | 36 n = pretty(style, cst[1], s, nonest=nonest, nospace=nospace_args) 38 n = pretty(style, cst[1], s) 45 paren = FST(PUNCTUATION, -1, n.startline, n.startline, "(") 47 add_node!(t, n, s, join_lines=true) 48 paren = FST(PUNCTUATION, -1, n.startline, n.startline, ")") 51 add_node!(t, n, s) 88 n = pretty(style, cst[3], s, nonest=nonest, nospace=nospace_args) 90 n = pretty(style, cst[3], s) 97 paren = FST(PUNCTUATION, -1, n.startline, n.startline, "(") 99 add_node!(t, n, s, join_lines=true, override_join_lines_based_on_source=!nest) [all …]
|
| /libCEED/tests/ |
| H A D | t355-basis.c | 10 static CeedScalar Eval(CeedScalar x, CeedInt n, const CeedScalar *c) { in Eval() argument 11 CeedScalar y = c[n - 1]; in Eval() 12 for (CeedInt i = n - 2; i >= 0; i--) y = y * x + c[i]; in Eval() 16 static CeedScalar EvalGrad(CeedScalar x, CeedInt n, const CeedScalar *c) { in EvalGrad() argument 17 CeedScalar y = (n - 1) * c[n - 1]; in EvalGrad() 18 for (CeedInt i = n - 2; i >= 1; i--) y = y * x + i * c[i]; in EvalGrad()
|
| H A D | t598-operator.c | 72 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main() local 73 CeedInt g_node = 0, g_node_stride = 1, r_node = n; in main() 80 elem_nodes[n] = p * g_node; in main() 118 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main() local 119 CeedInt g_node = 0, g_node_stride = 1, r_node = n; in main() 126 elem_nodes[n] = g_node; in main() 150 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main() local 151 CeedInt g_node = 0, g_node_stride = 1, r_node = n; in main() 158 elem_nodes[n] = g_node; in main()
|
| H A D | t105-vector-f.f90 | 7 integer x,y,i,n variable 19 n=10 21 call ceedvectorcreate(ceed,n,x,err) 22 call ceedvectorcreate(ceed,n,y,err)
|
| H A D | t103-vector-f.f90 | 7 integer x,y,i,n variable 19 n=10 20 call ceedvectorcreate(ceed,n,x,err) 21 call ceedvectorcreate(ceed,n,y,err)
|
| H A D | t106-vector-f.f90 | 7 integer x,y,i,n variable 19 n=10 21 call ceedvectorcreate(ceed,n,x,err) 22 call ceedvectorcreate(ceed,n,y,err)
|
| /libCEED/examples/solids/qfunctions/ |
| H A D | finite-strain-neo-hookean.h | 106 for (CeedInt n = 0; n < 3; n++) E2work[m] += grad_u[n][indj[m]] * grad_u[n][indk[m]]; in commonFS() local 138 for (CeedInt n = 0; n < 3; n++) Swork[m] += mu * C_inv[indj[m]][n] * E2[n][indk[m]]; in commonFS() local 323 …for (CeedInt n = 0; n < 3; n++) deltaEwork[m] += (graddeltau[n][indj[m]] * F[n][indk[m]] + F[n][in… in ElasFSJacobian_NH() local 447 for (CeedInt n = 0; n < 3; n++) E2work[m] += grad_u[n][indj[m]] * grad_u[n][indk[m]]; in ElasFSEnergy_NH() local 517 for (CeedInt n = 0; n < 3; n++) E2work[m] += grad_u[n][indj[m]] * grad_u[n][indk[m]]; in ElasFSDiagnostic_NH() local
|
| /libCEED/examples/deal.II/ |
| H A D | CMakeLists.txt | 7 MESSAGE(FATAL_ERROR "\n" 8 "*** Could not locate deal.II. ***\n\n" 9 "You may want to either pass a flag -DDEAL_II_DIR=/path/to/deal.II to cmake\n"
|