Weak discrete maximum principle of finite element methods in convex polyhedra

Dmitriy Leykekhman; Buyang Li

doi:10.1090/mcom/3560

Weak discrete maximum principle of finite element methods in convex polyhedra

Dmitriy Leykekhman, Buyang Li

Research output: Journal article publication › Journal article › Academic research › peer-review

6 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	1-18
Number of pages	18
Journal	Mathematics of Computation
Volume	90
Issue number	327
DOIs	https://doi.org/10.1090/mcom/3560
Publication status	Published - Jan 2021

ASJC Scopus subject areas

Algebra and Number Theory
Computational Mathematics
Applied Mathematics

More information

10.1090/mcom/3560

http://hdl.handle.net/10397/89361

Cite this

@article{bc4123368148461096fbfc748f4a6e9b,

title = "Weak discrete maximum principle of finite element methods in convex polyhedra",

abstract = "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:",

author = "Dmitriy Leykekhman and Buyang Li",

note = "Funding Information: Received by the editor September 18, 2019, and, in revised form, February 29, 2020, and April 13, 2020. 2010 Mathematics Subject Classification. Primary 65N12, 65N30. This work was partially supported by NSF DMS-1913133 and a Hong Kong RGC grant (project no. 15300519). Publisher Copyright: {\textcopyright} 2021. All Rights Reserved.",

year = "2021",

month = jan,

doi = "10.1090/mcom/3560",

language = "English",

volume = "90",

pages = "1--18",

journal = "Mathematics of Computation",

issn = "0025-5718",

publisher = "American Mathematical Society",

number = "327",

}

TY - JOUR

T1 - Weak discrete maximum principle of finite element methods in convex polyhedra

AU - Leykekhman, Dmitriy

AU - Li, Buyang

N1 - Funding Information: Received by the editor September 18, 2019, and, in revised form, February 29, 2020, and April 13, 2020. 2010 Mathematics Subject Classification. Primary 65N12, 65N30. This work was partially supported by NSF DMS-1913133 and a Hong Kong RGC grant (project no. 15300519). Publisher Copyright: © 2021. All Rights Reserved.

PY - 2021/1

Y1 - 2021/1

N2 - 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:

AB - 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:

UR - http://www.scopus.com/inward/record.url?scp=85100076046&partnerID=8YFLogxK

U2 - 10.1090/mcom/3560

DO - 10.1090/mcom/3560

M3 - Journal article

AN - SCOPUS:85100076046

SN - 0025-5718

VL - 90

SP - 1

EP - 18

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 327

ER -

Weak discrete maximum principle of finite element methods in convex polyhedra

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this