Home
last modified time | relevance | path

Searched refs:D (Results 1 – 11 of 11) sorted by relevance

/honee/examples/postprocess/
H A Dvortexshedding.py8 def coeff(force, rho=1, u=1, D=1, zspan=0.2): argument
9 S = np.pi * D * zspan # surface area
/honee/doc/
H A Dauxiliary.md22 The function $\langle \phi \rangle (x,y)$ is represented on a 2-D finite element grid, taken from t…
141 These quantities have agreed-upon definitions for 1D, but in multiple dimensions their definitions …
175 \overline{\phi} - \nabla \cdot (\beta (\bm{D}\bm{\Delta})^2 \nabla \overline{\phi} ) = \phi
178 …tric positive-definite rank 2 tensor defining the width of the filter, $\bm{D}$ is the filter widt…
182 \int_\Omega \left( v \overline \phi + \beta \nabla v \cdot (\bm{D}\bm{\Delta})^2 \nabla \overline \…
183 - \cancel{\int_{\partial \Omega} \beta v \nabla \overline \phi \cdot (\bm{D}\bm{\Delta})^2 \bm{\hat…
187 The boundary integral resulting from integration-by-parts is crossed out, as we assume that $(\bm{D…
211 ### Filter Width Scaling Tensor, $\bm{D}$
214 The definition for $\bm{D}$ then becomes
217 \bm{D} =
[all …]
H A Dexamples.md63 A cylinder with diameter $D=1$ is centered at $(0,0)$ in a computational domain $-4.5 \leq x \leq 1…
64 We solve this as a 3D problem with (default) one element in the $z$ direction.
76 Given the force components $\bm F = (F_x, F_y, F_z)$ and surface area $S = \pi D L_z$ where $L_z$ i…
614 The advection problems can be run in both 2D and 3D, based on the DM defined for the problem.
718 For 3D advection, an example of the `rotation` mode can be run with:
730 For 2D advection, an example of the `rotation` mode can be run with:
H A Dreferences.bib7 title = {{Efficient Nonlinear Solvers for Nodal High-Order Finite Elements in 3D}},
183 editor = {Robert D. Moser},
H A Druntime_options.md285 :::{list-table} 2D Face ID Labels
308 :::{list-table} 3D Face ID Labels
H A Dtheory.md289 For Advection-Diffusion, we first examine a 1D definition given by:
306 …ty for a unit square, keeping this definition aligned with the traditional 1D definition, which us…
/honee/qfunctions/
H A Dutils.h105 CEED_QFUNCTION_HELPER void MatDiagNM(const CeedScalar *A, const CeedScalar *D, const CeedInt N, con… in MatDiagNM() argument
109 …i < N; i++) { CeedPragmaSIMD for (CeedInt j = 0; j < M; j++) B[i * M + j] += D[i] * A[i * M + j]; } in MatDiagNM()
112 …i < M; i++) { CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) B[i * N + j] += D[i] * A[j * M + i]; } in MatDiagNM()
119 CEED_QFUNCTION_HELPER void MatDiag3(const CeedScalar A[3][3], const CeedScalar D[3], const CeedTran… in MatDiag3()
120 MatDiagNM((const CeedScalar *)A, (const CeedScalar *)D, 3, 3, transpose_A, (CeedScalar *)B); in MatDiag3()
/honee/include/
H A Dmat-ceed-impl.h39 PETSC_CEED_EXTERN PetscErrorCode MatGetDiagonal_Ceed(Mat A, Vec D);
/honee/src/
H A Dmat-ceed.c1590 PetscErrorCode MatGetDiagonal_Ceed(Mat A, Vec D) { in MatGetDiagonal_Ceed() argument
1599 PetscCall(PetscLogEventBegin(MATCEED_ASSEMBLE_DIAGONAL, A, D, NULL, NULL)); in MatGetDiagonal_Ceed()
1604 PetscCall(PetscLogEventBegin(MATCEED_ASSEMBLE_DIAGONAL_CEEDOP, A, D, NULL, NULL)); in MatGetDiagonal_Ceed()
1606 PetscCall(PetscLogEventEnd(MATCEED_ASSEMBLE_DIAGONAL_CEEDOP, A, D, NULL, NULL)); in MatGetDiagonal_Ceed()
1612 PetscCall(VecZeroEntries(D)); in MatGetDiagonal_Ceed()
1613 PetscCall(DMLocalToGlobal(ctx->dm_x, D_loc, ADD_VALUES, D)); in MatGetDiagonal_Ceed()
1615 PetscCall(PetscLogEventEnd(MATCEED_ASSEMBLE_DIAGONAL, A, D, NULL, NULL)); in MatGetDiagonal_Ceed()
/honee/
H A DMakefile185 @mkdir -p $(@D)
198 $(OBJDIR)/%.o : %.c | $$(@D)/.DIR
201 $(OBJDIR)/%.o : %.cpp | $$(@D)/.DIR
H A DDoxyfile329 # Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
2352 # defined before the preprocessor is started (similar to the -D option of e.g.