自适应间断有限元方法求解双曲守恒律方程

研究自适应Runge-Kutta间断Galerkin (RKDG)方法求解双曲守恒律方程组,并提出两种生成相容三角形网格的自适应算法.第一种算法适用于规则网格,实现简单、计算速度快.第二种算法基于非结构网格,设计一类基于间断界面的自适应网格加密策略,方法灵活高效.两种方法都具有令人满意的计算效果,而且降低了RKDG的计算量.     

基于自适应非结构化网格的VOF方法

本文提出了一种基于自适应非结构化网格的VOF算法,根据相界面网格的相函数值对相界面网格进行自适应细化与合并,通过基于非结构化网格的界面构造方法构造相界面,在适量增加网格单元数量的情况下提高了计算的精度。该方法随着时间及相界面的变化无需重新整体生成网格,算法效率较高。经典算例的验证结果表明,本文自适应网格方法计算得到的结...     

气固两相各向同性湍流的自适应网格模拟

气固两相湍流是一个复杂的多尺度,多物理场的难题.为了捕捉流场的小尺度涡以及其对颗粒的作用,传统上采用了静态的高分辨率网格,消耗极大的计算资源.本文基于小波算法对网格进行加密或疏化,从而实现网格的自适应.基于自适应网格的框架上,建立颗粒与流场分块的映射,搭建了欧拉-拉格朗日的气固两相流模拟的并行平台.通过对均匀各向同性湍...     

Euler及N-S方程的二维四边形/叉树混合网格自适应算法

描述了一种基于直角叉树网格的Euler和N-S方程自适应算法.由于考虑了粘性的作用,提出并使用了四边形叉树混合网格的方法,在几何表面附近生成贴体的四边形网格,外流场使用直角叉树网格.采用中心有限体积法,对Euler及N-S方程进行数值求解,对N-S方程的计算中加入了B-L代数湍流模型.在流场中,运用了网格自适应算法,提高了数值计算对激波、流动分离等特性的捕捉和分辨能力.采用上述方法,数值分析了单段和多段翼型的绕流问题.     

一种求解流体力学方程组的自适应显式时间积分算法及其应用

针对交替方向显式离散格式,提出一个基于结构网格局部加密技术(SAMR)的求解流体力学方程组的自适应时间积分算法;基于该算法,在JASMIN框架上研制多介质流体力学并行自适应数值模拟程序;在512个处理器上模拟惯性约束聚变中的二维内爆模型.数值模拟结果和并行性能分析显示了算法的正确性和并行实现的高效率.     

面向结构网格自适应并行计算的矩形区域求差集快速算法

结构网格自适应程序需要使用矩形区域求差集算法计算网格层间数据依赖关系和网格层嵌套关系.原有的矩形区域求差集算法时间复杂度较高,成为该类应用大规模并行计算可扩展性能瓶颈.本文利用分而治之的方法,构造近似线性时间复杂度的矩形区域求差集快速算法,并利用区域分解实现该算法的并行计算.分别针对规则矩形区域和多层自适应网格的非规则矩形区域求差集问题,验证该算法的效率.结果表明,该算法具有近似线性计算复杂度,对于大规模计算问题,加速效果显著.     

流动数值模拟中一种并行自适应有限元算法

给出了一种流动数值模拟中的基于误差估算的并行网格自适应有限元算法.首先,以初网格上获得的当地事后误差估算值为权,应用递归谱对剖分方法划分初网格,使各子域上总体误差近似相等,以解决负载平衡问题.然后以误差值为判据对各子域内网格进行独立的自适应处理.最后应用基于粘接元的区域分裂法在非匹配的网格上求解N-S方程.区域分裂情形下N-S方程有限元解的误差估算则是广义Stokes问题误差估算方法的推广.为验证方法的可靠性,给出了不可压流经典算例的数值结果.     

SPH核函数光滑长度最优选取和自适应准则研究

基于小波分析理论和RKPM再生核函数研究无网格方法SPH中多尺度诊断工具,多尺度再生核函数使得数值计算在不同尺度上的响应分离,并通过动态伸缩窗函数给出计算域不同位置的时频特性,实现在无网格体系下构造网格计算方法的“自适应网格”,从而达到对不同流场位置多分辨率分析的目的.利用多尺度诊断工具中的小波分解算法给出SPH核函数在频域内能量残差估计,发展一种核函数光滑长度最优选取准则.最后,基于可压缩流场激波稀疏波共存的现象,针对传统的光滑长度自适应的缺陷,构造一种避免数值计算“拖尾”现象的自适应准则.     

任意网格重映的样条逼近算法

在大变形流体力学问题的数值模拟中,任何方法都必须考虑网格重分或网格自适应,只要改动网格就涉及重分,或自适应后从旧的、扭曲的网格到新网格的守恒量重映,包括质量、动量和能量.在研究样条函数逼近的基础上,给出一种物理量重映的对结构网格和非结构网格均适应的算法,并给出了数值结果.     

三维非均匀不稳定渗流方程的自适应网格粗化算法

将渗透率自适应网格技术应用于三维非均匀不稳定渗流方程的网格粗化算法中,在渗透率或孔隙度变化异常区域自动采用精细网格,用直接解法求解渗透率或孔隙度变化异常区域的压强分布,在其它区域采用不均匀网格粗化的方法计算,即在流体流速大的区域采用精细网格.用该方法计算了三维非均匀不稳定渗流场的压降解,结果表明三维非均匀不稳定渗流方程的三维非均匀自适应网格粗化算法的解在渗透率或孔隙度异常区的压强分布规律与采用精细网格的解非常逼近,在其它区域压强分布规律与粗化算法的解非常逼近,计算速度比采用精细网格提高100多倍.     

一种基于预估-修正策略的非定常流网格自适应加密/稀疏方法

给出一种非定常流动数值模拟的网格自适应处理方法.在"求解流动方程-自适应调整网格"的流程中,引入预估-修正步.根据自适应周期内每个时间步上的流场预估解,计算单元上的事后误差估算值.建立考虑解演变的网格自适应指示器,并进行多层次单元加密-稀疏的动态网格自适应处理.在自适应网格上重新计算流场.每个自适应周期中,流动演变区域的网格获得加密;而前一个周期中的特征现象已离开区域的网格被稀疏.应用边界非协调的当地DFD(Domain-Free Discretization)方法求解流动方程.为验证网格自适应处理方法,针对静止圆柱和自推进游鱼的流动进行了数值实验.     

Simulation of Vortex Convection in a Compressible Viscous Flow with Dynamic Mesh Adaptation

In this work, vortex convection is simulated using a dynamic mesh adaptation procedure. In each adaptation period, the mesh is refined in the regions where the phenomena evolve and is coarsened in the regions where the phenomena deviate since the last adaptation. A simple indicator of mesh adaptation that accounts for the solution progression is defined. The generation of dynamic adaptive meshes is based on multilevel refinement/coarsening. The efficiency and accuracy of the present procedure are validated by simulating vortex convection in a uniform flow. Two unsteady compressible turbulent flows involving blade-vortex interactions are investigated to demonstrate further the applicability of the procedure. Computed results agree well with the published experimental data or numerical results.     

Fully anisotropic goal-oriented mesh adaptation for 3D steady Euler equations

This paper studies the coupling between anisotropic mesh adaptation and goal-oriented error estimate. The former is very well suited to the control of the interpolation error. It is generally interpreted as a local geometric error estimate. On the contrary, the latter is preferred when studying approximation errors for PDEs. It generally involves non local error contributions. Consequently, a full and strong coupling between both is hard to achieve due to this apparent incompatibility. This paper shows how to achieve this coupling in three steps.First, a new a priori error estimate is proved in a formal framework adapted to goal-oriented mesh adaptation for output functionals. This estimate is based on a careful analysis of the contributions of the implicit error and of the interpolation error. Second, the error estimate is applied to the set of steady compressible Euler equations which are solved by a stabilized Galerkin finite element discretization. A goal-oriented error estimation is derived. It involves the interpolation error of the Euler fluxes weighted by the gradient of the adjoint state associated with the observed functional. Third, rewritten in the continuous mesh framework, the previous estimate is minimized on the set of continuous meshes thanks to a calculus of variations. The optimal continuous mesh is then derived analytically. Thus, it can be used as a metric tensor field to drive the mesh adaptation. From a numerical point of view, this method is completely automatic, intrinsically anisotropic, and does not depend on any a priori choice of variables to perform the adaptation.3D examples of steady flows around supersonic and transsonic jets are presented to validate the current approach and to demonstrate its efficiency.     

Variational mesh adaptation II: error estimates and monitor functions

The key to the success of a variational mesh adaptation method is to define a proper monitor function which controls mesh adaptation. In this paper we study the choice of the monitor function for the variational adaptive mesh method developed in the previous work [J. Comput. Phys. 174 (2001) 924]. Two types of monitor functions, scalar matrix and non-scalar matrix ones, are defined based on asymptotic estimates of interpolation error obtained using the interpolation theory of finite element methods. The choice of the adaptation intensity parameter is also discussed for each of these monitor functions. Asymptotic bounds on interpolation error are obtained for adaptive meshes that satisfy the regularity and equidistribution conditions. Two-dimensional numerical results are given to verify the theoretical findings.     

Modelling atmospheric flows with adaptive moving meshes

An anelastic atmospheric flow solver has been developed that combines semi-implicit non-oscillatory forward-in-time numerics with a solution-adaptive mesh capability. A key feature of the solver is the unification of a mesh adaptation apparatus, based on moving mesh partial differential equations (PDEs), with the rigorous formulation of the governing anelastic PDEs in generalised time-dependent curvilinear coordinates. The solver development includes an enhancement of the flux-form multidimensional positive definite advection transport algorithm (MPDATA) — employed in the integration of the underlying anelastic PDEs — that ensures full compatibility with mass continuity under moving meshes. In addition, to satisfy the geometric conservation law (GCL) tensor identity under general moving meshes, a diagnostic approach is proposed based on the treatment of the GCL as an elliptic problem. The benefits of the solution-adaptive moving mesh technique for the simulation of multiscale atmospheric flows are demonstrated. The developed solver is verified for two idealised flow problems with distinct levels of complexity: passive scalar advection in a prescribed deformational flow, and the life cycle of a large-scale atmospheric baroclinic wave instability showing fine-scale phenomena of fronts and internal gravity waves.     

Parallel adaptation of general three-dimensional hybrid meshes

A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.     

A new anisotropic mesh adaptation method based upon hierarchical a posteriori error estimates

A new anisotropic mesh adaptation strategy for finite element solution of elliptic differential equations is presented. It generates anisotropic adaptive meshes as quasi-uniform ones in some metric space, with the metric tensor being computed based on hierarchical a posteriori error estimates. A global hierarchical error estimate is employed in this study to obtain reliable directional information of the solution. Instead of solving the global error problem exactly, which is costly in general, we solve it iteratively using the symmetric Gauß–Seidel method. Numerical results show that a few GS iterations are sufficient for obtaining a reasonably good approximation to the error for use in anisotropic mesh adaptation. The new method is compared with several strategies using local error estimators or recovered Hessians. Numerical results are presented for a selection of test examples and a mathematical model for heat conduction in a thermal battery with large orthotropic jumps in the material coefficients.     

A parallel solution – adaptive method for three-dimensional turbulent non-premixed combusting flows

A parallel adaptive mesh refinement (AMR) algorithm is proposed and applied to the prediction of steady turbulent non-premixed compressible combusting flows in three space dimensions. The parallel solution-adaptive algorithm solves the system of partial-differential equations governing turbulent compressible flows of reactive thermally perfect gaseous mixtures using a fully coupled finite-volume formulation on body-fitted multi-block hexahedral meshes. The compressible formulation adopted herein can readily accommodate large density variations and thermo-acoustic phenomena. A flexible block-based hierarchical data structure is used to maintain the connectivity of the solution blocks in the multi-block mesh and to facilitate automatic solution-directed mesh adaptation according to physics-based refinement criteria. For calculations of near-wall turbulence, an automatic near-wall treatment readily accommodates situations during adaptive mesh refinement where the mesh resolution may not be sufficient for directly calculating near-wall turbulence using the low-Reynolds-number formulation. Numerical results for turbulent diffusion flames, including cold- and hot-flow predictions for a bluff-body burner, are described and compared to available experimental data. The numerical results demonstrate the validity and potential of the parallel AMR approach for predicting fine-scale features of complex turbulent non-premixed flames.     

Metric-based mesh adaptation for 2D Lagrangian compressible flows

In this paper, we present a method to compute compressible flows in 2D. It uses two steps: a Lagrangian step and a metric-based triangular mesh adaptation step. Computational mesh is locally adapted according to some metric field that depends on physical or geometrical data. This mesh adaptation step embeds a conservative remapping procedure to satisfy consistency with Euler equations. The whole method is no more Lagrangian.After describing mesh adaptation patterns, we recall the metric formalism. Then, we detail an appropriate remapping procedure which is first-order and relies on exact intersections.We give some hints about the parallel implementation. Finally, we present various numerical experiments which demonstrate the good properties of the algorithm.     

Shaping quantum pulses of light via coherent atomic memory

We describe proof-of-principle experiments demonstrating a novel approach for generating pulses of light with controllable photon numbers, propagation direction, timing, and pulse shapes. The approach is based on preparation of an atomic ensemble in a state with a desired number of atomic spin excitations, which is later converted into a photon pulse. Spatiotemporal control over the pulses is obtained by exploiting long-lived coherent memory for photon states and Electromagnetically Induced Transparency in an optically dense atomic medium. Using photon counting experiments, we observe Electromagnetically Induced Transparency based generation and shaping of few-photon sub-Poissonian light pulses.