求解Klein-Gordon-Schrdinger方程组的一个新型守恒差分算法的收敛性分析

对复Schrdinger场和实Klein-Gordon场相互作用下一类耦合方程组的初边值问题进行了数值研究,提出了一个高效差分格式,该格式非耦合且为半显格式,因此比隐格式具有更快的计算速度,而且便于并行计算;同时,该格式很好地模拟了初边值问题的守恒性质,保证了格式计算的可靠性,从而便于长时间计算.细致讨论了格式的守恒性质,并在先验估计的基础上运用能量方法分析了差分格式的收敛性.     

求解Klein-Gordon-Schr(o)dinger方程组的一个新型守恒差分算法的收敛性分析

对复Schr(o)dinger场和实Klein-Gordon场相互作用下一类耦合方程组的初边值问题进行了数值研究,提出了一个高效差分格式,该格式非耦合且为半显格式,因此比隐格式具有更快的计算速度,而且便于并行计算;同时,该格式很好地模拟了初边值问题的守恒性质,保证了格式计算的可靠性,从而便于长时间计算.细致讨论了格式的守恒性质,并在先验估计的基础上运用能量方法分析了差分格式的收敛性.     

RLW方程的一个新的显式多辛格式

以多辛Euler-box格式为基础对正则长波(RLW)方程的初边值问题进行了讨论,推导了一个新的显式10点格式.模拟孤立波的数值实验表明,这个新的多辛格式是行之有效的,能很好的反映出RLW方程的非弹性性质.     

耗散对称正则长波方程的有限差分逼近

本文对耗散对称正则长波方程的初边值问题进行了数值研究,提出了一个两层隐式Crank-Nicolson差分格式,讨论了差分解的存在唯一性,并利用能量方法分析了该格式的二阶收敛性与稳定性,数值算例表明本文的格式是可靠的.     

具有积分边界条件的常微分方程边值问题的数值解

讨论了一类具有积分边界条件的二阶常微分方程非局部边值问题的数值解.对非局部积分边界条件采用了离散的多点边值问题进行逼近,通过常系数情况下解的局部性质,建立了这类边值问题的指数型差分格式,并且给出了格式的误差分析,证明了格式是一致收敛的.     

二维非线性Schrdinger方程显式格式的最大模误差分析

本文讨论了数值求解二维非线性Schrdinger方程周期边值问题的DuFort-Frankel格式和蛙跳格式.以解函数的一个广义时间导数作为独立变量,将非线性方程初边值问题改写成一个混合方程组形式,应用我们最新提出的离散能量技巧讨论这两个三层显式格式的收敛性.分析表明,在必要的网格条件下,差分解在最大模意义下二阶收敛.数值算例验证了理论分析结果.     

带非线性强迫项的Burgers方程二阶收敛的差分格式

本文研究带非线性强迫项的Burguers方程初边值问题的有限差分方法.构造了一个两层线性化隐式差分格式.证明了差分格式解的存在唯一性、收敛性和稳定性.并给出了差分解在L∞模意义下的收敛阶数为O(h2+τ2).数值例子验证了理论分析结果.     

一类非线性延迟抛物偏微分方程的紧致差分格式

对于一类带有Dirichlet边界条件的延迟非线性抛物型偏微分方程的初边值问题建立了一个紧差分格式,用能量分析法证明该差分格式在L_∞范数下是无条件收敛的,且收敛阶为O(τ~2+h~4).最后,通过数值算例验证了理论结果.     

Klein-Gordon-Zakharov方程初边值问题的Legendre谱方法

研究Klein-Gordon-Zakharov方程初边值问题的Legendre谱方法.在先验估计的基础上,证明了该格式的稳定性和收敛性,并得到最优阶误差估计.另外,还设计了一个半隐格式,并给出数值例子.在文章的后面给出了多区域谱格式,数值结果表明精度要高于单区域.     

对称正则长波方程的拟紧致守恒差分逼近

该文对称正则长波方程的初边值问题进行了数值研究, 提出了一个两层隐式拟紧差分格式,格式很好地模拟了初值问题的守恒性质. 得到了差分解的存在唯一性, 并在先验估计基础上运用能量方法分析了格式的稳定性及二阶收敛性.     

三级四阶显式辛R-K-N格式的完全构造

s级p阶辛Runge-Kutta-Nystr\"om(R-K-N)方法的一种充要条件是用关于参数的非线性方程组来表示的,辛R-K-N格式的构造问题因而转化为该方程组的求解问题. 在一些特殊的限定条件下, 已有该方程组在s=3,p=4时的两组解,即得到了两个三级四阶显式辛格式. 对于s=3,p=4情形,基于吴方法,利用计算机代数系统Maple及软件包wsolve给出了对应的非线性方程组的全部解, 这样就构造了所有的三级四阶显式辛R-K-N格式, 并证明了三级四阶显式辛R-K-N方法所满足的条件方程有冗余. 数值实验结果显示出新的辛格式在一定的条件下有着较好的误差精度.     

A Continuous-Stage Modified Leap-Frog Scheme for High-Dimensional Semi-Linear Hamiltonian Wave Equations

Among the typical time integrations for PDEs, Leap-frog scheme is the well-known method which can easily be used. A most welcome feature of the Leap-frog scheme is that it has very simple scheme and is easy to be implemented. The main purpose of this paper is to propose and analyze an improved Leap-frog scheme, the so-called continuous-stage modified Leap-frog scheme for high-dimensional semi-linear Hamiltonian wave equations. To this end, under the assumption of periodic boundary conditions, we begin with the formulation of the nonlinear Hamiltonian equation as an abstract second-order ordinary differential equation (ODE) and its operator-variation-of-constants formula (the Duhamel Principle). Then the continuous-stage modified Leap-frog scheme is formulated. Accordingly, the convergence, energy preservation, symplecticity conservation and long-time behaviour of explicit schemes are rigorously analysed. Numerical results demonstrate the remarkable advantage and efficiency of the improved Leap-frog scheme compared with the existing mostly used numerical schemes in the literature.     

非线性波动方程的弱隐式与显式差分方法

广泛出现于物理、化学、机械动力学、生物、几何学等领域的非线性波动方程已经有很多的研究工作,Sine-Gordon方程和非线性受迫振动方程就是典型的例子.周毓麟教授在[1]中研究了非线性波动方程组     

The Conservation and Convergence of Two Finite Difference Schemes for KdV Equations with Initial and Boundary Value Conditions

Korteweg-de Vries equation is a nonlinear evolutionary partial differential equation that is of third order in space. For the approximation to this equation with the initial and boundary value conditions using the finite difference method, the difficulty is how to construct matched finite difference schemes at all the inner grid points. In this paper, two finite difference schemes are constructed for the problem. The accuracy is second-order in time and first-order in space. The first scheme is a two-level nonlinear implicit finite difference scheme and the second one is a three-level linearized finite difference scheme. The Browder fixed point theorem is used to prove the existence of the nonlinear implicit finite difference scheme. The conservation, boundedness, stability, convergence of these schemes are discussed and analyzed by the energy method together with other techniques. The two-level nonlinear finite difference scheme is proved to be unconditionally convergent and the three-level linearized one is proved to be conditionally convergent. Some numerical examples illustrate the efficiency of the proposed finite difference schemes.     

High-order splitting schemes for semilinear evolution equations

We first derive necessary and sufficient stiff order conditions, up to order four, for exponential splitting schemes applied to semilinear evolution equations. The main idea is to identify the local splitting error as a sum of quadrature errors. The order conditions of the quadrature rules then yield the stiff order conditions in an explicit fashion, similarly to that of Runge–Kutta schemes. Furthermore, the derived stiff conditions coincide with the classical non-stiff conditions. Secondly, we propose an abstract convergence analysis, where the linear part of the vector field is assumed to generate a group or a semigroup and the nonlinear part is assumed to be smooth and to satisfy a set of compatibility requirements. Concrete applications include nonlinear wave equations and diffusion-reaction processes. The convergence analysis also extends to the case where the nonlinear flows in the exponential splitting scheme are approximated by a sufficiently accurate one-step method.     

A three-time-level explicit difference scheme of the second order of accuracy for parabolic equations

The difference schemes of Richardson [1] and of Crank-Nicolson [2] are schemes providing second-order approximation. Richardson's three-time-level difference scheme is explicit but unstable and the Crank-Nicolson two-time-level difference scheme is stable but implicit. Explicit numerical methods are preferable for parallel computations. In this paper, an explicit three-time-level difference scheme of the second order of accuracy is constructed for parabolic equations by combining Richardson's scheme with that of Crank-Nicolson. Restrictions on the time step required for the stability of the proposed difference scheme are similar to those that are necessary for the stability of the two-time-level explicit difference scheme, but the former are slightly less onerous.Translated fromMatematicheskie Zametki, Vol. 60, No. 5, pp. 751–759, November, 1996.This research was supported by the Russian Foundation for Basic Research under grant No. 95-01-00489 and by the International Science Foundation under grants No. N8Q300 and No. JBR100.     

激波捕捉差分方法研究

在迎风型格式和矢通量分裂技术的基础之上,对捕捉激波方法进行一种新的尝试．该方法首先对原始格式在特征方向上进行投影,然后用限制器对这些特征分量的变化幅值进行限制以抑止非物理波动,最后再把它转换成守恒形式,得到了基本上无振荡的激波捕捉格式．用该方法对两种迎风显示格式(二阶和三阶)和3种迎风紧致格式(三阶、五阶和七阶)进行处理,并在一维和二维的情况下进行了应用测试．通过与高阶WENO、MP、Compact-WENO等格式的比较,表明该方法在光滑捕捉激波的前提下仍有较高精度和分辨率．     

非线性Galerkin算法的收敛性和复杂性

本文给出了数值求解非线性发展方程的全离散非线性Ｇａｌｅｒｋｉｎ算法,即将空间离散时的谱非线性Ｇａｌｅｒｋｉｎ算法和时间离散的Ｅｕｌｅｒ差分格式相结合,得到了显式和隐式两种全离散数值格式,相应地也考虑了显式和隐式的Ｇａｌｅｒｋｉｎ全离散格式,并分别分析了上述四种全离散格式的收敛性和复杂性,经过比较得出结论;在某些约束条件下,非线性Ｇａｌｅｒｋｉｎ算法和Ｇａｌｅｒｋｉｎ算法具有相同阶的收敛速度,然而前     

On convergence of finite volume schemes for one-dimensional two-phase flow in porous media

This paper deals with development and analysis of finite volume schemes for a one-dimensional nonlinear, degenerate, convection-diffusion equation having application in petroleum reservoir and groundwater aquifer simulation. The main difficulty is that the solution typically lacks regularity due to the degenerate nonlinear diffusion term. We analyze and compare three families of numerical schemes corresponding to explicit, semi-implicit, and implicit discretization of the diffusion term and a Godunov scheme for the advection term. L^∞ stability under appropriate CFL conditions and BV estimates are obtained. It is shown that the schemes satisfy a discrete maximum principle. Then we prove convergence of the approximate solution to the weak solution of the problem. Results of numerical experiments using the present approach are reported.     

Difference methods for computing the Ginzburg‐Landau equation in two dimensions

In this article, three difference schemes of the Ginzburg‐Landau Equation in two dimensions are presented. In the three schemes, the nonlinear term is discretized such that nonlinear iteration is not needed in computation. The plane wave solution of the equation is studied and the truncation errors of the three schemes are obtained. The three schemes are unconditionally stable. The stability of the two difference schemes is proved by induction method and the time‐splitting method is analysized by linearized analysis. The algebraic multigrid method is used to solve the three large linear systems of the schemes. At last, we compute the plane wave solution and some dynamics of the equation. The numerical results demonstrate that our schemes are reliable and efficient. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 507–528, 2011py; 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 507–528, 2011