一个新的保单调保守恒插值算子

提出一个保守恒保单调的PQIM插值算子,论证该算子的收敛阶、保守恒性与保单调性,通过数值实验,证明该算子能有效地抑制可能由插值引起的振荡.     

多组份流动质量分数保极值原理算法

对基于质量分数的Mie-Gruneisen状态方程多流体组份模型提出了新的数值方法.该模型保持混合流体的质量、动量、和能量守恒,保持各组份分质量守恒,在多流体组份界面处保持压力和速度一致.该模型是拟守恒型方程系统.对该模型系统的离散采用波传播算法.与直接对模型中所有守恒方程采用相同算法不同的是,在处理分介质质量守恒方程时,对波传播算法进行了修正,使之满足质量分数保极值原理.而不作修改的算法则不能保证质量分数在[0,1]范围.数值实验验证了该方法有效.     

非结构多面体二阶局部保界全局重映算法

提出一种三维非结构多面体二阶保界全局重映算法.在旧网格上选取模板利用最小二乘构造插值多项式,采用凸包算法计算多面体相交部分,最后使用局部保界修正技术修补重映后的越界量.多项数值实验表明这种格式同时具有高精度、高分辨率和高效率的特点.     

ENO守恒插值(重映)方法及其在流体计算中的应用

在ENO(Essentially Non-oscillatory)守恒插值方法的基础上,分析和研究现今流体力学计算中涉及的几类网格技术:重叠网格技术、自适应加密技术和运动网格技术.基于ENO插值多项式构造的重映方法具有良好的守恒性,可以有效保证数据传递中物理量的总体守恒.提出该类守恒插值方法在以上几种网格技术中的一些应用前景,并给出一些数值算例.     

SAMR网格上扩散方程有限体格式的逼近性与两层网格算法

针对结构自适应加密网格(SAMR)上扩散方程的求解,分析几种有限体格式的逼近性,同时设计和分析一种两层网格算法.首先,讨论一种常见的守恒型有限体格式,并给出网格加密区域和细化/粗化插值算子的条件;接着,通过在粗细界面附近引入辅助三角形单元,消除粗细界面处的非协调单元,设计了一种保对称有限体元(SFVE)格式,分析表明,该格式具有更好的逼近性,且对网格加密区域和插值算子的限制更弱;最后,为SFVE格式构造一种两层网格(TL)算法,理论分析和数值实验表明该算法的一致收敛性.     

一类自适应运动网格的ALE方法

从积分形式的二维Lagrange流体力学方程组出发,使用ENO高阶插值多项式,推广了四边形结构网格下的一阶有限体积格式,构造一类结构网格下的高精度有限体积格式.结合有效的守恒重映方法,发展一类高精度的ALE方法,并结合自适应运动网格技术,进行ALE方法的数值模拟,得到预期的效果.     

用保角变换法制作二维第一类格林函数

从黎曼定理出发,结合单位圆内线电荷的电势表达式,用保角变换法制作二维第一类格林函数.     

孤立波方程的保结构算法

讨论了孤立波方程的保结构差分算法，以一些经典的孤立波方程为例，如KdV，sine-Gordon，K-P方程，给出了它们的辛和多辛结构，说明辛和多辛算法的可适用性．提出局部守恒算法和广义保结构算法的概念，它们是保结构算法的概念自然推广．还给出一种能系统构造局部守恒格式的复合方法．数值例子说明，保结构数值能很好模拟各种孤立波的演化。     

强场一维模型问题的保Wronskian守恒算法

提出辛算法是保Wronskian守恒的算法,把辛算法应用于强激光场一维模型的计算中,结果显示,Wronskian保持不变,与理论分析一致。     

Lagrange坐标系下二维气动方程组的RKDG有限元方法

构造Lagrange坐标系下二维可压缩气动方程组的RKDG(Runge-Kutta Discontinuous Galerkin)有限元方法.将流体力学方程组和几何守恒律统-求解,所有计算都在固定的网格上进行,计算过程中不需要网格节点的速度信息.对几个数值算例进行数值模拟,得到较好的数值模拟结果.     

Advances in multi-domain lattice Boltzmann grid refinement

Grid refinement has been addressed by different authors in the lattice Boltzmann method community. The information communication and reconstruction on grid transitions is of crucial importance from the accuracy and numerical stability point of view. While a decimation is performed when going from the fine to the coarse grid, a reconstruction must performed to pass form the coarse to the fine grid. In this context, we introduce a decimation technique for the copy from the fine to the coarse grid based on a filtering operation. We show this operation to be extremely important, because a simple copy of the information is not sufficient to guarantee the stability of the numerical scheme at high Reynolds numbers. Then we demonstrate that to reconstruct the information, a local cubic interpolation scheme is mandatory in order to get a precision compatible with the order of accuracy of the lattice Boltzmann method.These two fundamental extra-steps are validated on two classical 2D benchmarks, the 2D circular cylinder and the 2D dipole–wall collision. The latter is especially challenging from the numerical point of view since we allow strong gradients to cross the refinement interfaces at a relatively high Reynolds number of 5000. A very good agreement is found between the single grid and the refined grid cases.The proposed grid refinement strategy has been implemented in the parallel open-source library Palabos.     

三维弹塑性流体力学自适应欧拉方法研究

 研究了三维多介质弹塑性流体力学欧拉数值方法的网格自适应技术,编制了可计算多介质弹塑性流体力学问题的三维自适应欧拉程序,解决了计算弹塑性问题时应用网格自适应方法所遇到的一系列关键问题,如网格细分和合并规则,父网格或子网格物理量的填充,幻影网格的选择、填充及存储方案,插值函数的选择及如何选择时间步长等问题。给出了侵彻、爆轰等弹塑性问题的数值算例,验证了方法的有效性。     

High order numerical approximation of minimal surfaces

We present an algorithm for finding high order numerical approximations of minimal surfaces with a fixed boundary. The algorithm employs parametrization by high order polynomials and a linearization of the weak formulation of the Laplace–Beltrami operator to arrive at an iterative procedure to evolve from a given initial surface to the final minimal surface. For the steady state solution we measure the approximation error in a few cases where the exact solution is known. In the framework of parametric interpolation, the choice of interpolation points (mesh nodes) is directly affecting the approximation error, and we discuss how to best update the mesh on the evolutionary surface such that the parametrization remains smooth. In our test cases we may achieve exponential convergence in the approximation of the minimal surface as the polynomial degree increases, but the rate of convergence greatly differs with different choices of mesh update algorithms. The present work is also of relevance to high order numerical approximation of fluid flow problems involving free surfaces.     

A Revisit on the Derivation of the Particular Solution for the Differential Operator ∆2 ± λ2

In this paper, we applied the polyharmonic splines as the basis functions to derive particular solutions for the differential operator ∆² ± λ². Similar to the derivation of fundamental solutions, it is non-trivial to derive particular solutions for higher order differential operators. In this paper, we provide a simple algebraic factorization approach to derive particular solutions for these types of differential operators in 2D and 3D. The main focus of this paper is its simplicity in the sense that minimal mathematical background is required for numerically solving higher order partial differential equations such as thin plate vibration. Three numerical examples in both 2D and 3D are given to validate particular solutions we derived.     

自适应结构网格上扩散方程隐式时间积分算法及其应用

提出一种自适应结构网格(SAMR)上求解扩散方程的隐式时间积分算法.该算法从粗网格到细网格逐层进行时间积分,通过多层迭代同步校正保证粗细界面的流连续和计算区域的扩散平衡.分析算法复杂度,并给出评估算法低复杂度的准则.典型算例表明,相对于一致加密情形,本文算法能够在保持相同计算精度的前提下,大幅度降低网格规模和计算量,且具有低复杂度.将算法应用于辐射流体力学数值模拟中非线性扩散方程组求解,相对于一致加密网格,SAMR计算将计算量下降一个量级以上,计算效率提高33.2倍.     

Adaptive mesh refinement based on high order finite difference WENO scheme for multi-scale simulations

In this paper, we propose a finite difference AMR-WENO method for hyperbolic conservation laws. The proposed method combines the adaptive mesh refinement (AMR) framework  and  with the high order finite difference weighted essentially non-oscillatory (WENO) method in space and the total variation diminishing (TVD) Runge–Kutta (RK) method in time (WENO-RK)  and  by a high order coupling. Our goal is to realize mesh adaptivity in the AMR framework, while maintaining very high (higher than second) order accuracy of the WENO-RK method in the finite difference setting. The high order coupling of AMR and WENO-RK is accomplished by high order prolongation in both space (WENO interpolation) and time (Hermite interpolation) from coarse to fine grid solutions, and at ghost points. The resulting AMR-WENO method is accurate, robust and efficient, due to the mesh adaptivity and very high order spatial and temporal accuracy. We have experimented with both the third and the fifth order AMR-WENO schemes. We demonstrate the accuracy of the proposed scheme using smooth test problems, and their quality and efficiency using several 1D and 2D nonlinear hyperbolic problems with very challenging initial conditions. The AMR solutions are observed to perform as well as, and in some cases even better than, the corresponding uniform fine grid solutions. We conclude that there is significant improvement of the fifth order AMR-WENO over the third order one, not only in accuracy for smooth problems, but also in its ability in resolving complicated solution structures, due to the very low numerical diffusion of high order schemes. In our work, we found that it is difficult to design a robust AMR-WENO scheme that is both conservative and high order (higher than second order), due to the mass inconsistency of coarse and fine grid solutions at the initial stage in a finite difference scheme. Resolving these issues as well as conducting comprehensive evaluation of computational efficiency constitute our future work.