Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a Hybrid Mixed Domain Decomposition Method

Published 24 Apr 2026 in math.NA and cs.CE | (2604.22543v1)

Abstract: We present a domain decomposition formulation based on hybridization which is inspired by hybridized discontinuous Galerkin (HDG) methods, that enhance mixed domain decomposition methods by incorporating stabilization terms. Unlike discontinuous Galerkin methods, our analysis of the proposed finite element method is based on a corresponding consistent variational formulation and a perturbed Galerkin method. In the variational formulation the divergence appears not only within subdomains, but also as an $L2$-surface quantity on the interfaces. Furthermore, the traces of the finite element functions on the interfaces are replaced by $L2$-distributions. The well-posedness of the perturbed Galerkin method is shown for an appropriate choice of subspaces, in a manner similar to that of the variational formulation. For the finite element method we use Raviart-Thomas elements for the dual variable and piecewise polynomials for the primal and hybrid variables, respectively. We perform an analysis of the discretization error which is explicit in the stabilization parameter $τ$. Numerical experiments for piecewise smooth solutions using finite element spaces of order~$q$ on curved quadrilateral meshes confirm the predicted convergence rate of $q+1$ for small values of $τ$. In the error analysis we observe the discretization error to be uniformly bounded in $τ$. Even for large $τ$ values the observed convergence rates for the primal and for the hybrid variables are $q+1$. For the dual variable the convergence rate depends on the stabilization parameter and the mesh-width, with an asymptotic rate of $q+\tfrac12$.

Summary

  • The paper's main contribution is the development and analysis of a Hybrid Mixed Domain Decomposition method that uses stabilization terms to enable explicit domain coupling.
  • It rigorously proves well-posedness and establishes uniform error bounds in τ, with optimal convergence rates of order h^(q+1) for the primal and hybrid variables.
  • Numerical experiments validate the approach on Poisson’s equation, demonstrating robust performance on both matching and non-matching meshes with variable coefficients.

Hybrid Mixed Domain Decomposition: A Variational and Numerical Analysis

Problem Setting and Motivation

The paper "On a Hybrid Mixed Domain Decomposition Method" (2604.22543) develops and analyzes a finite element domain decomposition approach for elliptic PDEs, leveraging advances from hybridized discontinuous Galerkin (HDG) methods. The central motivation lies in the interface treatment between non-overlapping subdomains—but instead of classical approaches, the Hybrid Mixed Domain Decomposition (HMDD) method incorporates stabilization terms à la Lehrenfeld-Schöberl, extending the classical mixed formulation by enabling explicit domain coupling. This allows for both optimal convergence and the possibility of applying the method to matching or non-matching meshes and variable coefficients.

The work's focus is on Poisson’s equation with homogeneous Dirichlet boundary data, re-cast in a mixed form using a flux variable. The formulation aims to combine the reduced global coupling, positive definiteness, and efficient Schur-complement properties of hybridized schemes with the flexibility and rigor of mixed finite elements.

Formulation of the Method

Mixed Hybrid Formulation

The computational domain Ω\Omega is partitioned into non-overlapping subdomains. The interface Γ\Gamma between neighboring subdomains (the skeleton) plays a key role. The hybrid variable μ\mu represents the trace of the primal variable uu on Γ\Gamma (Figure 1). Figure 1

Figure 1: Exemplary depiction of the domain Ω\Omega decomposed into four disjoint subdomains. Green lines denote the interface Γ\Gamma; blue arrows are arbitrary but fixed normal directions.

Inside each patch, a standard mixed formulation is used: find (q,u,μ)(\mathbf{q}, u, \mu) such that

κ1qu=0 in ΩΓ, div q=f in ΩΓ, \begin{aligned} \kappa^{-1}\mathbf{q} - \nabla u &= 0 \text{ in }\Omega\setminus\Gamma, \ -\text{div}~\mathbf{q} &= f \text{ in }\Omega\setminus\Gamma, \ \end{aligned}

and coupling on Γ\Gamma is imposed weakly via stabilization and hybrid variables.

A key feature is the use of stabilization parameter Γ\Gamma0, controlling the strength of penalty on primal trace jumps across Γ\Gamma1. This recovers classical methods (e.g., Raviart-Thomas hybrid mixed as Γ\Gamma2 and CG as Γ\Gamma3), but for Γ\Gamma4, it enables non-conforming meshing.

Variational and Discrete Setting

The authors provide a rigorous variational formulation, using duality products and carefully constructed function spaces (notably, Γ\Gamma5 for the primal variable, and Γ\Gamma6 for the flux). These spaces allow for Γ\Gamma7-based distributions both in the subdomain interiors and on the skeleton, weighted appropriately by Γ\Gamma8. The norm and decomposition structure ensure robust inf-sup stability independent of the choice of Γ\Gamma9.

In the finite element setting, subdomain spaces use Raviart-Thomas elements for the flux, standard polynomials for μ\mu0 and the hybrid variable, and approximate traces on μ\mu1 are handled via μ\mu2 projection. Figure 2

Figure 2

Figure 2: Computational domain μ\mu3 and reference solution component μ\mu4.

Figure 3

Figure 3

Figure 3

Figure 3

Figure 3

Figure 3

Figure 3: Numerical solution μ\mu5 and μ\mu6 (red lines) at polynomial order μ\mu7 (upper) and μ\mu8 (lower) for increasing mesh refinement.

Theoretical Analysis

Well-Posedness

A major theoretical achievement is the proof of well-posedness uniformly in μ\mu9. Through a detailed inf-sup theory, the authors show that the coupled system is stable for all uu0, matching mixed finite element stability arguments. The analysis extends naturally to high-order finite elements and curved meshes.

Error Analysis

The discretization error is bounded explicitly in terms of uu1 (mesh size), uu2 (polynomial order), uu3, and solution regularity: uu4 for sufficiently regular uu5. Similar error bounds are established for flux and divergence errors, demonstrating that for moderate uu6, optimal uu7 convergence rates are observed—independent of the stabilization.

Notably, the error is uniformly bounded in uu8, and observed rates for the primal and hybrid variables remain uu9 even for large Γ\Gamma0. For the flux variable, the rate is Γ\Gamma1 asymptotically as Γ\Gamma2 or Γ\Gamma3 varies.

Numerical Experiments

A comprehensive numerical study validates the theoretical predictions. The test case features a radially symmetric domain with an interface at the unit circle and material jump. Polynomial orders Γ\Gamma4 and Γ\Gamma5 were tested across several mesh resolutions and a wide range of stabilization parameters Γ\Gamma6. Figure 4

Figure 4

Figure 4

Figure 4

Figure 4

Figure 4

Figure 4: Γ\Gamma7 error in Γ\Gamma8 as a function of Γ\Gamma9 for order Ω\Omega0.

Figure 5

Figure 5

Figure 5

Figure 5

Figure 5

Figure 5

Figure 5: Error plots for Ω\Omega1, Ω\Omega2, and Ω\Omega3 across Ω\Omega4, as Ω\Omega5 varies for Ω\Omega6.

Figure 6

Figure 6

Figure 6

Figure 6

Figure 6

Figure 6

Figure 6: Error plots for the flux variable on Ω\Omega7: normal component Ω\Omega8, primal jump Ω\Omega9, and hybrid error, for Γ\Gamma0 and different Γ\Gamma1.

Key empirical findings:

  • For fixed Γ\Gamma2, all error measures remain bounded for large Γ\Gamma3, confirming independence from stabilization magnitude.
  • Both Γ\Gamma4 and Γ\Gamma5 consistently show optimal convergence rates of Γ\Gamma6 with respect to Γ\Gamma7, robust to Γ\Gamma8.
  • The flux and its divergence show intermediate rates that transition depending on Γ\Gamma9 and (q,u,μ)(\mathbf{q}, u, \mu)0—matching analysis.

The authors systematically investigate both (q,u,μ)(\mathbf{q}, u, \mu)1- and (q,u,μ)(\mathbf{q}, u, \mu)2-asymptotic regimes, clarifying convergence behavior in all relevant parameter limits.

Implications and Future Directions

This work establishes a robust theoretical and numerical foundation for HMDD as a versatile domain decomposition approach for mixed formulations. The flexibility of (q,u,μ)(\mathbf{q}, u, \mu)3 enables straightforward application to non-matching grids (mortar methods), higher dimensions, and more general PDEs (e.g., Maxwell or Helmholtz equations).

Potential directions include:

  • Extending the variational analysis to general non-matching grids and multipatch isogeometric discretizations.
  • Exploiting the positive-definite, sparsified Schur complement structure for efficient solver design.
  • Applying the framework to more complex coupled field problems and time-dependent PDEs.

The variational underpinning also opens the door to rigorous mortar-like coupling of multi-physics and multi-mesh simulations.

Conclusion

The HMDD method represents a theoretically well-founded, high-order accurate approach to domain decomposition for mixed formulations of elliptic problems, unifying and extending previous hybrid and hybridized Galerkin ideas. Its robustness with respect to stabilization, rigorous error analysis, and empirical validation set the stage for broad applicability in large-scale and geometrically complex PDE simulations.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Collections

Sign up for free to add this paper to one or more collections.