Emergent Mind

A divergence preserving cut finite element method for Darcy flow

(2205.12023)
Published May 24, 2022 in math.NA and cs.NA

Abstract

We study cut finite element discretizations of a Darcy interface problem based on the mixed finite element pairs $\textbf{RT}k\times Qk$, $k\geq 0$. Here $Qk$ is the space of discontinuous polynomial functions of degree less or equal to $k$ and $\textbf{RT}$ is the Raviart-Thomas space. We show that the standard ghost penalty stabilization, often added in the weak forms of cut finite element methods for stability and control of the condition number of the linear system matrix, destroys the divergence-free property of the considered element pairs. Therefore, we propose new stabilization terms for the pressure and show that we recover the optimal approximation of the divergence without losing control of the condition number of the linear system matrix. We prove that the method with the new stabilization term has pointwise divergence-free approximations of solenoidal velocity fields. We derive a priori error estimates for the proposed unfitted finite element discretization based on $\textbf{RT}k\times Qk$, $k\geq 0$. In addition, by decomposing the mesh into macro-elements and applying ghost penalty terms only on interior edges of macro-elements, stabilization is applied very restrictively and only where needed. Numerical experiments with element pairs $\textbf{RT}0\times Q0$, $\textbf{RT}1\times Q1$, and $\textbf{BDM}1\times Q_0$ (where $\textbf{BDM}$ is the Brezzi-Douglas-Marini space) indicate that we have 1) optimal rates of convergence of the approximate velocity and pressure; 2) well-posed linear systems where the condition number of the system matrix scales as it does for fitted finite element discretizations; 3) optimal rates of convergence of the approximate divergence with pointwise divergence-free approximations of solenoidal velocity fields. All three properties hold independently of how the interface is positioned relative to the computational mesh.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.