Colocated schemes for the incompressible Navier–Stokes equations on non‐smooth grids for two‐dimensional problems

The accuracy of colocated finite volume schemes for the incompressible Navier–Stokes equations on non‐smooth curvilinear grids is investigated. A frequently used scheme is found to be quite inaccurate on non‐smooth grids. In an attempt to improve the accuracy on such grids, three other schemes are described and tested. Two of these are found to give satisfactory results. Copyright © 2000 John Wiley & Sons, Ltd.     

Stretched Cartesian grids for solution of the incompressible Navier–Stokes equations

Two Cartesian grid stretching functions are investigated for solving the unsteady incompressible Navier–Stokes equations using the pressure–velocity formulation. The first function is developed for the Fourier method and is a generalization of earlier work. This function concentrates more points at the centre of the computational box while allowing the box to remain finite. The second stretching function is for the second‐order central finite difference scheme, which uses a staggered grid in the computational domain. This function is derived to allow a direct discretization of the Laplacian operator in the pressure equation while preserving the consistent behaviour exhibited by the uniform grid scheme. Both functions are analysed for their effects on the matrix of the discretized pressure equation. It is shown that while the second function does not spoil the matrix diagonal dominance, the first one can. Limits to stretching of the first method are derived for the cases of mappings in one and two directions. A limit is also derived for the second function in order to prevent a strong distortion of a sine wave. The performances of the two types of stretching are examined in simulations of periodic co‐flowing jets and a time developing boundary layer. Copyright © 2000 John Wiley & Sons, Ltd.     

Schwarz domain decomposition for the incompressible Navier–Stokes equations in general co‐ordinates

This paper describes a domain decomposition method for the incompressible Navier–Stokes equations in general co‐ordinates. Domain decomposition techniques are needed for solving flow problems in complicated geometries while retaining structured grids on each of the subdomains. This is the so‐called block‐structured approach. It enables the use of fast vectorized iterative methods on the subdomains. The Navier–Stokes equations are discretized on a staggered grid using finite volumes. The pressure‐correction technique is used to solve the momentum equations together with incompressibility conditions. Schwarz domain decomposition is used to solve the momentum and pressure equations on the composite domain. Convergence of domain decomposition is accelerated by a GMRES Krylov subspace method. Computations are presented for a variety of flows. Copyright © 2000 John Wiley & Sons, Ltd.     

Three-dimensional incompressible Navier–Stokes equations on non-orthogonal staggered grids using the velocity–vorticity formulation

This paper is concerned with the numerical resolution of the incompressible Navier–Stokes equations in the velocity–vorticity form on non-orthogonal structured grids. The discretization is performed in such a way, that the discrete operators mimic the properties of the continuous ones. This allows the discrete equivalence between the primitive and velocity–vorticity formulations to be proved. This last formulation can thus be seen as a particular technique for solving the primitive equations. The difficulty associated with non-simply connected computational domains and with the implementation of the boundary conditions are discussed. One of the main drawback of the velocity–vorticity formulation, relative to the additional computational work required for solving the additional unknowns, is alleviated. Two- and three-dimensional numerical test cases validate the proposed method. © 1998 John Wiley & Sons, Ltd.     

Parallel finite element computation of unsteady incompressible flows

A parallel semi-explicit iterative finite element computational procedure for modelling unsteady incompressible fluid flows is presented. During the procedure, element flux vectors are calculated in parallel and then assembled into global flux vectors. Equilibrium iterations which introduce some ‘local implicitness’ are performed at each time step. The number of equilibrium iterations is governed by an implicitness parameter. The present technique retains the advantages of purely explicit schemes, namely (i) the parallel speed-up is equal to the number of parallel processors if the small communication overhead associated with purely explicit schemes is ignored and (ii) the computation time as well as the core memory required is linearly proportional to the number of elements. The incompressibility condition is imposed by using the artificial compressibility technique. A pressure-averaging technique which allows the use of equal-order interpolations for both velocity and pressure, this simplifying the formulation, is employed. Using a standard Galerkin approximation, three benchmark steady and unsteady problems are solved to demonstrate the accuracy of the procedure. In all calculations the Reynolds number is less than 500. At these Reynolds numbers it was found that the physical dissipation is sufficient to stabilize the convective term with no need for additional upwind-type dissipation. © 1998 John Wiley & Sons, Ltd.     

Asymptotic–Newton method for solving incompressible flows

In this paper we present a comparative study of three non-linear schemes for solving finite element systems of Navier–Stokes incompressible flows. The first scheme is the classical Newton–Raphson linearization, the second one is the modified Newton–Raphson linearization and the last one is a new scheme called the asymptotic–Newton method. The relative efficiency of these approaches is evaluated over a large number of examples. © 1997 John Wiley & Sons, Ltd.     

Implementation of a stabilized finite element formulation for the incompressible Navier–Stokes equations based on a pressure gradient projection

We discuss in this paper some implementation aspects of a finite element formulation for the incompressible Navier–Stokes equations which allows the use of equal order velocity–pressure interpolations. The method consists in introducing the projection of the pressure gradient and adding the difference between the pressure Laplacian and the divergence of this new field to the incompressibility equation, both multiplied by suitable algorithmic parameters. The main purpose of this paper is to discuss how to deal with the new variable in the implementation of the algorithm. Obviously, it could be treated as one extra unknown, either explicitly or as a condensed variable. However, we take for granted that the only way for the algorithm to be efficient is to uncouple it from the velocity–pressure calculation in one way or another. Here we discuss some iterative schemes to perform this uncoupling of the pressure gradient projection (PGP) from the calculation of the velocity and the pressure, both for the stationary and the transient Navier–Stokes equations. In the first case, the strategies analyzed refer to the interaction of the linearization loop and the iterative segregation of the PGP, whereas in the second the main dilemma concerns the explicit or implicit treatment of the PGP. Copyright © 2001 John Wiley & Sons, Ltd.     

A 3D incompressible Navier–Stokes velocity–vorticity weak form finite element algorithm

The velocity–vorticity formulation is selected to develop a time‐accurate CFD finite element algorithm for the incompressible Navier–Stokes equations in three dimensions.The finite element implementation uses equal order trilinear finite elements on a non‐staggered hexahedral mesh. A second order vorticity kinematic boundary condition is derived for the no slip wall boundary condition which also enforces the incompressibility constraint. A biconjugate gradient stabilized (BiCGSTAB) sparse iterative solver is utilized to solve the fully coupled system of equations as a Newton algorithm. The solver yields an efficient parallel solution algorithm on distributed‐memory machines, such as the IBM SP2. Three dimensional laminar flow solutions for a square channel, a lid‐driven cavity, and a thermal cavity are established and compared with available benchmark solutions. Copyright © 2002 John Wiley & Sons, Ltd.     

Comparison of pressure correction smoothers for multigrid solution of incompressible flow

We compare the performance of different pressure correction algorithms used as basic solvers in a multigrid method for the solution of the incompressible Navier–Stokes equations on non-staggered grids. Numerical tests were performed on several cases of lid-driven cavity flow using four different pressure correction schemes, including the traditional SIMPLE and SIMPLEC methods as well as novel variants, and varying combinations of underrelaxation parameters. The results show that three of the four algorithms tested are robust smoothers for the multigrid solver and that one of the new methods converges fastest in most of the tests. © 1997 John Wiley & Sons, Ltd.     

An overlapping control volume method for the Navier–Stokes equations on non‐staggered grids

An algorithm, based on the overlapping control volume (OCV) method, for the solution of the steady and unsteady two‐dimensional incompressible Navier–Stokes equations in complex geometry is presented. The primitive variable formulation is solved on a non‐staggered grid arrangement. The problem of pressure–velocity decoupling is circumvented by using momentum interpolation. The accuracy and effectiveness of the method is established by solving five steady state and one unsteady test problems. The numerical solutions obtained using the technique are in good agreement with the analytical and benchmark solutions available in the literature. On uniform grids, the method gives second‐order accuracy for both diffusion‐ and convection‐dominated flows. There is little loss of accuracy on grids that are moderately non‐orthogonal. Copyright © 1999 John Wiley & Sons, Ltd.     

An unsteady incompressible Navier–Stokes solver for large eddy simulation of turbulent flows

An unsteady incompressible Navier–Stokes solver that uses a dual time stepping method combined with spatially high‐order‐accurate finite differences, is developed for large eddy simulation (LES) of turbulent flows. The present solver uses a primitive variable formulation that is based on the artificial compressibility method and various convergence–acceleration techniques are incorporated to efficiently simulate unsteady flows. A localized dynamic subgrid model, which is formulated using the subgrid kinetic energy, is employed for subgrid turbulence modeling. To evaluate the accuracy and the efficiency of the new solver, a posteriori tests for various turbulent flows are carried out and the resulting turbulence statistics are compared with existing experimental and direct numerical simulation (DNS) data. Copyright © 1999 John Wiley & Sons, Ltd.     

Domain decomposition for the incompressible Navier–Stokes equations: solving subdomain problems accurately and inaccurately

For the solution of practical flow problems in arbitrarily shaped domains, simple Schwarz domain decomposition methods with minimal overlap are quite efficient, provided Krylov subspace methods, e.g. the GMRES method, are used to accelerate convergence. With an accurate subdomain solution, the amount of time spent solving these problems may be quite large. To reduce computing time, an inaccurate solution of subdomain problems is considered, which requires a GCR-based acceleration technique. Much emphasis is put on the multiplicative domain decomposition algorithm since we also want an algorithm which is fast on a single processor. Nevertheless, the prospects for parallel implementation are also investigated. © 1998 John Wiley & Sons, Ltd.     

An implicit edge‐based ALE method for the incompressible Navier–Stokes equations

A new finite volume method for the incompressible Navier–Stokes equations, expressed in arbitrary Lagrangian–Eulerian (ALE) form, is presented. The method uses a staggered storage arrangement for the pressure and velocity variables and adopts an edge‐based data structure and assembly procedure which is valid for arbitrary n‐sided polygonal meshes. Edge formulas are presented for assembling the ALE form of the momentum and pressure equations. An implicit multi‐stage time integrator is constructed that is geometrically conservative to the precision of the arithmetic used in the computation. The method is shown to be second‐order‐accurate in time and space for general time‐dependent polygonal meshes. The method is first evaluated using several well‐known unsteady incompressible Navier–Stokes problems before being applied to a periodically forced aeroelastic problem and a transient free surface problem. Published in 2003 by John Wiley & Sons, Ltd.     

SIMPLE‐type preconditioners for cell‐centered,colocated finite volume discretization of incompressible Reynolds‐averaged Navier–Stokes equations

This paper contains a comparison of four SIMPLE‐type methods used as solver and as preconditioner for the iterative solution of the (Reynolds‐averaged) Navier–Stokes equations, discretized with a finite volume method for cell‐centered, colocated variables on unstructured grids. A matrix‐free implementation is presented, and special attention is given to the treatment of the stabilization matrix to maintain a compact stencil suitable for unstructured grids. We find SIMPLER preconditioning to be robust and efficient for academic test cases and industrial test cases. Compared with the classical SIMPLE solver, SIMPLER preconditioning reduces the number of nonlinear iterations by a factor 5–20 and the CPU time by a factor 2–5 depending on the case. The flow around a ship hull at Reynolds number 2E9, for example, on a grid with cell aspect ratio up to 1:1E6, can be computed in 3 instead of 15 h.Copyright © 2012 John Wiley & Sons, Ltd.     

Calculation of impulsively started incompressible viscous flows

The paper's focus is the calculation of unsteady incompressible 2D flows past airfoils. In the framework of the primitive variable Navier–Stokes equations, the initial and boundary conditions must be assigned so as to be compatible, to assure the correct prediction of the flow evolution. This requirement, typical of all incompressible flows, viscous or inviscid, is often violated when modelling the flow past immersed bodies impulsively started from rest. Its fulfillment can however be restored by means of a procedure enforcing compatibility, consisting in a pre‐processing of the initial velocity field, here described in detail. Numerical solutions for an impulsively started multiple airfoil have been obtained using a finite element incremental projection method. The spatial discretization chosen for the velocity and pressure are of different order to satisfy the inf–sup condition and obtain a smooth pressure field. Results are provided to illustrate the effect of employing or not the compatibility procedure, and are found in good agreement with those obtained with a non‐primitive variable solver. In addition, we introduce a post‐processing procedure to evaluate an alternative pressure field which is found to be more accurate than the one resulting from the projection method. This is achieved by considering an appropriate ‘unsplit’ version of the momentum equation, where the velocity solution of the projection method is substituted. Copyright © 2004 John Wiley & Sons, Ltd.     

Simulation of viscous water column collapse using adapting hierarchical grids

An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd.     

A high‐order scheme for the incompressible Navier–Stokes equations with open boundary condition

We present a numerical scheme to solve the incompressible Navier–Stokes equations with open boundary condition. After replacing the incompressibility constraint by the pressure Poisson equation, the key is how to give an appropriate boundary condition for the pressure Poisson equation. We propose a new boundary condition for the pressure on the open boundary. Some numerical experiments are presented to verify the accuracy and stability of scheme. Copyright © 2013 John Wiley & Sons, Ltd.     

A fractional-step method for the incompressible Navier–Stokes equations related to a predictor–multicorrector algorithm

An implicit fractional-step method for the numerical solution of the time-dependent incompressible Navier–Stokes equations in primitive variables is studied in this paper. The method, which is first-order-accurate in the time step, is shown to converge to an exact solution of the equations. By adequately splitting the viscous term, it allows the enforcement of full Dirichlet boundary conditions on the velocity in all substeps of the scheme, unlike standard projection methods. The consideration of this method was actually motivated by the study of a well-known predictor–multicorrector algorithm, when this is applied to the incompressible Navier–Stokes equations. A new derivation of the algorithm in a general setting is provided, showing in what sense it can also be understood as a fractional-step method; this justifies, in particular, why the original boundary conditions of the problem can be enforced in this algorithm. Two different finite element interpolations are considered for the space discretization, and numerical results obtained with them for standard benchmark cases are presented. © 1998 John Wiley & Sons, Ltd.     

Newton linearization of the incompressible Navier–Stokes equations

The present study aims to accelerate the convergence to incompressible Navier–Stokes solution. For the sake of computational efficiency, Newton linearization of equations is invoked on non‐staggered grids to shorten the sequence to the final solution of the non‐linear differential system of equations. For the sake of accuracy, the resulting convection–diffusion–reaction finite‐difference equation is solved line‐by‐line using the proposed nodally exact one‐dimensional scheme. The matrix size is reduced and, at the same time, the CPU time is considerably saved due to the decrease of stencil points. The effectiveness of the implemented Newton linearization is demonstrated through computational exercises. Copyright © 2004 John Wiley & Sons, Ltd.