Impact of the fourth‐order compact difference scheme on computational properties of 3D grids in a nonhydrostatic model

To investigate the potential of the fourth‐order compact difference scheme within the specific context of numerical atmospheric models, a linear baroclinic adjustment system is discretized, using a variety of candidates for practically meaningful staggered 3D grids. A unified method is introduced to derive the dispersion relationship of the baroclinic geostrophic adjustment process. Eight popular 3D grids are obtained by combining contemporary horizontal staggered grids, such as the Arakawa C and Eliassen grids, with optimal vertical grids, such as the Lorenz and Charney‐Phillip (CP) grids, and their time‐staggered versions. The errors produced on the 3D grids in describing the baroclinic geostrophic adjustment process relative to the differential case are compared in terms of frequency and group velocity components with the elimination of implementation error. The results show that by utilizing the fourth‐order compact difference scheme with high precision, instead of the conventional second‐order centered difference scheme, the errors in describing baroclinic geostrophic adjustment process decrease but only when using the combinations of the horizontally staggered Arakawa C grid and the vertically staggered CP or the C/CP grid, the time‐horizontally staggered Eliassen (EL) grid and vertically staggered CP or the EL/CP grid, the C grid and the vertically time‐staggered versions of Lorenz (LTS) grid or C/LTS grid, EL grid and LTS grid or EL/LTS grid. The errors were found to increase for specific waves on the rest grids. It can be concluded that errors produced on the chosen 3D grids do not universally decrease when using the fourth‐order compact difference scheme; hence, care should be taken when implementing the fourth‐order compact difference scheme, otherwise, the expected benefits may be offset by increased errors. Copyright © 2008 John Wiley & Sons, Ltd.     

A fast nested multi‐grid viscous flow solver for adaptive Cartesian/Quad grids

A nested multi‐grid solution algorithm has been developed for an adaptive Cartesian/Quad grid viscous flow solver. Body‐fitted adaptive Quad (quadrilateral) grids are generated around solid bodies through ‘surface extrusion’. The Quad grids are then overlapped with an adaptive Cartesian grid. Quadtree data structures are employed to record both the Quad and Cartesian grids. The Cartesian grid is generated through recursive sub‐division of a single root, whereas the Quad grids start from multiple roots—a forest of Quadtrees, representing the coarsest possible Quad grids. Cell‐cutting is performed at the Cartesian/Quad grid interface to merge the Cartesian and Quad grids into a single unstructured grid with arbitrary cell topologies (i.e., arbitrary polygons). Because of the hierarchical nature of the data structure, many levels of coarse grids have already been built in. The coarsening of the unstructured grid is based on the Quadtree data structure through reverse tree traversal. Issues arising from grid coarsening are discussed and solutions are developed. The flow solver is based on a cell‐centered finite volume discretization, Roe's flux splitting, a least‐squares linear reconstruction, and a differentiable limiter developed by Venkatakrishnan in a modified form. A local time stepping scheme is used to handle very small cut cells produced in cell‐cutting. Several cycling strategies, such as the saw‐tooth, W‐ and V‐cycles, have been studies. The V‐cycle has been found to be the most efficient. In general, the multi‐grid solution algorithm has been shown to greatly speed up convergence to steady state—by one to two orders. Copyright © 2000 John Wiley & Sons, Ltd.     

Combined compact difference method for solving the incompressible Navier–Stokes equations

This paper presents a numerical method for solving the two‐dimensional unsteady incompressible Navier–Stokes equations in a vorticity–velocity formulation. The method is applicable for simulating the nonlinear wave interaction in a two‐dimensional boundary layer flow. It is based on combined compact difference schemes of up to 12th order for discretization of the spatial derivatives on equidistant grids and a fourth‐order five‐ to six‐alternating‐stage Runge–Kutta method for temporal integration. The spatial and temporal schemes are optimized together for the first derivative in a downstream direction to achieve a better spectral resolution. In this method, the dispersion and dissipation errors have been minimized to simulate physical waves accurately. At the same time, the schemes can efficiently suppress numerical grid‐mesh oscillations. The results of test calculations on coarse grids are in good agreement with the linear stability theory and comparable with other works. The accuracy and the efficiency of the current code indicate its potential to be extended to three‐dimensional cases in which full boundary layer transition happens. Copyright © 2011 John Wiley & Sons, Ltd.     

Finite element and implicit Runge–Kutta implementation of an acoustics–convection upstream resolution algorithm for the time‐dependent two‐dimensional Euler equations

The second of a two‐paper series, this paper details a solver for the characteristics‐bias system from the acoustics–convection upstream resolution algorithm for the Euler and Navier–Stokes equations. An integral formulation leads to several surface integrals that allow effective enforcement of boundary conditions. Also presented is a new multi‐dimensional procedure to enforce a pressure boundary condition at a subsonic outlet, a procedure that remains accurate and stable. A classical finite element Galerkin discretization of the integral formulation on any prescribed grid directly yields an optimal discretely conservative upstream approximation for the Euler and Navier–Stokes equations, an approximation that remains multi‐dimensional independently of the orientation of the reference axes and computational cells. The time‐dependent discrete equations are then integrated in time via an implicit Runge–Kutta procedure that in this paper is proven to remain absolutely non‐linearly stable for the spatially‐discrete Euler and Navier–Stokes equations and shown to converge rapidly to steady states, with maximum Courant number exceeding 100 for the linearized version. Even on relatively coarse grids, the acoustics–convection upstream resolution algorithm generates essentially non‐oscillatory solutions for subsonic, transonic and supersonic flows, encompassing oblique‐ and interacting‐shock fields that converge within 40 time steps and reflect reference exact solutions. Copyright © 2005 John Wiley & Sons, Ltd.     

An efficient semi‐implicit subgrid method for free‐surface flows on hierarchical grids

We present a new modelling strategy for improving the efficiency of computationally intensive flow problems in environmental free‐surface flows. The approach combines a recently developed semi‐implicit subgrid method with a hierarchical grid solution strategy. The method allows the incorporation of high‐resolution data on subgrid scale to obtain a more accurate and efficient hydrodynamic model. The subgrid method improves the efficiency of the hierarchical grid method by providing better solutions on coarse grids. The method is applicable to both steady and unsteady flows, but we particularly focus on river flows with steady boundary conditions. There, the combined hierarchical grid–subgrid method reduces the computational effort to obtain a steady state with factors up to 43. For unsteady models, the method can be used for efficiently generating accurate initial conditions on high‐resolution grids. Additionally, the method provides automatic insight in grid convergence. We demonstrate the efficiency and applicability of the method using a schematic test for the vortex shedding around a circular cylinder and a real‐world river case study. Copyright © 2015 John Wiley & Sons, Ltd.     

Parallel‐in‐time simulation of the unsteady Navier–Stokes equations for incompressible flow

In this paper, we present an application of a parallel‐in‐time algorithm for the solution of the unsteady Navier–Stokes model equations that are of parabolic–elliptic type. This method is based on the alternated use of a coarse global sequential solver and a fine local parallel one. A standard finite volume/finite differences first‐order approach is used for discretization of the unsteady two‐dimensional Navier–Stokes equations. The Taylor vortex decay problem and the confined flow around a square cylinder were selected as unsteady flow examples to illustrate and analyse the properties of the parallel‐in‐time method through numerical experiments. The influence of several parameters on the computing time required to perform a parallel‐in‐time calculation on a PC cluster was verified. Among them we have analysed the influence of the number of processors, the number of iterations for convergence, the resolution of the spatial domain and the influence of the time‐step sizes ratio between the coarse and fine grids. Significant computer time saving was achieved when compared with the single processor computing time, particularly when the spatial dimension of the problem is low and the temporal scale is large. Copyright © 2004 John Wiley & Sons, Ltd.     

An aspect ratio agglomeration multigrid for unstructured grids

A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Reliability Issues of LES-Related Approaches in an Industrial Context

Large-Eddy Simulation (LES), Detached-Eddy Simulation (DES) and Scale-Adaptive Simulation (SAS) are increasingly being used as engineering tools to predict the behaviour of complex industrial flows. Often the flows studied have not been examined previously and the required grid resolution is unknown. Industrial users studying these flows tend to be using commercial CFD codes and do not usually have access to high-performance computing facilities. Due to the significant computing times required, it is difficult to undertake systematic grid-dependence studies. There is therefore a risk that LES, DES and SAS will be performed using overly coarse grids which may lead to unreliable predictions. The present work surveys a number of practical techniques that provide a means of assessing the quality of the grid resolution in large-eddy simulations and related approaches. To examine the usefulness of these techniques, a gas release in a ventilated room is examined using DES and SAS. The grid resolution measures indicate that overall the grids used are relatively coarse. Both DES and SAS model predictions are found to be in poor agreement with experimental data compared to steady and unsteady Reynolds-averaged Navier–Stokes (RANS) results using the SST model. The SAS model also shows the greatest grid sensitivity of the four models tested. The work highlights the need for grid-dependence studies and the potential problems of using coarse grids.     

Consistent discretization for simulations of flows with moving generalized curvilinear coordinates

We develop a consistent discretization of conservative momentum and scalar transport for the numerical simulation of flow using a generalized moving curvilinear coordinate system. The formulation guarantees consistency between the discrete transport equation and the discrete mass conservation equation due to grid motion. This enables simulation of conservative transport using generalized curvilinear grids that move arbitrarily in three dimensions while maintaining the desired properties of the discrete transport equation on a stationary grid, such as constancy, conservation, and monotonicity. In addition to guaranteeing consistency for momentum and scalar transport, the formulation ensures geometric conservation and maintains the desired high‐order time accuracy of the discretization on a moving grid. Through numerical examples we show that, when the computation is carried out on a moving grid, consistency between the discretized scalar advection equation and the discretized equation for flow mass conservation due to grid motion is required in order to obtain stable and accurate results. We also demonstrate that significant errors can result when non‐consistent discretizations are employed. Copyright © 2009 John Wiley & Sons, Ltd.     

Numerical simulation of a single bubble by compressible two‐phase fluids

The present work deals with the numerical investigation of a collapsing bubble in a liquid–gas fluid, which is modeled as a single compressible medium. The medium is characterized by the stiffened gas law using different material parameters for the two phases. For the discretization of the stiffened gas model, the approach of Saurel and Abgrall is employed where the flow equations, here the Euler equations, for the conserved quantities are approximated by a finite volume scheme, and an upwind discretization is used for the non‐conservative transport equations of the pressure law coefficients. The original first‐order discretization is extended to higher order applying second‐order ENO reconstruction to the primitive variables. The derivation of the non‐conservative upwind discretization for the phase indicator, here the gas fraction, is presented for arbitrary unstructured grids. The efficiency of the numerical scheme is significantly improved by employing local grid adaptation. For this purpose, multiscale‐based grid adaptation is used in combination with a multilevel time stepping strategy to avoid small time steps for coarse cells. The resulting numerical scheme is then applied to the numerical investigation of the 2‐D axisymmetric collapse of a gas bubble in a free flow field and near to a rigid wall. The numerical investigation predicts physical features such as bubble collapse, bubble splitting and the formation of a liquid jet that can be observed in experiments with laser‐induced cavitation bubbles. Opposite to the experiments, the computations reveal insight to the state inside the bubble clearly indicating that these features are caused by the acceleration of the gas due to shock wave focusing and reflection as well as wave interaction processes. While incompressible models have been used to provide useful predictions on the change of the bubble shape of a collapsing bubble near a solid boundary, we wish to study the effects of shock wave emissions into the ambient liquid on the bubble collapse, a phenomenon that may not be captured using an incompressible fluid model. Copyright © 2009 John Wiley & Sons, Ltd.     

Algebraic–hyperbolic grid generation with precise control of intersection of angles

A new approach to construct high quality meshes for flow calculations is investigated in the context of algebraic grid generation, where the angle of intersection between two alternate co‐ordinate lines can be specified by the user. From an initial grid, new co‐ordinate lines in one parameter direction are determined by solving a set of ordinary differential equations (ODE). These trajectories intersect the alternate co‐ordinate lines of the initial grid in a prescribed angle. The resulting grid function is proven to be folding‐free. The advantages with respect to grid quality achieved by prescribing the angles are gained at the expense that the boundary distribution can only be prescribed on three of four boundaries. In view of a sparse representation of the grid function, the points of intersection are interpolated by a B‐spline surface. Thus, the grid can be accessed evaluating the generated parametric representation of the computational domain. Investigations of several test configurations have shown that useful grids with high resolution can be computed from the B‐spline representation only depending on a small number of locally chosen parameters. Therefore, only a small amount of computational memory is required for storing these parameters and evaluating the grid function can be efficiently performed at reduced computational costs. This is particularly promising when the mesh has to be frequently changed or updated in time. Copyright © 2000 John Wiley & Sons, Ltd.     

Efficiency and scalability of a two‐level Schwarz algorithm for incompressible and compressible flows

This paper studies the application of two‐level Schwarz algorithms to several models of computational fluid dynamics. The purpose is to build an algorithm suitable for elliptic and convective models. The subdomain approximated solution relies on the incomplete lower‐upper factorization. The algebraic coupling between the coarse grid and the Schwarz preconditioner is discussed. The deflation method and the balancing domain decomposition method are studied for introducing the coarse‐grid correction as a preconditioner. Standard coarse grids are built with the characteristic or indicator functions of the subdomains. The building of a set of smooth basis functions (analogous to smoothed‐aggregation methods) is considered. A first test problem is the Poisson problem with a discontinuous coefficient. The two options are compared for the standpoint of coarse‐grid consistency and for the gain in scalability of the global Schwarz iteration. The advection–diffusion model is then considered as a second test problem. Extensions to compressible flows (together with incompressible flows for comparison) are then proposed. Parallel applications are presented and their performance measured. Copyright © 2012 John Wiley & Sons, Ltd.     

Finite‐volume‐type VOF method on dynamically adaptive quadtree grids

This paper describes a finite‐volume volume‐of‐fluid (VOF) method for simulating viscous free surface flows on dynamically adaptive quadtree grids. The scheme is computationally efficient in that it provides relatively fine grid resolution at the gas–liquid interface and coarse grid density in regions where flow variable gradients are small. Special interpolations are used to ensure volume flux conservation where differently sized neighbour cells occur. The numerical model is validated for advection of dyed fluid in unidirectional and rotating flows, and for two‐dimensional viscous sloshing in a rectangular tank. Copyright © 2004 John Wiley & Sons, Ltd.     

Estimate of the truncation error of finite volume discretization of the Navier–Stokes equations on colocated grids

A methodology is proposed for the calculation of the truncation error of finite volume discretizations of the incompressible Navier–Stokes equations on colocated grids. The truncation error is estimated by restricting the solution obtained on a given grid to a coarser grid and calculating the image of the discrete Navier–Stokes operator of the coarse grid on the restricted velocity and pressure field. The proposed methodology is not a new concept but its application to colocated finite volume discretizations of the incompressible Navier–Stokes equations is made possible by the introduction of a variant of the momentum interpolation technique for mass fluxes where the pressure part of the mass fluxes is not dependent on the coefficients of the linearized momentum equations. The theory presented is supported by a number of numerical experiments. The methodology is developed for two‐dimensional flows, but extension to three‐dimensional cases should not pose problems. Copyright © 2005 John Wiley & Sons, Ltd.     

Generation of Voronoi Grid Based on Vorticity for Coarse-Scale Modeling of Flow in Heterogeneous Formations

We present a novel unstructured coarse grid generation technique based on vorticity for upscaling two-phase flow in permeable media. In the technique, the fineness of the gridblocks throughout the domain is determined by vorticity distribution such that where the larger is the vorticity at a region, the finer are the gridblocks at that region. Vorticity is obtained from single-phase flow on original fine grid, and is utilized to generate a background grid which stores spacing parameter, and is used to steer generation of triangular and finally Voronoi grids. This technique is applied to two channelized and heterogeneous models and two-phase flow simulations are performed on the generated coarse grids and, the results are compared with the ones of fine scale grid and uniformly gridded coarse models. The results show a close match of unstructured coarse grid flow results with those of fine grid, and substantial accuracy compared to uniformly gridded coarse grid model.     

Invariant discretization of the incompressible Navier-Stokes equations in boundary fitted co-ordinates

The discretization of the incompressible Navier-Stokes equation on boundary-fitted curvilinear grids is considered. The discretization is based on a staggered grid arrangement and the Navier-;Stokes equations in tensor formulation including Christoffel symbols. It is shown that discretization accuracy is much enhanced by choosing the velocity variables in a special way. The time-dependent equations are solved by a pressure-correction method in combination with a GMRES method. Special attention is paid to the discretization of several types of boundary conditions. It is shown that fairly non-smooth grids may be used using our approach.     

Optimal boundary discretization by variational data assimilation

A variational data assimilation technique applied to the identification of the optimal discretization of interpolation operators and derivatives in the nodes adjacent to the boundary of the domain is discussed in frames of the linear shallow water model. The advantage of controlling the discretization of operators near the boundary rather than boundary conditions is shown. Assimilating data that have been produced by the same model on a finer grid, in a model on a coarse grid, we have shown that optimal discretization allows us to correct such errors of the numerical scheme as under‐resolved boundary layer and wrong wave velocity. Copyright © 2010 John Wiley & Sons, Ltd.     

A structured but non‐uniform Cartesian grid‐based model for the shallow water equations

In large‐scale shallow flow simulations, local high‐resolution predictions are often required in order to reduce the computational cost without losing the accuracy of the solution. This is normally achieved by solving the governing equations on grids refined only to those areas of interest. Grids with varying resolution can be generated by different approaches, e.g. nesting methods, patching algorithms and adaptive unstructured or quadtree gridding techniques. This work presents a new structured but non‐uniform Cartesian grid system as an alternative to the existing approaches to provide local high‐resolution mesh. On generating a structured but non‐uniform Cartesian grid, the whole computational domain is first discretized using a coarse background grid. Local refinement is then achieved by directly allocating a specific subdivision level to each background grid cell. The neighbour information is specified by simple mathematical relationships and no explicit storage is needed. Hence, the structured property of the uniform grid is maintained. After employing some simple interpolation formulae, the governing shallow water equations are solved using a second‐order finite volume Godunov‐type scheme in a similar way as that on a uniform grid. Copyright © 2010 John Wiley & Sons, Ltd.     

Dispersion and stability analyses of the linearized two‐dimensional shallow water equations in boundary‐fitted co‐ordinates

In the present investigation, a Fourier analysis is used to study the phase and group speeds of a linearized, two‐dimensional shallow water equations, in a non‐orthogonal boundary‐fitted co‐ordinate system. The phase and group speeds for the spatially discretized equations, using the second‐order scheme in an Arakawa C grid, are calculated for grids with varying degrees of non‐orthogonality and compared with those obtained from the continuous case. The spatially discrete system is seen to be slightly dispersive, with the degree of dispersivity increasing with an decrease in the grid non‐orthogonality angle or decrease in grid resolution and this is in agreement with the conclusions reached by Sankaranarayanan and Spaulding (J. Comput. Phys., 2003; 184 : 299–320). The stability condition for the non‐orthogonal case is satisfied even when the grid non‐orthogonality angle, is as low as 30° for the Crank Nicolson and three‐time level schemes. A two‐dimensional wave deformation analysis, based on complex propagation factor developed by Leendertse (Report RM‐5294‐PR, The Rand Corp., Santa Monica, CA, 1967), is used to estimate the amplitude and phase errors of the two‐time level Crank–Nicolson scheme. There is no dissipation in the amplitude of the solution. However, the phase error is found to increase, as the grid angle decreases for a constant Courant number, and increases as Courant number increases. Copyright © 2003 John Wiley & Sons, Ltd.     

Fourth‐ and tenth‐order compact finite difference solutions of perturbed circular vortex flows

In this study, high‐order compact finite difference calculations are reported for 2D unsteady incompressible circular vortex flow in primitive variable formulation. The fourth‐order Runge–Kutta temporal discretization is used together with fourth‐ or tenth‐order compact spatial discretization. Dependent on the perturbation initially imposed, the solutions display a tripole, triangular or square vortex. The comparison of the predictions with the detailed spectral calculations of Kloosterziel and Carnevale (J. Fluid Mech. 1999; 388 :217–257) shows that the vorticity fields are very well captured. The spectral resolution of the present method was quantified from the decomposition of the vorticity distribution in its azimuthal components and compared with reported spectral results. Using identical grid resolution to the reference results yields negligible differences in the main features of the flow. The perturbation amplitude and its first harmonic are virtually identical to the reference results for both fourth‐ or tenth‐order spatial discretization, as theoretically expected but seldom a posteriori verified. The differences between the two spatial discretizations appear only for coarser grids, favouring the tenth‐order discretization. Copyright © 2005 John Wiley & Sons, Ltd.