Home
last modified time | relevance | path

Searched refs:p4est (Results 1 – 6 of 6) sorted by relevance

/petsc/src/snes/tutorials/
H A Dex11.c166 PetscBool p4est; /* if we want to use non-conforming AMR */ member
179 options->p4est = PETSC_FALSE; in ProcessOptions()
188 …ool("-p4est", "Use p4est to represent the mesh", __FILE__, options->p4est, &options->p4est, NULL)); in ProcessOptions()
197 PetscCall(PetscPrintf(comm, " non-conforming AMR: %d\n", options->p4est)); in ProcessOptions()
218 if (user->p4est) { in CreateMesh()
/petsc/doc/overview/
H A Ddiscrete_table.md29 - ``p4est``
/petsc/src/snes/tutorials/output/
H A Dex12_quad_q1_adapt_0.out1 type: p4est
/petsc/src/dm/impls/forest/p4est/
H A Dpforest.h54 static int DMRefinePattern_Corner(p4est_t *p4est, p4est_topidx_t which_tree, p4est_quadrant_t *quad… in DMRefinePattern_Corner() argument
59 ctx = (DMRefinePatternCtx *)p4est->user_pointer; in DMRefinePattern_Corner()
72 static int DMRefinePattern_Center(p4est_t *p4est, p4est_topidx_t which_tree, p4est_quadrant_t *quad… in DMRefinePattern_Center() argument
78 ctx = (DMRefinePatternCtx *)p4est->user_pointer; in DMRefinePattern_Center()
89 static int DMRefinePattern_Fractal(p4est_t *p4est, p4est_topidx_t which_tree, p4est_quadrant_t *qua… in DMRefinePattern_Fractal() argument
94 ctx = (DMRefinePatternCtx *)p4est->user_pointer; in DMRefinePattern_Fractal()
144 static int DMRefinePattern_Hash(p4est_t *p4est, p4est_topidx_t which_tree, p4est_quadrant_t *quadra… in DMRefinePattern_Hash() argument
150 ctx = (DMRefinePatternCtx *)p4est->user_pointer; in DMRefinePattern_Hash()
429 static int pforest_coarsen_currlevel(p4est_t *p4est, p4est_topidx_t which_tree, p4est_quadrant_t *q… in pforest_coarsen_currlevel() argument
431 PforestAdaptCtx *ctx = (PforestAdaptCtx *)p4est->user_pointer; in pforest_coarsen_currlevel()
[all …]
/petsc/doc/community/meetings/2023/
H A Dindex.md708 code, currently using a combination of DMDA, and DMPlex with DMForest/p4est
/petsc/doc/
H A Dpetsc.bib16926 title = {The p4est library: A parallel scalable forest of adaptive octrees},