ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT: In Part I of this work [SIAM Journal on Numer.
Anal. , 41 (2003), pp. 2294--2312], we analyzed superconvergence for
piecewise linear finite element approximations on triangular meshes
where most pairs of triangles sharing a common edge form approximate
parallelograms. In this work, we consider superconvergence for general
unstructured but shape regular meshes. We develop a postprocessing gradient
recovery scheme for the finite element solution uh, inspired in part
by the smoothing iteration of the multigrid method. This recovered
gradient superconverges to the gradient of the true solution and
becomes the basis of a global a posteriori error estimate that is often
asymptotically exact. Next, we use the superconvergent gradient to
approximate the Hessian matrix of the true solution and form local
error indicators for adaptive meshing algorithms. We provide several
numerical examples illustrating the effectiveness of our procedures.
ABSTRACT: In Part I of this work, we develop superconvergence estimates for piecewise linear
finite element approximations on quasi-uniform triangular meshes
where most pairs of triangles sharing a common edge form approximate
parallelograms. In particular, we first show a superconvergence of the
gradient of the finite element solution uh and to the gradient of
the interpolant $u_I$. We then analyze a postprocessing gradient
recovery scheme, showing that $Q_h\nabla u_h$ is a superconvergent
approximation to $\nabla u$. Here Qh is the global L2 projection.
In Part II, we analyze a superconvergent gradient recovery scheme
for general unstructured, shape regular triangulations. This is the
foundation for an a posteriori error estimate and local error indicators.
ABSTRACT: We will give an overview of superconvergnece
results for finite element methods applied to problems in three space
dimensions. Apart from that, we sketch techniques that could be applied
to three dimensional superconvergnece questions, and indicate what
exactly makes the three-dimensional case so much harder to tackle than
the two-dimensional case, for which many more results are known.
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT: We will prove, for a model problem, that on regular families of uniform triangulations, the vector variable of the order k=1 Raviart-Thomas type mixed finite element method, is superconvergent with respect to Fortin interpolation. For lowest order k=0 this was already proved in (Brandts, 1994). As a side product of the present analysis, we obtain similar results for the gradient of the standard quadratic finite element method, also with respect to Fortin interpolation.Although the use of Fortin interpolation instead of Lagrange interpolation in the setting of standard finite elements is somewhat unusual, it turns out that the superconvergence for standard quadratic elements with respect to Lagrange interpolation, proved in (Goodsell and Whiteman, 1991), is a direct corollary of it. As a result, the post-processing scheme that was developed in (Goodsell and Whiteman, 1991) to raise the approximation order of the gradient of the standard finite element approximation, can be adapted to improve the approximation quality of the mixed finite element vector variable in a similar fashion.The Fortin interpolation approach results moreover in L2({$[$}Omega{$]$})-superconvergence for the scalar variable.
ABSTRACT:
ABSTRACT: This paper establishes some superconvergence estimates for finite element solutions of second-order elliptic problems by a projection method depending only on local properties of the domain and the finite element solution. The projection method is a postprocessing procedure that constructs a new approximation by using the method of least squares. In particular, some local superconvergence estimates in the L2 and $L^\infty$ norms are derived for the local projections of the Galerkin finite element solution. The results have two prominent features. First, they are established for any quasi-uniform meshes, which are of practical importance in scientific computation. Second, they are derived on the basis of local properties of the domain and the solution for the second-order elliptic problem. Therefore, the result of this paper can be employed to provide useful a posteriori error estimators in practical computing.
ABSTRACT: In this paper, we show that the piecewise linear finite element solution $u_{h}$ and the linear interpolation $u_{I}$ have superclose gradient for tetrahedral meshes, where most elements are obtained by dividing approximate parallelepiped into six tetrahedra. We then analyze a post-processing gradient recovery scheme, showing that the global $L^2$ projection of $\nabla u_h$ is a superconvergent gradient approximation to $\nabla u$.
ABSTRACT: We present a two-level
finite difference scheme for the approximation of nonlinear parabolic
equations. Discrete inner products and the lowest-order Raviart--Thomas
approximating space are used in the expanded mixed method in order to
develop the finite difference scheme. Analysis of the scheme is given
assuming an implicit time discretization. In this two-level scheme, the
full nonlinear problem is solved on a "coarse" grid of size H. The
nonlinearities are expanded about the coarse grid solution and an
appropriate interpolation operator is used to provide values of the
coarse grid solution on the fine grid in terms of superconvergent node
points. The resulting linear but nonsymmetric system is solved on a
"fine" grid of size h. Some a priori error estimates are derived which
show that the discrete L\infty(L2) and L2(H1) errors are $O(h^2 +
H^{4-d/2} + \Delta t)$, where $d \geq 1$ is the spatial dimension.
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT: For the linear finite element solution to a linear elliptic model problem, we derive an error estimator based upon appropriate gradient recovery by local averaging. In contrast to popular variants like the ZZ estimator, our estimator contains some additional terms that ensure reliability also on coarse meshes. Moreover, the enhanced estimator is proved to be (locally) efficient and asymptotically exact whenever the recovered gradient is superconvergent. We formulate an adaptive algorithm that is directed by this estimator and illustrate its aforementioned properties, as well as their importance, in numerical tests.
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT: 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.
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT: Mathematical proofs are presented for the derivative superconvergence obtained by a class of patch recovery techniques for both linear and bilinear finite elements in the approximation of elliptic second-order problems. In detail, the authors consider both the locally discrete least-squares recovery and the traditional post-processing technique by local $L$ projection recovery for both triangular linear and rectangular bilinear finite element approximations of general second-order elliptic problems on two-dimensional convex polygonal domains. They prove that the derivative superconvergence is achieved by both methods for the triangular linear element on a strongly regular family of meshes, by the locally discrete least-squares recovery for the rectangular bilinear element on a quasi-uniform family of meshes, and by the local $L$ projection recovery for the rectangular bilinear element on a unidirectionally uniform family of meshes. A one-dimensional example is also given.
ABSTRACT:
ABSTRACT:
ABSTRACT: The lowest order Raviart--Thomas rectangular element is considered for solving the singular perturbation problem $-\mbox{div}(a\nabla p)+bp=f,$ where the diagonal tensor $a=(\varepsilon^2,1)$ or $a=(\varepsilon^2,\varepsilon^2).$ Global uniform convergence rates of O(N -1) for both p and a 1/2\nabla p$ in the L 2-norm are obtained in both cases, where N is the number of intervals in either direction. The pointwise interior (away from the boundary layers) convergence rates of O(N -1) for p are also proved. Superconvergence (i.e., O(N -2)) at special points and O(N -2) global L 2 estimate for both p and $a^{1/2}\nabla p$ are obtained by a local postprocessing. Numerical results support our theoretical analysis. Moreover, numerical experiments show that an anisotropic mesh gives more accurate results than the standard global uniform mesh.
ABSTRACT:
ABSTRACT:
ABSTRACT: Superconvergence of order $O(h^{1+\rho})$, for some $\rho > 0$, is established for the gradient recovered with the polynomial preserving recovery (PPR) when the mesh is mildly structured. Consequently, the PPR-recovered gradient can be used in building an asymptotically exact a posteriori error estimator.
ABSTRACT: The use of dual/adjoint problems for approximating functionals of solutions of PDEs with great accuracy or to merely drive a goal-oriented adaptive refinement scheme has become well-accepted, and it continues to be an active area of research. The traditional approach involves dual residual weighting (DRW). In this work we present two new functional error estimators and give conditions under which we can expect them to be asymptotically exact. The first is of DRW type and is derived for meshes in which most triangles satisfy an -approximate parallelogram property. The second functional estimator involves dual error estimate weighting (DEW) using any superconvergent gradient recovery technique for the primal and dual solutions. Several experiments are done which demonstrate the asymptotic exactness of a DEW estimator which uses a gradient recovery scheme proposed by Bank and Xu, and the effectiveness of refinement done with respect to the corresponding local error indicators.
ABSTRACT: This work introduces a methodology for self-adaptive numerical procedures, which relies on the various components of an integrated, object-oriented, computational environment involving pre-, analysis, and post-processing modules. A basic platform for numerical experiments and further development is provided, which allows implementation of new elements/error estimators and sensitivity analysis. A general implementation of the Superconvergent Patch Recovery (SPR) and the recently proposed Recovery by Equilibrium in Patches (REP) is presented. Both SPR and REP are compared and used for error estimation and for guiding the adaptive remeshing process. Moreover, the SPR is extended for calculating sensitivity quantities of first and higher orders. The mesh (re-)generation process is accomplished by means of modern methods combining quadtree and Delaunay triangulation techniques. Surface mesh generation in arbitrary domains is performed automatically (i.e. with no user intervention) during the self-adaptive analysis using either quadrilateral or triangular elements. These ideas are implemented in the Finite Element System Technology in Adaptivity (FESTA) software. The effectiveness and versatility of FESTA are demonstrated by representative numerical examples illustrating the interconnections among finite element analysis, recovery procedures, error estimation/adaptivity and automatic mesh generation.
ABSTRACT:
ABSTRACT: We consider a Galerkin finite element method that uses piecewise linears on a class of Shishkin-type meshes for a model singularly perturbed convection-diffusion problem. We pursue two approaches in constructing superconvergent approximations of the gradient. The first approach uses superconvergence points for the derivative, while the second one combines the consistency of a recovery operator with the superconvergence property of an interpolant. Numerical experiments support our theoretical results.
ABSTRACT: Consider a second-order elliptic boundary value problem in any number of space dimensions with locally smooth coefficients and solution. Consider also its numerical approximation by standard conforming finite element methods with, for example, fixed degree piecewise polynomials on a quasi-uniform mesh-family (the ``$h$-method''). It will be shown that, if the finite element function spaces are locally symmetric about a point $x_0 $ with respect to the antipodal map $x \to x_0 - (x - x_0 )$, then superconvergence ensues at xo under mild conditions on what happens outside a neighborhood of $x_0 $. For piecewise polynomials of even degree, superconvergence occurs in function values; for piecewise polynomials of odd degree, it occurs in derivatives.
ABSTRACT: We first derive a variety of local error estimates for u - uh at a point x0, where uh belongs to a finite element space Shr and is an approximation to u satisfying the local equations $A(u-u_h,\varphi) = F(\varphi)$ for all $\varphi$ in Shr with compact support in a neighborhood of x0. Here the $A(\cdot,\cdot)$ are bilinear forms associated with second order elliptic equations and the F are linear functionals. In the case that $F \equiv 0$ our results coincide with those of Schatz [SIAM Journal on Numer. Anal., 38 (2000), pp. 1269--1293] but are improvements when $F \neq 0$. We apply these results to improve the superconvergence error estimates obtained by Schatz, Sloan, and Wahlbin [SIAM Journal on Numer. Anal., 33 (1996), pp. 505--521] at points x0 where the subspaces are symmetric with respect to x0.
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT: This paper derives a general superconvergence result for finite element approximations of the Stokes problem by using projection methods proposed and analyzed recently by Wang [J. Math. Study, 33 (2000), pp. 229--243] for the standard Galerkin method. The superconvergence result is based on some regularity assumption for the Stokes problem and is applicable to any finite element method with regular but nonuniform partitions. The method is proved to give a convergent scheme for certain finite element spaces which fail to satisfy the well-known uniform inf-sup condition of Brezzi and Babuska.
ABSTRACT:
ABSTRACT: We consider mixed finite element discretizations of linear second order elliptic boundary value problems with respect to an adaptively generated hierarchy of possibly highly nonuniform simplicial triangulations. In particular, we present and analyze four different kinds of error estimators: a residual based estimator, a hierarchical one, error estimators relying on the solution of local subproblems and on a superconvergence result, respectively. Finally, we examine the relationship between the presented error estimators and compare their local components.
ABSTRACT: The composite trapezoidal rule has been well studied and widely applied for numerical integrations and numerical solution of integral equations with smooth or weakly singular kernels. However, this quadrature rule has been less employed for Hadamard finite part integrals due to the fact that its global convergence rate for Hadamard finite part integrals with (p+1)-order singularity is p-order lower than that for the Riemann integrals in general. In this paper, we study the superconvergence of the composite trapezoidal rule for Hadamard finite part integrals with the second-order and the third-order singularity, respectively. We obtain superconvergence estimates at some special points and prove the uniqueness of the superconvergence points. Numerical experiments confirm our theoretical analysis and show that the composite trapezoidal rule is efficient for Hadamard finite part integrals by noting the superconvergence phenomenon.
ABSTRACT: Some recovery type error estimators for linear finite elements are analyzed under
$O(h^{1+\alpha}) (\alpha > 0)$ regular grids. Superconvergence of order
$O(h^{1+\rho}) (0 < \rho\leq \alpha)$ is established for recovered gradients
by three different methods. As a consequence, a posteriori error
estimators based on those recovery methods are asymptotically exact.
ABSTRACT: This paper is concerned with the
theoretical analysis and the practiccal algorithms for the infinite
element method which was developed in recent years. With the aid of the
inequalities related to the Sobolev space given in the paper, the
error estimates in the norms of ____ (with weight), and ___ and ___,
the estimates like superconvergence and so on are comprehensively
investigated for the method. Many of the conclusions obtained are
optimal or nearly optimal. Also, some relative algorithms are analyzed
and improved and the results are suported by numerical experiments
ABSTRACT: The purpose of this work is to investigate the quality of the a posteriori error estimator based on polynomial preserving recovery (PPR). The main tool in this investigation is the computer-based theory. Also, a comparison is made between this estimator and the one based on superconvergence patch recovery (SPR). The results of this comparison are found to be in favour of the estimator based on PPR.
ABSTRACT: This is the first in a series of papers in which a new gradient recovery method is introduced and analyzed. It is proved that the method is superconvergent for translation invariant finite element spaces of any order. The method maintains the simplicity, efficiency, and superconvergence properties of the Zienkiewicz--Zhu patch recovery method. In addition, for uniform triangular meshes, the method is superconvergent for the linear element under the chevron pattern, and ultraconvergent at element edge centers for the quadratic element under the regular pattern. Applications of this new gradient recovery technique will be discussed in forthcoming papers
ABSTRACT:
ABSTRACT: 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
sitNumer. Meth. PDEsuation) 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.
ABSTRACT: Superconvergence approximations of singularly perturbed two-point boundary value
problems of reactiondiffusion type and convection-diffusion type are
studied. By applying the standard finite element method of any fixed
order p on a modified Shishkin mesh, superconvergence error bounds
of (N? 1 ln(N +1))p+1 in a discrete energy norm in approximating
problems with the exponential type boundary layers are established.
The error bounds are uniformly valid with respect to the singular
perturbation parameter. Numerical tests indicate that the error estimates
are sharp; in particular, the logarithmic factor is not removable.
ABSTRACT: In this work, the bilinear finite element method on a
Shishkin mesh for convection-diffusion problems is analyzed in the
two-dimensional setting. A superconvergence rate O(N?2 ln 2 N + N?1. 5 ln
N)inadiscrete -weighted energy norm is established under certain regularity
assumptions. This convergence rate is uniformly valid with respect to
the singular perturbation parameter . Numerical tests indicate that
the rate O(N?2 ln 2 N) is sharp for the boundary layer terms. As a
by-product, an -uniform convergence of the same order is obtained for
the L2-norm. Furthermore, under the same regularity assumption, an
-uniform convergence of order N?3/2 ln 5/2 N + N?1 ln1/2 N in the
norm is proved for some mesh points in the boundary layer region.
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
ABSTRACT:
@ These notes are copyrighted by Long Chen. All rights reserved. The HTML template for bib file was created by Mauro Cherubini and modified by Long Chen.