解弥散问题的高精度差分格式

用待定系数法 ,对弥散方程构造了一个二层六阶精度的差分格式 ,给出了稳定条件 .用该格式可以直接从初始条件出发逐层求解 ,也可以在使用三层差分格式时 ,用来求第一层的数值解 u1j.     

关于U_t=aU_(xx)差分格式的进一步研究(英文)

对于热传导方程构造了两个高阶精度的差分格式，一个是三层七点显格式，另一个是三层九点隐格式．证明了差分格式的收敛性和稳定性，最后给出数值计算结果．     

关于Ut=aUxx差分格式的进一步研究

对于热传导方程构造了两个高阶精度的差分格式，一个是三层七点显格式．另一个是三层九点隐格式．证明了差分格式的收敛性和稳定性，最后给出数值计算结果。     

一类时空二阶精度高分辨率MmB差分格式的构造及数值试验

1．引言考虑如下二维双曲型守恒律初值问题的数值解．H．M．Wu和S．L．Yang在文山中给出了MmB差分格式的定义如下：给定（．1）M差分格式定义．若则称格式（1．2）为MmB差分格式．这里BmB表示局部MaximumandminimumBounds．由定义可知，若差分格式（1．2）可写为形式且。＼P’三0，＞。：r’一1．则格式（1．4）为MmB差分格式．j＝l文山构造了二维双曲型守恒律的二类二阶精度的MmB差分格式，使构造二维高分辨格式有了新的突破，但他们是从标量线性双曲型守恒律出发，然后把结果推广到非线性情形．本文直接从二维非线性双曲型守恒律…     

解三抛物型微分方程的一族高精度显式差分格式

对求解三维抛物型微分方程利用待定参数法构造出截断误差为Ｏ的一族高精度的三层显式差分格式，并讨论了其稳定性。     

解三维抛物型方程的一个高精度显式差分格式

提出了求解三维抛物型方程的一个高精度显式差分格式.首先,推导了一个特殊节点处一阶偏导数(■u)/(■/t)的一个差分近似表达式,利用待定系数法构造了一个显式差分格式,通过选取适当的参数使格式的截断误差在空间层上达到了四阶精度和在时间层上达到了三阶精度.然后,利用Fourier分析法证明了当r1/6时,差分格式是稳定的.最后,通过数值试验比较了差分格式的解与精确解的区别,结果说明了差分格式的有效性.     

关于色散方程u_t=au_(xxx)一类显式差分格式的讨论

关于色散方程u_t=au_(xxx)差分格式的讨论,在[1]和[2]中,分别提出了中层为五点和六点的显式差分格式,其稳定区域分别为 0≤r≤0.7016和-0.0625 ≤r≤1.1851.本文针对这一问题,讨论中层为七点的一类差分格式的稳定性.[1]中格式是本文的特例,并且这类格式的最佳稳定区域为0≤r≤2.394,大约是[2]中稳定范围的二倍,[1]中稳定范围的三倍.     

二维热传导方程的三层显式差分格式

对二维热传导方程构造了一个稳定的三层显式差分格式求其数值解，其背景源于高维热力学反问题迭代算法中对正问题小计算量算法的需求。首先建立一个含参数的一般差分格式去逼近微分方程，并得到了最优截断误差。然后导出了参数应满足的条件以保证差分格式的稳定性。最后给出了数值的例子并和其它算法进行比较，说明了格式在精度上的有效性和计算量上的优越性。     

解抛物型方程的一族高精度差分格式

1 引言 求解抛物型方程 u/t=u/x~2, 00, (1) 初边值问题的差分格式,精度高者当属[1]、[2]中的格式.本文对上述问题构造了一族三层(特殊情况下是两层)双参数、绝对稳定、高精度三对角线型的隐式格式,它不仅包含了[1]、[2]中所有的格式,而且还可以得到一个截断误差为O(Δt~3+Δx~4)的绝对稳定的差分格式,精度比[1]、[2]中的格式都高. 2 差分格式 设Δt为时间步长,Δx=L/M(M为正整数)为空间步长,网函数u(jΔx,nΔt )记为u_j~n,对     

解四阶抛物型方程高精度紧致差分格式

针对四阶抛物型方程周期初值问题,提出了一个两层隐式差分格式和一个三层隐式差分格式.它们的局部截断误差分别为O((Δt)2+(Δx)4)和O((Δt)2+(Δt)(Δx)2+(Δx)4),其中Δt,Δx分别为时间步长和空间步长.误差分析和数值实验均表明,本文构造的差分格式比经典的Crank-Nicolson格式和Saul’ev构造的差分格式精度更高.从精度及稳定性方面考虑,本文构造的格式也比文[5]的显式格式要好.     

A meshless method for Burgers’ equation using MQ-RBF and high-order temporal approximation

In this paper, a new numerical method is proposed to solve one-dimensional Burgers’ equation using multiquadric (MQ) radial basis function (RBF) for spatial approximation and a second-order compact finite difference scheme for temporal approximation. The numerical results obtained by this way for different Reynolds number have been compared with the existing numerical schemes to show the accuracy and efficiency of the approach. To show the superiority of this meshless method, numerical experiments with non-uniform MQ interpolation node distribution are also performed.     

MULTI-LEVEL ADAPTIVE CORRECTIONS IN FINITE DIMENSIONAL APPROXIMATIONS

Based on the Boolean sum technique, we introduce and analyze in this paper a class of multi-level iterative corrections for finite dimensional approximations. This type of multi-level corrections is adaptive and can produce highly accurate approximations. For illustration, we present some old and new finite element correction schemes for an elliptic boundary value problem.     

Discrete artificial boundary conditions for nonlinear Schrödinger equations

In this work we construct and analyze discrete artificial boundary conditions (ABCs) for different finite difference schemes to solve nonlinear Schrödinger equations. These new discrete boundary conditions are motivated by the continuous ABCs recently obtained by the potential strategy of Szeftel. Since these new nonlinear ABCs are based on the discrete ABCs for the linear problem we first review the well-known results for the linear Schrödinger equation. We present our approach for a couple of finite difference schemes, including the Crank–Nicholson scheme, the Dùran–Sanz-Serna scheme, the DuFort–Frankel method and several split-step (fractional-step) methods such as the Lie splitting, the Strang splitting and the relaxation scheme of Besse. Finally, several numerical tests illustrate the accuracy and stability of our new discrete approach for the considered finite difference schemes.     

差分格式的余项效应分析及其应用

本文对已有的差分格的色散关系和群速度效应的Ｆｏｕｒｉｅｒ分析提出了置疑，指出症结所在并予以纠正，并且利用差分格式的Ｍｏｄｉｆｉｅｄ ＰＤＥ思想，提出了一种新的构造性差分格式分析方法－差分格式余项效应分析。这种方法基于差分格式的耗散关系和色散关系的，人有明显的构造性和现实意义。     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

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.     

Difference Forms

Currently, there is much interest in the development of geometric integrators, which retain analogues of geometric properties of an approximated system. This paper provides a means of ensuring that finite difference schemes accurately mirror global properties of approximated systems. To this end, we introduce a cohomology theory for lattice varieties, on which finite difference schemes and other difference equations are defined. We do not assume that there is any continuous space, or that a scheme or difference equation has a continuum limit. This distinguishes our approach from theories of “discrete differential forms” built on simplicial approximations and Whitney forms, and from cohomology theories built on cubical complexes. Indeed, whereas cochains on cubical complexes can be mapped injectively to our difference forms, a bijection may not exist. Thus our approach generalizes what can be achieved with cubical cohomology. The fundamental property that we use to prove our results is the natural ordering on the integers. We show that our cohomology can be calculated from a good cover, just as de Rham cohomology can. We postulate that the dimension of solution space of a globally defined linear recurrence relation equals the analogue of the Euler characteristic for the lattice variety. Most of our exposition deals with forward differences, but little modification is needed to treat other finite difference schemes, including Gauss-Legendre and Preissmann schemes. Dedicated to Professor Arieh Iserles on the Occasion of his Sixtieth Birthday.     

High order finite difference methods on non-uniform meshes for space fractional operators

In the past decades, the finite difference methods for space fractional operators develop rapidly; to the best of our knowledge, all the existing finite difference schemes, including the first and high order ones, just work on uniform meshes. The nonlocal property of space fractional operator makes it difficult to design the finite difference scheme on non-uniform meshes. This paper provides a basic strategy to derive the first and high order discretization schemes on non-uniform meshes for fractional operators. And the obtained first and second schemes on non-uniform meshes are used to solve space fractional diffusion equations. The error estimates and stability analysis are detailedly performed; and extensive numerical experiments confirm the theoretical analysis or verify the convergence orders.     

A new conservative finite difference scheme for Boussinesq paradigm equation

A family of nonlinear conservative finite difference schemes for the multidimensional Boussinesq Paradigm Equation is considered. A second order of convergence and a preservation of the discrete energy for this approach are proved. Existence and boundedness of the discrete solution on an appropriate time interval are established. The schemes have been numerically tested on the models of the propagation of a soliton and the interaction of two solitons. The numerical experiments demonstrate that the proposed family of schemes is about two times more accurate than the family of schemes studied in [Kolkovska N., Two families of finite difference schemes for multidimensional Boussinesq paradigm equation, In: Application of Mathematics in Technical and Natural Sciences, Sozopol, June 21–26, 2010, AIP Conf. Proc., 1301, American Institute of Physics, Melville, 2010, 395–403].     

An inverse problem of finding a source parameter in a semilinear parabolic equation

An inverse problem concerning diffusion equation with source control parameter is considered. Several finite-difference schemes are presented for identifying the control parameter. These schemes are based on the classical forward time centred space (FTCS) explicit formula, and the 5-point FTCS explicit method and the classical backward time centred space (BTCS) implicit scheme, and the Crank–Nicolson implicit method. The classical FTCS explicit formula and the 5-point FTCS explicit technique are economical to use, are second-order accurate, but have bounded range of stability. The classical BTCS implicit scheme and the Crank–Nicolson implicit method are unconditionally stable, but these schemes use more central processor (CPU) times than the explicit finite difference mehods. The basis of analysis of the finite difference equations considered here is the modified equivalent partial differential equation approach, developed from the 1974 work of Warming and Hyett. This allows direct and simple comparison of the errors associated with the equations as well as providing a means to develop more accurate finite difference schemes. The results of a numerical experiment are presented, and the accuracy and CPU time needed for this inverse problem are discussed.