Abstract

The unsteady incompressible Navier–Stokes equations in primitive variables are often numerically solved by segregating the computation of velocity and pressure, according to either functional analysis arguments following the pioneering work of A.J. Chorin and R. Temam (STD, Split-Then-Discretize paradigm) or linear algebra arguments based on the inexact block factorization of the discretized problem (DTS, Discretize-Then-Split paradigm). The presence of the time derivative allows for the calibration of an appropriate approximation of the pseudo-differential operator of the pressure problem and excellent results in terms of both accuracy and efficiency have been obtained as witnessed by the abundant literature. The extension of the same segregated approach to the steady Navier–Stokes equations is unclear, unless a pseudo-time advancing formulation is undertaken. In this paper we present a methodology for a segregated computation of the primitive variables in a genuinely steady formulation, so to avoid iterations to get to the steady limit. The approach is largely inspired by the algebraic factorization of the unsteady problem (DTS approach), yet we detail specific settings required by the absence of the velocity time-derivative. The basic idea relies on the introduction of some parameters in a modified Picard linearization. We discuss stability bounds and the convergence of the segregated method to the unsplit solution. Several numerical results on different test cases confirm the efficiency of the procedure.

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.