Pith. sign in

REVIEW

Superconvergent Gradient Recovery for Virtual Element Methods

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.10194 v2 pith:2WTIRAMX submitted 2018-04-26 math.NA cs.NA

classification math.NAcs.NA
keywords methodselementerrorvirtualgradientposteriorirecoveryestimator
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Virtual element methods is a new promising finite element methods using general polygonal meshes. Its optimal a priori error estimates are well established in the literature. In this paper, we take a different viewpoint. We try to uncover the superconvergent property of the virtual element methods by doing some local post-processing only on the degrees of freedom. Using linear virtual element method as an example, we propose a universal recovery procedure to improve the accuracy of gradient approximation for numerical methods using general polygonal meshes. Its capability of serving as a posteriori error estimators in adaptive methods is also investigated. Compared to the existing residual-type a posteriori error estimators for the virtual element methods, the recovery-type a posteriori error estimator based on the proposed gradient recovery technique is much simpler in implementation and asymptotically exact. A series of benchmark tests are presented to numerically illustrate the superconvergence of recovered gradient and validate the asymptotical exactness of the recovery-based a posteriori error estimator.

Discussion (0). Sign in to comment.

Pith tools