Weak discrete maximum principle of finite element methods in convex polyhedra

by   Dmitriy Leykekhman, et al.
University of Connecticut

We prove that the Galerkin finite element solution u_h of the Laplace equation in a convex polyhedron , with a quasi-uniform tetrahedral partition of the domain and with finite elements of polynomial degree r> 1, satisfies the following weak maximum principle: u_h_L^∞()< Cu_h_L^∞(∂) , with a constant C independent of the mesh size h. By using this result, we show that Ritz projection operator R_h is stable in L^∞ norm uniformly in h for r≥ 2, i.e. R_hu_L^∞()< Cu_L^∞() . Thus we remove a logarithmic factor appearing in the previous results for convex polyhedral domains.


page 1

page 2

page 3

page 4


Curved Elements in Weak Galerkin Finite Element Methods

A mathematical analysis is established for the weak Galerkin finite elem...

Weak discrete maximum principle of isoparametric finite element methods in curvilinear polyhedra

The weak maximum principle of the isoparametric finite element method is...

A pollution-free ultra-weak FOSLS discretization of the Helmholtz equation

We consider an ultra-weak first order system discretization of the Helmh...

Weak convergence of Monge-Ampere measures for discrete convex mesh functions

For mesh functions which satisfy a convexity condition at the discrete l...

A stable and jump-aware projection onto a discrete multi-trace space

This work is concerned with boundary element methods on singular geometr...

Averaging-based local projections in finite element exterior calculus

We develop projection operators onto finite element differential forms o...

Please sign up or login with your details

Forgot password? Click here to reset