A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

A volume-tracking method for incompressible multifluid flows with large density variations

A numerical technique (FGVT) for solving the time-dependent incompressible Navier–Stokes equations in fluid flows with large density variations is presented for staggered grids. Mass conservation is based on a volume tracking method and incorporates a piecewise-linear interface reconstruction on a grid twice as fine as the velocity–pressure grid. It also uses a special flux-corrected transport algorithm for momentum advection, a multigrid algorithm for solving a pressure-correction equation and a surface tension algorithm that is robust and stable. In principle, the method conserves both mass and momentum exactly, and maintains extremely sharp fluid interfaces. Applications of the numerical method to prediction of two-dimensional bubble rise in an inclined channel and a bubble bursting through an interface are presented. © 1998 John Wiley & Sons, Ltd.     

A momentum coupling method for the unsteady incompressible Navier–Stokes equations on the staggered grid

A new numerical method is developed to efficiently solve the unsteady incompressible Navier–Stokes equations with second-order accuracy in time and space. In contrast to the SIMPLE algorithms, the present formulation directly solves the discrete x- and y-momentum equations in a coupled form. It is found that the present implicit formulation retrieves some cross convection terms overlooked by the conventional iterative methods, which contribute to accuracy and fast convergence. The finite volume method is applied on the fully staggered grid to solve the vector-form momentum equations. The preconditioned conjugate gradient squared method (PCGS) has proved very efficient in solving the associate linearized large, sparse block-matrix system. Comparison with the SIMPLE algorithm has indicated that the present momentum coupling method is fast and robust in solving unsteady as well as steady viscous flow problems. © 1998 John Wiley & Sons, Ltd.     

Space–Time Method for Detonation Problems with Finite-rate Chemical Kinetics

The space–time conservation element and solution element (CE/SE) method originally developed for non-reacting flows is extended to accommodate finite-rate chemical kinetics for multi-component systems. The model directly treats the complete conservation equations of mass, momentum, energy, and species concentrations. A subtime-step integration technique is established to handle the stiff chemical source terms in the formulation. In addition, a local grid refinement algorithm within the framework of the CE/SE method is incorporated to enhance the flow resolution in areas of interest. The capability and accuracy of the resultant scheme are validated against several detonation problems, including shock-induced detonation with detailed chemical kinetics and multi-dimensional detonation initiation and propagation.     

A parallel monolithic algorithm for the numerical simulation of large‐scale fluid structure interaction problems

A novel parallel monolithic algorithm has been developed for the numerical simulation of large‐scale fluid structure interaction problems. The governing incompressible Navier–Stokes equations for the fluid domain are discretized using the arbitrary Lagrangian–Eulerian formulation‐based side‐centered unstructured finite volume method. The deformation of the solid domain is governed by the constitutive laws for the nonlinear Saint Venant–Kirchhoff material, and the classical Galerkin finite element method is used to discretize the governing equations in a Lagrangian frame. A special attention is given to construct an algorithm with exact total fluid volume conservation while obeying both the global and the local discrete geometric conservation law. The resulting large‐scale algebraic nonlinear equations are multiplied with an upper triangular right preconditioner that results in a scaled discrete Laplacian instead of a zero block in the original system. Then, a one‐level restricted additive Schwarz preconditioner with a block‐incomplete factorization within each partitioned sub‐domains is utilized for the modified system. The accuracy and performance of the proposed algorithm are verified for the several benchmark problems including a pressure pulse in a flexible circular tube, a flag interacting with an incompressible viscous flow, and so on. John Wiley & Sons, Ltd.     

A comparative study of pressure correction and block-implicit finite volume algorithms on parallel computers

A comparison of a new parallel block-implicit method and the parallel pressure correction procedure for the solution of the incompressible Navier–Stokes equations is presented. The block-implicit algorithm is based on a pressure equation. The system of non-linear equation s is solved by Newton's method. For the solution of the linear algebraic systems the Bi-CGSTAB algorithm with incomplete lower–upper (ILU) decomposition of the matrix is applied. Domain decomposition serves as a strategy for the parallelization of the algorithms. Different algorithms for the parallel solution of the linear system of algebraic equations in conjunction with the pressure correction procedure are proposed. Three different flows are predicted with the parallel algorithms. Results and efficiency data of the block-implicit method are compared with the parallel version of the pressure correction algorithm. The block-implicit method is characterized by stable convergence behaviour, high numerical efficiency, insensitivity to relaxation parameters and high spatial accuracy. © 1997 John Wiley & Sons, Ltd.     

Application of local grid refinement to vortex motion due to a solitary wave passing over a submerged body

A numerical method based on the streamfunction–vorticity formulation is applied to simulate the two‐dimensional, transient, viscous flow with a free surface. This method successfully uses the locally refined grid in an inviscid–viscous model to explore the processes of vortex formation due to a solitary wave passing over a submerged bluff body. The two particular bodies considered here are a blunt rectangular block and a semicircular cylinder. Flow visualization to track dyelines is carried out in the laboratory in order to confirm the validity of the numerical results. Numerical results examined by different grid configurations ensure the locally refined grid to be useful in practical application. Flow phenomena, including the vortex motion and wave patterns during non‐linear wave–structure interaction, are also discussed. Copyright © 2002 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.     

NUMERICAL UNCERTAINTIES IN TRANSONIC FLOW CALCULATIONS FOR AEROFOILS WITH BLUNT TRAILING EDGES

Numerical uncertainties are quantified for calculations of transonic flow around a divergent trailing edge (DTE) supercritical aerofoil. The Reynolds-averaged Navier–Stokes equations are solved using a linearized block implicit solution procedure and mixing-length turbulence model. This procedure has reproduced measurements around supercritical aerofoils with blunt trailing edges that have shock, boundary layer and separated regions. The present effort quantifies numerical uncertainty in these calculations using grid convergence indices which are calculated from aerodynamic coefficients, shock location, dimensions of the recirculating region in the wake of the blunt trailing edge and distributions of surface pressure coefficients. The grid convergence index is almost uniform around the aerofoil, except in the shock region and at the point where turbulence transition was fixed. The grid convergence index indicates good convergence for lift but only fair convergence for moment and drag and also confirms that drag calculations are more sensitive to numerical error. © 1997 by John Wiley and Sons, Ltd.     

Flux‐difference splitting‐based upwind compact schemes for the incompressible Navier–Stokes equations

Third‐order and fifth‐order upwind compact finite difference schemes based on flux‐difference splitting are proposed for solving the incompressible Navier–Stokes equations in conjunction with the artificial compressibility (AC) method. Since the governing equations in the AC method are hyperbolic, flux‐difference splitting (FDS) originally developed for the compressible Euler equations can be used. In the present upwind compact schemes, the split derivatives for the convective terms at grid points are linked to the differences of split fluxes between neighboring grid points, and these differences are computed by using FDS. The viscous terms are approximated with a sixth‐order central compact scheme. Comparisons with 2D benchmark solutions demonstrate that the present compact schemes are simple, efficient, and high‐order accurate. Copyright © 2008 John Wiley & Sons, Ltd.     

求解一维理想磁流体方程的移动网格熵稳定格式

磁流体方程的数值求解在等离子体物理学、天体物理研究以及流动控制等领域具有重要意义,本文构造了用于求解理想磁流体动力学方程的基于移动网格的熵稳定格式,此方法将Roe型熵稳定格式与自适应移动网格算法结合,空间方向采用熵稳定格式对磁流体动力学方程进行离散,利用变分法构造网格演化方程并通过Gauss-Seidel迭代法对其迭代求解实现网格的自适应分布,在此基础上采用守恒型插值公式实现新旧节点上的量值传递,利用三阶强稳定Runge-Kutta方法将数值解推进到下一时间层。数值实验表明,该算法能有效捕捉解的结构(特别是激波和稀疏波),分辨率高,通用性好,具有强鲁棒性。     

Convergence acceleration of segregated algorithms using dynamic tuning additive correction multigrid strategy

A convergence acceleration method based on an additive correction multigrid–SIMPLEC (ACM‐S) algorithm with dynamic tuning of the relaxation factors is presented. In the ACM‐S method, the coarse grid velocity correction components obtained from the mass conservation (velocity potential) correction equation are included into the fine grid momentum equations before the coarse grid momentum correction equations are formed using the additive correction methodology. Therefore, the coupling between the momentum and mass conservation equations is obtained on the coarse grid, while maintaining the segregated structure of the single grid algorithm. This allows the use of the same solver (smoother) on the coarse grid. For turbulent flows with heat transfer, additional scalar equations are solved outside of the momentum–mass conservation equations loop. The convergence of the additional scalar equations is accelerated using a dynamic tuning of the relaxation factors. Both a relative error (RE) scheme and a local Reynolds/Peclet (ER/P) relaxation scheme methods are used. These methodologies are tested for laminar isothermal flows and turbulent flows with heat transfer over geometrically complex two‐ and three‐dimensional configurations. Savings up to 57% in CPU time are obtained for complex geometric domains representative of practical engineering problems. Copyright © 1999 John Wiley & Sons, Ltd.     

An implicit three‐dimensional fully non‐hydrostatic model for free‐surface flows

An implicit method is developed for solving the complete three‐dimensional (3D) Navier–Stokes equations. The algorithm is based upon a staggered finite difference Crank‐Nicholson scheme on a Cartesian grid. A new top‐layer pressure treatment and a partial cell bottom treatment are introduced so that the 3D model is fully non‐hydrostatic and is free of any hydrostatic assumption. A domain decomposition method is used to segregate the resulting 3D matrix system into a series of two‐dimensional vertical plane problems, for each of which a block tri‐diagonal system can be directly solved for the unknown horizontal velocity. Numerical tests including linear standing waves, nonlinear sloshing motions, and progressive wave interactions with uneven bottoms are performed. It is found that the model is capable to simulate accurately a range of free‐surface flow problems using a very small number of vertical layers (e.g. two–four layers). The developed model is second‐order accuracy in time and space and is unconditionally stable; and it can be effectively used to model 3D surface wave motions. Copyright © 2004 John Wiley & Sons, Ltd.     

A hybrid immersed boundary and material point method for simulating 3D fluid–structure interaction problems

A numerical method is developed for solving the 3D, unsteady, incompressible Navier–Stokes equations in curvilinear coordinates containing immersed boundaries (IBs) of arbitrary geometrical complexity moving and deforming under forces acting on the body. Since simulations of flow in complex geometries with deformable surfaces require special treatment, the present approach combines a hybrid immersed boundary method (HIBM) for handling complex moving boundaries and a material point method (MPM) for resolving structural stresses and movement. This combined HIBM & MPM approach is presented as an effective approach for solving fluid–structure interaction (FSI) problems. In the HIBM, a curvilinear grid is defined and the variable values at grid points adjacent to a boundary are forced or interpolated to satisfy the boundary conditions. The MPM is used for solving the equations of solid structure and communicates with the fluid through appropriate interface‐boundary conditions. The governing flow equations are discretized on a non‐staggered grid layout using second‐order accurate finite‐difference formulas. The discrete equations are integrated in time via a second‐order accurate dual time stepping, artificial compressibility scheme. Unstructured, triangular meshes are employed to discretize the complex surface of the IBs. The nodes of the surface mesh constitute a set of Lagrangian control points used for tracking the motion of the flexible body. The equations of the solid body are integrated in time via the MPM. At every instant in time, the influence of the body on the flow is accounted for by applying boundary conditions at stationary curvilinear grid nodes located in the exterior but in the immediate vicinity of the body by reconstructing the solution along the local normal to the body surface. The influence of the fluid on the body is defined through pressure and shear stresses acting on the surface of the body. The HIBM & MPM approach is validated for FSI problems by solving for a falling rigid and flexible sphere in a fluid‐filled channel. The behavior of a capsule in a shear flow was also examined. Agreement with the published results is excellent. Copyright © 2007 John Wiley & Sons, Ltd.     

Low-rank solution of an optimal control problem constrained by random Navier-Stokes equations

We develop a low-rank tensor decomposition algorithm for the numerical solution of a distributed optimal control problem constrained by two-dimensional time-dependent Navier-Stokes equations with a stochastic inflow. The goal of optimization is to minimize the flow vorticity. The inflow boundary condition is assumed to be an infinite-dimensional random field, which is parametrized using a finite- (but high-) dimensional Fourier expansion and discretized using the stochastic Galerkin finite element method. This leads to a prohibitively large number of degrees of freedom in the discrete solution. Moreover, the optimality conditions in a time-dependent problem require solving a coupled saddle-point system of nonlinear equations on all time steps at once. For the resulting discrete problem, we approximate the solution by the tensor-train (TT) decomposition and propose a numerically efficient algorithm to solve the optimality equations directly in the TT representation. This algorithm is based on the alternating linear scheme (ALS), but in contrast to the basic ALS method, the new algorithm exploits and preserves the block structure of the optimality equations. We prove that this structure preservation renders the proposed block ALS method well posed, in the sense that each step requires the solution of a nonsingular reduced linear system, which might not be the case for the basic ALS. Finally, we present numerical experiments based on two benchmark problems of simulation of a flow around a von Kármán vortex and a backward step, each of which has uncertain inflow. The experiments demonstrate a significant complexity reduction achieved using the TT representation and the block ALS algorithm. Specifically, we observe that the high-dimensional stochastic time-dependent problem can be solved with the asymptotic complexity of the corresponding deterministic problem.     

Schwarz domain decomposition for the incompressible Navier–Stokes equations in general co‐ordinates

This paper describes a domain decomposition method for the incompressible Navier–Stokes equations in general co‐ordinates. Domain decomposition techniques are needed for solving flow problems in complicated geometries while retaining structured grids on each of the subdomains. This is the so‐called block‐structured approach. It enables the use of fast vectorized iterative methods on the subdomains. The Navier–Stokes equations are discretized on a staggered grid using finite volumes. The pressure‐correction technique is used to solve the momentum equations together with incompressibility conditions. Schwarz domain decomposition is used to solve the momentum and pressure equations on the composite domain. Convergence of domain decomposition is accelerated by a GMRES Krylov subspace method. Computations are presented for a variety of flows. Copyright © 2000 John Wiley & Sons, Ltd.     

ADAPTIVE LINEARIZATION AND GRID ITERATIONS WITH THE TRI-TREE MULTIGRID REFINEMENT–RECOARSEMENT ALGORITHM FOR THE NAVIER–STOKES EQUATIONS

The tri-tree algorithm for refinements and recoarsements of finite element grids is explored. The refinement–recoarsement algorithm not only provides an accurate solution in certain parts of the grid but also has a major influence on the finite element equation system itself. The refinements of the grid lead to a more symmetric and linear equation matrix. The recoarsements will ensure that the grid is not finer than is necessary for preventing divergence in an iterative solution procedure. The refinement–recoarsement algorithm is a dynamic procedure and the grid is adapted to the instant solution. In the tri-tree multigrid algorithm the solution from a coarser grid is scaled relatively to the increase in velocity boundary condition for the finer grid. In order to have a good start vector for the solution of the finer grid, the global Reynolds number or velocity boundary condition should not be subject to large changes. For each grid and velocity solution the element Reynolds number is computed and used as the grid adaption indicator during the refinement–recoarsement procedure. The iterative tri-tree multigrid method includes iterations with respect to the grid. At each Reynolds number the same boundary condition s are applied and the grid is adapted to the solution iteratively until the number of unknowns and elements in the grid becomes constant. In the present paper the following properties of the tri-tree algorithm are explored: the influence of the increase in boundary velocities and the size of the grid adaption indicator on the amount of work for solving the equations, the number of linear iterations and the solution error estimate between grid levels. The present work indicates that in addition to the linear and non-linear iterations, attention should also be given to grid adaption iterations. © 1997 by John Wiley & Sons, Ltd.     

靠近排列的两个交错方柱三维绕流的数值模拟

通过用时间分裂算法求解Navier－Stokes方程,对中等Reynolds数下靠近排列的两个交错方柱三维绕流进行了数值模拟,其中,中间速度场用四阶Adams格式计算,压力场通过结合近似因子分解方法AF1与稳定的双共轭梯度方法Bi-CGSTAB进行迭代求解．数值模拟发现当两个方柱靠得较近时,有互相吸引趋势,而且上游方柱的Strouhal数较大．方柱的交错排列方式对绕流影响明显．计算结果与实验定性吻合,而且比用MAC－AF1方法计算的结果好．     

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.