EUVIMEDEUVIMED entdecken
Crossref

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

Gabriel R. Barrenechea, Philip L. Lederer, Andreas Rupp

SIAM Journal on Scientific Computing · 30.06.2026 · 48 (3) · A1761-A1784

DOI: 10.1137/25m1780493 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Scientific Computing, online erschienen am 17.06.2026. Verfasst von Gabriel R. Barrenechea und 2 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Gefördert von: Research Council of Finland, Leverhulme Trust.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial overpenalization of the discrete solution’s jumps to obtain optimal convergence. To avoid the ill-conditioning issues that arise in overpenalized 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.

Förderung

  • Research Council of Finland
  • Leverhulme Trust

Zitieren

APA

Barrenechea, G. R., Lederer, P. L., & Rupp, A. (2026). A Bound-Preserving and Conservative Enriched Galerkin Method for Elliptic Problems. SIAM Journal on Scientific Computing, 48(3), A1761-A1784. https://doi.org/10.1137/25m1780493

Vancouver

Barrenechea GR, Lederer PL, Rupp A. A Bound-Preserving and Conservative Enriched Galerkin Method for Elliptic Problems. SIAM Journal on Scientific Computing. 2026;48(3):A1761-A1784. doi:10.1137/25m1780493

BibTeX
@article{Barrenechea2026,
  author = {Barrenechea, Gabriel R. and Lederer, Philip L. and Rupp, Andreas},
  title = {A Bound-Preserving and Conservative Enriched Galerkin Method for Elliptic Problems},
  journal = {SIAM Journal on Scientific Computing},
  year = {2026},
  volume = {48},
  number = {3},
  pages = {A1761--A1784},
  doi = {10.1137/25m1780493}
}
Kostenlos starten →