Assessment of a high‐order MUSCL method for rotor flows

This work presents the implementation of a high‐order, finite‐volume scheme suitable for rotor flows. The formulation is based on the variable extrapolation MUSCL‐scheme, where high‐order spatial accuracy (up to fourth‐order) is achieved using correction terms obtained through successive differentiation. A variety of results are presented, including 2‐ and 3‐dimensional test cases. Results with the proposed scheme, showed better wake and higher resolution of vortical structures compared with the standard MUSCL, even when coarse meshes were employed. The method was also demonstrated for 3‐dimensional unsteady flows using overset and moving grids for the UH‐60A rotor in forward flight and the Enhanced Rotorcraft Innovative Concept Achievement tiltrotor in aeroplane mode. For medium grids, the present method adds reasonable CPU and memory overheads and offers good accuracy on relatively coarse grids.     

An embedded boundary framework for compressible turbulent flow and fluid–structure computations on structured and unstructured grids

The finite volume method with exact two‐phase Riemann problems (FIVER) is a two‐faceted computational method for compressible multi‐material (fluid–fluid, fluid–structure, and multi‐fluid–structure) problems characterized by large density jumps, and/or highly nonlinear structural motions and deformations. For compressible multi‐phase flow problems, FIVER is a Godunov‐type discretization scheme characterized by the construction and solution at the material interfaces of local, exact, two‐phase Riemann problems. For compressible fluid–structure interaction (FSI) problems, it is an embedded boundary method for computational fluid dynamics (CFD) capable of handling large structural deformations and topological changes. Originally developed for inviscid multi‐material computations on nonbody‐fitted structured and unstructured grids, FIVER is extended in this paper to laminar and turbulent viscous flow and FSI problems. To this effect, it is equipped with carefully designed extrapolation schemes for populating the ghost fluid values needed for the construction, in the vicinity of the fluid–structure interface, of second‐order spatial approximations of the viscous fluxes and source terms associated with Reynolds averaged Navier–Stokes (RANS)‐based turbulence models and large eddy simulation (LES). Two support algorithms, which pertain to the application of any embedded boundary method for CFD to the robust, accurate, and fast solution of FSI problems, are also presented in this paper. The first one focuses on the fast computation of the time‐dependent distance to the wall because it is required by many RANS‐based turbulence models. The second algorithm addresses the robust and accurate computation of the flow‐induced forces and moments on embedded discrete surfaces, and their finite element representations when these surfaces are flexible. Equipped with these two auxiliary algorithms, the extension of FIVER to viscous flow and FSI problems is first verified with the LES of a turbulent flow past an immobile prolate spheroid, and the computation of a series of unsteady laminar flows past two counter‐rotating cylinders. Then, its potential for the solution of complex, turbulent, and flexible FSI problems is also demonstrated with the simulation, using the Spalart–Allmaras turbulence model, of the vertical tail buffeting of an F/A‐18 aircraft configuration and the comparison of the obtained numerical results with flight test data. Copyright © 2014 John Wiley & Sons, Ltd.     

FPSO船与低充水率下LNG液舱晃荡耦合运动的数值模拟

应用数值模拟方法对FPSO船舶运动与LNG液舱晃荡耦合问题进行了研究.这种全耦合问题的研究基于开源平台OpenFOAM开发的船舶与海洋工程水动力CFD求解器——naoe-FOAM-SJ-TU进行计算.液舱内部流场与外部流场同时求解.采用带有两个LNG液舱的FPSO船作为对象进行数值模拟,船舶放开3个自由度运动,并在90°浪向的规则波中进行模拟.液舱充水率为20％～20％,低于船外自由水面高度.这种低充水率的液舱会大大减少船舶的横摇运动,并且舱内的流体情况较为复杂.考虑了4种不同的入射波频率下船舶的运动,与实验结果进行了对比.数值模拟结果与实验结果对比吻合良好,验证了数值求解方法的可靠性.还对大波高情况下带有低充水率LNG液舱的船舶运动进行了数值模拟分析.在船舶运动与液舱晃荡全耦合情况下,观察到了液舱内流体的剧烈晃荡和舱壁的脉冲压力.     

A MUSCL smoothed particles hydrodynamics for compressible multi‐material flows

By incorporating the Monotone Upwind Scheme of Conservation Law (MUSCL) scheme into the smoothed particles hydrodynamics (SPH) method and making use of an interparticle contact algorithm, we present a MUSCL–SPH scheme of second order for multifluid computations, which extends the Riemann‐solved‐based SPH method. The numerical tests demonstrate high accuracy and resolution of the scheme for both shocks, contact discontinuities, and rarefaction waves in the one‐dimensional shock tube problem. For the two‐dimensional cylindrical Noh and shock‐bubble interaction problems, the MUSCL–SPH scheme can resolve shocks well. Copyright © 2015 John Wiley & Sons, Ltd.     

基于MCPT解法器库的专用辐射探测模拟软件研发与应用北大核心CSCD

甲状腺内^(131)I放射性活度与辐射探测结果的比例关系与甲状腺几何尺寸、探测距离等因素相关,是估算甲状腺内^(131)I含量与其可能造成的辐照损伤的关键参数。基于MCPT辐射输运数值模拟算法器库开发了用于开展NaI探测器伽马辐射测量模拟的应用程序,进而建立了多组具有不同容积的甲状腺型容器和不同探测距离的物理模型,最终通过蒙特卡罗数值计算得到了不同测量状态下探测器的探测效率。在甲状腺型容器与探测器距离较远时,数值模拟给出的结果与理论计算结果一致,证明此应用程序可用于定量分析NaI的探测效率。数值模拟结果表明,小距离模型的结果受甲状腺样容器的大小和距离的显著影响,模拟给出的探测效率表为开展深入细致的实验研究奠定了基础。     

Application of the full approximation storage method to the numerical simulation of two-dimensional steady incompressible viscous multiphase flows

In recent years multigrid algorithms have been applied to increasingly difficult systems of partial differential equations and major improvements in both speed of convergence and robustness have been achieved. Problems involving several interacting fluids are of great interest in many industrial applications, especially in the process and petro-chemical sectors. However, the multifluid version of the Navier–Stokes equations is extremely complex and represents a challenge to advanced numerical algorithms. In this paper, we describe an extension of the full approximation storage (FAS) multigrid algorithm to the multifluid equations. A number of special issues had to be addressed. The first was the development of a customised, non-linear, coupled relaxation scheme for the smoothing step. Automatic differentiation was used to facilitate the coding of a robust, globally convergent quasi-Newton method. It was also necessary to use special inter-grid transfer operators to maintain the realisability of the solution. Algorithmic details are given and solutions for a series of test problems are compared with those from a widely validated, commercial code. The new approach has proved to be robust; it achieves convergence without resorting to specialised initialisation methods. Moreover, even though the rate of convergence is complex, the method has achieved very good reduction factors: typically five orders of magnitude in 50 cycles. © 1998 John Wiley & Sons, Ltd.     

Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time‐independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi–Babuska condition. The k–l model is used to complete the turbulence closure problem. The non‐symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a ‘V‐cycling’ schedule. These methods are all compared to the non‐symmetric frontal solver. Copyright © 1999 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.     

Fast solvers with block‐diagonal preconditioners for linear FEM–BEM coupling

The purpose of this paper is to present optimal preconditioned iterative methods to solve indefinite linear systems of equations arising from symmetric coupling of finite elements and boundary elements. This is a block‐diagonal preconditioner together with a conjugate residual method and a preconditioned inner–outer iteration. We prove the efficiency of these methods by showing that the number of iterations to preserve a given accuracy is bounded independent of the number of unknowns. Numerical examples underline the efficiency of these methods. Copyright © 2008 John Wiley & Sons, Ltd.     

A Fast High Order Iterative Solver for the Electromagnetic Scattering by Open Cavities Filled with the Inhomogeneous Media

The scattering of the open cavity filled with the inhomogeneous media is studied. The problem is discretized with a fourth order finite difference scheme and the immersed interface method, resulting in a linear system of equations with the high order accurate solutions in the whole computational domain. To solve the system of equations, we design an efficient iterative solver, which is based on the fast Fourier transformation, and provides an ideal preconditioner for Krylov subspace method. Numerical experiments demonstrate the capability of the proposed fast high order iterative solver.