基于多步高阶差分格式求解时域Maxwell方程

提出基于无穷维哈密尔顿系统及分裂算子理论的多步高阶差分格式,求解时域Maxwell方程.在时间方向上,针对Maxwell方程采用不同阶数的辛算法进行差分离散;在空间方向上,采用四阶差分格式进行差分离散.探讨多步高阶差分格式的稳定性及数值色散性,最后给出数值计算结果.结果表明,五级四阶格式为最有效的多步高阶差分格式,具有高精度、占用较少的计算机资源等优点,适用于长时间的数值模拟.     

分数阶对流扩散方程的特征有限元方法

讨论非线性分数阶对流扩散方程的特征有限元方法.利用特征线法和分数阶有限元框架,构建一种基于特征方向的全离散有限元格式.模拟物理问题,并在数值上与常规有限元格式进行比较,计算结果表明：该方法能准确地捕捉到控制方程的精确解,即使是在对流效应占优时,也具有稳定性好和逼近精度高等特征.     

高阶辛算法在典型量子器件模拟中的应用

利用辛积分和高阶交错差分方法建立了求解含时薛定谔方程的高阶辛算法(SFDTD(4,4)).对空间部分的二阶导数采用四阶准确度的差分格式离散得到随时间演化的多维系统再引入四阶辛积分格式离散;探讨了SFDTD(4,4)法的稳定性,获得了含时薛定谔方程的一维以及多维的稳定性条件,并得到在含势能情况下该稳定性条件的具体表达式;借助复坐标沿伸概念,实现了SFDTD(4,4)法在量子器件模拟中的完全匹配层吸收边界条件.结合一维量子阱和金属场效应管传输的仿真,结果表明较传统的时域有限差分算法,SFDTD(4,4)有着更好的计算准确度,适用于长时间仿真.算法及相关结果可为实际量子器件的设计提供必要的参考.     

二维Lagrangian坐标系下可压气动方程组的间断Petrov-Galerkin方法

构造矩形网格下求解Lagrangian坐标系下气动方程组的单元中心型格式. 空间离散采用控制体积间断Petrov-Galerkin方法,时间离散采用二阶TVD Runge-Kutta方法. 利用限制器来抑制非物理震荡并保证RKCV算法的稳定性. 构造的算法可以保证物理量的局部守恒. 与Runge-Kutta间断Galerkin（RKDG）方法相比较,RKCV方法的计算公式少一项积分项使得计算较简单. 给出一些数值算例验证了算法的可靠性及效率.     

二维Lagrangian坐标系下可压气动方程组的间断Petrov-Galerkin方法（英文）

构造矩形网格下求解Lagrangian坐标系下气动方程组的单元中心型格式.空间离散采用控制体积间断Petrov-Galerkin方法,时间离散采用二阶TVD Runge-Kutta方法.利用限制器来抑制非物理震荡并保证RKCV算法的稳定性.构造的算法可以保证物理量的局部守恒.与Runge-Kutta间断Galerkin(RKDG)方法相比较,RKCV方法的计算公式少一项积分项使得计算较简单.给出一些数值算例验证了算法的可靠性及效率.     

非等温非牛顿黏性流体流动问题的修正光滑粒子动力学方法模拟

为准确、有效地模拟非等温非牛顿黏性流体的流动问题,本文基于一种不含核导数计算的核梯度修正格式和不可压缩条件给出了一种改进光滑粒子动力学(SPH)离散格式,它较传统SPH离散格式具有较高精度和较好稳定性.同时,为准确地描述温度场的演化过程,建立了非牛顿黏性的SPH温度离散模型.通过对等温Poiseuille流、喷射流和非等温Couette流、4:1收缩流进行模拟,并与其他数值结果作对比,分别验证了改进SPH方法模拟非牛顿黏性流动问题的可靠性和提出的SPH温度离散模型求解非等温流动问题的有效性和准确性.随后,运用改进SPH方法结合SPH温度离散模型对环形腔和C形腔内非等温非牛顿黏性流体的充模过程进行了试探性模拟研究,分析了数值模拟的收敛性,讨论了不同位置处热流参数对温度和流动的影响.     

λ算法在轴对称情况的改进

本文给出了一种改进的λ算法。该算法可以用于计算二维流动和轴对称流动。在导出了以广义黎曼变量表示的欧拉方程组后，本文用两步两点迎风格式对方程组离散求解。由于采用了广义黎曼变量表示的方程组，离散求解时充分考虑了变量的信息依赖域，所以算法稳定性好；由于仅用到待算点单侧一点的构造格式，所以算法简单，编程容易，同时也节省了计算时间。作为算例，我们对钝体超音绕流进行了广泛计算，结果表明，本算法速度快，稳定性好     

抛物方程显隐修正迎风区域分裂差分法

给出抛物方程一种有效的区域分裂差分格式,提高了计算效率.对一阶项采用二阶迎风差分格式,内边界点和各子区域分别采用显隐差分格式.在较弱的稳定性条件下,得到离散l2模误差估计结果.最后给出具体的数值算例,以验证方法的实用性.     

二维可压缩流体力学Lagrange有限点方法

提出二维可压缩流体力学问题的拉格朗日有限点方法,将求解区域离散为适当的点集.在每个时间步,每个离散点与其周围适当的五个邻点组成一个基本计算单元.在每个计算单元上,利用有限点方法中的典型微分算子的五点近似公式直接离散流体力学方程中的微分算子,并在每个方程中加上一个人为拉普拉斯粘性项,达到稳定格式的目的.给出时间步长的自动选取算法.数值算例结果验证了算法的有效性,初步展示了其计算大变形流体问题的良好发展潜力.     

耦合界面计算格式的一维流体力学Lagrange有限点方法

为探索高维多介质流体力学散乱点集上的Lagrange有限点方法,首先对相应一维问题进行研究,提出一种Lagrange有限点方法:在计算区域内(包括物质界面)设置任意离散点集,所有力学量都设在该点集上,在内点和界面点上分别建立离散格式.内点算法为基于Taylor展开的差分方法.界面点算法为显式追踪算法,从定解条件出发,利用Rankine-Hugoniot关系和特征差分方法,计算界面点位置及相应的状态量变化.通过追踪界面点的运动得到物质界面是方法的最大特色.典型算例计算结果与精确解符合很好,验证了算法的合理和有效性.     

A splitting method for incompressible flows with variable density based on a pressure Poisson equation

A new fractional time-stepping technique for solving incompressible flows with variable density is proposed. The main feature of this method is that, as opposed to other known algorithms, the pressure is determined by just solving one Poisson equation per time step, which greatly reduces the computational cost. The stability of the method is proved and the performance of the method is numerically illustrated.     

Numerical simulations of 2D fractional subdiffusion problems

The growing number of applications of fractional derivatives in various fields of science and engineering indicates that there is a significant demand for better mathematical algorithms for models with real objects and processes. Currently, most algorithms are designed for 1D problems due to the memory effect in fractional derivatives. In this work, the 2D fractional subdiffusion problems are solved by an algorithm that couples an adaptive time stepping and adaptive spatial basis selection approach. The proposed algorithm is also used to simulate a subdiffusion-convection equation.     

A velocity decomposition approach for moving interfaces in viscous fluids

We present a second-order accurate method for computing the coupled motion of a viscous fluid and an elastic material interface with zero thickness. The fluid flow is described by the Navier–Stokes equations, with a singular force due to the stretching of the moving interface. We decompose the velocity into a “Stokes” part and a “regular” part. The first part is determined by the Stokes equations and the singular interfacial force. The Stokes solution is obtained using the immersed interface method, which gives second-order accurate values by incorporating known jumps for the solution and its derivatives into a finite difference method. The regular part of the velocity is given by the Navier–Stokes equations with a body force resulting from the Stokes part. The regular velocity is obtained using a time-stepping method that combines the semi-Lagrangian method with the backward difference formula. Because the body force is continuous, jump conditions are not necessary. For problems with stiff boundary forces, the decomposition approach can be combined with fractional time-stepping, using a smaller time step to advance the interface quickly by Stokes flow, with the velocity computed using boundary integrals. The small time steps maintain numerical stability, while the overall solution is updated on a larger time step to reduce computational cost.     

汽液界面厚度和分维数

本文应用分子动力学模拟方法进行了汽液界面厚度和分维数的模拟研究。用统计系综方法,以氩原子为对象,对长方形模拟盒中粒子数目为2048个的汽液平衡共存系统进行模拟计算。研究了一定条件下汽液界面厚度的取定对确定界面分维数的影响,根据计算模拟结果,提出了可用15~85法则确定界面厚度和分维数。汽液界面在X方向、Y方向和Z方向具有不同的分维数,充分说明了汽液界面的各性异性性质。     

A class of Cartesian grid embedded boundary algorithms for incompressible flow with time-varying complex geometries

We present a class of numerical algorithms for simulating viscous fluid problems of incompressible flow interacting with moving rigid structures. The proposed Cartesian grid embedded boundary algorithms employ a slightly different idea from the traditional direct-forcing immersed boundary methods: the proposed algorithms calculate and apply the force density in the extended solid domain to uphold the solid velocity and hence the boundary condition at the rigid-body surface. The principle of the embedded boundary algorithm allows us to solve the fluid equations on a Cartesian grid with a set of external forces spread onto the grid points occupied by the rigid structure. The proposed algorithms use the MAC (marker and cell) algorithm to solve the incompressible Navier-Stokes equations. Unlike projection methods, the MAC scheme incorporates the gradient of the force density in solving the pressure Poisson equation, so that the dipole force, due to the jump of pressure across the solid-fluid interface, is directly balanced by the gradient of the force density. We validate the proposed algorithms via the classical benchmark problem of flow past a cylinder. Our numerical experiments show that numerical solutions of the velocity field obtained by using the proposed algorithms are smooth across the solid-fluid interface. Finally, we consider the problem of a cylinder moving between two parallel plane walls. Numerical solutions of this problem obtained by using the proposed algorithms are compared with the classical asymptotic solutions. We show that the two solutions are in good agreement.     

Analysis of an immersed boundary method for three-dimensional flows in vorticity formulation

This article presents numerical analysis and practical considerations for three-dimensional flow computation using an implicit immersed boundary method. The Euler equations, or half a step of the Navier–Stokes equations when using fractional step algorithms, are investigated in their vorticity formulation. The context of flow computation around an arbitrarily shaped body is especially investigated.In conventional immersed boundary methods using vorticity, singular vortex are dispatched over the body surface. In the present study, one prefers using sources of potential velocity field, dispatched on the body, whose nature is not vorticity. Such a formulation is compatible to the Euler equations. In practice, these sources of potential flow produce a velocity through this surface, aiming in practice at cancelling a flow-through velocity.This article focuses on the use of the source-to-flow-through linear application, its properties being the key points for fast convergence. Its self-adjointness, or lack thereof, conditioning and preconditioning aspects are investigated. It follows that computing a velocity field with no-flow-through conditions in complex geometry, when using the source-to-flow-through linear application, can be achieved for 4/3 of the computational cost of standard Poisson equation in a Cartesian box.The robustness of immersed boundaries is especially interesting when used together with vortex-in-cell methods, well known for their robustness in time and their ability to compute accurately convective effects. A few examples, based on real-world geometries, illustrate the method capabilities.     

The momentum interpolation method based on the time-marching algorithm for All-Speed flows

The time-marching approach has clear physical meaning and strict mathematical nature and has been applied in computation of compressible flows widely and extended to many uniform algorithms for All-Speed flows. Remedy for its weakness in the problem of checkerboard decoupling of pressure field for incompressible flows is envisaged with the time-marching momentum interpolation method (MIM) taken into account in this paper. Existing preconditioning methods for suppressing decoupling and time-marching MIM are analyzed for this purpose, and algorithms of time-marching MIM are proposed for steady and unsteady flows and for All-Speed flows. Asymptotic analysis shows that the supposed time-marching MIM has at least a third-order accuracy, better than the existing time-marching coupling methods, which only have an accuracy of the same order as the adopted scheme has. Effects of the time step sizes on the ability of the time-marching MIM to suppress the checkerboard pressure decoupling are particularly discussed in terms of the dual-time stepping approach, and it is revealed how the decreased sizes of either the pseudo- or physical-time step increases the possibility of decoupling and how Choi’s modification, in which the history of the interface velocity is decided by itself instead of the arithmetic average of the velocities on its adjacent nodes, removes the unphysical pressure oscillation with small size of the physical time step but leads to divergence with the pseudo-time step as well. As a remedy for the pseudo-time step, such methods are recommended as implicit methods and the local-time step method with a proposed modification of the time-marching MIM preventing accuracy loss due to very large time step size. Numerical experiments support the theoretical analyses and show the validity of the time-marching MIM proposed.     

任意不可压多介质流的粒子有限元方法模拟

基于粒子有限元方法(particle finite element method,PFEM),利用细分混合单元的界面识别思想,模拟种类任意多的不可压多介质流问题.对分步算法采用基于有限增量微积分理论的稳定措施,以适应流体特性差异;将混合单元细分为代表单一流体的小单元,进而得到流体间的边界;通过加密边界、控制粒子速度、自动检查穿透来防止粒子穿透外部边界.瑞利-泰勒不稳定性和水柱在空气中倒塌的模拟与已有结果的对比验证了PFEM及界面识别方法的可靠性和准确性.七种流体混合的模拟结果表明PFEM可有效处理任意多种类不相溶流体的混合流动问题.     

An effective attenuation coefficient for evanescent wave spectroscopy using multimode fiber

An attenuation coefficient for evanescent wave spectroscopy on the core of a multimode step index fiber in contact with an absorbing species is derived in terms of the range of incident angles of the meridional rays to the interface. An expression, for the fractional power outside the core as a function of incident angles is also given. Their ratio is discussed for the case of a fiber sensor having a porous cladding in contact with a gaseous absorbing species and one in which a section of cladding has been removed and replaced by an absorbing liquid.     

Improved determination of retardation in digital photoelasticity by load stepping

Use of phase shifting has revolutionized the acquisition of photoelastic data. Even since its introduction, various researchers have improved the methodology. In phase shifting the problem of ambiguity exists in the sign of fractional retardation in some zones of the model. This has been overcome with the development of load stepping. However, the conventional approach to data processing in load stepping introduces several noise points in the phase map. In this paper a new methodology for data reduction in load stepping, which removes the noise points in the domain is presented. Results from four- and six-step algorithms are analyzed. A normalization scheme to improve the results has been proposed. A comparative study has also been carried out on the evaluation of phase map by phase shifting, load stepping and the new methodology.