Abstract
This paper introduces a novel and efficient compact reconstruction procedure for high-order finite volume methods applied to unstructured grids. In this procedure, we establish a set of constitutive relations that ensure the continuity of the reconstruction polynomial and its normal derivatives between adjacent elements at control points. The paper delves into the details of the fourth-order compact reconstruction method specifically designed for two-dimensional triangular grids. This method can be considered an extension of the one-dimensional compact scheme and cubic spline interpolation methods to two-dimensional triangular unstructured grids. In the cubic polynomial reconstruction, a two-dimensional cubic polynomial is reconstructed using the cell averages of elements in the standard stencil and the function values at control points. The determination of function values at control points is achieved by adhering to the constraint of normal derivative continuity. This reconstruction is solved using a relaxation iteration method and has been verified to be solvable for triangular grids. Compared to other fourth-order implicit compact polynomial reconstructions, our method requires solving a smaller number of unknowns, which means less computational cost in reconstruction. By applying this method to solve the Poisson equation, the linear convection equation, and incompressible flow benchmarks, it demonstrates that the proposed method exhibits the expected high-order accuracy and performs well in incompressible flow problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.