期刊
JOURNAL OF COMPUTATIONAL PHYSICS
卷 475, 期 -, 页码 -出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2022.111840
关键词
Volume-of-Fluid (VoF); Volume fraction initialization; Unstructured grid; Parabolic surface approximation
This paper presents a new method for efficiently and accurately computing volume fractions on unstructured polyhedral meshes. The method utilizes a principal coordinate system to approximate the phase boundary as the graph of an osculating paraboloid within each mesh cell. By applying the GAUSSIAN divergence theorem recursively, volume integrals are analytically transformed into curve integrals associated with polyhedron faces, which can be numerically approximated using standard GAUSS-LEGENDRE quadrature. This face-based formulation enables the application of the method to unstructured meshes and simplifies the numerical procedure significantly for three-dimensional applications.
This paper introduces a novel method for the efficient and accurate computation of volume fractions on unstructured polyhedral meshes, where the phase boundary is an orientable hypersurface, implicitly given as the iso-contour of a sufficiently smooth level-set function. Locally, i.e. in each mesh cell, we compute a principal coordinate system in which the hypersurface can be approximated as the graph of an osculating paraboloid. A recursive application of the GAUSSIAN divergence theorem then allows to analytically transform the volume integrals into curve integrals associated to the polyhedron faces, which can be easily approximated numerically by means of standard GAUSS-LEGENDRE quadrature. This face-based formulation enables the applicability to unstructured meshes and considerably simplifies the numerical procedure for applications in three spatial dimensions. We discuss the theoretical foundations and provide details of the numerical algorithm. Finally, we present numerical results for convex and non-convex hypersurfaces embedded in cuboidal and tetrahedral meshes, showing both high accuracy and third-to fourth-order convergence with spatial resolution. The proposed algorithm outperforms existing methods in terms of both accuracy and execution time.(c) 2022 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据