Abstract
PurposeThe purpose of the paper is to propose some modifications to the SIMPLE (semi-implicit method for pressure-linked equations) algorithm. These modifications can ensure the numerical robustness and optimize computational efficiency. They remarkably promote the ability of the SIMPLE algorithm for incompressible DNS (direct numerical simulation) of multiscale problems, such as transitional flows and turbulent flows, by improving the properties of dispersion and dissipation.Design/methodology/approachThe MDCD (minimized dispersion and controllable dissipation) scheme and MMIM (modified momentum interpolation method) are introduced. Six typical test cases are used to validate the modified algorithm, including the linear convective flow, lid-driven cavity flow, laminar boundary layer, Taylor vortex and DHIT (decaying homogenous isotropic turbulence). Particularly, a highly unsteady DNS of separated-flow transition in turbomachinery is precisely predicted by the modified algorithm.FindingsThe numerical examples show the distinct superiority of the modified algorithm in both internal flows and external flows. The advantages of the MDCD scheme and MMIM make the SIMPLE algorithm a promising method for DNS.Originality/valueSome effective modifications to the SIMPLE algorithm are addressed. It is the first attempt to introduce the MDCD approach into the SIMPLE-type algorithms. The new algorithm is especially suitable for the incompressible DNS of convection-dominated flows.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Numerical Methods for Heat & Fluid Flow
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.