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.     

Flux‐difference splitting‐based upwind compact schemes for the incompressible Navier–Stokes equations

Third‐order and fifth‐order upwind compact finite difference schemes based on flux‐difference splitting are proposed for solving the incompressible Navier–Stokes equations in conjunction with the artificial compressibility (AC) method. Since the governing equations in the AC method are hyperbolic, flux‐difference splitting (FDS) originally developed for the compressible Euler equations can be used. In the present upwind compact schemes, the split derivatives for the convective terms at grid points are linked to the differences of split fluxes between neighboring grid points, and these differences are computed by using FDS. The viscous terms are approximated with a sixth‐order central compact scheme. Comparisons with 2D benchmark solutions demonstrate that the present compact schemes are simple, efficient, and high‐order accurate. Copyright © 2008 John Wiley & Sons, Ltd.     

The fundamental solution method for incompressible Navier–Stokes equations

A complete boundary integral formulation for incompressible Navier–Stokes equations with time discretization by operator splitting is developed using the fundamental solutions of the Helmholtz operator equation with different order. The numerical results for the lift and the drag hysteresis associated with a NACA0012 aerofoil oscillating in pitch show good agreement with available experimental data. © 1998 John Wiley & Sons, Ltd.     

An adaptive multigrid finite-volume scheme for incompressible Navier–Stokes equations

An algorithm for the solutions of the two-dimensional incompressible Navier–Stokes equations is presented. The algorithm can be used to compute both steady-state and time-dependent flow problems. It is based on an artificial compressibility method and uses higher-order upwind finite-volume techniques for the convective terms and a second-order finite-volume technique for the viscous terms. Three upwind schemes for discretizing convective terms are proposed here. An interesting result is that the solutions computed by one of them is not sensitive to the value of the artificial compressibility parameter. A second-order, two-step Runge–Kutta integration coupling with an implicit residual smoothing and with a multigrid method is used for achieving fast convergence for both steady- and unsteady-state problems. The numerical results agree well with experimental and other numerical data. A comparison with an analytically exact solution is performed to verify the space and time accuracy of the algorithm.     

Upwind discretization of the steady Navier–Stokes equations

A discretization method is presented for the full, steady, compressible Navier–Stokes equations. The method makes use of quadrilateral finite volumes and consists of an upwind discretization of the convective part and a central discretization of the diffusive part. In the present paper the emphasis lies on the discretization of the convective part. The solution method applied solves the steady equations directly by means of a non-linear relaxation method accelerated by multigrid. The solution method requires the discretization to be continuously differentiable. For two upwind schemes which satisfy this requirement (Osher's and van Leer's scheme), results of a quantitative error analysis are presented. Osher's scheme appears to be increasingly more accurate than van Leer's scheme with increasing Reynolds number. A suitable higher-order accurate discretization of the convection terms is derived. On the basis of this higher-order scheme, to preserve monotonicity, a new limiter is constructed. Numerical results are presented for a subsonic flat plate flow and a supersonic flat plate flow with oblique shock wave–boundary layer interaction. The results obtained agree with the predictions made. Useful properties of the discretization method are that it allows an easy check of false diffusion and that it needs no tuning of parameters.     

Numerical solution of Navier–Stokes equations using multiquadric radial basis function networks

A numerical method based on radial basis function networks (RBFNs) for solving steady incompressible viscous flow problems (including Boussinesq materials) is presented in this paper. The method uses a ‘universal approximator’ based on neural network methodology to represent the solutions. The method is easy to implement and does not require any kind of ‘finite element‐type’ discretization of the domain and its boundary. Instead, two sets of random points distributed throughout the domain and on the boundary are required. The first set defines the centres of the RBFNs and the second defines the collocation points. The two sets of points can be different; however, experience shows that if the two sets are the same better results are obtained. In this work the two sets are identical and hence commonly referred to as the set of centres. Planar Poiseuille, driven cavity and natural convection flows are simulated to verify the method. The numerical solutions obtained using only relatively low densities of centres are in good agreement with analytical and benchmark solutions available in the literature. With uniformly distributed centres, the method achieves Reynolds number Re = 100 000 for the Poiseuille flow (assuming that laminar flow can be maintained) using the density of , Re = 400 for the driven cavity flow with a density of and Rayleigh number Ra = 1 000 000 for the natural convection flow with a density of . Copyright © 2001 John Wiley & Sons, Ltd.     

A parallel adaptive numerical method with generalized curvilinear coordinate transformation for compressible Navier–Stokes equations

A fourth‐order finite‐volume method for solving the Navier–Stokes equations on a mapped grid with adaptive mesh refinement is proposed, implemented, and demonstrated for the prediction of unsteady compressible viscous flows. The method employs fourth‐order quadrature rules for evaluating face‐averaged fluxes. Our approach is freestream preserving, guaranteed by the way of computing the averages of the metric terms on the faces of cells. The standard Runge–Kutta marching method is used for time discretization. Solutions of a smooth flow are obtained in order to verify that the method is formally fourth‐order accurate when applying the nonlinear viscous operators on mapped grids. Solutions of a shock tube problem are obtained to demonstrate the effectiveness of adaptive mesh refinement in resolving discontinuities. A Mach reflection problem is solved to demonstrate the mapped algorithm on a non‐rectangular physical domain. The simulation is compared against experimental results. Future work will consider mapped multiblock grids for practical engineering geometries. Copyright © 2016 John Wiley & Sons, Ltd.     

Two‐level finite element method with a stabilizing subgrid for the incompressible Navier–Stokes equations

We consider the Galerkin finite element method for the incompressible Navier–Stokes equations in two dimensions. The domain is discretized into a set of regular triangular elements and the finite‐dimensional spaces employed consist of piecewise continuous linear interpolants enriched with the residual‐free bubble functions. To find the bubble part of the solution, a two‐level finite element method with a stabilizing subgrid of a single node is described, and its application to the Navier–Stokes equation is displayed. Numerical approximations employing the proposed algorithm are presented for three benchmark problems. The results show that the proper choice of the subgrid node is crucial in obtaining stable and accurate numerical approximations consistent with the physical configuration of the problem at a cheap computational cost. Copyright © 2008 John Wiley & Sons, Ltd.     

A Chimera method for the incompressible Navier–Stokes equations

The Chimera method was developed three decades ago as a meshing simplification tool. Different components are meshed independently and then glued together using a domain decomposition technique to couple the equations solved on each component. This coupling is achieved via transmission conditions (in the finite element context) or by imposing the continuity of fluxes (in the finite volume context). Historically, the method has then been used extensively to treat moving objects, as the independent meshes are free to move with respect to the others. At each time step, the main task consists in recomputing the interpolation of the transmission conditions or fluxes. This paper presents a Chimera method applied to the Navier–Stokes equations. After an introduction on the Chimera method, we describe in two different sections the two independent steps of the method: the hole cutting to create the interfaces of the subdomains and the coupling of the subdomains. Then, we present the Navier–Stokes solver considered in this work. Implementation aspects are then detailed in order to apply efficiently the method to this specific parallel Navier–Stokes solver. We conclude with some examples to demonstrate the reliability and application of the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.     

Vectorized poisson solvers for the Navier–Stokes equations

The advent of vector and massively parallel computers offers researchers the possibility of enormous gains in execution time for scientific and engineering programs. From the numerical point of view, such programs are frequently based on the inversion of sparse, diagonally banded matrices. Conventional scalar solvers often perform poorly on vector machines due to short effective vector lengths, and thus appropriate methods must be chosen for use with vector machines. In this paper a number of commonly used solvers are tested for the Navier–Stokes equations, in both scalar and vector form, on two vector architecture machines. A new method is presented which performs well in both vector and scalar form on a range of vector architectures.     

A complete boundary integral formulation for compressible Navier–Stokes equations

A complete boundary integral formulation for compressible Navier–Stokes equations with time discretization by operator splitting is developed using the fundamental solutions of the Helmholtz operator equation with different order. The numerical results for wall pressure and wall skin friction of two‐dimensional compressible laminar viscous flow around airfoils are in good agreement with field numerical methods. Copyright © 2004 John Wiley & Sons, Ltd.     

Multigrid solution of the Navier–Stokes equations on highly stretched grids

Relaxation-based multigrid solvers for the steady incompressible Navier–Stokes equations are examined to determine their computational speed and robustness. Four relaxation methods were used as smoothers in a common tailored multigrid procedure. The resulting solvers were applied to three two-dimensional flow problems, over a range of Reynolds numbers, on both uniform and highly stretched grids. In all cases the L₂ norm of the velocity changes is reduced to 10^?6 in a few 10's of fine-grid sweeps. The results of the study are used to draw conciusions on the strengths and weaknesses of the individual relaxation methods as well as those of the overall multigrid procedure when used as a solver on highly stretched grids.     

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.     

Pseudostress–velocity formulation for incompressible Navier–Stokes equations

This paper presents a numerical algorithm using the pseudostress–velocity formulation to solve incompressible Newtonian flows. The pseudostress–velocity formulation is a variation of the stress–velocity formulation, which does not require symmetric tensor spaces in the finite element discretization. Hence its discretization is greatly simplified. The discrete system is further decoupled into an H ( div ) problem for the pseudostress and a post‐process resolving the velocity. This can be done conveniently by using the penalty method for steady‐state flows or by using the time discretization for nonsteady‐state flows. We apply this formulation to the 2D lid‐driven cavity problem and study its grid convergence rate. Also, computational results of the time‐dependent‐driven cavity problem and the flow past rectangular problem are reported. Copyright © 2009 John Wiley & Sons, Ltd.     

Orthogonal grid generation for Navier–Stokes computations

Body conforming orthogonal grids were generated using a fast hyperbolic method for aerofoils, and were used to solve the Navier–Stokes equation in the generalized orthogonal system for the first time for time accurate simulation of incompressible flow. For grid generation, the Beltrami equation and the definition equation for the orthogonality are solved using a finite difference method. The grids generated around aerofoils by this method have better orthogonality than the results published by earlier investigators. The Navier–Stokes equation at Reynolds numbers of 3000 and 35 000 for NACA 0012 and NACA 0015 respectively, have been solved as an application. The obtained results match quite well with the corresponding experimental results. © 1998 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.     

Steady‐state solution of incompressible Navier–Stokes equations using discrete least‐squares meshless method

A fractional step method for the solution of the steady state incompressible Navier–Stokes equations is proposed in this paper in conjunction with a meshless method, named discrete least‐squares meshless (DLSM). The proposed fractional step method is a first‐order accurate scheme, named semi‐incremental fractional step method, which is a general form of the previous first‐order fractional step methods, i.e. non‐incremental and incremental schemes. One of the most important advantages of the proposed scheme is its capability to use large time step sizes for the solution of incompressible Navier–Stokes equations. DLSM method uses moving least‐squares shape functions for function approximation and discrete least‐squares technique for discretization of the governing differential equations and their boundary conditions. As there is no need for a background mesh, the DLSM method can be called a truly meshless method and enjoys symmetric and positive‐definite properties. Several numerical examples are used to demonstrate the ability and the efficiency of the proposed scheme and the discrete least‐squares meshless method. The results are shown to compare favorably with those of the previously published works. Copyright © 2010 John Wiley & Sons, Ltd.     

A variational multiscale Newton–Schur approach for the incompressible Navier–Stokes equations

In the following paper, we present a consistent Newton–Schur (NS) solution approach for variational multiscale formulations of the time‐dependent Navier–Stokes equations in three dimensions. The main contributions of this work are a systematic study of the variational multiscale method for three‐dimensional problems and an implementation of a consistent formulation suitable for large problems with high nonlinearity, unstructured meshes, and non‐symmetric matrices. In addition to the quadratic convergence characteristics of a Newton–Raphson‐based scheme, the NS approach increases computational efficiency and parallel scalability by implementing the tangent stiffness matrix in Schur complement form. As a result, more computations are performed at the element level. Using a variational multiscale framework, we construct a two‐level approach to stabilizing the incompressible Navier–Stokes equations based on a coarse and fine‐scale subproblem. We then derive the Schur complement form of the consistent tangent matrix. We demonstrate the performance of the method for a number of three‐dimensional problems for Reynolds number up to 1000 including steady and time‐dependent flows. Copyright © 2009 John Wiley & Sons, Ltd.     

Third‐order‐accurate semi‐implicit Runge–Kutta scheme for incompressible Navier–Stokes equations

A semi‐implicit three‐step Runge–Kutta scheme for the unsteady incompressible Navier–Stokes equations with third‐order accuracy in time is presented. The higher order of accuracy as compared to the existing semi‐implicit Runge–Kutta schemes is achieved due to one additional inversion of the implicit operator I‐τγL, which requires inversion of tridiagonal matrices when using approximate factorization method. No additional solution of the pressure‐Poisson equation or evaluation of Navier–Stokes operator is needed. The scheme is supplied with a local error estimation and time‐step control algorithm. The temporal third‐order accuracy of the scheme is proved analytically and ascertained by analysing both local and global errors in a numerical example. Copyright © 2005 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.