betaFeedback

WorksMathematics

Two nodally bound-preserving and mass-conservative discontinuous Galerkin methods for reaction-diffusion problems

Abstract

We propose and analyze two high-order discontinuous Galerkin methods that preserve prescribed nodal bounds and total mass for reaction-diffusion problems with anisotropic and heterogeneous diffusion. Both methods combine a weighted interior-penalty prediction step with a convex correction in either the dG energy or the L2L^2 metric. We construct a pointwise bound-preserving and cellwise mass-preserving comparison function with optimal local approximation properties. This construction yields optimal dG-energy error estimates for the energy correction and, under a dual regularity assumption, optimal L2L^2 and dG-energy error estimates for the L2L^2 correction on quasi-uniform meshes. We further establish a general a posteriori estimate that combines a predictor estimator with the computable correction norm. The resulting estimators are globally reliable and efficient up to data oscillation, with parameter-dependent efficiency constants. Numerical experiments compare the two corrections and illustrate their use in adaptive computations.

Introduction

Numerical schemes with structure-preserving properties play an essential role in the numerical simulations in physics and engineering, especially in materials science, biology and fluid dynamics [30, 4, 27, 41, 37]. For example, positivity-preservation ensures that diffusion terms like −∇⋅(u∇u)-\nabla\cdot(\sqrt{u}\nabla u) [41] are well-defined; mass-conservation is important for accurately reproducing long-time behavior of time-dependent problems [17]; bound-preservation ensures that source terms such as log⁡(1+u)−log⁡(1−u)\log(1+u)-\log(1-u) [38] are well-defined. Within these models, many linear ones can be considered as linear reaction-diffusion problems, whereas nonlinear stationary and time-dependent problems can be formulated as linear reaction-diffusion problems after linearization or time-discretization. Another common feature of these models is the existence of sharp interfaces or singularities caused by heterogeneous and anisotropic diffusion tensor [25].

Based on the above discussion, we consider a class of linear reaction-diffusion PDEs (partial differential equations) which covers model features mentioned above: on a bounded, connected Lipschitz domain Ω⊂Rd\Omega\subset\mathbb{R}^{d} with d∈{2,3}d \in\{2,3\}, let uu be the solution of

μu−∇⋅(K∇u)=f in Ω,u=gD on ΓD,K∇u⋅nΩ=gN on ΓN,(1)\mu u-\nabla\cdot(\boldsymbol{K}\nabla u)=f \text{ in } \Omega,\qquad u=g_D \text{ on } \Gamma_D,\qquad\boldsymbol{K}\nabla u\cdot\boldsymbol{n}_{\Omega}=g_N \text{ on } \Gamma_N, \tag*{(1)}

where K∈L∞(Ω;Rd×d)\boldsymbol{K}\in L^\infty(\Omega;\mathbb{R}^{d\times d}) is piecewise constant, symmetric, uniformly positive definite, anisotropic (the ratio between maximal and minimal eigenvalue of K\boldsymbol{K} can be much larger than 1) and heterogeneous (K\boldsymbol{K} can have large jumps) diffusion matrix. μ>0\mu>0 is the reaction coefficient, f∈L2(Ω)f\in L^2(\Omega), ∣ΓD∩ΓN∣=0|\Gamma_D\cap\Gamma_N|=0, ∂Ω=ΓD∪ΓN\partial\Omega=\Gamma_D\cup\Gamma_N, gD∈H12(ΓD)g_D \in H^{\frac{1}{2}}(\Gamma_D) and gN∈L2(ΓN)g_N \in L^2(\Gamma_N). With the help of trace operator γ\gamma, we introduce the trial and test function spaces

V:={v∈H1(Ω):γ(v)=gD on ΓD},V0:={v∈H1(Ω):γ(v)=0 on ΓD}.(2)V := \{v \in H^1(\Omega) : \gamma(v) = g_D \text{ on } \Gamma_D\}, \quad V_0 := \{v \in H^1(\Omega) : \gamma(v) = 0 \text{ on } \Gamma_D\}. \tag*{(2)}

The model problem (1) can be rewritten in a weak formulation: find u∈Vu \in V, such that

a(u,v)=l(v)∀v∈V0,(3)a(u,v) = l(v) \quad\forall v \in V_0, \tag*{(3)}

where a(v,w)=(μv,w)Ω+(K∇v,∇w)Ωa(v,w) = (\mu v,w)_\Omega+ (K\nabla v,\nabla w)_\Omega for all v,w∈H1(Ω)v,w \in H^1(\Omega) and l(v)=(f,v)Ω+∫ΓNgNvl(v) = (f,v)_\Omega+ \int_{\Gamma_N} g_N v for all v∈H1(Ω)v \in H^1(\Omega). We assume in addition that

u(x)∈[a,b]for almost all x∈Ω,(4)u(x) \in[a,b] \quad\text{for almost all } x \in\Omega, \tag*{(4)}

with −∞<a<b<∞-\infty< a < b < \infty, and the total mass m:=∫Ωum := \int_\Omega u (hence m/∣Ω∣∈[a,b]m/|\Omega| \in[a,b]) is known a priori. We note that (4) is in general violated by standard numerical schemes, even with sufficiently fine mesh [33].

The aim of this work is to find an efficient numerical method which is high-order, bound-preserving, mass-conservative, and able to capture and resolve the local features and singularities. For the finite element type schemes, it is practical to replace the pointwise bound-preservation by the nodal bound-preservation, hence in the rest of this work, the term bound-preservation will hereafter refer to nodal bound-preservation.

Over the past decades, bound-preservation has remained a major challenge for finite element type schemes. In low-order settings (polynomial degree equals one), discrete maximum principles or bound-preserving properties can be achieved under suitable mesh conditions, such as the acute-angle condition for triangular meshes in two dimensions [9]. In recent years, variational inequality formulations are applied to obtain high-order bound-preserving schemes in the pioneering works [8, 36]. Optimal convergence results in the energy norm have recently been established and extended to other model problems and spatial discretizations in [8, 1, 3, 19, 10, 2, 38]. The optimal convergence rate in the L2L^2 norm has recently been established for piecewise affine finite elements in one dimension by [7]. However, the above approaches generally do not ensure mass-conservation. This limitation has been addressed in a local sense in [11] via an enriched Galerkin method with specifically designed iterative solver to address the resulting linear system with large condition number.

To the best of our knowledge, in the literature, the following problems are important but remain open for high-order structure-preserving finite element type schemes: 1. How to efficiently ensure bound-preservation, mass-conservation and high-order accuracy simultaneously? 2. How to derive the error estimate in the L2L^2 norm in multidimensional setting? 3. How to derive a posteriori analysis and related adaptive scheme for singular solutions? 4. How to derive pointwise error estimates in the sense of [35]?

On the other hand, in the literature of time-dependent problems, a natural way to numerically ensure the physical constraints such as bound-preservation or mass-conservation is to project (or correct) the numerical solutions onto the constrained admissible set, e.g., the projection methods [6, 31, 12, 44, 40]. We note that, for the bound-preserving and mass-conservative admissible set, the projection method is close to the Lagrange multiplier method [17]. To the best of our knowledge, all methods mentioned above are mainly designed for problems with isotropic or mildly anisotropic diffusion, and focus on (quasi-) uniform mesh in space. Their technique will be adapted in this work for problems with anisotropic diffusion.

In order to capture the local feature and singular behavior, one natural idea is to consider the adaptive schemes with local refinement based on the a posteriori analysis (see, e.g., [43] and the references therein). The challenging issues of minimal regularity and robustness with respect to KK of our model problem are investigated in [25, 26, 16] and references therein. However, to the best of our knowledge, the bound-preserving high-order schemes are not analyzed in the a posteriori sense in the literature. Instead, the obstacle problems or the variational inequalities of the first kind are close to our model problem, and they are well studied in both a priori and a posteriori analysis (see e.g., [42, 15, 32] and references therein). These techniques can be adapted to our schemes, and the resulting estimators are compared with ours in § 6.

Overall, to the best of our knowledge, in the literature, there is no method which has simultaneously high-order accuracy, bound-preservation, mass-conservation, a priori and a posteriori error estimates, but these features are partially satisfied by different methods and analysis techniques from different communities. Based on the above literature review, we propose and analyze two prediction-correction type schemes to solve the model problem (1), which satisfy all properties mentioned above, and one of them admits a priori $L^2 error estimate. The prediction step (2.3) is given by standard discontinuous Galerkin (dG) approximation with harmonic weighting [21], and the correction steps (2.6) and (2.9) are realized by projecting the predicted solution onto structure-preserving admissible set through a minimization problem in different metrics.

The main contributions of this work are summarized as follows:

  • High-order structure-preserving schemes. Two high-order bound-preserving and mass-conservative schemes are proposed and shown to be well-posed for the model problem (1.1), based on the prediction-correction methodology. We obtain error estimates with similar parameter and mesh size dependencies as in the literature, meanwhile additional structure-preserving properties are satisfied.

  • Structure-preserving dG candidate with optimal approximation properties. Based on a cellwise convex combination of L2L^2 projection and its mean value, we construct a (pointwise) bound-preserving and cellwise mass-conservative dG function Πhu\Pi_h u which converges to u∈C(Ω‾;[a,b])∩H1(Ω)u \in C(\overline{\Omega};[a,b]) \cap H^1(\Omega) as h→0h \to0, and optimal convergence rate is established in HkH^k norm, k=0,…,p+1k=0,\ldots,p+1 and L∞L^\infty norm, for uu in Hp+1(Th)H^{p+1}(\mathcal{T}_h) and Wp+1,∞(Th)W^{p+1,\infty}(\mathcal{T}_h), respectively. This may be of independent interest, since it provides an optimal candidate for error analysis of other structure-preserving schemes.

  • Scheme with dG energy correction. For the scheme (2.3)-(2.6), we prove, for the dG energy norm, the optimal a priori convergence rate, under standard regularity assumptions in Theorem 3.6, without quasi-uniform mesh and Wp,∞W^{p,\infty}-regularity assumptions used in our previous work [38]; for the a posteriori analysis, we use the triangle inequality and the a posteriori approximation properties of the prediction step to construct error estimators (4.7) and establish the global reliability and efficiency of these estimators in Theorem 4.1.

  • Scheme with L2L^2 correction. For the scheme (2.3)-(2.9), we prove the optimal a priori convergence rate for the L2L^2 norm under standard regularity assumption, and the optimal a priori convergence rate for dG energy norm requires in addition the quasi-uniformity on meshes, in Theorem 5.1. A posteriori analysis is also derived in Theorem 5.4, with the same technique used in the dG correction scheme. We also note that our a posteriori analysis framework can be extended to other correction steps. See Corollary 4.7 and Remark 5.5 for details.

  • Numerical comparison. Owing to the block-diagonal structure of mass matrix of dG method, the scheme with L2L^2 correction is computationally less expensive than scheme with dG energy correction. However, we observe in §6 that, the correction realized in the L2L^2 metric is less smooth than the correction realized by the dG energy, hence the usage of two schemes depends on the resolution of the diffusion. In addition, the comparison between our estimators and estimators derived based on variational inequality techniques are also conducted.

The paper is organized as follows. §2 presents the discrete setting, the prediction-correction schemes and their fundamental properties. §3 develops a priori error analysis of the scheme with dG energy correction. In §4, we establish the a posteriori error analysis for the scheme with dG energy correction. In §5, we extend and adapt the argument in §3 and §4 to the scheme with L2L^2 correction. Numerical validation and comparison of two schemes are given in §6, followed by concluding remarks in §7.

Throughout the paper, we use standard notation for Sobolev spaces. The L2(S)L^2(S) inner product is written as (⋅,⋅)S(\cdot,\cdot)_S with associated norm ∥⋅∥S\|\cdot\|_S for any S⊂ΩS \subset\Omega. Generic constants C>0C>0 may change from line to line but are always independent of the mesh size, μ\mu, KK, ff, uu, gDg_D and gNg_N, but may depend on mesh shape regularity, domain Ω\Omega, polynomial degree and problem parameter. For brevity, spatial dependence is often suppressed when clear from context (e.g., K=K(x)K=K(x)).

Discrete setting and numerical scheme

In this section, we present the discrete setting, two prediction-correction high-order structure-preserving schemes, their fundamental properties and a practical solver for the correction step.

Discrete setting

For the spatial discretization, we consider a simplicial conforming mesh {Th}h>0\{\mathcal{T}_h\}_{h>0} of Ω\Omega. A generic mesh cell is denoted by T∈ThT \in\mathcal{T}_h. For simplicity, we assume that KK is constant on each cell T∈ThT \in\mathcal{T}_h. We define the mesh size parameter h:=max⁡T∈ThhTh := \max_{T \in\mathcal{T}_h} h_T and hT:=diam⁡(T)h_T := \operatorname{diam}(T). We also define hmin⁡:=min⁡T∈ThhTh_{\min} := \min_{T \in\mathcal{T}_h} h_T. The set of mesh faces is defined by F:=FD∪FN∪Fi\mathcal{F} := \mathcal{F}_D \cup\mathcal{F}_N \cup\mathcal{F}_i, with FD\mathcal{F}_D, FN\mathcal{F}_N and Fi\mathcal{F}_i representing the sets of Dirichlet, Neumann and interior faces, respectively. For each F∈FF \in\mathcal{F}, we define hF:=diam⁡(F)h_F := \operatorname{diam}(F) as the face diameter. We also set TF\mathcal{T}_F as the set of cells TT such that ∣∂T∩F∣≠0|\partial T \cap F| \ne0, and F~T\widetilde{\mathcal{F}}_T as the set of faces sharing a vertex with TT. For each face F∈FiF \in\mathcal{F}_i, we define nF\boldsymbol{n}_F as the globally fixed unit normal vector on FF. For F∈FiF \in\mathcal{F}_i, it points from T+T^+ to T−T^-, for some T±∈ThT^\pm\in\mathcal{T}_h with ∣∂T±∩F∣>0|\partial T^\pm\cap F| > 0, and for F∈FD∪FNF \in\mathcal{F}_D \cup\mathcal{F}_N, it is the outward unit normal vector of the domain. We assume only that the mesh is shape-regular, rather than the acute angle assumption which guarantees the discrete maximum principle in the literature (see for example [9]). On each cell T∈ThT \in\mathcal{T}_h, we set Kmax⁡,TK_{\max,T} and Kmin⁡,TK_{\min,T} as the maximum and minimum eigenvalues of KK on T∈ThT \in\mathcal{T}_h, respectively. We also define Kmax⁡:=max⁡T∈ThKmax⁡,TK_{\max} := \max_{T \in\mathcal{T}_h} K_{\max,T} and Kmin⁡:=min⁡T∈ThKmin⁡,TK_{\min} := \min_{T \in\mathcal{T}_h} K_{\min,T}.

We consider the dG space with a Lagrange basis of polynomial degree p≥1p \ge1. The global shape functions are denoted by {φi}i∈V\{\varphi_i\}_{i \in\mathcal{V}}. The corresponding dG space is denoted by

References

  1. [1]A. Amiri, G. R. Barrenechea, and T. Pryer. A nodally bound-preserving finite element method for reaction-convection-diffusion equations. Math. Models Methods Appl. Sci., 34(8):1533–1565, 2024.arxiv.org/abs/2311.15602
  2. [2]A. Amiri, G. R. Barrenechea, E. H. Georgoulis, and T. Pryer. A nodally bound-preserving composite discontinuous Galerkin method on polytopic meshes, 2025. URL https://arxiv.org/abs/2510.02094.
  3. [3]A. Amiri, G. R. Barrenechea, and T. Pryer. A nodally bound-preserving finite element method for time-dependent convection-diffusion equations. J. Comput. Appl. Math., 470:Paper No. 116691, 19, 2025.
  4. [4]D. M. Anderson, G. B. McFadden, and A. A. Wheeler. Diffuse-interface methods in fluid mechanics. In Annu. Rev. Fluid Mech., volume 30, pages 139–165. Annual Reviews, Palo Alto, CA, 1998.
  5. [5]D. Arndt, W. Bangerth, M. Bergbauer, B. Blais, M. Fehling, R. Gassmöller, T. Heister, L. Heltai, M. Kronbichler, M. Maier, P. Munch, S. Scheuermann, B. Turcksin, S. Uzunbajakau, D. Wells, and M. Wichrowski. The deal.II library, version 9.7. J. Numer. Math., 33(4):403–415, 2025.DOI
  6. [6]W. Bao and Q. Du. Computing the ground state solution of Bose-Einstein condensates by a normalized gradient flow. SIAM J. Sci. Comput., 25(5):1674–1697, 2004.arxiv.org/abs/cond-mat/0303241
  7. [7]G. R. Barrenechea and T. Chaumont-Frelet. An Aubin-Nitsche lemma for a positivity-preserving finite element method, 2026. URL https://arxiv.org/abs/2606.21560.
  8. [8]G. R. Barrenechea, E. Georgoulis, T. Pryer, and A. Veeser. A nodally bound-preserving finite element method. IMA J. Numer. Anal., 44(4):2198–2219, 2024.
  9. [9]G. R. Barrenechea, V. John, and P. Knobloch. Finite element methods respecting the discrete maximum principle for convection-diffusion equations. SIAM Rev., 66(1):3–88, 2024.
  10. [10]G. R. Barrenechea, T. Pryer, and A. Trenam. A nodally bound-preserving discontinuous Galerkin method for the drift–diffusion equation. J. Comput. Appl. Math., 470:116670, 2025.
  11. [11]G. R. Barrenechea, P. L. Lederer, and A. Rupp. A bound-preserving and conservative enriched Galerkin method for elliptic problems. SIAM J. Sci. Comput., 48(3):A1761–A1784, 2026.
  12. [12]S. Bartels and A. Prohl. Constraint preserving implicit finite element discretization of harmonic map flow into spheres. Math. Comp., 76(260):1847–1859, 2007.DOI
  13. [13]D. Braess. A posteriori error estimators for obstacle problems—another look. Numer. Math., 101(3):415–421, 2005.DOI
  14. [14]S. C. Brenner and L. R. Scott. The mathematical theory of finite element methods, volume 15 of Texts in Applied Mathematics. Springer, New York, third edition, 2008.
  15. [15]M. Bürg and A. Schröder. A posteriori error control of hp-finite elements for variational inequalities of the first and second kind. Comput. Math. Appl., 70(12):2783–2802, 2015.DOI
  16. [16]Z. Cai, C. He, and S. Zhang. Discontinuous finite element methods for interface problems: robust a priori and a posteriori error estimates. SIAM J. Numer. Anal., 55(1):400–418, 2017.DOI
  17. [17]Q. Cheng and J. Shen. A new Lagrange multiplier approach for constructing structure-preserving schemes, ii. bound preserving. SIAM J. Numer. Anal., 60(3):970–998, 2022.arxiv.org/abs/2109.12479
  18. [18]D. A. Di Pietro and A. Ern. Mathematical aspects of discontinuous Galerkin methods, volume 69 of Mathématiques & Applications (Berlin). Springer, Heidelberg, 2012.
  19. [19]Z. Dong, A. Ern, and Z. Wang. A bound-preserving scheme for the Allen-Cahn equation. Comput. Math. Appl., 199:225–241, 2025.
  20. [20]W. Dörfler. A convergent adaptive algorithm for Poisson’s equation. SIAM J. Numer. Anal., 33(3):1106–1124, 1996.DOI
  21. [21]M. Dryja. On discontinuous Galerkin methods for elliptic problems with discontinuous coefficients. Comput. Methods Appl. Math., 3(1):76–85, 2003.DOI
  22. [22]A. Ern and J.-L. Guermond. Finite Elements I—Approximation and Interpolation, volume 72 of Texts in Applied Mathematics. Springer, Cham, 2021.
  23. [23]A. Ern and J.-L. Guermond. Quasi-optimal nonconforming approximation of elliptic PDEs with contrasted coefficients and H^{1+r}, r > 0, regularity. Found. Comput. Math., 22(5):1273–1308, 2022.DOI
  24. [24]A. Ern and A. F. Stephansen. A posteriori energy-norm error estimates for advection-diffusion equations approximated by weighted interior penalty methods. J. Comput. Math., 26(4):488–510, 2008.DOI
  25. [25]A. Ern, A. F. Stephansen, and P. Zunino. A discontinuous Galerkin method with weighted averages for advection-diffusion equations with locally small and anisotropic diffusivity. IMA J. Numer. Anal., 29(2):235–256, 2009.DOI
  26. [26]A. Ern, A. F. Stephansen, and M. Vohralík. Guaranteed and robust discontinuous Galerkin a posteriori error estimates for convection-diffusion-reaction problems. J. Comput. Appl. Math., 234(1):114–130, 2010.DOI
  27. [27]M. Frémond. Non-smooth thermomechanics. Springer-Verlag, Berlin, 2002.
  28. [28]D. Gilbarg and N. S. Trudinger. Elliptic partial differential equations of second order, volume 224 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin, second edition, 1983.
  29. [29]T. Gudi. A new error analysis for discontinuous finite element methods for linear elliptic problems. Math. Comp., 79(272):2169–2189, 2010.DOI
  30. [30]M. E. Gurtin, D. Polignone, and J. Viñals. Two-phase binary fluids and immiscible fluids described by an order parameter. Math. Models Methods Appl. Sci., 6(6):815–831, 1996.DOI
  31. [31]E. Hairer, C. Lubich, and G. Wanner. Geometric numerical integration—structure-preserving algorithms for ordinary differential equations, volume 31 of Springer Series in Computational Mathematics. Springer-Verlag, Berlin, second edition, 2006.
  32. [32]W. Han. An introduction to theory and applications of stationary variational-hemivariational inequalities, volume 220 of Applied Mathematical Sciences. Springer, Cham, 2024.DOI
  33. [33]R. Herbin and F. Hubert. Benchmark on discretization schemes for anisotropic diffusion problems on general grids. In Finite volumes for complex applications V, pages 659–692. ISTE, London, 2008.
  34. [34]M. Hintermüller, K. Ito, and K. Kunisch. The primal-dual active set strategy as a semismooth Newton method. SIAM J. Optim., 13(3):865–888, 2002.DOI
  35. [35]C. Johnson, A. H. Schatz, and L. B. Wahlbin. Crosswind smear and pointwise errors in streamline diffusion finite element methods. Math. Comp., 49(179):25–38, 1987.DOI
  36. [36]R. C. Kirby and D. Shapero. High-order bounds-satisfying approximation of partial differential equations via finite element variational inequalities. Numer. Math., 156(3):927–947, 2024.arxiv.org/abs/2311.05880
  37. [37]B. Perthame. Parabolic equations in biology. Lecture Notes on Mathematical Modelling in the Life Sciences. Springer, Cham, 2015. Growth, reaction, movement and diffusion.
  38. [38]J. Shen and Z. Wang. A high-order nodally bound-preserving and mass-conservative method for linear fourth-order elliptic problems and its applications to nonlinear parabolic equations, 2026. URL https://arxiv.org/abs/2605.23486.
  39. [39]B. Stellato, G. Banjac, P. Goulart, A. Bemporad, and S. Boyd. OSQP: an operator splitting solver for quadratic programs. Math. Program. Comput., 12(4):637–672, 2020.
  40. [40]F. Tong and Y. Cai. Positivity preserving and mass conservative projection method for the Poisson-Nernst–Planck equation. SIAM J. Numer. Anal., 62(4):2004–2024, 2024.arxiv.org/abs/2403.04291
  41. [41]J. L. Vázquez. The porous medium equation—Mathematical theory. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, Oxford, 2007.
  42. [42]A. Veeser. Efficient and reliable a posteriori error estimators for elliptic obstacle problems. SIAM J. Numer. Anal., 39(1):146–167, 2001.DOI
  43. [43]R. Verfürth. A Posteriori Error Estimation Techniques for Finite Element Methods. Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford, 2013.DOI
  44. [44]X. Zhang. On positivity-preserving high order discontinuous Galerkin schemes for compressible Navier-Stokes equations. J. Comput. Phys., 328:301–343, 2017.DOI

Paper details

vlnc:W_vyk47bgr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents