非线性算子方程的泰勒展式算法

本文的目的是给出一种解Ｈｉｌｂｅｒｔ空间中非线性方程的ｋ阶泰勒展式算法（ｋ１）．标准Ｇａｌｅｒｋｉｎ方法可以看作１阶泰勒展式算法，而最优非线性Ｇａｌｅｒｋｉｎ方法可视为２阶泰勒展式算法．我们应用这种算法于定常的Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程的数值逼近．在一定情景下，最优非线性Ｇａｌｅｒｋｉｎ方法提供比标准Ｇａｌｅｒｋｉｎ方法和非线性Ｇａｌｅｒｋｉｎ方法更高阶的收敛速度．     

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

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

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

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

三维热传导型半导体问题的特征有限元方法和分析

本文研究三维热传导型半导体瞬态问题的特征有限元方法及其理论分析,其数学模型是一类非线性偏微分方程的初边值问题,对电子位势方程提出Ｇａｌｅｒｋｉｎ逼近;对电子,空穴浓度方程采用特征有限元逼近;对热传导方程采用对时间向后差分的Ｇａｌｅｒｋｉｎ逼近．应用微分方程先验估计理论和技巧得到了最优阶Ｌ＾２误差估计。     

方程u_(tt)=u_(xxt) f(u_x)_x初边值问题的差分法

１．引言方程是在国内外引起广泛关注的一类重要的非线性发展方程．文［１］在函数ｆ（ｓ）满足局部 Ｌｉｐ－ｓｃｈｉｔｚ条件及单调性条件（ｆ（ｓ２）－ｆ（ｓ１））（ｓ２－ｓ１）＞ ０的假设下得到了（１．１）初边值问题整体弱解的存在与唯一性;文［２］用 Ｇａｌｅｒｋｉｎ方法,研究了（１．１）的初边值问题,周期边值问题和初值问题,并在函数ｆ’（ｓ）下方有界的假设下得到了整体强解的存在与唯一性． 本文在有限区域 ＱＴ＝［０,１］×［０,Ｔ］（Ｔ＞ ０）上讨论方程（１．１）带有初值条件和边值条件（ｕ（ｘ,ｔ）为未知…     

带非线性边界条件的反应扩散方程的数值方法

１引言近年来关于非线性抛物型方程数值解法的研究取得了许多好的结果,其中以Ｃ．Ｖ．Ｐａｏ为主的研究者们利用上、下解方法对带线性边界条件的半线性抛物型方程的有限差分系统进行了广泛的研究,提出了一系列有效的迭代算法（见［１］、［２］、［３］、［４］）．但对带非线性边界条件的半线性抛物型方程初边值问题,作者至今尚未见到有研究者将上、下解方法用在相应的差分系统上,求得数值解．其主要原因是由于边界上函数的非线性,解在边界网格点上的值未知且无法用内部网格点上的值直接表示,相应的差分系统表示形式受到影响,边界网…     

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

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

Clifforrd分析中广义双正则函数的(线性)非线性边值问题

本文研究Ｃｌｉｆｏｒｄ分析中广义双正则函数的一个非线性边值问题：Ａ（ｔ１，ｔ２）Ｗ＋＋（ｔ１，ｔ２）＋Ｂ（ｔ１，ｔ２）Ｗ＋－（ｔ１，ｔ２）＋Ｃ（ｔ１，ｔ２）Ｗ－＋（ｔ１，ｔ２）＋Ｄ（ｔ１，ｔ２）Ｗ－－（ｔ１，ｔ２）＝ｇ（ｔ１，ｔ２）ｆｔ１，ｔ２，Ｗ＋＋（ｔ１，ｔ２），Ｗ＋－（ｔ１，ｔ２），Ｗ－＋（ｔ１，ｔ２），Ｗ－－（ｔ１，ｔ２）［］．先讨论解的积分表示式，再研究几个奇异算子，最后用Ｓｃｈａｕｄｅｒ不动点原理（压缩映射定理）证明了解的存在性（唯一性）．目前还没有见到其它国内外学者研究广义双正则函数的非线性边值问题．本文推广了Ｆ．Ｂｒａｃｋｓ，Ｗ．Ｐｉｎｃｋｅｔ［１０］，ＬｅＨｕａｎｇ Ｓｏｎ［１１］，Ｒ．Ｐ．ＧｉｌｂｅｒｔａｎｄＪ．Ｌ．Ｂｕｃｈｎａｎ［１５］和黄沙［１３］的工作     

三维热传导型半导体问题的特征混合元方法和分析

本文研究三维热传导型半导体态问题的特征混合元方法及其理论分析,其数学模型是一类非线性偏微分方程的初边值问题,对电子位势方程提出混合元逼近,对电子,空穴浓度方程笔挺表限元逼近;对热传导方程采用对时间向后差分的Ｇａｌｅｒｋｉｎ逼近,应用微分方程先验估计理论和技巧得到了最优阶Ｌ＾２误差估计。     

二维N－S方程的Fourier非线性Galerkin方法

本文对周期边界条件Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程，证明了其Ｆｏｕｒｉｅｒ非线性Ｇａｌｅｒｋｉｎ逼近解的存在唯一性，同时给出了逼近解的误差估计．     

二维连续信号的近似采样定理

利用加细方程的面具,给出该方程的一个近似解,并根据这个近似解构造出二维连续信号的近似采样定理.其近似采样函数是所求加细方程的近似解,它是由加细方程的面具唯一确定的逐段线性函数,且有显示的计算公式.因此可以根据需要选择加细方程的面具,从而达到控制近似采样函数的衰减速度.     

A Spectral Method for Neutral Volterra Integro-Differential Equation with Weakly Singular Kernel

This paper is concerned with obtaining an approximate solution and an approximate derivative of the solution for neutral Volterra integro-differential equation with a weakly singular kernel. The solution of this equation, even for analytic data, is not smooth on the entire interval of integration. The Jacobi collocation discretization is proposed for the given equation. A rigorous analysis of error bound is also provided which theoretically justifies that both the error of approximate solution and the error of approximate derivative of the solution decay exponentially in $L^∞$ norm and weighted $L^2$ norm. Numerical results are presented to demonstrate the effectiveness of the spectral method.     

Dynamics of micromachined vibrating gimbal and wheel gyroscope

We deduce dynamic equations of micromachined vibrating gimbal and wheel gyroscope and give an approximate solution of enough accuracy. The comparison between the approximate solution and the solution used often in the literature is given. According to property of the approximate solution a decoupled two-axes gyroscope will be composed of two single-axes gyroscopes.     

An approximate solution for linear boundary-value problems with slowly varying coefficients

In this paper, an approximate closed-form solution for linear boundary-value problems with slowly varying coefficient matrices is obtained. The derivation of the approximate solution is based on the freezing technique, which is commonly used in analyzing the stability of slowly varying initial-value problems as well as solving them. The error between the approximate and the exact solutions is given, and an upper bound on the norm of the error is obtained. This upper bound is proportional to the rate of change of the coefficient matrix of the boundary-value problem. The proposed approximate solution is obtained for a two-point boundary-value problem and is compared to its solution obtained numerically. Good agreement is observed between the approximate and the numerical solutions, when the rate of change of the coefficient matrix is small.     

On the approximate solution to an initial boundary valued problem for the Cahn–Hilliard equation

The particular approximate solution of the initial boundary valued problem to the Cahn–Hilliard equation is provided. The Fourier Method is combined with the Adomian’s decomposition method in order to provide an approximate solution that satisfy the initial and the boundary conditions. The approximate solution also satisfies the mass conservation principle.     

THE LARGE TIME BEHAVIOR OF SPECTRAL APPROXIMATION FOR A CLASS OF PSEUDOPARABOLIC VISCOUS DIFFUSION EQUATION

The asymptotic behavior of the solutions to a class of pseudoparabolic viscous diffusion equation with periodic initial condition is studied by using the spectral method. The semidiscrete Fourier approximate solution of the problem is constructed and the error estiation between spectral approximate solution and exact solution on large time is also obtained. The existence of the approximate attractor AN and the upper semicontinuity d(AN,A)→0 are proved.     

On the complexity of solving feasible systems of linear inequalities specified with approximate data

An algorithm that gives an approximate solution of a desired accuracy to a system of linear inequalities specified with approximate data is presented. It uses knowledge that the actual instance is feasible to reduce the data precision necessary to give an approximate solution to the actual instance. In some cases, this additional information allows problem instances that are ill-posed without the knowledge of feasibility to be solved.The algorithm is computationally efficient and requires not much more data accuracy than the minimal amount necessary to give an approximate solution of the desired accuracy. This work aids in the development of a computational complexity theory that uses approximate data and knowledge.     

Intuitive approach to the approximate analytical solution for the Blasius problem

For the Blasius problem, we propose an approximate analytical solution in the form of a logarithm of the hyperbolic cosine function which satisfies the given boundary conditions and some known properties of the exact solution. Furthermore, adding some hyperbolic tangent functions to this solution, we obtain much more accurate approximate solution with the relative error less than 0.16% over the whole region. The superiority of the proposed solutions is shown by comparison with the existing approximate analytical solution.     

Near-field and far-field approximations by the Adomian and asymptotic decomposition methods

The Adomian decomposition method and the asymptotic decomposition method give the near-field approximate solution and far-field approximate solution, respectively, for linear and nonlinear differential equations. The Padé approximants give solution continuation of series solutions, but the continuation is usually effective only on some finite domain, and it can not always give the asymptotic behavior as the independent variables approach infinity. We investigate the global approximate solution by matching the near-field approximation derived from the Adomian decomposition method with the far-field approximation derived from the asymptotic decomposition method for linear and nonlinear differential equations. For several examples we find that there exists an overlap between the near-field approximation and the far-field approximation, so we can match them to obtain a global approximate solution. For other nonlinear examples where the series solution from the Adomian decomposition method has a finite convergent domain, we can match the Padé approximant of the near-field approximation with the far-field approximation to obtain a global approximate solution representing the true, entire solution over an infinite domain.     

Combining approximate solutions for linear discrete ill-posed problems

Linear discrete ill-posed problems of small to medium size are commonly solved by first computing the singular value decomposition of the matrix and then determining an approximate solution by one of several available numerical methods, such as the truncated singular value decomposition or Tikhonov regularization. The determination of an approximate solution is relatively inexpensive once the singular value decomposition is available. This paper proposes to compute several approximate solutions by standard methods and then extract a new candidate solution from the linear subspace spanned by the available approximate solutions. We also describe how the method may be used for large-scale problems.