Sufficient conditions for strong discrete maximum principles in finite element solutions of linear and semilinear elliptic equations
Abstract
We introduce a novel technique for proving global strong discrete maximum principles for finite element discretizations of linear and semilinear elliptic equations for cases when the common, matrix-based sufficient conditions are not satisfied. The basic argument consists of extending the strong form of discrete maximum principle from macroelements to the entire domain via a connectivity argument. The method is applied to discretizations of elliptic equations with certain pathological meshes, and to semilinear elliptic equations.
Fields of Study & Subjects
Advanced Numerical Methods in Computational Mathematics
Matrix Theory and Algorithms
Numerical methods for differential equations
Publication details
- Journal / source
- Mathematics of Computation
- Publication date
- 14 August 2026
- Language
- EN