A momentum coupling method for the unsteady incompressible Navier–Stokes equations on the staggered grid

A new numerical method is developed to efficiently solve the unsteady incompressible Navier–Stokes equations with second-order accuracy in time and space. In contrast to the SIMPLE algorithms, the present formulation directly solves the discrete x- and y-momentum equations in a coupled form. It is found that the present implicit formulation retrieves some cross convection terms overlooked by the conventional iterative methods, which contribute to accuracy and fast convergence. The finite volume method is applied on the fully staggered grid to solve the vector-form momentum equations. The preconditioned conjugate gradient squared method (PCGS) has proved very efficient in solving the associate linearized large, sparse block-matrix system. Comparison with the SIMPLE algorithm has indicated that the present momentum coupling method is fast and robust in solving unsteady as well as steady viscous flow problems. © 1998 John Wiley & Sons, Ltd.     

Dealing with pressure: FEM solution strategies for the pressure in the time‐dependent Navier–Stokes equations

This paper presents a survey of solution methods for calculating the pressure in the time‐dependent Navier–Stokes equations. The primary focus is on the treatment of the pressure‐Poisson equation deriving from index‐1 DAE formulations of the Navier–Stokes equations. Based on extensive operational experience with a variety of solution strategies, the combination of a stabilized pressure‐Poisson operator with an A‐conjugate projection and SSOR preconditioned conjugate gradient method has been found to yield the overall best performance relative to the resolve cost of a high performance direct solver. Copyright © 2002 John Wiley & Sons, Ltd.     

A NON–LINEAR ADAPTED TRI–TREE MULTIGRID SOLVER FOR FINITE ELEMENT FORMULATION OF THE NAVIER–STOKES EQUATIONS

An iterative adaptive equation multigrid solver for solving the implicit Navier–Stokes equations simultaneously with tri-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structur e which is mapped to a finite element grid at each hierarchical level. For each hierarchical finite element multigrid the Navier–Stokes equations are solved approximately. The solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached. The iterative multigrid equation solver is preconditioned by incomplete LU factorization with coupled node fill-in. The non-linear Navier–Stokes equations are linearized by both the Newton method and grid adaption. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in.     

Parallel conjugate gradient performance for least-squares finite elements and transport problems

In this study we consider parallel conjugate gradient solution of sparse systems arising from the least-squares mixed finite element method. Of particular interest are transport problems involving convection. The least-squares approach leads to a symmetric positive system and the conjugate gradient scheme is directly applicable. The scheme is applied to both the convection–diffusion equation and to the stationary Navier–Stokes equations. Here we demonstrate parallel solution and performance studies for a representative MIMD parallel computer with hypercube architecture. © 1998 John Wiley & Sons, Ltd.     

Iterative solution techniques for the stokes and Navier-Stokes equations

The linear system arising from a Lagrange-Galerkin mixed finite element approximation of the Navier–Stokes and continuity equations is symmetric indefinite and has the same block structure as a system arising from a mixed finite element discretization of a Stokes problem. This paper considers the iterative solution of such a system, comparing the performance of the one-level preconditioned conjugate residual method for indefinite matrices with that of a more traditional two-level pressure correction approach. Asymptotic estimates for the amount of work involved in each method are given together with the results of related numerical experiments.     

A staggered control volume scheme for unstructured triangular grids

The purpose of this work is to introduce and validate a new staggered control volume method for the simulation of 2D/axisymmetric incompressible flows. The present study introduces a numerical procedure for solving the Navier–Stokes equations using the primitive variable formulation. The proposed method is an extension of the staggered grid methodology to unstructured triangular meshes for a control volume approach which features ease of handling of irregularly shaped domains. Two alternative elements are studied: transported scalars are stored either at the sides of an element or at its vertices, while the pressure is always stored at the centre of an element. Two interpolation functions were investigated for the integration of the momentum equations: a skewed mass-weighted upwind function and a flow-oriented exponential shape function. The momentum equations are solved over the covolume of a side or of a vertex and the pressure–velocity coupling makes use of a localized linear reconstruction of the discontinuous pressure field surrounding an element in order to obtain the pressure gradient terms. The pressure equation is obtained through a discretization of the continuity equation which uses the triangular element itself as the control volume. The method is applied to the simulation of the following test cases: backward-facing step flow, flow over a two-dimensional obstacle and flow in a pipe with sudden contraction of cross-sectional area. All numerical investigations are compared with experimental data from the literature. A grid convergence and error analysis study is also carried out for flow in a driven cavity. Results compared favourably with experimental data and so the new control volume scheme is deemed well suited for the prediction of incompressible flows in complex geometries. © 1997 John Wiley & Sons, Ltd.     

Control of Navier–Stokes equations by means of mode reduction

In a previous work (Park HM, Lee MW. An efficient method of solving the Navier–Stokes equation for the flow control. International Journal of Numerical Methods in Engineering 1998; 41 : 1131–1151), the authors proposed an efficient method of solving the Navier–Stokes equations by reducing their number of modes. Employing the empirical eigenfunctions of the Karhunen–Loève decomposition as basis functions of a Galerkin procedure, one can a priori limit the function space considered to the smallest linear sub‐space that is sufficient to describe the observed phenomena, and consequently, reduce the Navier–Stokes equations defined on a complicated geometry to a set of ordinary differential equations with a minimum degree of freedom. In the present work, we apply this technique, termed the Karhunen–Loève Galerkin procedure, to a pointwise control problem of Navier–Stokes equations. The Karhunen–Loève Galerkin procedure is found to be much more efficient than the traditional method, such as finite difference method in obtaining optimal control profiles when the minimization of the objective function has been done by using a conjugate gradient method.     

Least‐squares meshfree method for incompressible Navier–Stokes problems

A least‐squares meshfree method based on the first‐order velocity–pressure–vorticity formulation for two‐dimensional incompressible Navier–Stokes problem is presented. The convective term is linearized by successive substitution or Newton's method. The discretization of all governing equations is implemented by the least‐squares method. Equal‐order moving least‐squares approximation is employed with Gauss quadrature in the background cells. The boundary conditions are enforced by the penalty method. The matrix‐free element‐by‐element Jacobi preconditioned conjugate method is applied to solve the discretized linear systems. Cavity flow for steady Navier–Stokes problem and the flow over a square obstacle for time‐dependent Navier–Stokes problem are investigated for the presented least‐squares meshfree method. The effects of inaccurate integration on the accuracy of the solution are investigated. Copyright © 2004 John Wiley & Sons, Ltd.     

A finite volume method for viscous incompressible flows using a consistent flux reconstruction scheme

An incompressible Navier–Stokes solver using curvilinear body‐fitted collocated grid has been developed to solve unconfined flow past arbitrary two‐dimensional body geometries. In this solver, the full Navier–Stokes equations have been solved numerically in the physical plane itself without using any transformation to the computational plane. For the proper coupling of pressure and velocity field on collocated grid, a new scheme, designated ‘consistent flux reconstruction’ (CFR) scheme, has been developed. In this scheme, the cell face centre velocities are obtained explicitly by solving the momentum equations at the centre of the cell faces. The velocities at the cell centres are also updated explicitly by solving the momentum equations at the cell centres. By resorting to such a fully explicit treatment considerable simplification has been achieved compared to earlier approaches. In the present investigation the solver has been applied to unconfined flow past a square cylinder at zero and non‐zero incidence at low and moderate Reynolds numbers and reasonably good agreement has been obtained with results available from literature. Copyright © 2006 John Wiley & Sons, Ltd.     

Parallel ILU preconditioning,a priori pivoting and segregation of variables for iterative solution of the mixed finite element formulation of the Navier–Stokes equations

A parallel ILU preconditioning algorithm for the incompressible Navier–Stokes equations has been designed, implemented and tested. The computational mesh is divided into N subdomains which are processed in parallel in different processors. During ILU factorization, matrices and vectors associated with the nodes on the interface between the subdomains are communicated to the equation matrices to the adjacent subdomain. The bases for the parallel algorithm are an appropriate node ordering scheme and a segregation of velocity and pressure degrees of freedom. The inner nodes of the subdomain are numbered first and then the nodes on the interface between the subdomains. To avoid division by zero during the ILU factorization, the equations corresponding to the velocity degrees of freedom are assembled first in the global equation matrix, followed by the equations corresponding to the pressure degrees of freedom. Copyright © 2003 John Wiley & Sons, Ltd.     

Finite element modified method of characteristics for the Navier–Stokes equations

An algorithm based on the finite element modified method of characteristics (FEMMC) is presented to solve convection–diffusion, Burgers and unsteady incompressible Navier–Stokes equations for laminar flow. Solutions for these progressively more involved problems are presented so as to give numerical evidence for the robustness, good error characteristics and accuracy of our method. To solve the Navier–Stokes equations, an approach that can be conceived as a fractional step method is used. The innovative first stage of our method is a backward search and interpolation at the foot of the characteristics, which we identify as the convective step. In this particular work, this step is followed by a conjugate gradient solution of the remaining Stokes problem. Numerical results are presented for:

• a Convection–diffusion equation. Gaussian hill in a uniform rotating field.
• b Burgers equations with viscosity.
• c Navier–Stokes solution of lid‐driven cavity flow at relatively high Reynolds numbers.
• d Navier–Stokes solution of flow around a circular cylinder at Re=100.

Copyright © 2000 John Wiley & Sons, Ltd.     

Compact finite difference-Fourier spectral method for three-dimensional incompressible Navier-Stokes equations

A new compact finite difference-Fourier spectral hybrid method for solving the three dimensional incompressible Navier-Stokes equations is developed in the present paper. The fifth-order upwind compact finite difference schemes for the nonlinear convection terms in the physical space, and the sixth-order center compact schemes for the derivatives in spectral space are described, respectively. The fourth-order compact schemes in a single nine-point cell for solving the Helmholtz equations satisfied by the velocities and pressure in spectral space is derived and its preconditioned conjugate gradient iteration method is studied. The treatment of pressure boundary conditions and the three dimensional non-reflecting outflow boundary conditions are presented. Application to the vortex dislocation evolution in a three dimensional wake is also reported. The project supported by the National Natural Science Foundation of China     

数值求解Navier—Stokes方程的迎风紧致差分格式

从迎风紧致逼近^[1]出发,提出数值求解可压Navier-Stokes方程的一种高精度的数值方法。利用Steger-Warming的通量分裂技术^[2]将守恒型方程中的流通向量分裂成两部分,在此基础上据风向构造逼近于无粘项的三阶迎风紧致有限差分格式。对方程中的粘性部分采用通常的二阶差分逼近。所建立的差分格式被用来数值求解了三维粘性绕流问题。     

Vorticity–velocity formulation of the 3D Navier–Stokes equations in cylindrical co‐ordinates

A finite difference method is presented for solving the 3D Navier–Stokes equations in vorticity–velocity form. The method involves solving the vorticity transport equations in ‘curl‐form’ along with a set of Cauchy–Riemann type equations for the velocity. The equations are formulated in cylindrical co‐ordinates and discretized using a staggered grid arrangement. The discretized Cauchy–Riemann type equations are overdetermined and their solution is accomplished by employing a conjugate gradient method on the normal equations. The vorticity transport equations are solved in time using a semi‐implicit Crank–Nicolson/Adams–Bashforth scheme combined with a second‐order accurate spatial discretization scheme. Special emphasis is put on the treatment of the polar singularity. Numerical results of axisymmetric as well as non‐axisymmetric flows in a pipe and in a closed cylinder are presented. Comparison with measurements are carried out for the axisymmetric flow cases. Copyright © 2003 John Wiley & Sons, Ltd.     

Numerical solution of three‐dimensional velocity–vorticity Navier–Stokes equations by finite difference method

This paper describes the finite difference numerical procedure for solving velocity–vorticity form of the Navier–Stokes equations in three dimensions. The velocity Poisson equations are made parabolic using the false‐transient technique and are solved along with the vorticity transport equations. The parabolic velocity Poisson equations are advanced in time using the alternating direction implicit (ADI) procedure and are solved along with the continuity equation for velocities, thus ensuring a divergence‐free velocity field. The vorticity transport equations in conservative form are solved using the second‐order accurate Adams–Bashforth central difference scheme in order to assure divergence‐free vorticity field in three dimensions. The velocity and vorticity Cartesian components are discretized using a central difference scheme on a staggered grid for accuracy reasons. The application of the ADI procedure for the parabolic velocity Poisson equations along with the continuity equation results in diagonally dominant tri‐diagonal matrix equations. Thus the explicit method for the vorticity equations and the tri‐diagonal matrix algorithm for the Poisson equations combine to give a simplified numerical scheme for solving three‐dimensional problems, which otherwise requires enormous computational effort. For three‐dimensional‐driven cavity flow predictions, the present method is found to be efficient and accurate for the Reynolds number range 100?Re?2000. Copyright © 2004 John Wiley & Sons, Ltd.     

A Helmholtz pressure equation method for the calculation of unsteady incompressibl eviscous flows

A time-implicit numerical method for solving unsteady incompressible viscous flow problems is introduced. The method is based on introducing intermediate compressibility into a projection scheme to obtain a Helmholtz equation for a pressure-type variable. The intermediate compressibility increases the diagonal dominance of the discretized pressure equation so that the Helmholtz pressure equation is relatively easy to solve numerically. The Helmholtz pressure equation provides an iterative method for satisfying the continuity equation for time-implicit Navier–Stokes algorithms. An iterative scheme is used to simultaneously satisfy, within a given tolerance, the velocity divergence-free condition and momentum equations at each time step. Collocated primitive variables on a non-staggered finite difference mesh are used. The method is applied to an unsteady Taylor problem and unsteady laminar flow past a circular cylinder.     

SIMPLE‐type preconditioners for the Oseen problem

In this paper, the steady incompressible Navier–Stokes equations are discretized by the finite element method. The resulting systems of equations are solved by preconditioned Krylov subspace methods. Some new preconditioning strategies, both algebraic and problem dependent are discussed. We emphasize on the approximation of the Schur complement as used in semi implicit method for pressure‐linked equations‐type preconditioners. In the usual formulation, the Schur complement matrix and updates use scaling with the diagonal of the convection–diffusion matrix. We propose a variant of the SIMPLER preconditioner. Instead of using the diagonal of the convection–diffusion matrix, we scale the Schur complement and updates with the diagonal of the velocity mass matrix. This variant is called modified SIMPLER (MSIMPLER). With the new approximation, we observe a drastic improvement in convergence for large problems. MSIMPLER shows better convergence than the well‐known least‐squares commutator preconditioner which is also based on the diagonal of the velocity mass matrix. Copyright © 2008 John Wiley & Sons, Ltd.     

A Chebyshev collocation method for the Navier–Stokes equations with application to double-diffusive convection

A Chebyshev collocation method for solving the unsteady two-dimensional Navier–Stokes equations in vorticity–streamfunction variables is presented and discussed. The discretization in time is obtained through a class of semi-implicit finite difference schemes. Thus at each time cycle the problem reduces to a Stokes-type problem which is solved by means of the influence matrix technique leading to the solution of Helmholtz-type equations with Dirichlet boundary conditions. Theoretical results on the stability of the method are given. Then a matrix diagonalization procedure for solving the algebraic system resulting from the Chebyshev collocation approximation of the Helmholtz equation is developed and its accuracy is tested. Numerical results are given for the Stokes and the Navier–Stokes equations. Finally the method is applied to a double-diffusive convection problem concerning the stability of a fluid stratified by salinity and heated from below.     

Efficient algebraic multigrid solvers with elementary restriction and prolongation

An algebraic multigrid (AMG) scheme is presented for the efficient solution of large systems of coupled algebraic equations involving second-order discrete differentials. It is based on elementary (zero-order) intergrid transfer operators but exhibits convergence rates that are independent of the system bandwidth. Inconsistencies in the coarse-grid approximation are minimised using a global scaling approximation which requires no explicit geometrical information. Residual components of the error spectrum that remain poorly represented in the coarse-grid approximations are reduced by exploiting Krylof subspace methods. The scheme represents a robust, simple and cost-effective approach to the problem of slowly converging eigenmodes when low-order prolongation and restriction operators are used in multigrid algorithms. The algorithm investigated here uses a generalised conjugate residual (GCR) accelerator; it might also be described as an AMG preconditioned GCR method. It is applied to two test problems, one based on a solution of a discrete Poisson-type equation for nodal pressures in a pipe network, the other based on coupled solutions to the discrete Navier–Stokes equations for flows and pressures in a driven cavity. © 1998 John Wiley & Sons, Ltd.