关于抛物型方程离散流量的收敛性

关于用差分方法求解具有间断系数的二阶抛型方程的问题, Ａ．Ｈ． ＴＮＸＯＨＯＢ与 Ａ．Ａ．Ｃａｍａｐｃ　从１９６１年山开始曾经作过详尽的研究,他们的结果都总结在专著［２］中,有关的文献也可以在该书中找到．他们指出在系数间断点处附近的网格点上格式的截断误差为Ｏ（１）,但差分格式的解在极大意义下收敛于原微分方程的连续解．他们在构造差分格式,并论证其收敛性时,充分利用了原微分方程中流连续的性质,但是却没有讨论差分格式中的离散流量的收敛性．８０年代 Ｔ．Ａ． Ｍａｎｔｅｎｆｆｅｌ, Ａ．Ｂ． Ｗｈｉｔｅ, Ｊｒ…     

对流-扩散问题的特征──块中心差分法

１．引言１９８２年,Ｄｏｕｇｌａｓ和Ｒｕｓｓｅｌｌ［１］提出解对流一扩散问题的特征一差分方法,网格节点为均匀分布,求解区域为直线Ｒ．文中讨论了基于二次插值的特征一差分格式,但其近似解按离散Ｌ２模未达到最优阶误差估计．１９８８年Ｗｅｉｓｅｒ和Ｗｈｅｅｌｅｒ［２］提出解线性椭圆型和线性抛物型方程的块中心差分法,１９９１年王申林［３］讨论了解拟线性双曲型积分微分方程的块中心差分方法,其共同特点为近似解按离散的Ｌ２模达到最优阶误差估计,解的一阶导数的近似解达到超收敛误差估计．１９９３年由同顺［４］讨论了…     

形状记忆合金问题的有限元逼近

１．引言本文讨论非线性微分方程其中　系数　是给定常数,ｆ,ｆ为已知函数．这是形状记忆合金问题的数学模型,未知量ｕ,θ代表位移及Ｋｅｌｖｉｎ温度,其物理背景及数学模型的建立,参见文献［３,４］．最近,文［１,２］讨论了方程组（１．１）－（１．５）的数值求解,提出全离散格式．文［２］用Ｇａｌｅｒｋｉｎ方法,位移ｕ用四阶微分方程的有限个特征向量张成的空间,温度θ用分段线性多项式（折线）空间来近似,给出一个全离散格式,证明了离散近似解的存在唯一性,定性说明收敛于原问题的精确解．文［１］采用［２］中的离散…     

均匀格子气Boltzmann方程的稳定性研究

１．引言格子气的基本方程是在几何空间、速度空间和时间上都是离散的Ｂｏｌｔｚｍａｎｎ方程（Ｂ方程）．这是一个有限差分方程．在离散速度气体运动论中［１］,Ｂ方程在速度空间上是离散的,在几何空间和时间上是连续的．这是一个偏微分方程．人们对离散速度气体Ｂ方程的稳定性和渐近特性的研究已经取得了很多结果．Ｍａａｓｓ~［２］通过构造Ｌｙaｐｕｎｏｖ函数族,在分布函数在空间上均匀的条件下,证明了平衡分布的渐近稳定性．信息函数Ｈ是该函数族的一员．Ｂｅｌｌｏｍｏｅｔａｌ~［３］．采用小扰动线性化方法在初值距离平衡解足…     

多孔介质驱动问题的混合元最小二乘特征有限元方法及其收敛分析

１．引言多孔介质二相驱动问题的数学模型是偶合的非线性偏微分方程组的初边值问题．该问题可转化为压力方程和浓度方程［１－４］．浓度方程一般是对流占优的对流扩散方程,它的对流速度依赖于比浓度方程的扩散系数大得多的Ｆａｒｃｙ速度．因此Ｄａｒｃｙ速度的求解精度直接影响着浓度的求解精度．为了提高速度的求解精度,７０年代Ｐ．Ａ．Ｒａｖｉａｔ和Ｊ．Ｍ．Ｔｈｏｍａｓ提出混合有限元方法［５］．Ｊ．ＤｏｕｇｌａｓＪｒ,Ｔ．Ｆ．Ｒｕｓｓｅｌｌ,Ｒ．Ｅ．Ｅｗｉｎｇ,Ｍ．Ｆ．Ｗｈｅｅｌｅｒ［１］－［４］,［９］,［１２］袁…     

求解对流扩散方程的一致四阶紧致格式

目前,许多高精度差分格式,由于未成功地构造与其精度匹配的稳定的边界格式,不得不采用低精度的边界格式.本文针对对流扩散方程证明了存在一致四阶紧致格式,它的边界点的计算格式和内点的计算格式的截断误差主项保持一致,给出了具体内点和边界格式;并分析了此半离散格式的渐近稳定性.数值结果表明该格式是四阶精度;在对流占优情况下,本文边界格式的数值结果比四阶精度的显式差分格式的的数值结果的数值振荡小,取得了不错的效果,理论结果得到了数值验证;驱动方腔数值结果显示,本文对N-S方程的离散格式具有很好的可靠性,适合对复杂流体流动的数值模拟和研究.     

三维热传导方程的高精度有限差分方法

提出了数值求解三维热传导方程的一个四阶精度的有限差分格式,首先对三个空间方向上的二阶导数项,采用四次样条函数来近似,从而得到半离散的常微分方程.然后利用常微分方程的解析解表达式,时间矩阵利用Padé近似,得到时间和空间均为四阶精度的差分格式.最后利用方法计算了两个数值算例,并与文献中结果进行了对比,从而验证了高精度格式的性能.     

二维抛物型积分微分方程动边界问题的有限元方法

１引言抛物型积微分方程,可广泛用于描述具有记忆的材料的热传导、气体扩散、松散介质中的压力等实际问题中的现象,具有重要研究意义．关于固定空间区域上该类方程的研究,可见文献［１］,［２］;关于动边界抛物型方程,梁国平等已有重要工作［３］,［４］;作者在文［５］中,研究了一维动边界抛物型积微分方程的数值方法．本文研究二维空间区域变动情形下此类方程初边值问题的全离散、半离散有限元逼近格式及有关数值分析．主要特点在于对动边界和时间积分项（Ｖｏｌｔｅｒｒａ项）的处理．对于前者,通过空间变量代换,将问题化为定…     

基于不光滑边界的变系数抛物型方程的高精度紧格式

本文讨论基于不光滑边界的变系数抛物型方程求解的高精度紧格式.首先构造一般变系数抛物型方程的高精度紧格式,并在理论上证明格式具有空间方向四阶精度.然后针对非光滑边界条件,引入局部网格加密技巧在奇异点附近进行不均匀的网格加密.数值实验以期权定价中Black-Scholes偏微分方程的求解为例,验证高精度紧格式用于光滑边界条件的微分方程离散可以达到四阶精度.对于处理非光滑边界条件,网格局部加密技巧能有效的提高数值解精度,使得高精度紧格式用于定价欧式期权可以接近四阶精度.     

一维双曲守恒方程组的Taylor-Galerkin有限元方法

１．引言 在文章［８］中,利用双曲守恒律的Ｈａｍｉｌｔｏｎ－Ｊａｃｏｂｉ方程形式,应用 Ｇａｌｅｒｋｉｎ有限元给出了求解一维双曲守恒律的计算方法．不同于间断有限元方法［２］、［３］和 Ｔａｙｌｏｒ－Ｇａｌｅｒｋｉｎ有限元方法［１］求解双曲守恒律,文章［８］采用连续 Ｇａｌｅｒｋｉｎ有限元求解双曲守恒律． 在文章［８］中,对差分方法和有限元方法求解双曲守恒律作了较为详细的讨论．同时在文章［８］中,采用积分变换,将双曲守恒律方程变成 Ｈａｍｉｌｔｏｎ－Ｊａｃｏｂｉ方程形式．由于 Ｈａｍｉｌｔｏｎ－Ｊａｃｏ…     

L_2逼近高精度格式的基本原理及其应用

In the present paper, a new numerical method: L_2 approximation high accurate scheme is developed. The solution obtained by using this method satisfies not only at the discrete points, but also approximates to the exact solution in the total region. The basic principle is introduced and this method is used to solve some problems. The results show its high accuracy, high resolution and other advantages.     

奇异杂交边界点方法求解泊松方程

As a boundary-type meshless method,the singular hybrid boundary node method(SHBNM)is based on the modified variational principle and the moving least square(MLS)approximation,so it has the advantages of both boundary element method(BEM)and meshless method.In this paper,the dual reciprocity method(DRM)is combined with SHBNM to solve Poisson equation in which the solution is divided into particular solution and general solution.The general solution is achieved by means of SHBNM,and the particular solution is approximated by using the radial basis function(RBF).Only randomly distributed nodes on the bounding surface of the domain are required and it doesn't need extra equations to compute internal parameters in the domain.The postprocess is very simple.Numerical examples for the solution of Poisson equation show that high convergence rates and high accuracy with a small node number are achievable.     

Mathematical studies of the solution of Burgers' equations by Adomian decomposition method

In this paper, a novel Adomian decomposition method (ADM) is developed for the solution of Burgers' equation. While high level of this method for differential equations are found in the literature, this work covers most of the necessary details required to apply ADM for partial differential equations. The present ADM has the capability to produce three different types of solutions, namely, explicit exact solution, analytic solution, and semi-analytic solution. In the best cases, when a closed-form solution exists, ADM is able to capture this exact solution, while most of the numerical methods can only provide an approximation solution. The proposed ADM is validated using different test cases dealing with inviscid and viscous Burgers' equations. Satisfactory results are obtained for all test cases, and, particularly, results reported in this paper agree well with those reported by other researchers.     

离散变量结构优化设计的组合算法*

本文首先给出了离散变量优化设计局部最优解的定义,然后提出了一种综合的组合算法.该算法采用分级优化的方法,第一级优化首先采用计算效率很高且经过随机抽样性能实验表明性能较高的启发式算法─—相对差商法,求解离散变量结构优化设计问题近似最优解 X ;第二级采用组合算法,在 X 的离散邻集内建立离散变量结构优化设计问题的(-1,0.1)规划模型,再进一步将其化为(0,1)规划模型,应用定界组合算法或相对差商法求解该(0,1)规划模型,求得局部最优解.解决了采用启发式算法无法判断近似最优解是否为局部最优解这一长期未得到解决的问题,提高了计算精度,同时,由于相对差商法的高效率与高精度,以上综合的组合算法的计算效率也还是较高的.     

Elliptic regularization for the semi-linear telegraph system

The solution of the semi-linear telegraph system is compared with the solution of an elliptic regularization, to which one associates two-point boundary conditions. An asymptotic approximation for the solution of the elliptic regularization is constructed. The method employed here is the boundary function method due to Vishik and Lyusternik. The problem is singularly perturbed of elliptic-hyperbolic type. To conduct this analysis, high regularity with respect to t for the solutions of both problems is required. Finally, the order of this approximation is found in different spaces of functions.     

A hybrid metaheuristic algorithm for dynamic rail car fleet sizing problem

The aim of this paper is to present a model and a solution method for rail freight car fleet sizing problem. The mathematical model is dynamic and multi-periodic and car demands and travel times are assumed deterministic, and the proposed solution method is hybridization of genetic algorithms and simulated annealing algorithms. Experimental analysis is conducted using several test problems. The results of the proposed algorithm and CPLEX software are compared. The results show high efficiency and effectiveness of the proposed algorithm. The solution method is applied to solve fleet sizing problem in the Iran Railways as a case study.     

A cubic spline approximation and application of TAGE iterative method for the solution of two point boundary value problems with forcing function in integral form

In this article, we report an efficient high order numerical method based on cubic spline approximation and application of alternating group explicit method for the solution of two point non-linear boundary value problems, whose forcing functions are in integral form, on a non-uniform mesh. The proposed method is applicable when the internal grid points of solution interval are odd in number. The proposed cubic spline method is also applicable to integro-differential equations having singularities. Computational results are given to demonstrate the utility of the method.     

An analytical approximation for solving nonlinear Blasius equation by NHPM

In this article, an analytic approximation to the solution of Blasius equation is obtained by using a new modification of homotopy perturbation method. The Blasius equation is a nonlinear ordinary differential equation which arises in the boundary layer flow. The comparison with Howart's numerical solution shows that the new homotopy perturbation method is an effective mathematical method with high accuracy. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

A simple perturbation approach to Blasius equation

In this paper, we couple the iteration method with the perturbation method to solve the well-known Blasius equation. The obtained approximate analytic solutions are valid for the whole solution domain. Comparison with Howarth’s numerical solution reveals that the proposed method is of high accuracy, the first iteration step leads to 6.8% accuracy, and the second iteration step yields the 0.73% accuracy of initial slop.