Localized Coarsening of Conforming All-Hexahedral Meshes

Woodbury, Adam C.; Shepherd, Jason F.; Staten, Matthew L.; Benzley, Steven E.

doi:10.1007/978-3-540-87921-3_36

Cited by 14 publications

(12 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each group of edges is composed by 2 D−1 edges that do not share any vertex (also called topologically parallel edges in the literature [36,66]), see Figures 7 and 8.…”

Section: Updated Refinement Ratio: Sub-module Update_ratio Methodsmentioning

confidence: 99%

A unified framework for the computational comparison of adaptive mesh refinement strategies for all-quadrilateral and all-hexahedral meshes: Locally adaptive multigrid methods versus h-adaptive methods

Koliesnikova

Ramière

Lebon

2021

Journal of Computational Physics

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

“…Each group of edges is composed by 2 D−1 edges that do not share any vertex (also called topologically parallel edges in the literature [36,66]), see Figures 7 and 8.…”

Section: Updated Refinement Ratio: Sub-module Update_ratio Methodsmentioning

confidence: 99%

A unified framework for the computational comparison of adaptive mesh refinement strategies for all-quadrilateral and all-hexahedral meshes: Locally adaptive multigrid methods versus h-adaptive methods

Koliesnikova

Ramière

Lebon

2021

Journal of Computational Physics

View full text Add to dashboard Cite

show abstract

“…By the way, even if very efficient remeshing algorithms have been developed [46,47], such a procedure remains complex. Moreover, when dealing with commercial software, local mesh adaptation for quadrangular elements is an even more complex task [48,49], which is not as efficient as triangular mesh adaptation. A way to avoid main remeshing difficulties is to rely on non-conforming finite elements, allowing for hanging nodes.…”

Section: Application To Adaptive Mesh Refinementmentioning

confidence: 99%

Residual error based adaptive mesh refinement with the non-intrusive patch algorithm

Duval

Lozinski

Passieux

et al. 2018

Computer Methods in Applied Mechanics and Engineering

View full text Add to dashboard Cite

This paper deals with the introduction of mesh refinement techniques within the non-intrusive patch process. For this, an ad hoc residual based explicit error estimator is built, which is adapted to a multi-scale solution, associated with those non-intrusive mesh refinement technique. Moreover, to reduce the global cost of the process, one introduces an estimate of the convergence error of the non-intrusive algorithm, which allows to reduce the number of iterations. This method is discussed and illustrated in various numerical examples.

show abstract

“…Only refinement was considered here, but coarsening could be included. There has been recent research on coarsening of hexahedral mesh [17]. Including coarsening would provide a method to fully adaptive hexahedral meshes.…”

Section: Future Workmentioning

confidence: 99%

Hexahedral Mesh Refinement Using an Error Sizing Function

Paudel

Owen

Benzley

2011

Proceedings of the 20th International Meshing Roundtable

Self Cite

View full text Add to dashboard Cite

The ability to effectively adapt a mesh is a very important feature of high fidelity finite element modeling. In a finite element analysis, a relatively high node density is desired in areas of the model where there are high error estimates from an initial analysis. Providing a higher node density in such areas improves the accuracy of the model and reduces the computational time compared to having a high node density over the entire model. Node densities can be determined for any model using the sizing functions based on the geometry of the model or the error estimates from the finite element analysis. Robust methods for mesh adaptation using sizing functions are available for refining triangular, tetrahedral, and quadrilateral elements. However, little work has been published for adaptively refining all hexahedral meshes using sizing functions. This thesis describes a new approach to drive hexahedral refinement based upon an error sizing function and a mechanism to compare the sizes of the node after refinement.

show abstract

Localized Coarsening of Conforming All-Hexahedral Meshes

Cited by 14 publications

References 18 publications

A unified framework for the computational comparison of adaptive mesh refinement strategies for all-quadrilateral and all-hexahedral meshes: Locally adaptive multigrid methods versus h-adaptive methods

A unified framework for the computational comparison of adaptive mesh refinement strategies for all-quadrilateral and all-hexahedral meshes: Locally adaptive multigrid methods versus h-adaptive methods

Residual error based adaptive mesh refinement with the non-intrusive patch algorithm

Hexahedral Mesh Refinement Using an Error Sizing Function

Contact Info

Product

Resources

About