Weakly Admissible Meshes and Discrete Extremal Sets

We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, namely Approximate Fekete Points and Discrete Leja Points. These provide new computational tools for polynomial least squares and interpolation on multidimensional compact sets, with different applications such as numerical cubature, digital filtering, spectral and high-order methods for PDEs.     

曲率相关的爆轰波在非结构四边形网格上的数值方法

假设爆轰波阵面的法向速度是曲率的线性函数,在非结构四边形网格上采用水平集方法模拟爆轰波阵面的运动过程.水平集方程的曲率无关项采用正格式离散,曲率项采用伽辽金等参有限元方法空间离散,时间离散采用半隐格式.在笛卡儿网格和随机网格上,含曲率的水平集方程的离散格式为强一阶精度,重新初始化方程的离散格式精度为近似一阶精度.曲率收缩的不光滑界面和多个爆轰波阵面相互作用的算例说明格式可有效地模拟爆轰波与曲率相关的运动.     

Generalized Wall Functions for High-speed Separated Flows Over Adiabatic and Isothermal Walls

We present the extension of our wall-laws developed for low-speed flows to super-and hyper-sonic configurations. In particular, we are interested in flows over isothermal walls and in the modeling of heat transfer. We recall the main steps of the development:

?Obtaining generalized wall functions for low-speed fluids, valid for all y ⁺.

?Taking into account transversal effects in wall-laws.

?Accounting for the compressible feature of the flow on adiabatic walls without using information on the local boundary layer structure, for instance its thickness, but only using information available at the fictitious wall.

?Taking into account thermal effects on isothermal walls. In particular, the heat flux at the real wall is obtained by an a posteriori evaluation using information at the fictitious one.

?Only using information available on unstructured meshes and avoiding the information coming from a Cartesian hypothesis for the mesh in near-wall regions.

These ingredients are validated on hyper-sonic configurations on adiabatic and isothermal walls for expansion and compression ramps.     

三角形网格上多介质流动问题界面处理方法

多介质流动问题的求解一般是在结构网格上实现,而三角形网格对于复杂计算区域具有更好的适应性,本文结合rGFM方法,给出三角形网格上多介质流动问题界面处理方法.利用level-set方法跟踪界面,在界面处构造Riemann问题,得到界面处流体准确的流动状态.通过定义界面边界条件,将多介质流动问题转化为单介质流动问题,利用高精度RKDG方法求解.采用多个算例验证该方法的稳健性和有效性,结果表明该方法能准确捕捉界面和激波的位置,保持界面清晰.     

基于背景网格变形的动态网格移动方法

基于Delaunay背景网格插值技术的动态网格生成方法无需迭代计算,效率较高。但对复杂构形大幅运动的动边界问题,尤其当边界大幅转动时,背景网格极易交叉重叠。重新生成背景网格和重新定位网格节点信息不仅费时而且会导致网格质量的严重下降。本文提出改进的基于背景网格的动态网格变形方法,通过在初始Delaunay背景网格中添加辅助点,生成一层新的背景网格和新的映射关系;采用ball-vertex弹簧法驱动新背景网格的变形,进而牵动目标网格的变形。算例表明,本文提出的动态网格变形方法对所关心区域的网格具有良好保形性,边界可转动更大角度而不会出现网格交叉重叠问题,总体上提高了动态网格更新的效率和质量。     

二阶椭圆问题的各向异性非协调Crouzeix-Raviart型有限元方法

对满足最大角条件和坐标系条件的二维区域中的各向异性一般三角形网格,研究了二阶椭圆问题的非协调Crouzeix-Raviart型线性三角形有限元逼近,得到了最优的能量模和L2-模误差估计结果．     

A posteriori error estimates for optimal control problems constrained by convection-diffusion equations

We propose a characteristic finite element discretization of evolutionary type convection-diffusion optimal control problems. Nondivergence-free velocity fields and bilateral inequality control constraints are handled. Then some residual type a posteriori error estimates are analyzed for the approximations of the control, the state, and the adjoint state. Based on the derived error estimators, we use them as error indicators in developing efficient multi-set adaptive meshes characteristic finite element algorithm for such optimal control problems. Finally, one numerical example is given to check the feasibility and validity of multi-set adaptive meshes refinements.     

Assessment of a discontinuous Galerkin method for the simulation of vortical flows at high Reynolds number

This paper focuses on the assessment of a discontinuous Galerkin method for the simulation of vortical flows at high Reynolds number. The Taylor–Green vortex at Re = 1600 is considered. The results are compared with those obtained using a pseudo‐spectral solver, converged on a 512³ grid and taken as the reference. The temporal evolution of the dissipation rate, visualisations of the vortical structures and the kinetic energy spectrum at the instant of maximal dissipation are compared to assess the results. At an effective resolution of 288³, the fourth‐order accurate discontinuous Galerkin method (DGM) solution (p = 3) is already very close to the pseudo‐spectral reference; the error on the dissipation rate is then essentially less than a percent, and the vorticity contours at times around the dissipation peak overlap everywhere. At a resolution of 384³, the solutions are indistinguishable. Then, an order convergence study is performed on the slightly under‐resolved grid (resolution of 192³). From the fourth order, the decrease of the error is no longer significant when going to a higher order. The fourth‐order DGM is also compared with an energy conserving fourth‐order finite difference method (FD4). The results show that, for the same number of DOF and the same order of accuracy, the errors of the DGM computation are significantly smaller. In particular, it takes 768³ DOF to converge the FD4 solution. Finally, the method is also successfully applied on unstructured high quality meshes. It is found that the dissipation rate captured is not significantly impacted by the element type. However, the element type impacts the energy spectrum in the large wavenumber range and thus the small vortical structures. In particular, at the same resolution, the results obtained using a tetrahedral mesh are much noisier than those obtained using a hexahedral mesh. Those obtained using a prismatic mesh are already much better, yet still slightly noisier. Copyright © 2013 John Wiley & Sons, Ltd.     

Smoothness of Stationary Subdivision on Irregular Meshes

We derive necessary and sufficient conditions for tangent plane and C ^k -continuity of stationary subdivision schemes near extraordinary vertices. Our criteria generalize most previously known conditions. We introduce a new approach to analysis of subdivision surfaces based on the idea of the universal surface . Any subdivision surface can be locally represented as a projection of the universal surface, which is uniquely defined by the subdivision scheme. This approach provides us with a more intuitive geometric understanding of subdivision near extraordinary vertices. February 16, 1998. Date revised: January 27, 1999. Date accepted: April 2, 1999.