Algebraic multigrid and incompressible fluid flow

This paper is concerned with the development of algebraic multigrid (AMG) solution methods for the coupled vector–scalar fields of incompressible fluid flow. It addresses in particular the problems of unstable smoothing and of maintaining good vector–scalar coupling in the AMG coarse‐grid approximations. Two different approaches have been adopted. The first is a direct approach based on a second‐order discrete‐difference formulation in primitive variables. Here smoothing is stabilized using a minimum residual control harness and velocity–pressure coupling is maintained by employing a special interpolation during the construction of the inter‐grid transfer operators. The second is an indirect approach that avoids the coupling problem altogether by using a fourth‐order discrete‐difference formulation in a single scalar‐field variable, primitive variables being recovered in post‐processing steps. In both approaches the discrete‐difference equations are for the steady‐state limit (infinite time step) with a fully implicit treatment of advection based on central differencing using uniform and non‐uniform unstructured meshes. They are solved by Picard iteration, the AMG solvers being used repeatedly for each linear approximation. Both classical AMG (C‐AMG) and smoothed‐aggregation AMG (SA‐AMG) are used. In the direct approach, the SA‐AMG solver (with inter‐grid transfer operators based on mixed‐order interpolation) provides an almost mesh‐independent convergence. In the indirect approach for uniform meshes, the C‐AMG solver (based on a Jacobi‐relaxed interpolation) provides solutions with an optimum scaling of the convergence rates. For non‐uniform meshes this convergence becomes mesh dependent but the overall solution cost increases relatively slowly with increasing mesh bandwidth. Copyright © 2006 John Wiley & Sons, Ltd.     

Stabilisation of AMG solvers for saddle‐point stokes problems

When a block factorisation is used to precondition the saddle‐point equations of the discrete Stokes problem, the stability that this gives for the relaxation of residual errors may not be conserved in the coarse‐grid approximations (CGA) of algebraic multi‐grid (AMG) solvers. If the same first‐order interpolation is used in the inter‐grid transfer operators for the scalar and the vector fields, the conditioning degrades with each coarsening step until eventually a critical coarsening is reached beyond which residual errors are no longer damped and will become divergent with any further coarsening. It is shown that by introducing the same block pre‐conditioner as an integral part of the coarsening algorithm, stable smoothing can be maintained at all levels of the CGA. The pre‐conditioning need only be applied at preselected grid levels, one immediately before the critical threshold and others beyond that level if required. Excessive complexity in the CGA is thereby avoided. The method is purely algebraic and may be used for both classical AMG solvers and for smoothed‐aggregation AMG solvers. It should be applicable to other coupled vector and scalar fields in science and engineering that involve second‐order (block‐diagonal) and first‐order (block‐off‐diagonal) discrete difference operators. Copyright © 2015 John Wiley & Sons, Ltd.     

Performance of algebraic multi‐grid solvers based on unsmoothed and smoothed aggregation schemes

A comparison is made of the performance of two algebraic multi‐grid (AMG0 and AMG1) solvers for the solution of discrete, coupled, elliptic field problems. In AMG0, the basis functions for each coarse grid/level approximation (CGA) are obtained directly by unsmoothed aggregation, an appropriate scaling being applied to each CGA to improve consistency. In AMG1 they are assembled using a smoothed aggregation with a constrained energy optimization method providing the smoothing. Although more costly, smoothed basis functions provide a better (more consistent) CGA. Thus, AMG1 might be viewed as a benchmark for the assessment of the simpler AMG0. Selected test problems for D'Arcy flow in pipe networks, Fick diffusion, plane strain elasticity and Navier–Stokes flow (in a Stokes approximation) are used in making the comparison. They are discretized on the basis of both structured and unstructured finite element meshes. The range of discrete equation sets covers both symmetric positive definite systems and systems that may be non‐symmetric and/or indefinite. Both global and local mesh refinements to at least one order of resolving power are examined. Some of these include anisotropic refinements involving elements of large aspect ratio; in some hydrodynamics cases, the anisotropy is extreme, with aspect ratios exceeding two orders. As expected, AMG1 delivers typical multi‐grid convergence rates, which for all practical purposes are independent of mesh bandwidth. AMG0 rates are slower. They may also be more discernibly mesh‐dependent. However, for the range of mesh bandwidths examined, the overall cost effectiveness of the two solvers is remarkably similar when a full convergence to machine accuracy is demanded. Thus, the shorter solution times for AMG1 do not necessarily compensate for the extra time required for its costly grid generation. This depends on the severity of the problem and the demanded level of convergence. For problems requiring few iterations, where grid generation costs represent a significant penalty, AMG0 has the advantage. For problems requiring a large investment in iterations, AMG1 has the edge. However, for the toughest problems addressed (vector and coupled vector–scalar fields discretized exclusively using finite elements of extreme aspect ratio) AMG1 is more robust: AMG0 has failed on some of these tests. However, but for this deficiency AMG0 would be the preferred linear approximation solver for Navier–Stokes solution algorithms in view of its much lower grid generation costs. Copyright © 2001 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.     

Anisotropic mesh adaptation: towards user‐independent,mesh‐independent and solver‐independent CFD. Part I: general principles

The present paper is the lead article in a three‐part series on anisotropic mesh adaptation and its applications to structured and unstructured meshes. A flexible approach is proposed and tested on two‐dimensional, inviscid and viscous, finite volume and finite element flow solvers, over a wide range of speeds. The directional properties of an interpolation‐based error estimate, extracted from the Hessian of the solution, are used to control the size and orientation of mesh edges. The approach is encapsulated into an edge‐based anisotropic mesh optimization methodology (MOM), which uses a judicious sequence of four local operations: refinement, coarsening, edge swapping and point movement, to equi‐distribute the error estimate along all edges, without any recourse to remeshing. The mesh adaptation convergence of the MOM loop is carefully studied for a wide variety of test cases. The mesh optimization generic coupling of MOM with finite volume and finite element flow solvers is shown to yield the same final mesh no matter what the starting point is. It is also shown that on such optimized meshes, the need for computational fluid dynamics (CFD) stabilization artifices, such as upwinding or artificial viscosity, are drastically reduced, if not altogether eliminated, in most well‐posed formulations. These two conclusions can be considered significant steps towards mesh‐independent and solver‐independent CFD. The structure of the three‐part series is thus, 1, general principles; 2, methodology and applications to structured and unstructured grids; 3, applications to three‐dimensional flows. Copyright © 2000 John Wiley & Sons, Ltd.     

A low cost implementation of the Phillips model in solid–liquid flow modeling

The interpolation requirements for the loosely coupled finite element solution of the Navier–Stokes equations and Phillips shear‐induced particle diffusion model are discussed. It is shown that a second‐order approximation of the fluid velocity field is required to adequately capture the spatial derivatives of the rate‐of‐strain tensor. To circumvent this limitation, a shear‐rate smoothing procedure is introduced, thereby allowing the use of lower‐order approximations for the fluid phase. Numerical experiments comparing the convergence and CPU cost of the different tetrahedral interpolation bases are presented. Copyright © 2009 John Wiley & Sons, Ltd.     

The two‐grid stabilization of equal‐order finite elements for the stokes equations

This work presents a two‐grid stabilized method of equal‐order finite elements for the Stokes problems. This method only offsets the discrete pressure space by the residual of pressure on two grids to circumvent the discrete Babu?ka–Brezzi condition. The method can be done locally in a two‐grid approach without stabilization parameter by projecting the pressure onto a finite element space based on coarse mesh. Also, it leads to a linear system with minimal additional cost in implement. Optimal error estimates are obtained. Finally, some numerical simulations are presented to show stability and accuracy properties of the method. Copyright © 2010 John Wiley & Sons, Ltd.     

Monotone nonlinear finite‐volume method for nonisothermal two‐phase two‐component flow in porous media

This article presents a new nonlinear finite‐volume scheme for the nonisothermal two‐phase two‐component flow equations in porous media. The face fluxes are approximated by a nonlinear two‐point flux approximation, where transmissibilities nonlinearly depend on primary variables. Thereby, we mainly follow the ideas proposed by Le Potier combined with a harmonic averaging point interpolation strategy for the approximation of arbitrary heterogeneous permeability fields on polygonal grids. The behavior of this interpolation strategy is analyzed, and its limitation for highly anisotropic permeability tensors is demonstrated. Moreover, the condition numbers of occurring matrices are compared with linear finite‐volume schemes. Additionally, the convergence behavior of iterative solvers is investigated. Finally, it is shown that the nonlinear scheme is more efficient than its linear counterpart. Copyright © 2016 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.     

An L2‐stable approximation of the Navier–Stokes convection operator for low‐order non‐conforming finite elements

We develop in this paper a discretization for the convection term in variable density unstationary Navier–Stokes equations, which applies to low‐order non‐conforming finite element approximations (the so‐called Crouzeix–Raviart or Rannacher–Turek elements). This discretization is built by a finite volume technique based on a dual mesh. It is shown to enjoy an L² stability property, which may be seen as a discrete counterpart of the kinetic energy conservation identity. In addition, numerical experiments confirm the robustness and the accuracy of this approximation; in particular, in L² norm, second‐order space convergence for the velocity and first‐order space convergence for the pressure are observed. Copyright © 2010 John Wiley & Sons, Ltd.     

Adaptive mesh refinement and coarsening for aerodynamic flow simulations

A new mesh refinement technique for unstructured grids is discussed. The new technique presents the important advantage of maintaining the original grid skewness, thanks to the capability of handling hanging nodes. The paper also presents an interpretation of MacCormack's method in an unstructured grid context. Results for a transonic convergent–divergent nozzle, for a convergent nozzle with a supersonic entrance and for transonic flow over a NACA 0012 airfoil are presented and discussed. Copyright © 2004 John Wiley & Sons, Ltd.     

A novel twice-interpolation finite element method for solid mechanics problems

Formulation and numerical evaluation of a novel twice-interpolation finite element method （TFEM） is presented for solid mechanics problems. In this method, the trial function for Galerkin weak form is constructed through two stages of consecutive interpolation. The primary interpolation follows exactly the same procedure of standard FEM and is further reproduced according to both nodal values and averaged nodal gradients obtained from primary interpolation. The trial functions thus constructed have continuous nodal gradients and contain higher order polynomial without increasing total freedoms. Several benchmark examples and a real dam problem are used to examine the TFEM in terms of accuracy and convergence. Compared with standard FEM, TFEM can achieve significantly better accuracy and higher convergence rate, and the continuous nodal stress can be obtained without any smoothing operation. It is also found that TFEM is insensitive to the quality of the elemental mesh. In addition, the present TFEM can treat the incompressible material without any modification.     

Development of new finite volume schemes on unstructured triangular grid for simulating the gas–liquid two‐phase flow

This paper presents a coupled finite volume inner doubly iterative efficient algorithm for linked equations (IDEAL) with level set method to simulate the incompressible gas–liquid two‐phase flows with moving interfaces on unstructured triangular grid. The finite volume IDEAL method on a collocated grid is employed to solve the incompressible two‐phase Navier–Stokes equations, and the level set method is used to capture the moving interfaces. For the sake of mass conservation, an effective second‐order accurate finite volume scheme is developed to solve the level set equation on triangular grid, which can be implemented much easier than the classical high‐order level set solvers. In this scheme, the value of level set function on the boundary of control volume is approximated using a linear combination of a high‐order Larangian interpolation and a second‐order upwind interpolation. By the rotating slotted disk and stretching and shrinking of a circular fluid element benchmark cases, the mass conservation and accuracy of the new scheme is verified. Then the coupled method is applied to two‐phase flows, including a 2D bubble rising problem and a 2D dam breaking problem. The computational results agree well with those reported in literatures and experimental data. Copyright © 2015 John Wiley & Sons, Ltd.     

An improved Rhie–Chow interpolation scheme for the smoothed‐interface immersed boundary method

Rhie–Chow interpolation is a commonly used method in CFD calculations on a co‐located mesh in order to suppress non‐physical pressure oscillations arising from chequerboard effects. A fully parallelized smoothed‐interface immersed boundary method on a co‐located grid is described in this paper. We discuss the necessity of modifications to the original Rhie–Chow interpolation in order to deal with a locally refined mesh. Numerical simulation with the modified scheme of Choi shows that numerical dissipation due to Rhie–Chow interpolation introduces significant errors at the immersed boundary. To address this issue, we develop an improved Rhie–Chow interpolation scheme that is shown to increase the accuracy in resolving the flow near the immersed boundary. We compare our improved scheme with the modified scheme of Choi by parallel simulations of benchmark flows: (i) flow past a stationary cylinder; (ii) flow past an oscillating cylinder; and (iii) flow past a stationary elliptical cylinder, where Reynolds numbers are tested in the range 10–200. Our improved scheme is significantly more accurate and compares favourably with a staggered grid algorithm. We also develop a scheme to compute the boundary force for the direct‐forcing immersed boundary method efficiently. Copyright © 2016 John Wiley & Sons, Ltd.     

The implementation of an aeronautical CFD flow code onto distributed memory parallel systems

The parallelization of an industrially important in‐house computational fluid dynamics (CFD) code for calculating the airflow over complex aircraft configurations using the Euler or Navier–Stokes equations is presented. The code discussed is the flow solver module of the SAUNA CFD suite. This suite uses a novel grid system that may include block‐structured hexahedral or pyramidal grids, unstructured tetrahedral grids or a hybrid combination of both. To assist in the rapid convergence to a solution, a number of convergence acceleration techniques are employed including implicit residual smoothing and a multigrid full approximation storage scheme (FAS). Key features of the parallelization approach are the use of domain decomposition and encapsulated message passing to enable the execution in parallel using a single programme multiple data (SPMD) paradigm. In the case where a hybrid grid is used, a unified grid partitioning scheme is employed to define the decomposition of the mesh. The parallel code has been tested using both structured and hybrid grids on a number of different distributed memory parallel systems and is now routinely used to perform industrial scale aeronautical simulations. Copyright © 2000 John Wiley & Sons, Ltd.     

Non‐hydrostatic 3D free surface layer‐structured finite volume model for short wave propagation

In this paper a layer‐structured finite volume model for non‐hydrostatic 3D environmental free surface flow is presented and applied to several test cases, which involve the computation of gravity waves. The 3D unsteady momentum and mass conservation equations are solved in a collocated grid made of polyhedrons, which are built from a 2D horizontal unstructured mesh, by just adding several horizontal layers. The mesh built in such a way is unstructured in the horizontal plane, but structured in the vertical direction. This procedure simplifies the mesh generation and at the same time it produces a well‐oriented mesh for stratified flows, which are common in environmental problems. The model reduces to a 2D depth‐averaged shallow water model when one single layer is defined in the mesh. Pressure–velocity coupling is achieved by the Semi‐Implicit Method for Pressure‐Linked Equations algorithm, using Rhie–Chow interpolation to stabilize the pressure field. An attractive property of the model proposed is the ability to compute the propagation of short waves with a rather coarse vertical discretization. Several test cases are solved in order to show the capabilities and numerical stability of the model, including a rectangular free oscillating basin, a radially symmetric wave, short wave propagation over a 1D bar, solitary wave runup on a vertical wall, and short wave refraction over a 2D shoal. In all the cases the numerical results are compared either with analytical or with experimental data. Copyright © 2008 John Wiley & Sons, Ltd.     

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.     

Numerical solution of the incompressible Navier–Stokes equations with an upwind compact difference scheme

A new finite difference method for the discretization of the incompressible Navier–Stokes equations is presented. The scheme is constructed on a staggered‐mesh grid system. The convection terms are discretized with a fifth‐order‐accurate upwind compact difference approximation, the viscous terms are discretized with a sixth‐order symmetrical compact difference approximation, the continuity equation and the pressure gradient in the momentum equations are discretized with a fourth‐order difference approximation on a cell‐centered mesh. Time advancement uses a three‐stage Runge–Kutta method. The Poisson equation for computing the pressure is solved with preconditioning. Accuracy analysis shows that the new method has high resolving efficiency. Validation of the method by computation of Taylor's vortex array is presented. Copyright © 1999 John Wiley & Sons, Ltd.     

Mesh adaptation using C1 interpolation of the solution in an unstructured finite volume solver

The goal of this paper is to show the effectiveness of a newly developed estimate of the truncation error calculated based on C¹ interpolation of the solution weighted by the adjoint solution as the adaptation indicator for an unstructured finite volume solver. We will show that adjoint‐based mesh adaptation based on the corrected functional using the new developed truncation error estimate is capable of adapting the mesh to improve the accuracy of the functional and the convergence rate. Both discrete and continuous adjoint solutions are used for adaptation. Results are significantly better with new truncation error estimate than with previously used estimates.