OPTIMAL ERROR BOUNDS FOR THE CUBIC SPLINE INTERPOLATION OF LOWER SMOOTH FUNCTION （Ⅱ）

In this paper, by using the explicit expression of the kernel of the cubic spline interpolation, the optimal error bounds for the cubic spline interpolation of lower soomth functions are obtained.     

关于2R（w2R）范数的一个注记

证明了自反Banach空间X上的等价w2R范数全体构成一个剩余集;同时证明了X闭子空间上等价的w2R范数均可延拓为X上等价的w2R范数.特别地,当X是可分时,上述w2R范数可替换为2R范数.     

模p^l（l≥2）上的二次高斯和

对于高斯和G（n,x）=sum from t=0 to p^l-1 x（t）e（（nt^2）/（p^l））,l≥2,（n,p）=1,其中x代表Dirichlet特征,p为奇素数,本文得到了G（n,x）=0或者｜G（n,x）｜=2（p^l）^（1/2）.     

二次有限元解的渐近展开与外推

在Poisson方程的求解域Ω存在一致的三角剖分,并且相邻两初始单元构成平行四边形的假设下,证明了若Poisson方程的解u属于H6(Ω),那么二次有限元的误差有h4的渐近展开.基于误差的渐近展开,可以利用h4-Richardson外推进一步提高数值解的精度阶,并且能够得到一个后验误差估计.最后,一个数值算例验证了理论分析.     

Estimation and Testing for the Parameters of AR（p）-ARCH（q） under Ordered Restriction

Suppose that the time series Xt satisfies{Xt=β1Xt-1… βpXt-p εt,εt=ξtht^1/2,ht=α0 α1εt-1^2… αqεt-q^2,(1)     

OD-CHARACTERIZATION OF ALMOST SIMPLE GROUPS RELATED TO U6（2）

Let G be a finite group and π(G) = { p 1 , p 2 , ··· , p k } be the set of the primes dividing the order of G. We define its prime graph Γ(G) as follows. The vertex set of this graph is π(G), and two distinct vertices p, q are joined by an edge if and only if pq ∈π e (G). In this case, we write p ～ q. For p ∈π(G), put deg(p) := |{ q ∈π(G) | p ～ q }| , which is called the degree of p. We also define D(G) := (deg(p 1 ), deg(p 2 ), ··· , deg(p k )), where p 1 < p 2 < ··· < p k , which is called the degree pattern of G. We say a group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and degree pattern as G. Specially, a 1-fold OD-characterizable group is simply called an OD-characterizable group. Let L := U 6 (2). In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S 3 is 5-fold OD-characterizable.     

COMPUTATION OF K2Z[1＋（-35的平根号）／2 ]

The author shows that K2Z[1+（-35的平根号）/2 ]?A ≈Z/2Z. The method of proof is a generalization of the Tate‘s method.     

（n1,n2）型二重（r1,r2）—循环矩阵逆矩阵的插值求法

本文用插值法给出n1n2阶（n1，n2）型二重（r1，r2）－循环矩阵逆矩阵计算公式．     

有向图上的一些猜想和开放问题（英文）

讨论了有向图上的几个猜想和开放问题.一些尚未解决的问题是新的.     

Analysis of extrapolation cascadic multigrid method (EXCMG)

Based on an asymptotic expansion of finite element,a new extrapolation formula and extrapolation cascadic multigrid method(EXCMG)are proposed,in which the new extrapolation and quadratic interpolation are used to provide a better initial value on refined grid.In the case of triple grids,the error of the new initial value is analyzed in detail.A larger scale computation is completed in PC.     

基于超收敛和外推方法的一类新的瀑布型多重网格方法

本文运用有限元超收敛理论和外推技巧提出了一类求解椭圆型方程的新的瀑布型多重网格方法(ACMG).数值结果表明新方法具有超收敛性.     

CASCADIC MULTIGRID METHODS FOR MORTAR WILSON FINITE ELEMENT METHODS ON PLANAR LINEAR ELASTICITY

Cascadic multigrid technique for mortar Wilson finite element method of homogeneous boundary value planar linear elasticity is described and analyzed. First the mortar Wilson finite element method for planar linear elasticity will be analyzed, and the error estimate under L2 and H1 norm is optimal. Then a cascadic multigrid method for the mortar finite element discrete problem is described. Suitable grid transfer operator and smoother are developed which lead to an optimal cascadic multigrid method. Finally, the computational results are presented.     

P1-NONCONFORMING QUADRILATERAL FINITE VOLUME ELEMENT METHOD AND ITS CASCADIC MULTIGRID ALGORITHM FOR ELLIPTIC PROBLEMS

In this paper,we discuss the finite volume element method of P_1-nonconforming quadri-lateral element for elliptic problems and obtain optimal error estimates for general quadri-lateral partition.An optimal eascadie multigrid algorithm is proposed to solve the non-symmetric large-scale system resulting from such discretization.Numerical experimentsare reported to support our theoretical results.     

外推瀑布多网格法(EXCMG)——-大规模求解椭圆问题的新算法

基于有限元的渐近展开式,导出了新的外推公式,它们更精确地逼近密网上的有限元解(而不是微分方程的解).提出了新的外推瀑布型多网格法(EXCMG),采用新外推公式及其二次插值提供密网上的好初值.数值实验表明,新方法有很高的精度和效率.最后在PC机上求解了大规模二维椭圆问题.     

抛物型方程一个新的非协调混合元超收敛性分析及外推

本文研究了抛物型方程在新混合元格式下的非协调混合有限元方法. 在抛弃传统有限元分析的必要工具-Ritz 投影算子的前提下,直接利用单元的插值性质,运用高精度分析和对时间t的导数转移技巧,借助于插值后处理技术,分别导出了关于原始变量u的H¹-模和通量p=▽u在L²-模下的O（h²）阶超逼近性质和整体超收敛. 进一步,通过构造合适的辅助问题,运用Richardson 外推格式,得到了具有更高精度O（h³）阶的外推结果. 最后,给出了一些数值结果验证了理论分析的正确性.     

Asymptotic expansions of finite element solutions to Robin problems in H 3 and their application in extrapolation cascadic multigrid method

For the Poisson equation with Robin boundary conditions,by using a few techniques such as orthogonal expansion(M-type),separation of the main part and the finite element projection,we prove for the first time that the asymptotic error expansions of bilinear finite element have the accuracy of O(h3)for u∈H3.Based on the obtained asymptotic error expansions for linear finite elements,extrapolation cascadic multigrid method(EXCMG)can be used to solve Robin problems effectively.Furthermore,by virtue of Richardson not only the accuracy of the approximation is improved,but also a posteriori error estimation is obtained.Finally,some numerical experiments that confirm the theoretical analysis are presented.     

双参数Morley有限元多重网格法

1、引言 多重网格方法是求解偏微分方程的高效快速算法,在实际中得到广泛应用．[2][6]中考察了Morley元的多重网格方法,并用于双调和方程问题。     

求解三维高次拉格朗日有限元方程的代数多重网格法

本文针对带有间断系数的三维椭圆问题,讨论任意四面体剖分下的二次拉格朗日有限元方程的代数多重网格法．通过分析线性和高次有限元空间之间的关系,我们给出了一种新的网格粗化算法和构造提升算子的代数途径．进一步,我们还对新的代数多重网格法给出了收敛性分析．数值实验表明这种代数多重网格法对求解二次拉格朗日有限元方程是健壮和有效的。