Weak discrete maximum principle of finite element methods in convex polyhedra

Dmitriy Leykekhman, Buyang Li

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)


We prove that the Galerkin finite element solution uh 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:

Original languageEnglish
Pages (from-to)1-18
Number of pages18
JournalMathematics of Computation
Issue number327
Publication statusPublished - Jan 2021

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics

Cite this