A Bound-Preserving and Conservative Enriched Galerkin Method for Elliptic Problems

We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To avoid the ill-conditioning issues that arise in over-penalized schemes, we introduce an involved splitting approach that separates the system of equations for the discontinuous solution part from the system of equations for the continuous solution part, yielding well-behaved subproblems. We prove the existence of discrete solutions and optimal error estimates, which are validated numerically.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2026-06-17
DOI
https://doi.org/10.1137/25m1780493
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Bound-Preserving and Conservative Enriched Galerkin Method for Elliptic Problems

Andreas Norbert Rupp, Gabriel R. Barrenechea, Philip L. Lederer
SIAM Journal on Scientific Computing
Advanced Numerical Methods in Computational Mathematics
article

A Bound-Preserving and Conservative Enriched Galerkin Method for Elliptic Problems

Andreas Norbert Rupp, Gabriel R. Barrenechea, Philip L. Lederer
article en

Abstract

We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To avoid the ill-conditioning issues that arise in over-penalized schemes, we introduce an involved splitting approach that separates the system of equations for the discontinuous solution part from the system of equations for the continuous solution part, yielding well-behaved subproblems. We prove the existence of discrete solutions and optimal error estimates, which are validated numerically.

SIAM Journal on Scientific ComputingVol. 48(3)
Universität Hamburg (DE), University of Strathclyde (GB), HAW Hamburg (DE), Saarland University (DE)
Leverhulme Trust, Academy of Finland
Openalex Percentile: Top 99%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.