An adaptive cut‐cell method for environmental fluid mechanics

In this work we present a numerical method for solving the incompressible Navier–Stokes equations in an environmental fluid mechanics context. The method is designed for the study of environmental flows that are multiscale, incompressible, variable‐density, and within arbitrarily complex and possibly anisotropic domains. The method is new because in this context we couple the embedded‐boundary (or cut‐cell) method for complex geometry with block‐structured adaptive mesh refinement (AMR) while maintaining conservation and second‐order accuracy. The accurate simulation of variable‐density fluids necessitates special care in formulating projection methods. This variable‐density formulation is well known for incompressible flows in unit‐aspect ratio domains, without AMR, and without complex geometry, but here we carefully present a new method that addresses the intersection of these issues. The methodology is based on a second‐order‐accurate projection method with high‐order‐accurate Godunov finite‐differencing, including slope limiting and a stable differencing of the nonlinear convection terms. The finite‐volume AMR discretizations are based on two‐way flux matching at refinement boundaries to obtain a conservative method that is second‐order accurate in solution error. The control volumes are formed by the intersection of the irregular embedded boundary with Cartesian grid cells. Unlike typical discretization methods, these control volumes naturally fit within parallelizable, disjoint‐block data structures, and permit dynamic AMR coarsening and refinement as the simulation progresses. We present two‐ and three‐dimensional numerical examples to illustrate the accuracy of the method. Copyright © 2008 John Wiley & Sons, Ltd.     

An hp‐adaptive unstructured finite volume solver for compressible flows

The idea of hp‐adaptation, which has originally been developed for compact schemes (such as finite element methods), suggests an adaptation scheme using a mixture of mesh refinement and order enrichment based on the smoothness of the solution to obtain an accurate solution efficiently. In this paper, we develop an hp‐adaptation framework for unstructured finite volume methods using residual‐based and adjoint‐based error indicators. For the residual‐based error indicator, we use a higher‐order discrete operator to estimate the truncation error, whereas this estimate is weighted by the solution of the discrete adjoint problem for an output of interest to form the adaptation indicator for adjoint‐based adaptations. We perform our adaptation by local subdivision of cells with nonconforming interfaces allowed and local reconstruction of higher‐order polynomials for solution approximations. We present our results for two‐dimensional compressible flow problems including subsonic inviscid, transonic inviscid, and subsonic laminar flow around the NACA 0012 airfoil and also turbulent flow over a flat plate. Our numerical results suggest the efficiency and accuracy advantages of adjoint‐based hp‐adaptations over uniform refinement and also over residual‐based adaptation for flows with and without singularities.     

A mesh‐adaptative metric‐based full multigrid for the Poisson problem

This paper studies the combination of the full‐multigrid (FMG) algorithm with an anisotropic metric‐based mesh adaptation algorithm. For the sake of simplicity, the case of an elliptic two‐dimensional partial differential equation is studied. Meshes are unstructured and non‐embedded, defined through the metric‐based parameterization. A rather classical MG preconditioner is applied, in combination with a quasi‐Newton fixed point. An anisotropic metric‐based mesh adaptation loop is introduced inside the FMG algorithm. FMG convergence stopping test is revisited. Applications to a few two‐dimensional continuous and discontinuous coefficient elliptic model problems show the efficiency of this combination. Copyright © 2015 John Wiley & Sons, Ltd.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Patched grid and adaptive mesh refinement strategies for the calculation of the transport of vortices

This paper presents two techniques allowing local grid refinement to calculate the transport of vortices. one is the patched grid (PG) method which allows non‐coincident interfaces between blocks. Treatment of the non‐coincident interfaces is given in detail. The second one is the adaptive mesh refinement (AMR) method which has been developed in order to create embedded sub‐grids. The efficiency of these two methods is demonstrated by some validating tests. Then the PG and AMR strategies are applied in the computation of the transport of vortices. We start with a simple vortex flow in a cubic box. Then, the flowfield around a complex aircraft configuration is calculated using the two refinement techniques. Results are compared with a fine, referenced grid calculation. Copyright © 2002 John Wiley & Sons, Ltd.     

Adjoint‐based airfoil optimization with discretization error control

In this article, we develop a new airfoil shape optimization algorithm based on higher‐order adaptive DG methods with control of the discretization error. Each flow solution in the optimization loop is computed on a sequence of goal‐oriented h‐refined or hp‐refined meshes until the error estimation of the discretization error in a flow‐related target quantity (including the drag and lift coefficients) is below a prescribed tolerance. Discrete adjoint solutions are computed and employed for the multi‐target error estimation and adaptive mesh refinement. Furthermore, discrete adjoint solutions are employed for evaluating the gradients of the objective function used in the CGs optimization algorithm. Furthermore, an extension of the adjoint‐based gradient evaluation to the case of target lift flow computations is employed. The proposed algorithm is demonstrated on an inviscid transonic flow around the RAE2822, where the shape is optimized to minimize the drag at a given constant lift and airfoil thickness. The effect of the accuracy of the underlying flow solutions on the quality of the optimized airfoil shapes is investigated. Copyright © 2014 John Wiley & Sons, Ltd.     

An h-adaptive solution of the spherical blast wave problem

Shock waves and contact discontinuities usually appear in compressible flows, requiring a fine mesh in order to achieve an acceptable accuracy of the numerical solution. The usage of a mesh adaptation strategy is convenient as uniform refinement of the whole mesh becomes prohibitive in three-dimensional (3D) problems. An unsteady h-adaptive strategy for unstructured finite element meshes is introduced. Non-conformity of the refined mesh and a bounded decrease in the geometrical quality of the elements are some features of the refinement algorithm. A 3D extension of the well-known refinement constraint for 2D meshes is used to enforce a smooth size transition among neighbour elements with different levels of refinement. A density-based gradient indicator is used to track discontinuities. The solution procedure is partially parallelised, i.e. the inviscid flow equations are solved in parallel with a finite element SUPG formulation with shock capturing terms while the adaptation of the mesh is sequentially performed. Results are presented for a spherical blast wave driven by a point-like explosion with an initial pressure jump of 10⁵ atmospheres. The adapted solution is compared to that computed on a fixed mesh. Also, the results provided by the theory of self-similar solutions are considered for the analysis. In this particular problem, adapting the mesh to the solution accounts for approximately 4% of the total simulation time and the refinement algorithm scales almost linearly with the size of the problem.     

Adaptive mesh refinement for high‐resolution finite element schemes

New a posteriori error indicators based on edgewise slope‐limiting are presented. The L₂‐norm is employed to measure the error of the solution gradient in both global and element sense. A second‐order Newton–Cotes formula is utilized in order to decompose the local gradient error from a ??₁ finite element solution into a sum of edge contributions. The slope values at edge midpoints are interpolated from the two adjacent vertices. Traditional techniques to recover (superconvergent) nodal gradient values from consistent finite element slopes are reviewed. The deficiencies of standard smoothing procedures—L₂‐projection and the Zienkiewicz–Zhu patch recovery—as applied to nonsmooth solutions are illustrated for simple academic configurations. The recovered gradient values are corrected by applying a slope limiter edge‐by‐edge so as to satisfy geometric constraints. The direct computation of slopes at edge midpoints by means of limited averaging of adjacent gradient values is proposed as an inexpensive alternative. Numerical tests for various solution profiles in one and two space dimensions are presented to demonstrate the potential of this postprocessing procedure as an error indicator. Finally, it is used to perform adaptive mesh refinement for compressible inviscid flow simulations. Copyright © 2006 John Wiley & Sons, Ltd.     

Feature‐based adaptive mesh refinement for wingtip vortices

Feature‐based solution‐adaptive mesh refinement is an attractive strategy when it is known a priori that the resolution of certain key features is critical to achieving the objectives of a simulation. In this paper, we apply vortex characterization techniques, which are typically employed to visualize vortices, to identify regions of the computational domain for mesh refinement. We investigate different refinement strategies that are facilitated by these vortex characterization techniques to simulate the flow past a wing in a wind tunnel. Our results, which we compare with experimental data, indicate that it is necessary to refine the region within and near the vortex extent surface to obtain an accurate prediction. Application of the identified mesh refinement strategy also produced observed improvement in the results predicted for a spinning missile with deflected canards. Copyright © 2010 John Wiley & Sons, Ltd.     

An adaptive finite element method for the modeling of the equilibrium of red blood cells

This contribution is concerned with the numerical modeling of an isolated red blood cell (RBC), and more generally of phospholipid membranes. We propose an adaptive Eulerian finite element approximation, based on the level set method, of a shape optimization problem arising in the study of RBCs. We simulate the equilibrium shapes that minimize the elastic bending energy under prescribed constraints of fixed volume and surface area. An anisotropic mesh adaptation technique is used in the vicinity of the cell membrane to enhance the robustness of the method. Efficient time and spatial discretizations are considered and implemented. We address in detail the main features of the proposed method, and finally we report several numerical experiments in the two‐dimensional and the three‐dimensional axisymmetric cases. The effectiveness of the numerical method is further demonstrated through numerical comparisons with semi‐analytical solutions provided by a reduced order model. Copyright © 2015 John Wiley & Sons, Ltd.     

Parallel adaptive refinement for unsteady flow calculations on 3D unstructured grids

A parallel adaptive refinement algorithm for three‐dimensional unstructured grids is presented. The algorithm is based on an hierarchical h‐refinement/derefinement scheme for tetrahedral elements.The algorithm has been fully parallelized for shared‐memory platforms via a domain decomposition of the mesh at the algebraic level. The effectiveness of the procedure is demonstrated with applications which involve unsteady compressible fluid flow. A parallel speedup study of the algorithm also is included. Published in 2004 by John Wiley & Sons, Ltd.     

Domain decomposition methods in computational fluid dynamics

The divide-and-conquer paradigm of iterative domain decomposition or substructuring has become a practical tool in computational fluid dynamics applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. We illustrate these features on the classic model problem of flow over a backstep using Newton's method as the non-linear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately and can be combined synergistically. We include sample performance results from an Intel iPSC/860 hypercube implementation.     

Discretization of transport equations on 2D Cartesian unstructured grids using data from remote cells for the convection terms

This paper presents a new finite volume discretization methodology for the solution of transport equations on locally refined or unstructured Cartesian meshes. The implementation of the cell‐face values of the dependent variables enables the employment of data from remote cells and thus the use of higher‐order differencing schemes. It also results in simple and flux‐conservative multiple‐scale stencils for the discretization of the governing equations. The latter are finally cast into a generalized form that does not depend on the local mesh structure. The performance of the numerical model is demonstrated on some classical 2D problems using various gridding techniques and a bounded second‐order upwind scheme. A stable and efficient behaviour of the algorithm is observed in all test cases. The results indicate that the combination in the present model of both local grid refinement and second‐order discretization can produce substantially more accurate solutions than each of the above techniques alone, for the same computational effort. The method is also applicable to turbulent flows and can be easily extended to three‐dimensions. Copyright © 2003 John Wiley & Sons, Ltd.     

Numerical analysis of moving interfaces using a level set method coupled with adaptive mesh refinement

A novel numerical scheme is developed by coupling the level set method with the adaptive mesh refinement in order to analyse moving interfaces economically and accurately. The finite element method (FEM) is used to discretize the governing equations with the generalized simplified marker and cell (GSMAC) scheme, and the cubic interpolated pseudo‐particle (CIP) method is applied to the reinitialization of the level set function. The present adaptive mesh refinement is implemented in the quadrangular grid systems and easily embedded in the FEM‐based algorithm. For the judgement on renewal of mesh, the level set function is adopted as an indicator, and the threshold is set at the boundary of the smoothing band. With this criterion, the variation of physical properties and the jump quantity on the free surface can be calculated accurately enough, while the computation cost is largely reduced as a whole. In order to prove the validity of the present scheme, two‐dimensional numerical simulation is carried out in collapse of a water column, oscillation and movement of a drop under zero gravity. As a result, its effectiveness and usefulness are clearly shown qualitatively and quantitatively. Among them, the movement of a drop due to the Marangoni effect is first simulated efficiently with the present scheme. Copyright © 2004 John Wiley & Sons, Ltd.     

四面体单元网格加密过程中的曲面逼近算法及程序实现

本文介绍了一种在四面体单元网格的加密过程中实现曲面逼近的算法．单元加密采用了最长边加密算法．曲面逼近实现了对二次曲面的逼近功能．当加密点所在边是边界面上的边时，将该点挪到对应的边界面上．挪动时根据该边所参与的两个边界三角形面的法向方向来确定加密点的挪动方向，再结合二次曲面方程来计算出挪动后点的新坐标．算例表明，对于由二次曲面边界围成的物体，这种算法能够有效地实现网格加密过程中的曲面边界逼近功能．     

Adaptive mesh refinement and load balancing based on multi-level block-structured Cartesian mesh

We developed a framework for a distributed-memory parallel computer that enables dynamic data management for adaptive mesh refinement and load balancing. We employed simple data structure of the building cube method (BCM) where a computational domain is divided into multi-level cubic domains and each cube has the same number of grid points inside, realising a multi-level block-structured Cartesian mesh. Solution adaptive mesh refinement, which works efficiently with the help of the dynamic load balancing, was implemented by dividing cubes based on mesh refinement criteria. The framework was investigated with the Laplace equation in terms of adaptive mesh refinement, load balancing and the parallel efficiency. It was then applied to the incompressible Navier–Stokes equations to simulate a turbulent flow around a sphere. We considered wall-adaptive cube refinement where a non-dimensional wall distance y⁺ near the sphere is used for a criterion of mesh refinement. The result showed the load imbalance due to y⁺ adaptive mesh refinement was corrected by the present approach. To utilise the BCM framework more effectively, we also tested a cube-wise algorithm switching where an explicit and implicit time integration schemes are switched depending on the local Courant-Friedrichs-Lewy (CFL) condition in each cube.     

High‐order methods for the numerical solution of the BiGlobal linear stability eigenvalue problem in complex geometries

A high‐order computational tool based on spectral and spectral/hp elements (J. Fluid. Mech. 2009; to appear) discretizations is employed for the analysis of BiGlobal fluid instability problems. Unlike other implementations of this type, which use a time‐stepping‐based formulation (J. Comput. Phys. 1994; 110 (1):82–102; J. Fluid Mech. 1996; 322 :215–241), a formulation is considered here in which the discretized matrix is constructed and stored prior to applying an iterative shift‐and‐invert Arnoldi algorithm for the solution of the generalized eigenvalue problem. In contrast to the time‐stepping‐based formulations, the matrix‐based approach permits searching anywhere in the eigenspace using shifting. Hybrid and fully unstructured meshes are used in conjunction with the spatial discretization. This permits analysis of flow instability on arbitrarily complex 2‐D geometries, homogeneous in the third spatial direction and allows both mesh (h)‐refinement as well as polynomial (p)‐refinement. A series of validation cases has been defined, using well‐known stability results in confined geometries. In addition new results are presented for ducts of curvilinear cross‐sections with rounded corners. Copyright © 2010 John Wiley & Sons, Ltd.     

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

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

一种新的求解对流占优问题的自适应网格细化方法

在均匀网格上求解对流占优问题时,往往会产生数值震荡现象,因此需要局部加密网格来提高解的精度。针对对流占优问题,设计了一种新的自适应网格细化算法。该方法采用流线迎风SUPG(Petrov-Galerkin)格式求解对流占优问题,定义了网格尺寸并通过后验误差估计子修正来指导自适应网格细化,以泡泡型局部网格生成算法BLMG为网格生成器,通过模拟泡泡在区域中的运动得到了高质量的点集。与其他自适应网格细化方法相比,该方法可在同一框架内实现网格的细化和粗化,同时在所有细化层得到了高质量的网格。数值算例结果表明,该方法在求解对流占优问题时具有更高的数值精度和更好的收敛性。     

CAD-consistent adaptive refinement using a NURBS-based discontinuous Galerkin method

This study concerns the development of a new method combining high-order computer-aided design (CAD)-consistent grids and adaptive refinement/coarsening strategies for efficient analysis of compressible flows. The proposed approach allows to use geometrical data from CAD without any approximation. Thus, the simulations are based on the exact geometry, even for the coarsest discretizations. Combining this property with a local refinement method allows to start computations using very coarse grids and then relies on dynamic adaption to construct suitable computational domains. The resulting approach facilitates interactions between CAD and computational fluid dynamics solvers and focuses the computational effort on the capture of physical phenomena, since geometry is exactly taken into account. The proposed methodology is based on a discontinuous Galerkin method for compressible Navier-Stokes equations, modified to use nonuniform rational B-Spline representations. Local refinement and coarsening are introduced using intrinsic properties of nonuniform rational B-Spline associated with a local error indicator. A verification of the accuracy of the method is achieved and a set of applications are presented, ranging from viscous subsonic to inviscid trans- and supersonic flow problems.