欧拉方程的隐式间断有限元算法研究

针对Euler方程,设计了适合间断Galerkin有限元方法的LU-SGS、GMRES以及修正LU-SGS隐式算法。采用Roe通量以及Van Albada限制器技术实现了经典LU-SGS、GMRES算法,引入高阶项误差补偿,发展了修正LU-SGS算法。以NACA0012、RAE2822翼型为例验证分析了算法的可靠性和高效性。结果表明修正LU-SGS算法存储量较少,程序实现方便,而且计算效率是LU-SGS算法的2.5倍以上,接近于循环GMRES算法。     

面向高阶精度CFD的JFNK算法及其并行计算

目前计算效率低是限制计算流体力学(computational fluid dynamics,CFD)高阶精度格式方法的重要因素之一。由于高阶精度格式计算模板相对复杂,很难精确计算其Jacobian矩阵,从而影响传统LU-SGS(lowerupper symmetric Gauss-Seidel)等算法的收敛效率。JFNK(Jacobian-free Newton-Krylov)算法是Krylov子空间方法与非精确牛顿方法的结合,拥有较好的迭代收敛效率,采用无矩阵思想,只计算Jacobian矩阵与矢量的乘积,从而有效避免Jacobian矩阵的计算和存储。在真实高精度结构网格CFD应用程序中,设计并实现了JFNK时间求解算法。在有粘低速圆柱绕流的算例测试中,和传统LU-SGS算法相比,JFNK算法拥有更好的计算稳定性,同时可使迭代收敛效率提高2倍以上。以天河2号超级计算机为并行计算平台,对JFNK算法和传统的LU-SGS算法的并行强可扩展性进行了测试,二者均表现出良好的并行效率。     

超声速进气道流场的CFD数值仿真

进气道是航空推进系统的一个重要组成部分,进气道内的流场品质会显著影响发动机的性能.由于进气道内部流动的复杂性和其广泛的应用前景,进气道内的流动特性引起了人们广泛的关注.采用计算流体力学(CFD)方法,空间离散采用Harten-Yee的二阶迎风TVD格式,时间迭代采用隐式LU-SGS方法,数值求解Navier-Stokes(N-S)方程,对进气道内部流场进行了数值模拟,并研究了进气道内部流场的流场结构以及激波/边界层干扰问题.数值计算结果反映出了流场的基本物理现象,说明了所采用的研究方法是可行的.同时数值模拟结果对进气道的设计有一定的参考价值.     

基于非结构网格隐式算法的GPU加速研究

针对非结构网格隐式算法在GPU上的加速效果不佳的问题,通过分析GPU的架构及并行模式,研究并实现了基于非结构网格格点格式的隐式LU-SGS算法的GPU并行加速.通过采用RCM和Metis网格重排序（重组）方法,优化非结构网格的数据局部性,改善非结构网格的隐式算法在GPU上的并行加速效果.通过三维机翼算例验证了本文实现的正确性及效率.结果表明两种网格重排序（重组）方法分别得到了63%和69%的加速效果提高.优化后的LU-SGS隐式GPU并行算法获得了相较于CPU串行算法27倍的加速比,充分说明了本文方法的高效性.     

基于结构网格的高超声速流动大规模并行数值模拟研究

本文采用MPI消息传递模式自主开发出适用于高超声速流动数值模拟的并行计算软件,该软件以三维Navier-Stokes方程为基本控制方程来求解层流问题,应用基于结构网格的有限体积法对计算域进行离散,采用AUSMPW+格式求解对流通量,利用MUSCL插值方法获得高阶精度,时间格式上采用LU-SGS方法进行时间迭代以加快求解定常流动的收敛过程。在高性能计算机上针对不同高超声速流动进行大规模并行计算的结果表明,所开发的CFD并行计算软件具有较高的并行计算效率,为高超声速飞行器气动力/热的准确预测提供了高效工具。     

无条件稳定的显式降维非线性有限元

针对传统降维非线性有限元计算速度与精确度难以兼顾的问题,提出了一种无条件稳定的显式迭代算法。基于泰勒展开式得到速度、加速度的三阶精度差分表达式从而获得新的有限元显式迭代方程,并分析其单自由度系统下的传递矩阵谱半径。改进迭代方程使谱半径始终小于1从而满足无条件稳定的要求。实验表明,改进后的显式迭代算法在等效阻尼比的精度上优于中心差分法和隐式迭代法;在降维非线性有限元模型计算中的计算耗时优于隐式迭代方法,提高了降维非线性有限元的迭代计算速度。模型在降维后维度数值较高时,仍能维持良好的计算耗时和帧率,保证了模型的精确度。     

具有间断系数热传导方程的局部间断Galerkin方法

本文给出了求解具有间断系数热传导方程稳定的局部间断Galerkin方法.理论表明,当采用k阶多项式有限元空间逼近时,该方法连续时间的L~2模误差估计阶为O(h~(k+1/2)).文中分别应用显式和隐式时间离散求解局部间断Galerkin格式,数值算例验证了方法的有效性和理论结果.     

Cahn-Hilliard方程多重网格求解器收敛性分析

Cahn-Hilliard(CH)方程是相场模型中的一个基本的非线性方程，通常使用数值方法进行分析。在对CH方程进行数值离散后会得到一个非线性的方程组，全逼近格式(Full Approximation Storage, FAS)是求解这类非线性方程组的一个高效多重网格迭代格式。目前众多的求解CH方程主要关注数值格式的收敛性，而没有论证求解器的可靠性。文中给出了求解CH方程离散得到的非线性方程组的多重网格算法的收敛性证明，从理论上保证了计算过程的可靠性。针对CH方程的时间二阶全离散差分数值格式，利用快速子空间下降(Fast Subspace Descent, FASD)框架给出其FAS格式多重网格求解器的收敛常数估计。为了完成这一目标，首先将原本的差分问题转化为完全等价的有限元问题，再论证有限元问题来自一个凸泛函能量形式的极小化，然后验证能量形式及空间分解满足FASD框架假设，最终得到原多重网格算法的收敛系数估计。结果显示，在非线性情形下，CH方程中的参数ε对网格尺度添加了限制，太小的参数会导致数值计算过程不收敛。最后通过数值实验验证了收敛系数与方程参数及网格尺度的依赖关系。     

复合隐式时间积分格式的非线性问题仿真研究

梯形时间格式在求解某些非线性问题时会出现失稳现象,无法获得收敛解,为了验证复合隐式时间积分格式在求解此类非线性问题时的优越性,通过比较分析数值耗散的大小确定复合隐式时间积分格式中γ的合理取值。通过Updated La-grangian方法建立非线性运动增量方程,应用9节点四边形单元划分计算域网格。分析比较了相同时间步长,γ取值对研究对象的位移、速度和加速度时程曲线的影响。悬臂梁承受恒定集中力和承受冲击载荷的算例均表明:γ取0.2时复合隐式积分格式引入的数值耗散较小,精度较高。     

动态中子输运方程迭代初值的选取方法

研究离散纵标动态中子输运方程迭代求解时,迭代初值的不同选取方法,设计合理的迭代初值可以适当放宽对时同步长的限制,缩短计算时间.设计四种迭代初值并应用于数值求解中的等比格式和菱形格式,其中等比格式形成非线性离散方程,菱形格式形成线性离散方程.考察不同迭代初值的计算效率,分别对物理量变化平缓以及变化剧烈的问题进行考察.数值算例表明构造的基于物理量随时间走势的预估值作为迭代初值优势明显,这在保证计算精度的前提下提高了数值计算效率.     

Weak Galerkin method for the Biot’s consolidation model

We develop a weak Galerkin (WG) finite element method for the Biot’s consolidation model in the classical displacement–pressure two-field formulation. Weak Galerkin linear finite elements are used for both displacement and pressure approximations in spatial discretizations. Backward Euler scheme is used for temporal discretization in order to obtain an implicit fully discretized scheme. We study the well-posedness of the linear system at each time step and also derive the overall optimal-order convergence of the WG formulation. Such WG scheme is designed on general shape regular polytopal meshes and provides stable and oscillation-free approximation for the pressure without special treatment. Numerical experiments are presented to demonstrate the efficiency and accuracy of the proposed weak Galerkin finite element method.     

Third-order temporal discrete scheme for the non-stationary Navier–Stokes equations

In this article, we suggest a new third-order time discrete scheme for the two-dimensional non-stationary Navier–Stokes equations. After presenting the Galerkin finite element approximation for the spatial discretization, we consider an implicit/explicit time discrete scheme for the problem, which is based on the two-step Adams–Moulton scheme (implicit scheme) for the linear term and the three-step Adams–Bashforth scheme (explicit scheme) for the nonlinear term. In this method, we only need to solve a linearized discrete system at each time step, so the scheme can converge fast and the computational cost can be reduced. Moreover, under some assumptions, we deduce the stability and optimal error estimate for the velocity in L ²-norm.     

Characteristic-based operator-splitting finite element method for Navier-Stokes equations

A new finite element method, which is the characteristic-based operator-splitting (CBOS) algorithm, is developed to solve Navier-Stokes (N-S) equations. In each time step, the equations are split into the diffusive part and the convective part by adopting the operator-splitting algorithm. For the diffusive part, the temporal discretization is performed by the backward difference method which yields an implicit scheme and the spatial discretization is performed by the standard Galerkin method. The convective...     

The discontinuous Galerkin method with Lax–Wendroff type time discretizations

In this paper we develop a Lax–Wendroff time discretization procedure for the discontinuous Galerkin method (LWDG) to solve hyperbolic conservation laws. This is an alternative method for time discretization to the popular total variation diminishing (TVD) Runge–Kutta time discretizations. The LWDG is a one step, explicit, high order finite element method. The limiter is performed once every time step. As a result, LWDG is more compact than Runge–Kutta discontinuous Galerkin (RKDG) and the Lax–Wendroff time discretization procedure is more cost effective than the Runge–Kutta time discretizations for certain problems including two-dimensional Euler systems of compressible gas dynamics when nonlinear limiters are applied.     

Finite element methods for unsteady solidification problems arising in prediction of morphological structure

Galerkin finite element methods are presented for calculation of the dynamic transitions between planar and deep two-dimensional cellular interface morphologies in directional solidification of a binary alloy from models that include solute transport, the phase diagram, and the interfacial free energy between melt and crystals. The unknown melt-solid interface shape is accounted for in the finite element formulation by mapping the equations to a fixed domain. Novel nonorthogonal transformations are introduced combining cylindrical and Cartesian coordinate interface representations for approximating the deep cellular interfaces that evolve from a planar solidification front. The algorithm for time integration combines a fully implicit Adams-Moulton algorithm with the Isotherm-Newton method for solving the nonlinear set of differential-algebraic equations that result from the spatial discretization of the moving-boundary problem. The fully implicit scheme is found to be more accurate and efficient than an explicit predictor-corrector algorithm. Sample calculations show the connectivity between families of shapes with resonant spatial wavelengths.     

Optimally Convergent HDG Method for Third-Order Korteweg–de Vries Type Equations

We develop and analyze a new hybridizable discontinuous Galerkin method for solving third-order Korteweg–de Vries type equations. The approximate solutions are defined by a discrete version of a characterization of the exact solution in terms of the solutions to local problems on each element which are patched together through transmission conditions on element interfaces. We prove that the semi-discrete scheme is stable with proper choices of stabilization function in the numerical traces. For the linearized equation, we carry out error analysis and show that the approximations to the exact solution and its derivatives have optimal convergence rates. In numerical experiments, we use an implicit scheme for time discretization and the Newton–Raphson method for solving systems of nonlinear equations, and observe optimal convergence rates for both the linear and the nonlinear third-order equations.     

Fully discrete local discontinuous Galerkin method for solving the fractional telegraph equation

This paper aims to develop a fully discrete local discontinuous Galerkin finite element method for numerical simulation of the time-fractional telegraph equation, where the fractional derivative is in the sense of Caputo. The method is based on a finite difference scheme in time and local discontinuous Galerkin methods in space. The stability and convergence of this discontinuous approach are discussed and theoretically proven. Finally numerical examples are performed to illustrate the effectiveness and the accuracy of the method.     

A fully discrete scheme for the pressure–stress formulation of the time-domain fluid–structure interaction problem

We propose an implicit Newmark method for the time integration of the pressure–stress formulation of a fluid–structure interaction problem. The space Galerkin discretization is based on the Arnold–Falk–Winther mixed finite element method with weak symmetry in the solid and the usual Lagrange finite element method in the acoustic medium. We prove that the resulting fully discrete scheme is well-posed and uniformly stable with respect to the discretization parameters and Poisson ratio, and we provide asymptotic error estimates. Finally, we present numerical tests to confirm the asymptotic error estimates predicted by the theory.     

Convergence of linearized backward Euler–Galerkin finite element methods for the time-dependent Ginzburg–Landau equations with temporal gauge

We present error analysis of fully discrete Galerkin finite element methods for the time-dependent Ginzburg–Landau equations with the temporal gauge, where a linearized backward Euler scheme is used for the time discretization. We prove that the convergence rate is O(τ+h^r) if the finite element space of piecewise polynomials of degree r is used. Due to the degeneracy of the problem, the convergence rate is one order lower than the optimal convergence rate of finite element methods for parabolic equations. Numerical examples are provided to support our theoretical analysis.