Abstract

In this paper, we propose a flux correction technique generally applicable to practical finite-volume discretizations of a single flux evaluation per face for achieving second-order accuracy on arbitrary polyhedral grids involving non-planar faces. The proposed technique is derived from the k-exact finite-volume discretization approach originally introduced by Brenner. We take it as a general methodology for constructing a second-order discretization on arbitrary polyhedral grids, and identify a term considered as missing in other practical finite-volume discretizations; it is thus considered as a reason for the loss of second-order accuracy in many of such methods: e.g., a cell-centered discretization loses second-order accuracy on grids with non-planar faces as typical in polyhedral grids. In particular, we write the term as a vector involving flux gradients and show that it can be easily implemented as a correction to a numerical flux at each face. Also, we will show that a consistent definition of a control volume is critically important for achieving second-order accuracy on general polyhedral grids. We then discuss its general applicability and impact on accuracy and efficiency with simple but illustrative examples: the edge-based solver is made to achieve faster iterative convergence on irregular tetrahedral grids with adjustable centroids while preserving second-order accuracy; both the edge-based and cell-centered discretizations are made second-order accurate on irregular prismatic grids having non-planar faces.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.