基于近似惯性流形的后验Galerkin的方法

１．引言 为提高用数值方法解非线性发展方程及非线性椭圆边值问题的逼近阶,许多学者例如Ｊ．Ｎｏｖｏ和 Ｅ．Ｔｉｔｉ［４］, Ｍａｒｉｏｎ和 Ｔｅｍａｎ［６］,Ｊ．Ｘｕ［７］以及 Ｗ．Ｌａｙｔｏｎ［９］等人,提出了后验Ｇａｌｅｒｋｉｎ方法、近似惯性流形方法、非线性Ｇａｌｅｒｋｉｎ方法、各种区域分裂法、多重网格法等等．本文根据［１］提出了一种新的高精度的后验 Ｇａｌｅｒｋｉｎ方法．它的逼近阶是经典 Ｇａｌｅｒｋｉｎ方法逼近阶的两倍． 考虑非线性椭圆边值问题这里ｎ是按ｄ＝２,３）上具有分段光滑边界ｒ的有界区域,…     

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

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

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

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

裂缝-孔隙介质中地下水污染问题的Galerkin交替方向有限元方法

考虑裂缝 孔隙介质中地下水污染问题均匀化模型的数值模拟．对压力方程采用混合元方法,对浓度方程采用Ｇａｌｅｒｋｉｎ交替方向有限元方法,对吸附浓度方程采用标准Ｇａｌｅｒｋｉｎ方法,证明了交替方向有限元格式具有最优犔２ 和犎１ 模误差估计．     

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

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

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

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

一类广义Sine—Gordon方程的解的存在唯一性

本文利用非线性Ｇａｌｅｒｋｉｎ方法,证明了一类广义Ｓｉｎｅ－Ｇｏｒｄｏｎ方程在Ｄｉｒｉｃｈｌｅｔ边值条件下的整体解的存在唯一性．     

一类四阶非线性波动方程的初边值问题

本文研究一类描述非线性粘弹性杆中纵波振动的非线性波动方程的初边值问题,用Ｇａｌｅｒｋｉｎ方法证明了其整体强解的存在性,唯一性,最后讨论了解的渐近性质及在一定条件下整体解的不存在性。     

高次Galerkin有限元法的超收敛性

通过局部误差估计,对具有光滑边界的二阶常系数椭圆型方程,给出了高次Ｇａｌｅｒｋｉｎ 有限元法的超收敛性． 运用对称技巧和积分恒等式技巧,在局部对称矩形网格或三角形网格上,我们得到了改进的超收敛性（提高１－ ３ 阶）．     

一类非线性算子方程拟Galerkin逼近意义下的可解性

对非线性算子方程ｘ＋ＫＦｘ＝ｙ,本构造了一种新的不同于Ｇａｌｅｒｋｉｎ逼近的另一种逼近方程,并证明了在此逼近意义下上述方程是逼近可解的。     

非线性发展方程的Taylor展开方法

提出了积分非线性发展方程的新方法,即Taylor展开方法．标准的Galerkin方法可以看作0-阶Taylor展开方法,而非线性Galerkin方法可以看作1-阶修正Taylor展开方法A·D2此外,证明了数值解的存在性及其收敛性．结果表明,在关于严格解的一些正则性假设下,较高阶的Taylor展开方法具有较高阶的收敛速度．最后,给出了用Taylor展开方法求解二维具有非滑移边界条件Navier-Stokes方程的具体例子．     

Navier-Stokes方程的最佳有限元非线性Galerkin算法

1．引言对于Navier－Stokes方程有限元数值求解方面的研究已有很多的文章和专著,多数是采用有限元Galerkin算法,例见文献[1-4]．然而,由于Navier-Stokes方程在大雷诺数时有其强的非线性性和对时间土的长期依赖性,用计算机求解Navier－Stokes方程在速度和容量方面是难以承受的．为了克服这些困难,最近人们提出了有限元非线性Galerkin算法,见文献卜8］,然而这种算法只是在某一有限时刻之后具有好的收敛速度,在初始时刻的某一区间不能达到好的收敛速度．本文应用Taylor展开技术导出了数值求解二维非定常Navier－Stokes方程的最佳…     

一类分数阶Langevin方程block-by-block算法的数值分析

分数阶Langevin方程有重要的科学意义和工程应用价值，基于经典block-by-block算法，求解了一类含有Caputo导数的分数阶Langevin方程的数值解.Block-by-block算法通过引入二次Lagrange基函数插值，构造出逐块收敛的非线性方程组，通过在每一块耦合求得分数阶Langevin方程的数值解.在0<α<1条件下，应用随机Taylor展开证明block-by-block算法是3+α阶收敛的，数值试验表明在不同α和时间步长h取值下，block-by-block算法具有稳定性和收敛性，克服了现有方法求解分数阶Langevin方程速度慢精度低的缺点，表明block-by-block算法求解分数阶Langevin方程是高效的.     

Efficient methods using high accuracy approximate inertial manifolds

Summary. We extend the idea of the post-processing Galerkin method, in the context of dissipative evolution equations, to the nonlinear Galerkin, the filtered Galerkin, and the filtered nonlinear Galerkin methods. In general, the post-processing algorithm takes advantage of the fact that the error committed in the lower modes of the nonlinear Galerkin method (and Galerkin method), for approximating smooth, bounded solutions, is much smaller than the total error of the method. In each case, an improvement in accuracy is obtained by post-processing these more accurate lower modes with an appropriately chosen, highly accurate, approximate inertial manifold (AIM). We present numerical experiments that support the theoretical improvements in accuracy. Both the theory and computations are presented in the framework of a two dimensional reaction-diffusion system with polynomial nonlinearity. However, the algorithm is very general and can be implemented for other dissipative evolution systems. The computations clearly show the post-processed filtered Galerkin method to be the most efficient method. Received September 10, 1998 / Revised version received April 26, 1999 / Published online July 12, 2000     

Time accurate fast wavelet‐Taylor Galerkin method for partial differential equations

We introduce the concept of fast wavelet‐Taylor Galerkin methods for the numerical solution of partial differential equations. In wavelet‐Taylor Galerkin method discretization in time is performed before the wavelet based spatial approximation by introducing accurate generalizations of the standard Euler, θ and leap‐frog time‐stepping scheme with the help of Taylor series expansions in the time step. We will present two different time‐accurate wavelet schemes to solve the PDEs. First, numerical schemes taking advantage of the wavelet bases capabilities to compress the operators and sparse representation of functions which are smooth, except for in localized regions, up to any given accuracy are presented. Here numerical experiments deal with advection equation with the spiky solution in one dimension, two dimensions, and nonlinear equation with a shock in solution in two dimensions. Second, our schemes deal with more regular class of problems where wavelets are not efficient procedure for data compression but we can use the good approximation properties of wavelet. Here time‐accurate schemes lead to consistent mass matrix in an explicit time stepping, which can be solved by approximate factorization techniques. Numerical experiment deals with more regular class of problems like heat equation as well as coupled linear system in two dimensions. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A Chebyshev interval method for nonlinear dynamic systems under uncertainty

This paper proposes a new interval analysis method for the dynamic response of nonlinear systems with uncertain-but-bounded parameters using Chebyshev polynomial series. Interval model can be used to describe nonlinear dynamic systems under uncertainty with low-order Taylor series expansions. However, the Taylor series-based interval method can only suit problems with small uncertain levels. To account for larger uncertain levels, this study introduces Chebyshev series expansions into interval model to develop a new uncertain method for dynamic nonlinear systems. In contrast to the Taylor series, the Chebyshev series can offer a higher numerical accuracy in the approximation of solutions. The Chebyshev inclusion function is developed to control the overestimation in interval computations, based on the truncated Chevbyshev series expansion. The Mehler integral is used to calculate the coefficients of Chebyshev polynomials. With the proposed Chebyshev approximation, the set of ordinary differential equations (ODEs) with interval parameters can be transformed to a new set of ODEs with deterministic parameters, to which many numerical solvers for ODEs can be directly applied. Two numerical examples are applied to demonstrate the effectiveness of the proposed method, in particular its ability to effectively control the overestimation as a non-intrusive method.     

加罚Navier—Stokes方程的最佳非线性Galerkin算法

该文提出了求解二维加罚Navier-Stokes方程的最佳非线性Galerkin算法．这个算法在于在粗网格有限元空间上求解一非线性子问题，在细网格增量有限元空间Wh上求解一线性子问题．如果线性有限元被使用及，则该算法具有和有限元Galerkin算法同阶的收敛速度．然而该文提出的算法可以节省可观的计算时间．     

Insufficiency of chemical network model integration using a high-order Taylor series method

The rate of change for the concentrations of chemical substances in a set of reactions is modeled by a nonlinear dynamical system, which warrants the use of numerical integration methods for differential equations. Previous work advocates the use of a specialized high-order Taylor series method because of an observed reduction in computation time. Contrastingly, we show combinatorial and computational difficulties of the standard Taylor series method, which may dramatically increase computational time or reduce the quality of output. We provide two implementations, a naïve algorithm and an algorithm employing dynamic programming; we are able to overcome only some numerical obstacles and therefore conclude that the Taylor series approach is insufficient for large sets of reactions having many chemical substances.     

Local Discontinuous Galerkin Methods for Three Classes of Nonlinear Wave Equations

In this paper, we further develop the local discontinuous Galerkin method to solve three classes of nonlinear wave equations formulated by the general KdV-Burgers type equations, the general fifth-order KdV type equations and the fully nonlinear K(n, n, n) equations, and prove their stability for these general classes of nonlinear equations. The schemes we present extend the previous work of Yan and Shu [30, 31] and of Levy, Shu and Yan [24] on local discontinuous Galerkin method solving partial differential equations with higher spatial derivatives. Numerical examples for nonlinear problems are shown to illustrate the accuracy and capability of the methods. The numerical experiments include stationary solitons, soliton interactions and oscillatory solitary wave solutions.The numerical experiments also include the compacton solutions of a generalized fifthorder KdV equation in which the highest order derivative term is nonlinear and the fully nonlinear K (n, n, n) equations.     

A new Taylor collocation method for nonlinear Fredholm‐Volterra integro‐differential equations

The aim of this article is to present an efficient numerical procedure for solving nonlinear integro‐differential equations. Our method depends mainly on a Taylor expansion approach. This method transforms the integro‐differential equation and the given conditions into the matrix equation which corresponds to a system of nonlinear algebraic equations with unkown Taylor coefficients. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer program written in Maple10. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010