Weak discrete maximum principle of finite element methods in convex polyhedra

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/89361

Title:	Weak discrete maximum principle of finite element methods in convex polyhedra
Authors:	Leykekhman, D Li, B
Issue Date:	2021
Source:	Mathematics of computation, 2021, v. 90, no. 327, p. 1-18
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: [Abstract not complete, refer to publisher pdf]
Publisher:	American Mathematical Society
Journal:	Mathematics of computation
ISSN:	0025-5718
EISSN:	1088-6842
DOI:	10.1090/mcom/3560
Rights:	First published in Mathematics of Computation 90 (July 27, 2020) , published by the American Mathematical Society. © 2020 American Mathematical Society.
Appears in Collections:	Journal/Magazine Article

File	Description	Size	Format
554.pdf	Pre-Published version	457.6 kB	Adobe PDF	View/Open

Status	open access
File Version	Final Accepted Manuscript

View full-text via PolyU eLinks

104

Last Week
0

Last month

Citations as of Apr 14, 2025

23

Citations as of Apr 14, 2025

6

Citations as of May 8, 2025

7

Citations as of Oct 10, 2024

Check