Conservative interpolation on unstructured polyhedral meshes: An extension of the supermesh approach to cell-centered finite-volume variables

Menon, Sandeep; Schmidt, David P.

doi:10.1016/j.cma.2011.04.025

Cited by 38 publications

(20 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(ii) For the spring-analogy technique, we plan to consider using the torsional spring concept for further improvement in mesh deformation (Degand & Farhat, 2002). (iiii) Conservative interpolation schemes (Menon & Schmidt, 2011) need to be considered to replace the present non-conservative scheme. (iv) Improving the flow solver by considering the global discrete geometric conservation law (Eken & Sahin, 2015) deserves further investigation.…”

Section: Resultsmentioning

confidence: 99%

An improved local remeshing algorithm for moving boundary problems

Zheng

Chen

Zheng

et al. 2016

Engineering Applications of Computational Fluid Mechanics

View full text Add to dashboard Cite

Three issues are tackled in this study to improve the robustness of local remeshing techniques. Firstly, the local remeshing region (hereafter referred to as 'hole') is initialized by removing low-quality elements and then continuously expanded until a certain element quality is reached after remeshing. The effect of the number of the expansion cycle on the hole size and element quality after remeshing is experimentally analyzed. Secondly, the grid sources for element size control are attached to moving bodies and will move along with their host bodies to ensure reasonable grid resolution inside the hole. Thirdly, the boundary recovery procedure of a Delaunay grid generation approach is enhanced by a new grid topology transformation technique (namely shell transformation) so that the new grid created inside the hole is therefore free of elements of extremely deformed/skewed shape, whilst also respecting the hole boundary. The proposed local remeshing algorithm has been integrated with an in-house unstructured grid-based simulation system for solving moving boundary problems. The robustness and accuracy of the developed local remeshing technique are successfully demonstrated via industry-scale applications for complex flow simulations. ARTICLE HISTORY

show abstract

Section: Resultsmentioning

confidence: 99%

An improved local remeshing algorithm for moving boundary problems

Zheng

Chen

Zheng

et al. 2016

Engineering Applications of Computational Fluid Mechanics

View full text Add to dashboard Cite

show abstract

“…In particular, topological changes to the surface mesh due to local remeshing require a conservative field mapping procedure [98] which we adapted for surface meshes based on a super-mesh approach [99]; (ii) the coupled nature of multiple surfactant transport requires both an efficient (here iterative) inversion algorithm [70] for the interfacial multicomponent diffusion matrix arising from Maxwell-Stefan diffusion modeling, and a block-coupled solution method [100,101] to simultaneously solve for multiple surfactant transport equations. Both have been adapted and implemented to cope with coupled surface transport equations within the collocated face-centered finite area framework; (iii) since the resulting transport equations contain diffusion coefficients which are spatially strongly varying, the diffusion problem is spatially heterogeneous.…”

Section: Introductionmentioning

confidence: 99%

Numerical method for coupled interfacial surfactant transport on dynamic surface meshes of general topology

2015

View full text Add to dashboard Cite

“…1. Accurately and efficiently computing intersections between 3D meshes is difficult, and has been studied mainly for tetrahedral meshes, with different names: rendezvous mesh [20,23], common-refinement mesh [12], supermesh [8,15] or mesh intersection [4]. To keep memory requirements reasonable and to allow parallelizing the method, these intersection meshes are not built explicitly but locally.…”

Section: Distance Via Quadraturesmentioning

confidence: 99%

Computing the Distance between Two Finite Element Solutions Defined on Different 3D Meshes on a GPU

Reberol¹,

Lévy²

2018

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

This article introduces a new method to efficiently compute the distance (i.e., L p norm of the difference) between two functions supported by two different meshes of the same 3D domain. The functions that we consider are typically finite element solutions discretized in different function spaces supported by meshes that are potentially completely unrelated. Our method computes an approximation of the distance by resampling both fields over a set of parallel 2D regular grids. By leveraging the parallel horse power of computer graphics hardware (GPU), our method can efficiently compute distances between meshes with multi-million elements in seconds. We demonstrate our method applied to different problems (distance between known functions, Poisson solutions, linear elasticity solutions) using different function spaces (Lagrange polynomials from order one to seven) and different meshes (tetrahedral, hexahedral, with linear or quadratic geometry).

show abstract

Conservative interpolation on unstructured polyhedral meshes: An extension of the supermesh approach to cell-centered finite-volume variables

Cited by 38 publications

References 19 publications

An improved local remeshing algorithm for moving boundary problems

An improved local remeshing algorithm for moving boundary problems

Numerical method for coupled interfacial surfactant transport on dynamic surface meshes of general topology

Computing the Distance between Two Finite Element Solutions Defined on Different 3D Meshes on a GPU

Contact Info

Product

Resources

About