VoroCrust: Voronoi Meshing Without Clipping

Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.Comment: 18 pages (including appendix), 18 figures. Version without compressed images available on https://www.dropbox.com/s/qc6sot1gaujundy/VoroCrust.pdf. Supplemental materials available on https://www.dropbox.com/s/6p72h1e2ivw6kj3/VoroCrust_supplemental_materials.pd

A minimum-dissipation time-integration strategy for large-eddy simulation of incompressible turbulent flows

Adaptive time stepping can significantly enhance the accuracy and the efficiency of computational methods. In this work, a time-integration strategy with adaptive time step control is proposed for large-eddy simulation of turbulent flows. The algorithm is based on Runge-Kutta methods and consists in adjusting the time-step size dynamically to ensure that the numerical dissipation rate due to the temporal scheme is smaller than the molecular and subgrid-scale ones within a desired tolerance. The effectiveness of the method, as compared to standard CFL-like criteria, is assessed by large-eddy simulations of the three-dimensional Taylor-Green Vortex

Energy preserving turbulent simulations at a reduced computational cost

Energy-conserving discretizations are widely regarded as a fundamental requirement for high-fidelity simulations of turbulent flows. The skew-symmetric splitting of the nonlinear term is a well-known approach to obtain semi-discrete conservation of energy in the inviscid limit. However, its computation is roughly twice as expensive as that of the divergence or advective forms alone. A novel time-advancement strategy that retains the conservation properties of skew-symmetric-based schemes at a reduced computational cost has been developed. This method is based on properly constructed Runge–Kutta schemes in which a different form (advective or divergence) for the convective term is adopted at each stage. A general framework is presented to derive schemes with prescribed accuracy on both solution and energy conservation. Simulations of homogeneous isotropic turbulence show that the new procedure is effective and can be considerably faster than skew-symmetric-based techniques.Postprint (published version

A positive scheme for diffusion problems on deformed meshes

International audienceWe present in this article a positive finite volume method for diffusion equation on deformed meshes. This method is mainly inspired from [50, 52], and uses auxiliary unknowns at the nodes of the mesh. The flux is computed so as to be a two-point nonlinear flux, giving rise to a matrix which is the transpose of an M-matrix, which ensures that the scheme is positive. A particular attention is given to the computation of the auxiliary unknowns. We propose a new strategy, which aims at providing a scheme easy to implement in a parallel domain decomposition setting. An analysis of the scheme is provided: existence of a solution for the nonlinear system is proved, and the convergence of a fixed-point strategy is studied

An efficient time advancing strategy for energy-preserving simulations

Energy-conserving numerical methods are widely employed within the broad area of convection-dominated systems. Semi-discrete conservation of energy is usually obtained by adopting the so-called skew-symmetric splitting of the non-linear convective term, defined as a suitable average of the divergence and advective forms. Although generally allowing global conservation of kinetic energy, it has the drawback of being roughly twice as expensive as standard divergence or advective forms alone. In this paper, a general theoretical framework has been developed to derive an efficient time-advancement strategy in the context of explicit Runge–Kutta schemes. The novel technique retains the conservation properties of skew-symmetric-based discretizations at a reduced computational cost. It is found that optimal energy conservation can be achieved by properly constructed Runge–Kutta methods in which only divergence and advective forms for the convective term are used. As a consequence, a considerable improvement in computational efficiency over existing practices is achieved. The overall procedure has proved to be able to produce new schemes with a specified order of accuracy on both solution and energy. The effectiveness of the method as well as the asymptotic behavior of the schemes is demonstrated by numerical simulation of Burgers' equation.Postprint (published version