Numerical implementation of the Crank–Nicolson/Adams–Bashforth scheme for the time‐dependent Navier–Stokes equations

This article considers numerical implementation of the Crank–Nicolson/Adams–Bashforth scheme for the two‐dimensional non‐stationary Navier–Stokes equations. A finite element method is applied for the spatial approximation of the velocity and pressure. The time discretization is based on the Crank–Nicolson scheme for the linear term and the explicit Adams–Bashforth scheme for the nonlinear term. Comparison with other methods, through a series of numerical experiments, shows that this method is almost unconditionally stable and convergent, i.e. stable and convergent when the time step is smaller than a given constant. Copyright © 2009 John Wiley & Sons, Ltd.     

On the efficiency of semi‐implicit and semi‐Lagrangian spectral methods for the calculation of incompressible flows

Classical semi‐implicit backward Euler/Adams–Bashforth time discretizations of the Navier–Stokes equations induce, for high‐Reynolds number flows, severe restrictions on the time step. Such restrictions can be relaxed by using semi‐Lagrangian schemes essentially based on splitting the full problem into an explicit transport step and an implicit diffusion step. In comparison with the standard characteristics method, the semi‐Lagrangian method has the advantage of being much less CPU time consuming where spectral methods are concerned. This paper is devoted to the comparison of the ‘semi‐implicit’ and ‘semi‐Lagrangian’ approaches, in terms of stability, accuracy and computational efficiency. Numerical results on the advection equation, Burger's equation and finally two‐ and three‐dimensional Navier–Stokes equations, using spectral elements or a collocation method, are provided. Copyright © 2001 John Wiley & Sons, Ltd.     

A comparison of time integration methods in an unsteady low‐Reynolds‐number flow

This paper describes three different time integration methods for unsteady incompressible Navier–Stokes equations. Explicit Euler and fractional‐step Adams–Bashford methods are compared with an implicit three‐level method based on a steady‐state SIMPLE method. The implicit solver employs a dual time stepping and an iteration within the time step. The spatial discretization is based on a co‐located finite‐volume technique. The influence of the convergence limits and the time‐step size on the accuracy of the predictions are studied. The efficiency of the different solvers is compared in a vortex‐shedding flow over a cylinder in the Reynolds number range of 100–1600. A high‐Reynolds‐number flow over a biconvex airfoil profile is also computed. The computations are performed in two dimensions. At the low‐Reynolds‐number range the explicit methods appear to be faster by a factor from 5 to 10. In the high‐Reynolds‐number case, the explicit Adams–Bashford method and the implicit method appear to be approximately equally fast while yielding similar results. Copyright © 2002 John Wiley & Sons, Ltd.     

Mixed‐order interpolation for the Galerkin coarse‐grid approximations in algebraic multigrid solvers

An empirical investigation is made of AMG solver performance for the fully coupled set of Navier–Stokes equations. The investigation focuses on two different FV discretizations for the standard driven cavity test problem. One is a collocated vertex‐based discretization; the other is a cell‐centred staggered‐grid discretization. Both employ otherwise identical orthogonal Cartesian meshes. It is found that if mixed‐order interpolation is used in the construction of the Galerkin coarse‐grid approximation (CGA), a close‐to‐optimum mesh‐independent scaling of the AMG convergence is observed with similar convergence rates for both discretizations. If, on the other hand, an equal‐order interpolation is used, convergence rates are mesh‐dependent but the scaling differs in each case. For the collocated‐grid case, it depends both on the mesh size, h (or bandwidth Q～h^?1) and on the total number of grids, G, whereas for the staggered‐grid case it depends only on Q. Comparing the two characteristics reveals that the Q‐dependent parts are very similar; it is only in the G‐dependent convergence for the collocated‐grid case that they differ. This takes the form of stepped reductions in the AMG convergence rate (implying step reductions in the quality of the Galerkin CGA that correlate exactly with step increases in G). These findings reinforce previous evidence that, for optimum mesh‐independent performance, mixed‐order interpolations should be used in forming Galerkin CGAs for coupled Navier–Stokes problems. Copyright © 2010 John Wiley & Sons, Ltd.     

From h to p efficiently: optimal implementation strategies for explicit time‐dependent problems using the spectral/hp element method

We investigate the relative performance of a second‐order Adams–Bashforth scheme and second‐order and fourth‐order Runge–Kutta schemes when time stepping a 2D linear advection problem discretised using a spectral/hp element technique for a range of different mesh sizes and polynomial orders. Numerical experiments explore the effects of short (two wavelengths) and long (32 wavelengths) time integration for sets of uniform and non‐uniform meshes. The choice of time‐integration scheme and discretisation together fixes a CFL limit that imposes a restriction on the maximum time step, which can be taken to ensure numerical stability. The number of steps, together with the order of the scheme, affects not only the runtime but also the accuracy of the solution. Through numerical experiments, we systematically highlight the relative effects of spatial resolution and choice of time integration on performance and provide general guidelines on how best to achieve the minimal execution time in order to obtain a prescribed solution accuracy. The significant role played by higher polynomial orders in reducing CPU time while preserving accuracy becomes more evident, especially for uniform meshes, compared with what has been typically considered when studying this type of problem.© 2014. The Authors. International Journal for Numerical Methods in Fluids published by John Wiley & Sons, Ltd.     

Mono‐block and non‐matching multi‐block structured mesh adaptation based on aerodynamic functional total derivatives for RANS flow

An enhanced goal‐oriented mesh adaptation method is presented based on aerodynamic functional total derivatives with respect to mesh nodes in a Reynolds‐Averaged Navier‐Stokes (RANS) finite‐volume mono‐block and non‐matching multi‐block‐structured grid framework. This method falls under the category of methods involving the adjoint vector of the function of interest. The contribution of a Spalart–Allmaras turbulence model is taken into account through its linearization. Meshes are adapted accordingly to the proposed indicator. Applications to 2D RANS flow about a RAE2822 airfoil in transonic, and detached subsonic conditions are presented for the drag coefficient estimation. The asset of the proposed method is patent. The obtained 2D anisotropic mono‐block mesh well captures flow features as well as global aerodynamic functionals. Interestingly, the constraints imposed by structured grids may be relaxed by the use of non‐matching multi‐block approach that limits the outward propagation of local mesh refinement through all of the computational domain. The proposed method also leads to accurate results for these multi‐block meshes but at a fraction of the cost. Finally, the method is also successfully applied to a more complex geometry, namely, a mono‐block mesh in a 3D RANS transonic flow about an M6 wing. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

High‐order ADER‐WENO ALE schemes on unstructured triangular meshes—application of several node solvers to hydrodynamics and magnetohydrodynamics

In this paper, we present a class of high‐order accurate cell‐centered arbitrary Lagrangian–Eulerian (ALE) one‐step ADER weighted essentially non‐oscillatory (WENO) finite volume schemes for the solution of nonlinear hyperbolic conservation laws on two‐dimensional unstructured triangular meshes. High order of accuracy in space is achieved by a WENO reconstruction algorithm, while a local space–time Galerkin predictor allows the schemes to be high order accurate also in time by using an element‐local weak formulation of the governing PDE on moving meshes. The mesh motion can be computed by choosing among three different node solvers, which are for the first time compared with each other in this article: the node velocity may be obtained either (i) as an arithmetic average among the states surrounding the node, as suggested by Cheng and Shu, or (ii) as a solution of multiple one‐dimensional half‐Riemann problems around a vertex, as suggested by Maire, or (iii) by solving approximately a multidimensional Riemann problem around each vertex of the mesh using the genuinely multidimensional Harten–Lax–van Leer Riemann solver recently proposed by Balsara et al. Once the vertex velocity and thus the new node location have been determined by the node solver, the local mesh motion is then constructed by straight edges connecting the vertex positions at the old time level tⁿ with the new ones at the next time level t^{n + 1}. If necessary, a rezoning step can be introduced here to overcome mesh tangling or highly deformed elements. The final ALE finite volume scheme is based directly on a space–time conservation formulation of the governing PDE system, which therefore makes an additional remapping stage unnecessary, as the ALE fluxes already properly take into account the rezoned geometry. In this sense, our scheme falls into the category of direct ALE methods. Furthermore, the geometric conservation law is satisfied by the scheme by construction. We apply the high‐order algorithm presented in this paper to the Euler equations of compressible gas dynamics as well as to the ideal classical and relativistic magnetohydrodynamic equations. We show numerical convergence results up to fifth order of accuracy in space and time together with some classical numerical test problems for each hyperbolic system under consideration. Copyright © 2014 John Wiley & Sons, Ltd.     

Combined swept region and intersection‐based single‐material remapping method

A typical arbitrary Lagrangian–Eulerian algorithm consists of a Lagrangian step, where the computational mesh moves with the fluid flow; a rezoning step, where the computational mesh is smoothed and repaired in case it gets too distorted; and a remapping step, where all fluid quantities are conservatively interpolated on this new mesh. In single‐material simulations, the remapping process can be represented in a flux form, with fluxes approximated by integrating a reconstructed function over intersections of neighboring computational cells on the original and rezoned computational mesh. This algorithm is complex and computationally demanding – Therefore, a simpler approach that utilizes regions swept by the cell edges during rezoning is often used in practice. However, it has been observed that such simplification can lead to distortion of the solution symmetry, especially when the mesh movement is not bound by such symmetry. For this reason, we propose an algorithm combining both approaches in a similar way that was proposed for multi‐material remapping (two‐step hybrid remap). Intersections and exact integration are employed only in certain parts of the computational mesh, marked by a switching function – Various different criteria are presented in this paper. The swept‐based method is used elsewhere in areas that are not marked. This way, our algorithm can retain the beneficial symmetry‐preserving capabilities of intersection‐based remapping while keeping the overall computational cost moderate.     

A novel non‐upwind,interconnected, multi‐grid,overlapping numerical procedure for problems involving fluid flow

A novel numerical procedure for heat, mass and momentum transfer in fluid flow is presented. The new scheme is passed on a non‐upwind, interconnected, multi‐grid, overlapping (NIMO) finite‐difference algorithm. In 2D flows, the NIMO algorithm solves finite‐difference equations for each dependent variable on four overlapping grids. The finite‐difference equations are formulated using the control‐volume approach, such that no interpolations are needed for computing the convective fluxes. For a particular dependent variable, four fields of values are produced. The NIMO numerical procedure is tested against the exact solution of two test problems. The first test problem is an oblique laminar 2D flow with a double step abrupt change in a passive scalar variable for infinite Peclet number. The second test problem is a rotating radial flow in an annular sector with a single step abrupt change in a passive scalar variable for infinite Peclet number. The NIMO scheme produced essentially the exact solution using different uniform and non‐uniform square and rectangular grids for 45 and 30° angle of inclination. All other schemes were unable to capture the exact solution, especially for the rectangular and non‐uniform grids. The NIMO scheme was also successful in predicting the exact solution for the rotating radial flow, using a uniform cylindrical‐polar coordinate grid. Copyright © 2008 John Wiley & Sons, Ltd.     

High‐order stable interpolations for immersed boundary methods

The analysis and improvement of an immersed boundary method (IBM) for simulating turbulent flows over complex geometries are presented. Direct forcing is employed. It consists in interpolating boundary conditions from the solid body to the Cartesian mesh on which the computation is performed. Lagrange and least squares high‐order interpolations are considered. The direct forcing IBM is implemented in an incompressible finite volume Navier–Stokes solver for direct numerical simulations (DNS) and large eddy simulations (LES) on staggered grids. An algorithm to identify the body and construct the interpolation schemes for arbitrarily complex geometries consisting of triangular elements is presented. A matrix stability analysis of both interpolation schemes demonstrates the superiority of least squares interpolation over Lagrange interpolation in terms of stability. Preservation of time and space accuracy of the original solver is proven with the laminar two‐dimensional Taylor–Couette flow. Finally, practicability of the method for simulating complex flows is demonstrated with the computation of the fully turbulent three‐dimensional flow in an air‐conditioning exhaust pipe. Copyright © 2006 John Wiley & Sons, Ltd.     

Fourier analysis of several finite difference schemes for the one‐dimensional unsteady convection–diffusion equation

This paper reports a comparative study on the stability limits of nine finite difference schemes to discretize the one‐dimensional unsteady convection–diffusion equation. The tested schemes are: (i) fourth‐order compact; (ii) fifth‐order upwind; (iii) fourth‐order central differences; (iv) third‐order upwind; (v) second‐order central differences; and (vi) first‐order upwind. These schemes were used together with Runge–Kutta temporal discretizations up to order six. The remaining schemes are the (vii) Adams–Bashforth central differences, (viii) the Quickest and (ix) the Leapfrog central differences. In addition, the dispersive and dissipative characteristics of the schemes were compared with the exact solution for the pure advection equation, or simple first or second derivatives, and numerical experiments confirm the Fourier analysis. The results show that fourth‐order Runge–Kutta, together with central schemes, show good conditional stability limits and good dispersive and dissipative spectral resolution. Overall the fourth‐order compact is the recommended scheme. Copyright © 2001 John Wiley & Sons, Ltd.     

Implicit preconditioned high‐order compact scheme for the simulation of the three‐dimensional incompressible Navier–Stokes equations with pseudo‐compressibility method

This paper combines the pseudo‐compressibility procedure, the preconditioning technique for accelerating the time marching for stiff hyperbolic equations, and high‐order accurate central compact scheme to establish the code for efficiently and accurately solving incompressible flows numerically based on the finite difference discretization. The spatial scheme consists of the sixth‐order compact scheme and 10th‐order numerical filter operator for guaranteeing computational stability. The preconditioned pseudo‐compressible Navier–Stokes equations are marched temporally using the implicit lower–upper symmetric Gauss–Seidel time integration method, and the time accuracy is improved by the dual‐time step method for the unsteady problems. The efficiency and reliability of the present procedure are demonstrated by applications to Taylor decaying vortices phenomena, double periodic shear layer rolling‐up problem, laminar flow over a flat plate, low Reynolds number unsteady flow around a circular cylinder at Re = 200, high Reynolds number turbulence flow past the S809 airfoil, and the three‐dimensional flows through two 90°curved ducts of square and circular cross sections, respectively. It is found that the numerical results of the present algorithm are in good agreement with theoretical solutions or experimental data. Copyright © 2011 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.     

The Lagrange–Galerkin method for the two‐dimensional shallow water equations on adaptive grids

The weak Lagrange–Galerkin finite element method for the two‐dimensional shallow water equations on adaptive unstructured grids is presented. The equations are written in conservation form and the domains are discretized using triangular elements. Lagrangian methods integrate the governing equations along the characteristic curves, thus being well suited for resolving the non‐linearities introduced by the advection operator of the fluid dynamics equations. An additional fortuitous consequence of using Lagrangian methods is that the resulting spatial operator is self‐adjoint, thereby justifying the use of a Galerkin formulation; this formulation has been proven to be optimal for such differential operators. The weak Lagrange–Galerkin method automatically takes into account the dilation of the control volume, thereby resulting in a conservative scheme. The use of linear triangular elements permits the construction of accurate (by virtue of the second‐order spatial and temporal accuracies of the scheme) and efficient (by virtue of the less stringent Courant–Friedrich–Lewy (CFL) condition of Lagrangian methods) schemes on adaptive unstructured triangular grids. Lagrangian methods are natural candidates for use with adaptive unstructured grids because the resolution of the grid can be increased without having to decrease the time step in order to satisfy stability. An advancing front adaptive unstructured triangular mesh generator is presented. The highlight of this algorithm is that the weak Lagrange–Galerkin method is used to project the conservation variables from the old mesh onto the newly adapted mesh. In addition, two new schemes for computing the characteristic curves are presented: a composite mid‐point rule and a general family of Runge–Kutta schemes. Results for the two‐dimensional advection equation with and without time‐dependent velocity fields are illustrated to confirm the accuracy of the particle trajectories. Results for the two‐dimensional shallow water equations on a non‐linear soliton wave are presented to illustrate the power and flexibility of this strategy. Copyright © 2000 John Wiley & Sons, Ltd.     

Two‐dimensional implicit time‐dependent calculations on adaptive unstructured meshes with time evolving boundaries

An implicit multigrid‐driven algorithm for two‐dimensional incompressible laminar viscous flows has been coupled with a solution adaptation method and a mesh movement method for boundary movement. Time‐dependent calculations are performed implicitly by regarding each time step as a steady‐state problem in pseudo‐time. The method of artificial compressibility is used to solve the flow equations. The solution mesh adaptation method performs local mesh refinement using an incremental Delaunay algorithm and mesh coarsening by means of edge collapse. Mesh movement is achieved by modeling the computational domain as an elastic solid and solving the equilibrium equations for the stress field. The solution adaptation method has been validated by comparison with experimental results and other computational results for low Reynolds number flow over a shedding circular cylinder. Preliminary validation of the mesh movement method has been demonstrated by a comparison with experimental results of an oscillating airfoil and with computational results for an oscillating cylinder. Copyright © 2005 John Wiley & Sons, Ltd.     

CFD simulation of two‐ and three‐dimensional free‐surface flow

The paper describes the implementation of moving‐mesh and free‐surface capabilities within a 3‐d finite‐volume Reynolds‐averaged‐Navier–Stokes solver, using surface‐conforming multi‐block structured meshes. The free‐surface kinematic condition can be applied in two ways: enforcing zero net mass flux or solving the kinematic equation by a finite‐difference method. The free surface is best defined by intermediate control points rather than the mesh vertices. Application of the dynamic boundary condition to the piezometric pressure at these points provides a hydrostatic restoring force which helps to eliminate any unnatural free‐surface undulations. The implementation of time‐marching methods on moving grids are described in some detail and it is shown that a second‐order scheme must be applied in both scalar‐transport and free‐surface equations if flows driven by free‐surface height variations are to be computed without significant wave attenuation using a modest number of time steps. Computations of five flows of theoretical and practical interest—forced motion in a pump, linear waves in a tank, quasi‐1d flow over a ramp, solitary wave interaction with a submerged obstacle and 3‐d flow about a surface‐penetrating cylinder—are described to illustrate the capabilities of our code and methods. Copyright © 2003 John Wiley & Sons, Ltd.     

Accuracy and stability of a set of free‐surface time‐domain boundary element models based on B‐splines

An analysis is given for the accuracy and stability of some perturbation‐based time‐domain boundary element models (BEMs) with B‐spline basis functions, solving hydrodynamic free‐surface problems, including forward speed effects. The spatial convergence rate is found as a function of the order of the B‐spline basis. It is shown that for all the models examined the mixed implicit–explicit Euler time integration scheme is correct to second order. Stability diagrams are found for models based on B‐splines of orders third through to sixth for two different time integration schemes. The stability analysis can be regarded as an extension of the analysis by Vada and Nakos [Vada T, Nakos DE. Time marching schemes for ship motion simulations. In Proceedings of the 8th International Workshop on Water Waves and Floating Bodies, St. John's, Newfoundland, Canada, 1993; 155–158] to include B‐splines of orders higher than three (piecewise quadratic polynomials) and to include finite water depth and a current at an oblique angle to the model grid. Copyright © 2000 John Wiley & Sons, Ltd.     

Towards consistent hybrid overset mesh methods for rotorcraft CFD

The overset mesh method chimera is popular within the rotorcraft research community, because the use of multiple, non‐matching grids make the CFD simulations of bodies in relative motion much simpler. Consequently, the relative motion between the helicopter blades and fuselage can be accurately accounted for. In this paper, the method for treating overset grids within CFD codes is presented. It is compatible with multi‐block, structured‐grid solvers. The proposed method is based on hierarchy of overset, non‐matching grids, whose cells are automatically identified as computational or non‐computational and localised with respect to all grids they overlap with. The efficiency of the method relies on the hierarchical, multi‐step approach, for the overset mesh localisation and the use of a tree search. Because of the high efficiency of the algorithm, the search for overlapping cells can be carried out on‐the‐fly, during time‐marching of the unsteady, implicit CFD solver. In addition, the algorithm is suitable for parallel execution. The method has been demonstrated for several flows, ranging from simple aerofoils to rotor‐body interaction. The paper presents and demonstrates the method and shows that it has a low CPU overhead. It also highlights the limitations of the method and suggests remedies for improvement. Copyright © 2013 John Wiley & Sons, Ltd.     

A transformation‐free HOC scheme for steady convection–diffusion on non‐uniform grids

A higher order compact (HOC) finite difference solution procedure has been proposed for the steady two‐dimensional (2D) convection–diffusion equation on non‐uniform orthogonal Cartesian grids involving no transformation from the physical space to the computational space. Effectiveness of the method is seen from the fact that for the first time, an HOC algorithm on non‐uniform grid has been extended to the Navier–Stokes (N–S) equations. Apart from avoiding usual computational complexities associated with conventional transformation techniques, the method produces very accurate solutions for difficult test cases. Besides including the good features of ordinary HOC schemes, the method has the advantage of better scale resolution with smaller number of grid points, with resultant saving of memory and CPU time. Gain in time however may not be proportional to the decrease in the number of grid points as grid non‐uniformity imparts asymmetry to some of the associated matrices which otherwise would have been symmetric. The solution procedure is also highly robust as it computes complex flows such as that in the lid‐driven square cavity at high Reynolds numbers (Re), for which no HOC results have so far been seen. Copyright © 2004 John Wiley & Sons, Ltd.