求解含有高阶导数偏微分方程的局部间断Petrov-Galerkin方法（英文）

构造一类求解三种类型偏微分方程的间断Petrov-Galerkin方法.求解的方程分别含有二阶、三阶和四阶偏导数,包括Burgers型方程、KdV型方程和双调和型方程.首先将高阶微分方程转化成为与之等价的一阶微分方程组,再将求解双曲守恒律的间断Petrov-Galerkin方法用于求解微分方程组.该方法具有四阶精度且具有间断Petrov-Galerkin方法的优点.数值实验表明该方法可以达到最优收敛阶而且可以模拟复杂波形相互作用,如孤立子的传播及相互碰撞等.     

局部间断Petrov-Galerkin方法在大气污染模型中的应用

构造数值模拟两类大气污染模型的局部间断Petrov-Galerkin方法.首先通过变量代换将大气污染模型方程转化为与之等价的一阶微分方程组,再利用间断Petrov-Galerkin方法求解微分方程组.该方法既可以选取不同的检验函数和试探函数空间,又可以保持间断Petrov-Galerkin方法的优势.同局部间断有限元方...     

利用耦合的Riccati方程组构造微分-差分方程精确解

通过引入耦合的Riccati方程组得到一个构造非线性微分-差分方程精确解的代数方法.作为实例,将该方法应用到了一般格子方程,相对论的Toda格子方程和(2+1)维Toda格子方程.借助符号计算软件Mathematica,获得了这些方程的扭结型孤波解和复数解.该方法也适合求解其他非线性微分-差分方程的精确解. 关键词： 耦合Riccati方程组 格子方程 相对论的Toda格子方程 (2+1)维Toda格子方程     

间断有限元方法求解一维非平衡辐射扩散方程

研究一维非平衡辐射扩散方程的数值方法.通过求解间断系数热传导方程的广义黎曼问题,得到一种带加权数值流量,基于该数值流量构造了一类新型的间断有限元方法.在时间离散上采用向后Euler方法,形成的非线性方程组采用Picard迭代求解.数值试验表明该方法具有捕捉大梯度的能力,而且能适应扩散系数间断的情形.     

隐-显积分因子间断Galerkin方法求解二维辐射扩散方程

提出一种求解二维非平衡辐射扩散方程的数值方法.空间离散上采用加权间断Galerkin有限元方法,其中数值流量的构造采用一种新的加权平均;时间离散上采用隐-显积分因子方法,将扩散系数线性化,然后用积分因子方法求解间断Galerkin方法离散后的非线性常微分方程组.数值试验中在非结构网格上求解了多介质的辐射扩散方程.结果表明:对于强非线性和强耦合的非线性扩散方程组,该方法是一种非常有效的数值算法.     

变系数瞬态热传导问题边界元格式的特征正交分解降阶方法

提出了一种基于边界元法求解变系数瞬态热传导问题的特征正交分解(POD)降阶方法,重组并推导出变系数瞬态热传导问题适合降阶的边界元离散积分方程,建立了变系数瞬态热传导问题边界元格式的POD降阶模型,并用常数边界条件下建立的瞬态热传导问题的POD降阶模态,对光滑时变边界条件瞬态热传导问题进行降阶分析.首先,对一个变系数瞬态热传导问题,建立其边界域积分方程,并将域积分转换成边界积分;其次,离散并重组积分方程,获得可用于降阶分析的矩阵形式的时间微分方程组;最后,用POD模态矩阵对该时间微分方程组进行降阶处理,建立降阶模型并对其求解.数值算例验证了本文方法的正确性和有效性.研究表明:1)常数边界条件下建立的低阶POD模态矩阵,能够用来准确预测复杂光滑时变边界条件下的温度场结果;2)低阶模型的建立,解决了边界元法中采用时间差分推进技术求解大型时间微分方程组时求解速度慢、算法稳定性差的问题.     

立方非线性Schrdinger方程的Weierstrass椭圆函数周期解

利用Weierstrass椭圆函数展开法对非线性光学、等离子体物理等许多系统中出现的立方非线性Schrdinger方程进行了研究.首先通过行波变换将方程化为一个常微分方程,再利用Weierstrass椭圆函数展开法思想将其化为一组超定代数方程组,通过解超定方程组,求得了含Weierstrass椭圆函数的周期解,以及对应的Jacobi椭圆函数解和极限情况下退化的孤波解.该方法有以下两个特点:一是可以借助数学软件Mathematica自动地完成;二是可以用于求解其它的非线性演化方程(方程组).     

球几何中子输运保正线性间断有限元格式

针对球几何中子输运方程线性间断有限元方法计算的负中子通量问题,构造了保正线性间断有限元格式,该格式保持中子角通量0阶矩和1阶矩。现有方法计算中子角通量非负时,采用传统的线性间断有限元方法,求解线性方程组;原方法计算出现负通量,则采用构造的保正格式,求解非线性方程组。编制了球几何中子输运问题保正格式程序模块,并集成到应用程序。数值算例表明构造的保正格式计算的中子通量非负,有效降低数值误差,提高数值计算的精度。     

立方非线性Schr(o)dinger方程的Weierstrass椭圆函数周期解

利用Weierstrass椭圆函数展开法对非线性光学、等离子体物理等许多系统中出现的立方非线性Schr(o)dinger方程进行了研究.首先通过行波变换将方程化为一个常微分方程,再利用Weierstrass椭圆函数展开法思想将其化为一组超定代数方程组,通过解超定方程组,求得了含Weierstrass椭圆函数的周期解,以及对应的Jacobi椭圆函数解和极限情况下退化的孤波解.该方法有以下两个特点:一是可以借助数学软件Mathematica自动地完成;二是可以用于求解其它的非线性演化方程(方程组).     

立方非线性Schr?dinger方程的Weierstrass椭圆函数周期解

利用Weierstrass椭圆函数展开法对非线性光学、等离子体物理等许多系统中出现的立方非线性 Schr(o)dinger方程进行了研究.首先通过行波变换将方程化为一个常微分方程,再利用Weierstrass椭圆函数展开法思想将其化为一组超定代数方程组,通过解超定方程组,求得了含Weierstrass椭圆函数的周期解,以及对应的Jacobi椭圆函数解和极限情况下退化的孤波解.该方法有以下两个特点:一是可以借助数学软件Mathematica自动地完成;二是可以用于求解其它的非线性演化方程(方程组).     

Point-wise hierarchical reconstruction for discontinuous Galerkin and finite volume methods for solving conservation laws

We develop a new hierarchical reconstruction (HR) method  and  for limiting solutions of the discontinuous Galerkin and finite volume methods up to fourth order of accuracy without local characteristic decomposition for solving hyperbolic nonlinear conservation laws on triangular meshes. The new HR utilizes a set of point values when evaluating polynomials and remainders on neighboring cells, extending the technique introduced in Hu, Li and Tang [9]. The point-wise HR simplifies the implementation of the previous HR method which requires integration over neighboring cells and makes HR easier to extend to arbitrary meshes. We prove that the new point-wise HR method keeps the order of accuracy of the approximation polynomials. Numerical computations for scalar and system of nonlinear hyperbolic equations are performed on two-dimensional triangular meshes. We demonstrate that the new hierarchical reconstruction generates essentially non-oscillatory solutions for schemes up to fourth order on triangular meshes.     

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

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

A domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by discontinuous Galerkin methods

We present here a domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by a discontinuous Galerkin method. In order to allow the treatment of irregularly shaped geometries, the discontinuous Galerkin method is formulated on unstructured tetrahedral meshes. The domain decomposition strategy takes the form of a Schwarz-type algorithm where a continuity condition on the incoming characteristic variables is imposed at the interfaces between neighboring subdomains. A multifrontal sparse direct solver is used at the subdomain level. The resulting domain decomposition strategy can be viewed as a hybrid iterative/direct solution method for the large, sparse and complex coefficients algebraic system resulting from the discretization of the time-harmonic Maxwell equations by a discontinuous Galerkin method.     

Fourth Order Compact Boundary Value Method for Option Pricing with Jumps

We consider pricing options in a jump-diffusion model which requires solving a partial integro-differential equation. Discretizing the spatial direction with a fourth order compact scheme leads to a linear system of ordinary differential equations. For the temporal direction, we utilize the favorable boundary value methods owing to their advantageous stability properties. In addition, the resulting large sparse system can be solved rapidly by the GMRES method with a circulant Strang-type preconditioner. Numerical results demonstrate the high order accuracy of our scheme and the efficiency of the preconditioned GMRES method.     

The discontinuous Petrov-Galerkin method for one-dimensional compressible Euler equations in the Lagrangian coordinate

In this paper, a Petrov-Galerkin scheme named the Runge-Kutta control volume (RKCV) discontinuous finite element method is constructed to solve the one-dimensional compressible Euler equations in the Lagrangian coordinate. Its advantages include preservation of the local conservation and a high resolution. Compared with the Runge-Kutta discontinuous Galerkin (RKDG) method, the RKCV method is easier to implement. Moreover, the advantages of the RKCV and the Lagrangian methods are combined in the new method. Several numerical examples are given to illustrate the accuracy and the reliability of the algorithm.     

Hamilton--Jacobi method for solving ordinary differential equations

The Hamilton--Jacobi method for solving ordinary differential equations is presented in this paper. A system of ordinary differential equations of first order or second order can be expressed as a Hamilton system under certain conditions. Then the Hamilton--Jacobi method is used in the integration of the Hamilton system and the solution of the original ordinary differential equations can be found. Finally, an example is given to illustrate the application of the result.     

Approximate direct reduction method: infinite series reductions to the perturbed mKdV equation

The approximate direct reduction method is applied to the perturbed mKdV equation with weak fourth order dispersion and weak dissipation. The similarity reduction solutions of different orders conform to formal coherence, accounting for infinite series reduction solutions to the original equation and general formulas of similarity reduction equations. Painlevé II type equations, hyperbolic secant and Jacobi elliptic function solutions are obtained for zero-order similarity reduction equations. Higher order similarity reduction equations are linear variable coefficient ordinary differential equations.