On a Hybrid Mixed Domain Decomposition Method

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Schmidt, Kersten, Seibel, Timon, Schöps, Sebastian
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918466332655616
author Schmidt, Kersten
Seibel, Timon
Schöps, Sebastian
author_facet Schmidt, Kersten
Seibel, Timon
Schöps, Sebastian
contents 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 $L^2$-surface quantity on the interfaces. Furthermore, the traces of the finite element functions on the interfaces are replaced by $L^2$-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$.
format Preprint
id arxiv_https___arxiv_org_abs_2604_22543
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On a Hybrid Mixed Domain Decomposition Method
Schmidt, Kersten
Seibel, Timon
Schöps, Sebastian
Numerical Analysis
Computational Engineering, Finance, and Science
65N30, 65N55
G.1.8
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 $L^2$-surface quantity on the interfaces. Furthermore, the traces of the finite element functions on the interfaces are replaced by $L^2$-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$.
title On a Hybrid Mixed Domain Decomposition Method
topic Numerical Analysis
Computational Engineering, Finance, and Science
65N30, 65N55
G.1.8
url https://arxiv.org/abs/2604.22543