Litcius/Paper detail

Weak discrete maximum principle of finite element methods in convex polyhedra

Dmitriy Leykekhman, Buyang Li

2020Mathematics of Computation15 citationsDOI

Abstract

We prove that the Galerkin finite element solution <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="u Subscript h"> <mml:semantics> <mml:msub> <mml:mi>u</mml:mi> <mml:mi>h</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">u_h</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the Laplace equation in a convex polyhedron <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper Omega"> <mml:semantics> <mml:mi> Ω </mml:mi> <mml:annotation encoding="application/x-tex">\varOmega</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , with a quasi-uniform tetrahedral partition of the domain and with finite elements of polynomial degree <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="r greater-than-or-slanted-equals 1"> <mml:semantics> <mml:mrow> <mml:mi>r</mml:mi> <mml:mo> ⩾ </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">r\geqslant 1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , satisfies the following weak maximum principle: <disp-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartLayout 1st Row double-vertical-bar u Subscript h Baseline double-vertical-bar Subscript upper L Sub Superscript normal infinity Subscript left-parenthesis upper Omega right-parenthesis Baseline less-than-or-slanted-equals upper C double-vertical-bar u Subscript h Baseline double-vertical-bar Subscript upper L Sub Superscript normal infinity Subscript left-parenthesis partial-differential upper Omega right-parenthesis Baseline comma EndLayout"> <mml:semantics> <mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" side="left" displaystyle="true"> <mml:mtr> <mml:mtd> <mml:msub> <mml:mrow> <mml:mo symmetric="true">‖</mml:mo> <mml:msub> <mml:mi>u</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>h</mml:mi> </mml:mrow> </mml:msub> <mml:mo symmetric="true">‖</mml:mo> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>L</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:mrow> </mml:msup> <mml:mo stretchy="false">(</mml:mo> <mml:mi> Ω </mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msub> <mml:mo> ⩽ </mml:mo> <mml:mi>C</mml:mi> <mml:msub> <mml:mrow> <mml:mo symmetric="true">‖</mml:mo> <mml:msub> <mml:mi>u</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>h</mml:mi> </mml:mrow> </mml:msub> <mml:mo symmetric="true">‖</mml:mo> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>L</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:mrow> </mml:msup> <mml:mo stretchy="false">(</mml:mo> <mml:mi mathvariant="normal"> ∂ </mml:mi> <mml:mi> Ω </mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msub> <mml:mo>,</mml:mo> </mml:mtd> </mml:mtr> </mml:mtable> <mml:annotation encoding="application/x-tex">\begin{align*} \left \|u_{h}\right \|_{L^{\infty }(\varOmega )} \leqslant C\left \|u_{h}\right \|_{L^{\infty }(\partial \varOmega )} , \end{align*}</mml:annotation> </mml:semantics> </mml:math> </disp-formula> with a constant <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C"> <mml:semantics> <mml:mi>C</mml:mi> <mml:annotation encoding="application/x-tex">C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> independent of the mesh size <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h"> <mml:semantics> <mml:mi>h</mml:mi> <mml:annotation encoding="application/x-tex">h</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . By using this result, we show that the Ritz projection operator <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper R Subscript h"> <mml:semantics> <mml:msub> <mml:mi>R</mml:mi> <mml:mi>h</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">R_h</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is stable in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Superscript normal infinity"> <mml:semantics> <mml:msup> <mml:mi>L</mml:mi> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:msup> <mml:annotation encoding="application/x-tex">L^\infty</mml:annotation> </mml:semantics> </mml:math> </inline-formula> norm uniformly in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h"> <mml:semantics> <mml:mi>h</mml:mi> <mml:annotation encoding="application/x-tex">h</mml:annotation>

Topics & Concepts

AlgorithmType (biology)MathematicsCombinatoricsGeologyPaleontologyAdvanced Numerical Methods in Computational MathematicsAdvanced Mathematical Modeling in EngineeringNumerical methods in engineering
Weak discrete maximum principle of finite element methods in convex polyhedra | Litcius