DeepAI AI Chat
Log In Sign Up

Convergence and optimality of an adaptive modified weak Galerkin finite element method

by   Yingying Xie, et al.
University of California, Irvine
South China Normal University

An adaptive modified weak Galerkin method (AmWG) for an elliptic problem is studied in this paper, in addition to its convergence and optimality. The weak Galerkin bilinear form is simplified without the need of the skeletal variable, and the approximation space is chosen as the discontinuous polynomial space as in the discontinuous Galerkin method. Upon a reliable residual-based a posteriori error estimator, an adaptive algorithm is proposed together with its convergence and quasi-optimality proved for the lowest order case. The major tool is to bridge the connection between weak Galerkin method and the Crouzeix-Raviart nonconforming finite element. Unlike the traditional convergence analysis for methods with a discontinuous polynomial approximation space, the convergence of AmWG is penalty parameter free.


page 1

page 2

page 3

page 4


A Modified weak Galerkin finite element method for the Maxwell equations on polyhedral meshes

We introduce a new numerical method for solving time-harmonic Maxwell's ...

A modified weak Galerkin method for H(curl)-elliptic problem

In this paper, we design and analysis a modified weak Galerkin (MWG) fin...

Convergence of an adaptive C^0-interior penalty Galerkin method for the biharmonic problem

We develop a basic convergence analysis for an adaptive C^0IPG method fo...

Adaptive VEM for variable data: convergence and optimality

We design an adaptive virtual element method (AVEM) of lowest order over...