三维二次有限元梯度最大模的超逼近

作者证明了在一致四面体剖分下三维二次有限元的第一型弱估计,并给出了三维导数离散Green函数的估计,由此得到了四面体二次元梯度最大模的超逼近．通过这个超逼近还可以获得四面体二次元梯度最大模的超收敛．     

三三次长方体有限元的超收敛

本文首先介绍了三维投影型插值算子,并通过这个算子导出了三三次长方体有限元的弱估计．然后,利用离散导数Green函数的W^2,1半范估计和弱估计证明了有限元uh的梯度和三三次投影型插值Пh^2u的梯度在逐点意义下有超逼近．最后,将这种超逼近用于超收敛分析并导出了有限元的整体超收敛估计．     

Cahn-Hilliard方程的有限元分析

建立了求解非线性发展型Cahn-Hilliard方程的有限元方法,借助于一个双调和问题的有限元投影逼近,给出了最优阶L_2模误差估计。特别对于3次Hermite型有限元,导出了L_∞模和W_∞~1模的最优阶误差估计和导数逼近的超收敛结果。     

Stokes问题非协调有限元逼近的最大模估计

本文考察了二维稳态和非稳态Stokes问题的基于速度—压力形式的非协调C-R逼近格式,利用Sobolev权模技巧和权模LBB条件,得到了稳态问题速度(包括它的梯度)和压力逼近解的拟最优的最大模估计,利用稳态问题结果和Stokes投影技巧,得到了非稳态问题速度(包括它的梯度)和压力的半离散逼近解的拟最优的最大模估计。     

二阶椭圆问题的各向异性非协调Crouzeix-Raviart型有限元方法

对满足最大角条件和坐标系条件的二维区域中的各向异性一般三角形网格,研究了二阶椭圆问题的非协调Crouzeix-Raviart型线性三角形有限元逼近,得到了最优的能量模和L2-模误差估计结果．     

一类非线性变分不等式及其数值逼近

本文讨论了一类带有两个变函数的非线性变分不等式的问题,以及它们的有限元逼近。所考虑的区域ΩR~n真不必为凸区域,只需边界分片光滑即可。文中证明了有限元逼近的收敛性,并给出了逼近的误差估计,特别是最大模估计。     

投影型插值算子的超收敛性质及其应用

本文首先将证明矩形剖分单元上的Ｌｏｂａｔｔｏ点,Ｇａｕｓｓ点和拟Ｌｏｂａｔｔｏ点分别是二维投影型插值算子函数,梯度和二阶导数的逼近佳点;然后考虑了二阶椭圆边值问题的有限元近似．通过建立投影型插值算子各种形式的超收敛基本估计,证明了投影型插值算子的各类...     

高波数Helmholtz方程的超收敛分析

本文考虑求解Helmholtz方程的有限元方法的超逼近性质以及基于PPR后处理方法的超收敛性质.我们首先给出了矩形网格上的p-次元在收敛条件k(kh)~(2p+1)≤C_0下的有限元解和基于Lobatto点的有限元插值之间的超逼近以及重构的有限元梯度和精确解之间的超收敛分析.然后我们给出了四边形网格上的线性有限元方法的分析.这些估计都给出了与波数k和网格尺寸h的依赖关系.同时我们回顾了三角形网格上的线性有限元的超收敛结果.最后我们给出了数值实验并且结合Richardson外推进一步减少了误差.     

电报方程的类Wilson非协调有限元分析

本文在矩形网格上讨论了半离散和全离散格式下电报方程的类Wilson非协调有限元逼近.利用该元在H1模意义下O(h2)阶的相容误差结果,平均值理论和关于时间t的导数转移技巧得到了超逼近性.进而,借助于插值后处理方法导出了超收敛结果.又由于该元在H1模意义下的相容误差可以达到O(h3)阶,构造了新的外推格式,给出了比传统误差估计高两阶的外推估计.最后,对于给出的全离散逼近格式得到了最优误差估计.     

高波数问题的超收敛性

 本文考虑求解Helmholtz方程的有限元方法的超逼近性质以及基于PPR后处理方法的超收敛性质.我们首先给出了矩形网格上的p-次元在收敛条件k（kh）^2p+1≤C₀下的有限元解和基于Lobatto点的有限元插值之间的超逼近以及重构的有限元梯度和精确解之间的超收敛分析.然后我们给出了四边形网格上的线性有限元方法的分析.这些估计都给出了与波数k和网格尺寸h的依赖关系.同时我们回顾了三角形网格上的线性有限元的超收敛结果.最后我们给出了数值实验并且结合Richardson外推进一步减少了误差.     

Derivative superconvergent points in finite element solutions of Poisson's equation for the serendipity and intermediate families - a theoretical justification

Finite element derivative superconvergent points for the Poisson equation under local rectangular mesh (in the two dimensional case) and local brick mesh (in the three dimensional situation) are investigated. All superconvergent points for the finite element space of any order that is contained in the tensor-product space and contains the intermediate family can be predicted. In case of the serendipity family, the results are given for finite element spaces of order below 7. Any finite element space that contains the complete polynomial space will have at least all superconvergent points of the related serendipity family.

     

A posteriori error estimates for nonconforming finite element methods for fourth-order problems on rectangles

The a posteriori error analysis of conforming finite element discretisations of the biharmonic problem for plates is well established, but nonconforming discretisations are more easy to implement in practice. The a posteriori error analysis for the Morley plate element appears very particular because two edge contributions from an integration by parts vanish simultaneously. This crucial property is lacking for popular rectangular nonconforming finite element schemes like the nonconforming rectangular Morley finite element, the incomplete biquadratic finite element, and the Adini finite element. This paper introduces a novel methodology and utilises some conforming discrete space on macro elements to prove reliability and efficiency of an explicit residual-based a posteriori error estimator. An application to the Morley triangular finite element shows the surprising result that all averaging techniques yield reliable error bounds. Numerical experiments confirm the reliability and efficiency for the established a posteriori error control on uniform and graded tensor-product meshes.     

Derivative superconvergent points in finite element solutions of harmonic functions-- A theoretical justification

Finite element derivative superconvergent points for harmonic functions under local rectangular mesh are investigated. All superconvergent points for the finite element space of any order that is contained in the tensor-product space and contains the intermediate family can be predicted. In the case of the serendipity family, results are given for finite element spaces of order below 6. The results justify the computer findings of Babuska, et al.

     

K－网格上有限元的超收敛性及渐近准确的后验误差估计

Ｋ－网格上有限元的超收敛性及渐近准确的后验误差估计黄云清，陈艳萍（湘潭大学数学系）ＴＨＥＳＵＰＥＲＣＯＮＶＥＲＧＥＮＣＥＡＮＤＡＳＹＭＰＴＯＴＩＣＡＬＬＹＥＸＡＣＴＡＰＯＳＴＥＲＩＯＲＩＥＲＲＯＲＥＳＴＩＭＡＴＥＯＦＴＨＥＦＩＮＩＴＥＥＬＥＭＥＮＴＯ...     

Fast simplicial finite element algorithms using Bernstein polynomials

Fast algorithms for applying finite element mass and stiffness operators to the B-form of polynomials over d-dimensional simplices are derived. These rely on special properties of the Bernstein basis and lead to stiffness matrix algorithms with the same asymptotic complexity as tensor-product techniques in rectangular domains. First, special structure leading to fast application of mass matrices is developed. Then, by factoring stiffness matrices into products of sparse derivative matrices with mass matrices, fast algorithms are also obtained for stiffness matrices.     

On the rational cuboids with a given face

A rational cuboid is a rectangular parallelepiped whose edges and face diagonals all have rational lengths. In this paper, we consider the problem: are there rational cuboids with a given face? In a sense, we reduce the problem to a finite calculation.     

Maximum‐norm superapproximation of the gradient for the trilinear block finite element

For a model elliptic boundary value problem in three dimensions, we give the weak estimate of the first type for trilinear block elements and the estimate for W^1,1‐seminorm of the discrete derivative Green's function over rectangular partitions of the domain, from which we obtain maximum‐norm superapproximation of the gradient for the trilinear block finite element approximation. Furthermore, utilizing this superapproximation, we can also obtain maximum‐norm superconvergence of the gradient. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Asymptotically exact a posteriori estimators for the pointwise gradient error on each element in irregular meshes. Part 1: A smooth problem and globally quasi-uniform meshes

A class of a posteriori estimators is studied for the error in the maximum-norm of the gradient on single elements when the finite element method is used to approximate solutions of second order elliptic problems. The meshes are unstructured and, in particular, it is not assumed that there are any known superconvergent points. The estimators are based on averaging operators which are approximate gradients, ``recovered gradients', which are then compared to the actual gradient of the approximation on each element. Conditions are given under which they are asympotically exact or equivalent estimators on each single element of the underlying meshes. Asymptotic exactness is accomplished by letting the approximate gradient operator average over domains that are large, in a controlled fashion to be detailed below, compared to the size of the elements.

     

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

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