A NON-LINEAR ADAPTIVE FULL TRI-TREE MULTIGRID METHOD FOR THE MIXED FINITE ELEMENT FORMULATION OF THE NAVIER–STOKES EQUATIONS

The full adaptive multigrid method is based on the tri-tree grid generator. The solution of the Navier–Stokes equations is first found for a low Reynolds number. The velocity boundary conditions are then increased and the grid is adapted to the scaled solution. The scaled solution is then used as a start vector for the multigrid iterations. During the multigrid iterations the grid is first recoarsed a specified number of grid levels. The solution of the Navier–Stokes equations with the multigrid residual as right-hand side is smoothed in a fixed number of Newton iterations. The linear equation system in the Newton algorithm is solved iteratively by CGSTAB preconditioned by ILU factorization with coupled node fill-in. The full adaptive multigrid algorithm is demonstr ated for cavity flow. © 1997 by John Wiley & Sons, Ltd. Int. j. numer. methods fluids 24: 1037ndash;1047, 1997.     

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

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

The three-dimensional prolonged adaptive unstructured finite element multigrid method for the Navier–Stokes equations

This paper presents the development of the three- dimensional prolonged adaptive finite element equation solver for the Navier–Stokes equations. The finite element used is the tetrahedron with quadratic approximation of the velocities and linear approximation of the pressure. The equation system is formulated in the basic variables. The grid is adapted to the solution by the element Reynolds number. An element in the grid is refined when the Reynolds number of the element exceeds a preset limit. The global Reynolds number in the investigation is increased by scaling the solution for a lower Reynolds number. The grid is refined according to the scaled solution and the prolonged solution for the lower Reynolds number constitutes the start vector for the higher Reynolds number. Since the Reynolds number is the ratio of convection to diffusion, the grid refinements act as linearization and symmetrization of the equation system. The linear equation system of the Newton formulation is solved by CGSTAB with coupled node fill-in preconditioner. The test problem considered is the three-dimensional driven cavity flow. © 1997 John Wiley & Sons, Ltd.     

AN ADAPTIVE UNSTRUCTURED TRI-TREE ITERATIVE SOLVER FOR MIXED FINITE ELEMENT FORMULATION OF THE STOKES EQUATIONS

An iterative adaptive equation solver for solving the implicit Stokes equations simultaneously with tri-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structure which is mapped to a finite element grid at each hierarchical level. For each hierarchical finite element grid the Stokes equations are solved. The approximate solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached. In order to reduce the overall work, the element matrices are integrated analytically beforehand. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in. The efficiency of the incomplete coupled node fill-in preconditioner is shown to be largely dependent on the global node numbering. The preconditioner is therefore tested for the natural node ordering of the tri-tree grid generator and for different ways of sorting the nodes.     

AN EVALUATION OF THE BOUNCE-BACK BOUNDARY CONDITION FOR LATTICE BOLTZMANN SIMULATIONS

The bounce-back boundary condition for lattice Boltzmann simulations is evaluated for flow about an infinite periodic array of cylinders. The solution is compared with results from a more accurate boundary condition formulation for the lattice Boltemann method and with finite difference solutions. The bounce-back boundary condition is used to simulate boundaries of cylinders with both circular and octagonal cross-sections. The convergences of the velocity and total drag associated with this method are slightly sublinear with grid spacing. Error is also a function of relaxation time, increasing exponentially for large relaxation times. However, the accuracy does not exhibit a trend with Reynolds number between 0·1 and 100. The square lattice Boltzmann grid conforms to the octagonal cylinder but only approximates the circular cylinder, and the resulting error associated with the octagonal cylinder is half the error of the circular cylinder. The bounce-back boundary condition is shown to yield accurate lattice Boltzmann simulations with reduced computational requirements for computational grids of 170×170 or finer, a relaxation time less than 1·5 and any Reynolds number from 0·1 to 100. For this range of parameters the root mean square error in velocity and the relative error in drag coefficient are less than 1 per cent for the octagonal cylinder and 2 per cent for the circular cylinder. © 1997 John Wiley & Sons, Ltd.     

THE PARALLEL BLOCK ADAPTIVE MULTIGRID METHOD FOR THE IMPLICIT SOLUTION OF THE EULER EQUATIONS

A method capable of solving very fast and robust complex non-linear systems of equations is presented. The block adaptive multigrid (BAM) method combines mesh adaptive techniques with multigrid and domain decomposition methods. The overall method is based on the FAS multigrid, but instead of using global grids, locally enriched subgrids are also employed in regions where excessive solution errors are encountered. The final mesh is a composite grid with uniform rectangular subgrids of various mesh densities. The regions where finer grid resolution is necessary are detected using an estimation of the solution error by comparing solutions between grid levels. Furthermore, an alternative domain decomposition strategy has been developed to take advantage of parallel computing machines. The proposed method has been applied to an implicit upwind Euler code (EuFlex) for the solution of complex transonic flows around aerofoils. The efficiency and robustness of the BAM method are demonstrated for two popular inviscid test cases. Up to 19-fold acceleration with respect to the single-grid solution has been achieved, but a further twofold speed-up is possible on four-processor parallel computers.     

ADAPTIVE PARALLEL MULTIGRID SOLUTION OF 2D INCOMPRESSIBLE NAVIER–STOKES EQUATIONS

In this paper an adaptive parallel multigrid method and an application example for the 2D incompressible Navier–Stokes equations are described. The strategy of the adaptivity in the sense of local grid refinement in the multigrid context is the multilevel adaptive technique (MLAT) suggested by Brandt. The parallelization of this method on scalable parallel systems is based on the portable communication library CLIC and the message-passing standards: PARMACS, PVM and MPI. The specific problem considered in this work is a two-dimensional hole pressure problem in which a Poiseuille channel flow is disturbed by a cavity on one side of the channel. Near geometric singularities a very fine grid is needed for obtaining an accurate solution of the pressure value. Two important issues of the efficiency of adaptive parallel multigrid algorithms, namely the data redistribution strategy and the refinement criterion, are discussed here. For approximate dynamic load balancing, new data in the adaptive steps are redistributed into distributed memories in different processors of the parallel system by block remapping. Among several refinement criteria tested in this work, the most suitable one for the specific problem is that based on finite-element residuals from the point of view of self-adaptivity and computational efficiency, since it is a kind of error indicator and can stop refinement algorithms in a natural way for a given tolerance. Comparisons between different global grids without and with local refinement have shown the advantages of the self-adaptive technique, as this can save computer memory and speed up the computing time several times without impairing the numerical accuracy. © 1997 By John Wiley & Sons, Ltd. Int. J. Numer. Methods Fluids 24, 875–892, 1997.     

A local adaptive grid procedure for incompressible flows with multigridding and equidistribution concepts

An adaptive grid solution procedure is developed for incompressible flow problems in which grid refinement based on an equidistribution law is performed in high-error-estimate regions that are flagged from a preliminary coarse grid solution. Solutions on the locally refined and equidistributed meshes are obtained using boundary conditions interpolated from the preliminary coarse grid solution, and solutions on both the refined and coarse grid regions are successively improved using a multigrid approach. For this purpose, suitable correction terms for the coarse grid equations are derived for all variables in the flagged regions. This procedure with Local Adaptation, Multigridding and Equidistribution (LAME) concepts is applied to various flow problems to demonstrate the accuracy improvements obtained using this method.     

Fictitious domain approach for numerical modelling of Navier–Stokes equations

This study investigates a fictitious domain model for the numerical solution of various incompressible viscous flows. It is based on the so‐called Navier–Stokes/Brinkman and energy equations with discontinuous coefficients all over an auxiliary embedding domain. The solid obstacles or walls are taken into account by a penalty technique. Some volumic control terms are directly introduced in the governing equations in order to prescribe immersed boundary conditions. The implicit numerical scheme, which uses an upwind finite volume method on staggered Cartesian grids, is of second‐order accuracy in time and space. A multigrid local mesh refinement is also implemented, using the multi‐level Zoom Flux Interface Correction (FIC) method, in order to increase the precision where it is needed in the domain. At each time step, some iterations of the augmented Lagrangian method combined with a preconditioned Krylov algorithm allow the divergence‐free velocity and pressure fields be solved for. The tested cases concern external steady or unsteady flows around a circular cylinder, heated or not, and the channel flow behind a backward‐facing step. The numerical results are shown in good agreement with other published numerical or experimental data. Copyright © 2000 John Wiley & Sons, Ltd.     

Solution of the Navier–Stokes equations in velocity–vorticity form using a Eulerian–Lagrangian boundary element method

This paper describes the Eulerian–Lagrangian boundary element model for the solution of incompressible viscous flow problems using velocity–vorticity variables. A Eulerian–Lagrangian boundary element method (ELBEM) is proposed by the combination of the Eulerian–Lagrangian method and the boundary element method (BEM). ELBEM overcomes the limitation of the traditional BEM, which is incapable of dealing with the arbitrary velocity field in advection‐dominated flow problems. The present ELBEM model involves the solution of the vorticity transport equation for vorticity whose solenoidal vorticity components are obtained iteratively by solving velocity Poisson equations involving the velocity and vorticity components. The velocity Poisson equations are solved using a boundary integral scheme and the vorticity transport equation is solved using the ELBEM. Here the results of two‐dimensional Navier–Stokes problems with low–medium Reynolds numbers in a typical cavity flow are presented and compared with a series solution and other numerical models. The ELBEM model has been found to be feasible and satisfactory. Copyright © 2000 John Wiley & Sons, Ltd.     

Computation of turbulent free‐surface flows around modern ships

This paper presents the calculated results for three classes of typical modern ships in modelling of ship‐generated waves. Simulations of turbulent free‐surface flows around ships are performed in a numerical water tank, based on the FINFLO‐RANS SHIP solver developed at Helsinki University of Technology. The Reynolds‐averaged Navier–Stokes (RANS) equations with the artificial compressibility and the non‐linear free‐surface boundary conditions are discretized by means of a cell‐centred finite‐volume scheme. The convergence performance is improved with the multigrid method. A free surface is tracked using a moving mesh technology, in which the non‐linear free‐surface boundary conditions are given on the actual location of the free surface. Test cases recommended are a container ship, a US Navy combatant and a tanker. The calculated results are compared with the experimental data available in the literature in terms of the wave profiles, wave pattern, and turbulent flow fields for two turbulence models, Chien's low Reynolds number k–εmodel and Baldwin–Lomax's model. Furthermore, the convergence performance, the grid refinement study and the effect of turbulence models on the waves have been investigated. Additionally, comparison of two types of the dynamic free‐surface boundary conditions is made. Copyright © 2003 John Wiley& Sons, Ltd.     

A CELL VERTEX ALGORITHM FOR THE INCOMPRESSIBLE NAVIER–STOKES EQUATIONS ON NON-ORTHOGONAL GRIDS

The steady, incompressible Navier–Stokes (N–S) equations are discretized using a cell vertex, finite volume method. Quadrilateral and hexahedral meshes are used to represent two- and three-dimensional geometries respectively. The dependent variables include the Cartesian components of velocity and pressure. Advective fluxes are calculated using bounded, high-resolution schemes with a deferred correction procedure to maintain a compact stencil. This treatment insures bounded, non-oscillatory solutions while maintaining low numerical diffusion. The mass and momentum equations are solved with the projection method on a non-staggered grid. The coupling of the pressure and velocity fields is achieved using the Rhie and Chow interpolation scheme modified to provide solutions independent of time steps or relaxation factors. An algebraic multigrid solver is used for the solution of the implicit, linearized equations. A number of test cases are anlaysed and presented. The standard benchmark cases include a lid-driven cavity, flow through a gradual expansion and laminar flow in a three-dimensional curved duct. Predictions are compared with data, results of other workers and with predictions from a structured, cell-centred, control volume algorithm whenever applicable. Sensitivity of results to the advection differencing scheme is investigated by applying a number of higher-order flux limiters: the MINMOD, MUSCL, OSHER, CLAM and SMART schemes. As expected, studies indicate that higher-order schemes largely mitigate the diffusion effects of first-order schemes but also shown no clear preference among the higher-order schemes themselves with respect to accuracy. The effect of the deferred correction procedure on global convergence is discussed.     

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.     

Numerical simulation of fluid flows using an unstructured finite volume method with adaptive tri‐tree grids

A tri‐tree grid generation procedure is developed together with a finite volume method on the unstructured grid for solving the Navier–Stokes equations. A hierarchic numbering system for the data structure is used. The grid is adapted by adding and removing cell elements dependent on the vorticity magnitude. A special treatment is developed to ensure good quality triangular elements around the cylinder boundary. The adopted finite volume method is based on the cell‐centred scheme. The pressure–velocity coupling is treated using the SIMPLE algorithm. A modified QUICK scheme for unstructured grids is derived. The developed method is used to simulate the flow past a single and multiple cylinders at low Reynolds number. The obtained results are in good agreement with the published data. Copyright © 2002 John Wiley & Sons, Ltd.     

Multigrid solutions of the Euler and Navier–Stokes equations on unstructured grids

A computationally efficient multigrid algorithm for upwind edge‐based finite element schemes is developed for the solution of the two‐dimensional Euler and Navier–Stokes equations on unstructured triangular grids. The basic smoother is based upon a Galerkin approximation employing an edge‐based formulation with the explicit addition of an upwind‐type local extremum diminishing (LED) method. An explicit time stepping method is used to advance the solution towards the steady state. Fully unstructured grids are employed to increase the flexibility of the proposed algorithm. A full approximation storage (FAS) algorithm is used as the basic multigrid acceleration procedure. Copyright © 1999 John Wiley & Sons, Ltd.     

基于SIMPLER算法的多重网格方法研究

以二维方腔顶盖驱动流为模型,将多重网格方法和SIMPLER算法进行耦合,对不同雷诺数下多重网格加速SIMPLER算法和SIMPLER算法的计算效率进行了对比,数值计算表明:多重网格加速SIMPLER算法不仅能够解决SIMPLER算法不能准确模拟较高雷诺数流场的问题,而且其计算效率远远高于SIMPLER算法.本文也对松弛因子的选取、多重网格实现形式以及网格层数对多重网格加速SIMPLER算法的影响进行了研究,从而为多重网格加速SIMPLER算法的实施提供了计算技术.     

A 3D incompressible Navier–Stokes velocity–vorticity weak form finite element algorithm

The velocity–vorticity formulation is selected to develop a time‐accurate CFD finite element algorithm for the incompressible Navier–Stokes equations in three dimensions.The finite element implementation uses equal order trilinear finite elements on a non‐staggered hexahedral mesh. A second order vorticity kinematic boundary condition is derived for the no slip wall boundary condition which also enforces the incompressibility constraint. A biconjugate gradient stabilized (BiCGSTAB) sparse iterative solver is utilized to solve the fully coupled system of equations as a Newton algorithm. The solver yields an efficient parallel solution algorithm on distributed‐memory machines, such as the IBM SP2. Three dimensional laminar flow solutions for a square channel, a lid‐driven cavity, and a thermal cavity are established and compared with available benchmark solutions. Copyright © 2002 John Wiley & Sons, Ltd.     

Segmented multigrid domain decomposition procedure for incompressible viscous flows

The application of grid stretching or grid adaptation is generally required in order to optimize the distribution of nodal points for fluid-dynamic simulation. This is necessitated by the presence of disjoint high gradient zones, that represent boundary or free shear layers, reversed flow or vortical flow regions, triple deck structures, etc. A domain decomposition method can be used in conjunction with an adaptive multigrid algorithm to provide an effective methodology for the development of optimal grids. In the present study, the Navier-Stokes (NS) equations are approximated with a reduced Navier-Stokes (RNS) system, that represents the lowest-order terms in an asymptotic Re expansion. This system allows for simplified boundary conditions, more generality in the location of the outflow boundary, and ensures mass conservation in all subdomain grid interfaces, as well as at the outflow boundary. The higher-order (NS) diffusion terms are included through a deferred corrector, in selected subdomains, when necessary. Adaptivity in the direction of refinement is achieved by grid splitting or domain decomposition in each level of the multigrid procedure. Normalized truncation error estimates of key derivatives are used to determine the boundaries of these subdomains. The refinement is optimized in two co-ordinate directions independently. Multidirectional adaptivity eliminates the need for grid stretching so that uniform grids are specified in each subdomain. The overall grid consists of multiple domains with different meshes and is, therefore, heavily graded. Results and computational efficiency are discussed for the laminar flow over a finite length plate and for the laminar internal flow in a backward-facing step channel.     

A multigrid procedure for Cartesian ghost‐cell methods

This paper proposes a multigrid technique for Cartesian grid flow solvers. A recently developed ghost body‐cell method for inviscid flows is combined with a nested‐level local refinement procedure, which employs multigrid to accelerate convergence to steady state. Different from standard multigrid applications for body‐fitted grids, a fictitious residual needs to be defined in the ghost cells to perform a correct residual collection and thus to avoid possible stalling of the multigrid procedure. The efficiency of the proposed local refinement multigrid Cartesian method is demonstrated for the case of the inviscid subsonic flow past a circular body. Copyright © 2008 John Wiley & Sons, Ltd.     

Implicit time‒accurate solutions on unstructured dynamic grids

In this paper an unstructured multigrid algorithm is used as an iterative solution procedure for the discrete equations arising from an implicit time discretization of the unsteady Euler equations on tetrahedral grids. To calculate unsteady flows due to oscillating boundaries, a novel grid movement algorithm is introduced in which an elliptic equation with a non‒linear diffusion coefficient is used to define the displacement of interior grid nodes. This allows large grid displacements to be calculated in a single step. The multigrid technique uses an edge‒collapsing algorithm to generate a sequence of grids, and a pseudo‒time‒stepping smoother. On the coarser grids, no grid motion is used. Instead, surface normals are rotated consistently and transfer/interpolation weights are based on the time‒averaged grid co‒ordinates. A 2D NACA0012 test case is used to validate the programme. 3D results are presented for the M6 wing and a full aircraft configuration. © 1997 John Wiley & Sons, Ltd.