Abstract
We present a cut finite element method for the heat equation on two overlapping meshes: a stationary background mesh and an overlapping mesh that evolves inside/“on top” of it. Here the overlapping mesh is prescribed by a simple discontinuous evolution, meaning that its location, size, and shape as functions of time are discontinuous and piecewise constant. For the discrete function space, we use continuous Galerkin in space and discontinuous Galerkin in time, with the addition of a discontinuity on the boundary between the two meshes. The finite element formulation is based on Nitsche’s method. The simple discontinuous mesh evolution results in a space-time discretization with a slabwise product structure between space and time which allows for existing analysis methodologies to be applied with only minor modifications. We follow the analysis methodology presented by Eriksson and Johnson (SIAM J Numer Anal 28(1):43–77, 1991; SIAM J Numer Anal 32(3):706–740, 1995). The greatest modification is the introduction of a Ritz-like “shift operator” that is used to obtain the discrete strong stability needed for the error analysis. The shift operator generalizes the original analysis to some methods for which the discrete subspace at one time does not lie in the space of the stiffness form at the subsequent time. The error analysis consists of an a priori error estimate that is of optimal order with respect to both time step and mesh size. We also present numerical results for a problem in one spatial dimension that verify the analytic error convergence orders.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
For a more substantial introduction containing motivation and literary background discussing the works [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22], we refer to the related work Space-Time CutFEM on Overlapping Meshes I: Simple Continuous Mesh Motion [23].
This work: The work presented here is together with [23,24,25] intended to be an initial part of developing and analysing CutFEMs on overlapping meshes for time-dependent problems. We consider a CutFEM for the heat equation on two overlapping meshes: one stationary background mesh and one moving overlapping mesh with no object. Depending on how the mesh motion is represented discretely, quite different space-time discretizations may arise, allowing for different types of analyses to be applied. Generally the mesh motion may either be continuous or discontinuous, which might also affect the suitability for different applications. For instance, the information in a prismatic space-time method flows along the space-time trajectories of the underlying spatial mesh. This means that the flow of information of the overlapping mesh is more well-connected in the continuous case, whereas in the discontinuous one, the information “leaks” out of the overlapping mesh. This could suggest that continuous mesh motion is more suitable when the overlapping mesh represents something physical, and that discontinuous mesh motion is more suitable when it is a computational feature that should not be “seen”, e.g., alternative to adaptive mesh refinement. More discussion of a comparison of the two motions can be found in [25]. We have considered the simplest case of both of these two types of mesh motion, which we refer to as simple continuous and simple discontinuous mesh motion. Simple continuous mesh motion means that the location of the overlapping mesh as a function of time is continuous and piecewise linear, and simple discontinuous mesh motion means that it is discontinuous and piecewise constant. The first study on this topic, presented in the MSc thesis [24], considered simple continuous mesh motion together with an \(L^2\)-analysis (error in spatial \(L^2\)-norm at the final time). Partially due to \(L^2\)-analysis’s demanding stability requirements, error bounds were unfortunately not obtained and the analysis was left incomplete. However, the numerical results indicate that the superconvergence with respect to the time step is lost with continuous mesh motion, but that the other error convergence orders are preserved. After the first study, simplifications were made in two directions: less demanding analysis and less complicated mesh motion. This resulted in two new studies with complete analyses: energy analysis for continuous mesh motion and \(L^2\)-analysis for discontinuous. The former is presented in [23] and the latter in this work. They are also part of the Phd thesis [25] as long and technical manuscripts, referred to as Paper I and Paper II, respectively. There, detailed discussions and comparisons of all three studies are also presented. Here, with no extra effort, we may also extend the mesh motion to a mesh evolution, meaning that size and shape change as well. Thus, simple discontinuous mesh evolution means that the location, size, and shape of the overlapping mesh as functions of time are discontinuous and piecewise constant.
Analysis: The simple discontinuous mesh evolution results in a space-time discretization with a slabwise product structure between space and time. Standard analysis methodology therefore work with some modifications. So instead of following a more basic energy analysis as in [23], we choose to consider a more demanding analysis with the \(L^2\)-norm as the main error norm to more extensively demonstrate the capabilities of the method. We follow the analysis presented by Eriksson and Johnson in [26, 27]. The main modification is the introduction of what we call a “shift operator” which can be viewed as a modified Ritz projection operator. This is somewhat similar to what is done in [28]. The shift operator is used to obtain the discrete strong stability needed for the error analysis. In the proof of the strong stability, discrete functions on one slab need to be translated into discrete functions on the subsequent slab. In [26], this is done by simply assuming that the discrete space of one slab lies in the discrete space of the next. In [27], the proof is generalized by mapping discrete functions of one slab to the next with the Ritz projection operator. Here, the Ritz projection on one slab is not defined for discrete functions on another slab since the discontinuity on the interface between the two meshes changes between slabs. This issue is solved by instead using the shift operator to map between discrete subspaces. The shift operator thus further generalizes the original analysis to be applicable to some methods where the discrete space of one slab does not lie in the space of the stiffness form on the subsequent slab, e.g., problems with changing interior geometry. The error analysis concerns an optimal order a priori error estimate of the \(L^2\)-norm of the approximation error at the final time. This estimate shows that the method preserves the superconvergence of the error with respect to the time step.
Paper overview: The rest of the paper is organized as follows. We start by formulating the model problem in Sect. 2, followed by a corresponding CutFEM in Sect. 3. Then we present and prove analytic tools, including the shift operator, in Sect. 4 and discrete stability estimates in Sect. 5. In Sect. 6, the main analytic result which is an optimal order a priori error estimate is presented and proved. Numerical results for a problem in one spatial dimension that verify the analytic convergence orders are presented in Sect. 7. The last part of the paper is an appendix that contains technical estimates and interpolation results used in the analysis.
2 Problem
For \(d = 1, 2\), or 3, let \({\Omega _0} \subset \mathbb {R}^d\) be a bounded convex domain with polygonal boundary \(\partial {\Omega _0}\). Let \(T > 0\) be a given final time. Let \(G \subset {\Omega _0} \subset \mathbb {R}^d\) be another bounded domain with polygonal boundary \(\partial G\). We let the location, size, and shape of G be time-dependent by prescribing for G a time-dependent spatially smooth velocity field \(\mu _t: G(t) \rightarrow \mathbb {R}^d\). Using \({\Omega _0}\) and G, we define the following two domains:
with boundaries \(\partial {\Omega _1}\) and \(\partial {\Omega _2}\), respectively. Let their common boundary be
For \(t \in [0, T]\), we have the partition
See Fig. 1 for an illustration. We consider the heat equation in \({\Omega _0} \times (0, T]\) with source \(f \in L^2((0, T], {\Omega _0})\), homogeneous Dirichlet boundary conditions, and initial data \(u_0 \in H^2({\Omega _0}) \cap H_0^1({\Omega _0})\):
We stress that although we have the partition (2.4), the problem (2.5) is itself a one-domain problem for ease of analysis.
3 Method
3.1 Preliminaries
Let \(\mathcal {T}_0\) and \(\mathcal {T}_G\) be quasi-uniform simplicial meshes of \({\Omega _0}\) and G, respectively. We denote by \(h_K\) the diameter of a simplex K. We partition the time interval (0, T] quasi-uniformly into N subintervals \(I_n = (t_{n-1}, t_n]\) of length \(k_n = t_n - t_{n-1}\), where \(0 = t_0< t_1< \cdots < t_N = T\) and \(n = 1, \ldots , N\). We assume the following space-time quasi-uniformity: For \(h = \max _{K \in \mathcal {T}_0 \cup \mathcal {T}_G}\{h_K\}\), and \(k = \max _{1 \le n \le N}\{k_n\}\),
where \(k_{\min } = \min _{1 \le n \le N}\{k_n\}\), and \(h_{\min } = \min _{K \in \mathcal {T}_0 \cup \mathcal {T}_G}\{h_K\}\). We note that this space-time quasi-uniformity is stricter than the one assumed in [27], which here has the equivalent form \(h^2 \lesssim k_{\min }\). The stricter one is needed because of using the shift operator results Lemma 4.4 and Lemma 4.5 in the analysis. However, it does not seem like (3.1) is actually sharp based on the numerical results presented in Figs. 5 and 6. Here, \(h \approx h_{\min }\) and \(k = k_{\min }\) can differ by several orders of magnitude without affecting the expected error behaviour. In the most extreme case, the numerical results demonstrating the superconvergence for dG(1) in time that are presented in the left panel of Fig. 6, they differ by a factor of up to \(10^4\). We next define the following slabwise space-time domains:
In general we will use bar, i.e., \(\bar{\cdot }\), to denote something related to space-time, such as domains and variables. In addition to the domains \({\Omega _1(t)}\) and \({\Omega _2(t)}\), we also consider the “covered” overlap domain \({\Omega _O(t)}\). To define it, we will use the set of simplices \(\mathcal {T}_{0, \Gamma (t)}:= \{K \in \mathcal {T}_0: K \cap \Gamma (t)\ne \emptyset \}\), i.e., all simplices in \(\mathcal {T}_0\) that are cut by \(\Gamma \) at time t. We define the overlap domain \({\Omega _O(t)}\) for a time \(t \in [0, T]\) by
As a discrete counterpart to the evolution of the domain G, we prescribe a simple discontinuous evolution for the overlapping mesh \(\mathcal {T}_G\). By this we mean that the location, size, and shape of the overlapping mesh \(\mathcal {T}_G\) are functions with respect to time that are discontinuous on [0, T] and constant on each \(I_n\). This means that on each \(I_n\) the location, size, and shape of \(\mathcal {T}_G\) are fixed, but change from \(I_{n-1}\) to \(I_n\). We simply take \(\mathcal {T}_G\) on \(I_n\) to be a mesh of \(G(t_n)\). An illustration of the slabwise space-time domains \(S_{i, n}\) defined by (3.3) is shown in Fig. 2. The simple discontinuous mesh evolution results in the following: For \(n = 1, \ldots , N\)
3.2 Finite element spaces
We define the discrete spatial finite element spaces \(V_{h,0}\) and \(V_{h,G}\) as the spaces of continuous piecewise polynomials of degree \(\le p\) on \(\mathcal {T}_0\) and \(\mathcal {T}_G\), respectively. We also let the functions in \(V_{h,0}\) be zero on \(\partial {\Omega _0}\). For \(t \in [0, T]\), we use these two spaces to define the broken finite element space \(V_h(t)\) by
See Fig. 3 for an illustration of a function \(v \in V_h(t)\). From the simple discontinuous evolution of \(\mathcal {T}_G\), we have via (3.6a) that: For \(n = 1, \ldots , N\)
For \(n = 1, \ldots , N\), we define the discrete space-time finite element spaces \(V_{h,0}^n\) and \(V_{h,G}^n\) as the spaces of functions that for a \(t \in I_n\) lie in \(V_{h,0}\) and \(V_{h,G}\), respectively, and in time are polynomials of degree \(\le q\) along the trajectories of \(\mathcal {T}_0\) and \(\mathcal {T}_G\) for \(t \in I_n\), respectively. For \(n = 1, \ldots , N\), we use these two spaces to define the broken finite element space \(V_h^n\) by:
We define the global space-time finite element space \(V_h\) by:
3.3 Finite element formulation
We may now formulate the space-time cut finite element formulation for the problem described in Sect. 2 as follows: Find \(u_h \in V_h\) such that
The non-symmetric bilinear form \(B_h\) is defined by
where \(( \cdot , \cdot )_{\Omega }\) is the \(L^2(\Omega )\)-inner product, \([v]_n\) is the jump in v at time \(t_n\), i.e., \([v]_n = v_n^+ - v_n^-\), \(v_n^\pm = \lim _{\varepsilon \rightarrow 0+} v(x, t_n \pm \varepsilon )\). The symmetric bilinear form \(A_{h,t}\) is defined by
where \(\langle v \rangle \) is a convex-weighted average of v on \(\Gamma \), i.e., \(\langle v \rangle = \omega _1v_1 + \omega _2v_2\), where \(\omega _1, \omega _2 \in [0, 1]\) and \(\omega _1 + \omega _2 = 1\), \(v_i = \lim _{\varepsilon \rightarrow 0+} v(\bar{s}- \varepsilon n_i)\), \(\bar{s}= (s,t)\), n is the normal vector to \(\Gamma \) (not to be confused with time index n, e.g., in \(t_n\)), \(\partial _n v = n \cdot \nabla v\), [v] is the jump in v over \(\Gamma \), i.e., \([v]= v_1 - v_2\), \(\gamma \ge 0\) is a stabilization parameter, \(h_K = h_K(x) = h_{K_0}\) for \(x \in K_0\), where \(h_{K_0}\) is the diameter of simplex \(K_0 \in \mathcal {T}_0\), and \({\Omega _O(t)}\) is the overlap region defined by (3.5).
4 Analytic preliminaries
4.1 The bilinear form \(A_{h,t}\)
The space of \(A_{h, t}\) is \(H^{3/2 + \varepsilon }(\cup _i {\Omega _i(t)})\) where \(\varepsilon > 0\) may be arbitrarily small. From the simple discontinuous evolution of \(\mathcal {T}_G\), we have via (3.6) that
Let \(\Gamma _K(t):= K \cap \Gamma (t)\). We define the following two mesh-dependent norms:
Note that
We define the time-dependent spatial energy norm \(\left| \left| \left| \cdot \right| \right| \right| _{A_{h,t}}\) by
Continuity of \(A_{h,t}\) follows from using (4.3) in (3.13). Next we consider the coercivity:
Lemma 4.1
(Discrete coercivity of \(A_{h,t}\)) Let the bilinear form \(A_{h,t}\) and the energy norm \(\left| \left| \left| \cdot \right| \right| \right| _{A_{h,t}}\) be defined by (3.13) and (4.4), respectively. Then, for \(t \in [0, T]\) and \(\gamma \) sufficiently large,
Proof
Following the proof of the coercivity in [2], we consider
where we have used Lemma A.4 and denoted its constant by \(C_I\). We use (4.6) in
By taking \(\varepsilon > 2C_I\), and \(\gamma > \varepsilon \) we may obtain (4.5) from (4.7). \(\square \)
4.2 Standard operators that map to \(V_h(t)\)
Here we define some standard spatial operators for every \(t \in [0, T]\). The \(L^2({\Omega _0})\)-projection operator \(P_{h,t}: L^2({\Omega _0}) \rightarrow V_h(t)\) is defined by
The Ritz projection operator \(R_{h,t}: H^{3/2 + \varepsilon }(\cup _i {\Omega _i(t)}) \rightarrow V_h(t)\) is defined by
Lemma 4.2
(Estimates for the Ritz projection error) Let the spatial energy norm \(\left| \left| \left| \cdot \right| \right| \right| _{A_{h,t}}\) and the Ritz projection operator \(R_{h,t}\) be defined by (4.4) and (4.9), respectively. Then for any \(w \in H^{p+1}({\Omega _0}) \cap H^1_0({\Omega _0})\)
Proof
The proof is essentially the same as in the standard case with only natural modifications to account for the CutFEM setting. First the energy estimate (4.10) is shown, which then is used in the Aubin–Nitsche duality trick to show (4.11). Let \(\psi = w - R_{h,t}w\) denote the projection error. Due to only having discrete coercivity of \(A_{h,t}\), we use the spatial interpolation operator \(I_{h, t}\) defined by (B.1) to split the error into \(\pi = w - I_{h,t}w\) and \(\eta = I_{h,t}w - R_{h,t}w\). Thus
Since \(\eta \in V_h(t)\), we use Lemma 4.1 to get
Using this in (4.12) and applying Lemma B.1 we get
which is (4.10). For (4.11), we consider the auxiliary problem: Find \(\phi \in H^2({\Omega _0}) \cap H_0^1({\Omega _0})\) such that \(\Delta {\phi } = \psi \ \text {in} \ {\Omega _0}.\) From regularity we have that \([\partial _n\phi ]|_{\Gamma (t)} = 0\) in \(L^2(\Gamma (t))\). Using the integration by parts provided by Corollary A.1 and the spatial interpolation operator \(I_{h, t}\) for \(p = 1\) in following the Aubin–Nitsche duality trick shows (4.11). \(\square \)
The discrete Laplacian \(\Delta _{h,t}: H^{3/2 + \varepsilon }(\cup _i {\Omega _i(t)}) \rightarrow V_h(t)\) is defined by
From the simple discontinuous evolution of \(\mathcal {T}_G\), we have via (3.8) and (4.1) that
4.3 The shift operator
Here, we introduce the shift operator which is not present in the standard analysis, presented in [26, 27]. The shift operator is needed because of the simple discontinuous mesh evolution in the CutFEM setting. The shift operator will be used in the proof of Lemma 5.2. At one point in the proof, one would like to consider \(R_{n}u_{h,n-1}^-\). This is however undefined in the current setting because of the shifting discontinuity coming from the evolution of \(\Gamma \). Since \(R_{n}\) is only defined for functions in \(H^{3/2 + \varepsilon }(\cup _{i} {\Omega _{i,n}}) \subset H^1(\cup _{i} {\Omega _{i,n}})\) and \(u_{h,n-1}^- \in V_{h,n-1} \subset H^1(\cup _{i} {\Omega _{i,n-1}})\), the projection \(R_{n}u_{h,n-1}^-\) is not defined. Enter shift operator. The idea is to consider a Ritz-like operator that can map from one discrete space to another. To define the shift operator, we will use a special bilinear form \(\mathscr {A}_{n, m}\). To define \(\mathscr {A}_{n, m}\), we will use a partition of \({\Omega _0}\) into the subdomains
For an illustration of the partition, see Fig. 4. For \(n, m = 0, 1, \ldots , N\), we define the non-symmetric bilinear form \(\mathscr {A}_{n, m}\) by
We define a related energy norm by
With this norm, we may obtain the following continuity result:
Lemma 4.3
(Continuity of \(\mathscr {A}_{n, m}\)) Let the bilinear form \(\mathscr {A}_{n, m}\) be defined by (4.20), and the norm \(\left| \left| \left| \cdot \right| \right| \right| _{\mathscr {A}_{n,m}}\) by (4.21). Then for functions v and w of sufficient regularity
Proof
The left-hand side of (4.22) is given by (4.20), where the first term is
Here we have used that \(v \in H^1(\cup _i {\Omega _{i, n}})\) and \(w \in H^1(\cup _j {\Omega _{j, m}})\) to merge integrals over \({\omega _{ij}}\)’s to integrals over \({\Omega _i}\)’s, e.g., \(\Vert \nabla v \Vert _{{\omega _{i1}}}^2 + \Vert \nabla v \Vert _{{\omega _{i2}}}^2 = \Vert \nabla v \Vert _{{\Omega _{i, n}}}^2\). For the second and third term, we use (4.3) followed by the norm definition (4.21). \(\square \)
By restricting v and w in Lemma 4.3 to the corresponding discrete subspaces, i.e., \(V_{h, n}\) and \(V_{h, m}\), respectively, we may obtain a continuity result in the weaker \(A_n\)-norms. This is done by estimating the average terms in the \(\mathscr {A}_{n,m}\)-norms using an inverse inequality that is a twist on the one in Lemma A.4. The average term is
where we also want to estimate the second term by \(\left| \left| \left| v \right| \right| \right| _{A_{n}}^2\). We do this by following the proof of Lemma A.4, omitting some of the steps that are the same. Partitioning \(\Gamma _{m} \setminus \Gamma _{n}\) into \(\grave{\Gamma }_{i}:= (\Gamma _{m} {\setminus } \Gamma _{n}) \cap {\Omega _{i,n}}\), using the interdependent indices \(i = 1,2\), and \(j = 0, G\), and writing \(\grave{\Gamma }_{i {K_j}} = K_j \cap \grave{\Gamma }_i\), we have for \(v \in V_{h,n}\) that
where we have used Corollary A.2. Using (4.25) in (4.24), we get for \(v \in V_{h,n}\) that
Using (4.26) in (4.21), we may obtain
By restricting the functions in Lemma 4.3 to the discrete subspaces, we may use the above norm equivalence to obtain the following discrete continuity result:
Corollary 4.1
(Discrete continuity of \(\mathscr {A}_{n, m}\)) Let the bilinear form \(\mathscr {A}_{n, m}\) and the spatial energy norm \(\left| \left| \left| \cdot \right| \right| \right| _{A_{n}}\) be defined by (4.20) and (4.4), respectively. Then
We are now ready to move on to the shift operator.
Definition 4.1
(Shift operator) For \(n, m = 0, \ldots , N\), we define the shift operator \(\mathscr {S}_{n,m}: H^{3/2 + \varepsilon }(\cup _i {\Omega _{i, n}}) \rightarrow V_{h, m}\) by
Note that \(V_{h,n} \subset H^{3/2 + \varepsilon }(\cup _i {\Omega _{i, n}})\) so that \(\mathscr {S}_{n,m}: V_{h,n} \rightarrow V_{h,m}\). When it is clear what type of function \(\mathscr {S}_{n,m}\) operates on, we write \(\mathscr {S}_m = \mathscr {S}_{n,m}\) for brevity. For \(v \in H^{3/2 + \varepsilon }(\cup _i {\Omega _{i, n}})\), using \(\mathscr {S}_m v \in V_{h,m}\), the discrete coercivity of \(A_m\), the definition of \(\mathscr {S}_m\), and the continuities of \(\mathscr {A}_{n, m}\), we get the following stability of the shift operator:
By restricting v in (4.30) to \(V_{h,n} \subset H^{3/2 + \varepsilon }(\cup _i {\Omega _{i, n}})\) and using (4.27), we have
The shift operator has two approximability properties that are essential for its application in the analysis. We present and prove these properties in the following two lemmas:
Lemma 4.4
(An estimate for the shift error) Let the shift operator \(\mathscr {S}_m = \mathscr {S}_{n,m}\) be defined by (4.29) and the spatial energy norms \(\left| \left| \left| \cdot \right| \right| \right| _{\mathscr {A}_{n,m}}\) and \(\left| \left| \left| \cdot \right| \right| \right| _{A_{n}}\) by (4.21) and (4.4), respectively. Then
Proof
The estimate (4.33) follows from (4.32) by restricting v to \(V_{h,n} \subset H^{3/2 + \varepsilon }(\cup _i {\Omega _{i, n}}) \cap H_0^{1}(\cup _i {\Omega _{i, n}})\) and using (4.27). We thus only need to prove (4.32). The proof is based on the Aubin–Nitsche duality trick but involves a few modifications. Let \(\psi = v - \mathscr {S}_m v\) denote the shift error. We consider the auxiliary problem: Find \(\phi \in H^2({\Omega _0}) \cap H_0^1({\Omega _0})\) such that \(-\Delta {\phi } = \psi \ \text {in} \ {\Omega _0}\). With this, the square of the left-hand side of (4.33) is
where we have used Lemma A.2 and Corollary A.1 to go to the second row, and that \([\phi ]|_{\Gamma _m} = 0\) to go to \(\mathscr {A}_{n, m}\) in the last row. We denote by \(I_{h, m} = I_{h, p=1, m}\) the spatial interpolation operator \(I_{h, t_m}\) defined by (B.1). By adding and subtracting \(\mathscr {A}_{n, m}(v, I_{h, m} \phi )\) to the last row of (4.34) and using the definition of the shift operator, we have
where we have used the continuities to go to the third row. To get the penultimate inequality, we have used Lemma B.2, (4.30), and Lemma B.1. In the last step, we have used elliptic regularity on \(H^2({\Omega _0}) \cap H_0^1({\Omega _0})\) for \(\phi \). This shows (4.32). \(\square \)
Lemma 4.5
(An estimate for the shift energy) Let the bilinear form \(A_n\) be defined by (3.13), the shift operator \(\mathscr {S}_m = \mathscr {S}_{n, m}\) by (4.29), the spatial energy norm \(\left| \left| \left| \cdot \right| \right| \right| _{A_{n}}\) by (4.4), and the discrete Laplacian \(\Delta _n\) by (4.15). Then
Proof
The left-hand side of (4.36) is
where we have used (4.29), Lemma 4.4 and (4.31). This shows (4.36). \(\square \)
4.4 The bilinear form \(B_h\)
The bilinear form \(B_h\) can be expressed differently, as noted in the following lemma:
Lemma 4.6
(Alternative form of \(B_h\)) The bilinear form \(B_h\), defined by (3.12), can be written as
Proof
The proof is exactly as in the standard case. The first term in (3.12) is integrated by parts with respect to time and the result is combined with the last two terms in (3.12). \(\square \)
To show Galerkin orthogonality, we need the following lemma on consistency:
Lemma 4.7
(Consistency) The solution u to problem (2.5) also solves (3.11).
Proof
First insert u in place of \(u_h\) on the left-hand side of (3.11) and use the regularity of u. Then integrate by parts in space to get interior and boundary terms. The exterior boundary terms vanish because of the boundary conditions imposed on v thus leaving the \(\Gamma \)-terms which are combined. Applying Lemma A.1 and the regularity of u only leaves terms which from (2.5) equals the right-hand side of (3.11). \(\square \)
From Lemma 4.7 we may obtain the Galerkin orthogonality:
Corollary 4.2
(Galerkin orthogonality) Let the bilinear form \(B_h\) be defined by (3.12), and let u and \(u_h\) be the solutions of (2.5) and (3.11), respectively. Then
We now consider the discrete dual problem: Find \(z_h \in V_h\) such that
5 Stability analysis
The stability analysis in this section is based on a stability analysis for the case with only a background mesh, presented by Eriksson and Johnson in [26, 27]. Due to the CutFEM setting, the original analysis has been slightly modified by the incorporation of the shift operator defined by (4.29). The main result of this section is the following stability estimate and its counterpart for the discrete dual problem:
Theorem 5.1
(The main stability estimate) Let \(u_h\) be the solution of (3.11) with \(f \equiv 0\) and let \(u_0\) be the initial value of the analytic solution of the problem presented in Sect. 2. Then we have that
where \(C_1 = C(\log (t_N/k_1) + 1)^{1/2}\) and \(C > 0\) is a constant.
The counterpart of (5.1) for \(z_h\) is a crucial tool in the proof of the a priori error estimate presented in Theorem 6.1. For the purpose of that application, we replace the initial time jump term. From (5.1), we have that \(\Vert [u_h]_{0} \Vert _{{\Omega _0}} \le C_1 \Vert u_0 \Vert _{{\Omega _0}}\). The corresponding inequality for \(z_h\) is \(\Vert [z_h]_{N} \Vert _{{\Omega _0}} \le C_N \Vert z_{h,N}^+ \Vert _{{\Omega _0}}\), where \(C_N = C(\log (t_N/k_N) + 1)^{1/2}\) and \(C > 0\). By squaring both sides of this inequality and expanding the left-hand side we may obtain \(\Vert z_{h,N}^- \Vert _{{\Omega _0}} \le C_N \Vert z_{h,N}^+ \Vert _{{\Omega _0}}\), which we use in the corresponding stability estimate for \(z_h\):
Corollary 5.1
(A stability estimate for \(z_h\)) A corresponding stability estimate to (5.1) for the solution \(z_h\) to the discrete dual problem (4.40) is
where \(C_N = C(\log (t_N/k_N) + 1)^{1/2}\) and \(C > 0\) is a constant.
To prove Theorem 5.1, we need two other stability estimates. We start by letting \(f \equiv 0\) in (3.11). We have: Find \(u_h \in V_h\) such that
The first of the two auxiliary stability estimates is:
Lemma 5.1
(The basic stability estimate) Let \(u_h\) be the solution of (3.11) with \(f \equiv 0\) and let \(u_0\) be the initial value of the exact solution u. Then
Proof
The proof follows the same idea as in the standard case. By taking \(v = u_h \in V_h\) in (5.3), integrating the first term and combining the result with the third term, estimate (5.4) follows after using Lemma 4.1 on the second term. \(\square \)
Lemma 5.2
(The strong stability estimate) Let \(u_h\) be the solution of (3.11) with \(f \equiv 0\) and let \(u_0\) be the initial value of the exact solution u. Then
Proof
By taking \(v = -t_n\Delta _{n}u_h \in V_h\) in (5.3) and using (4.15), we may obtain
The first term on the left-hand side is done. Using Lemma 4.1, the other two terms on the left-hand side are estimated from below by 0. Using standard estimates, the first term on the right-hand side is
We move on to the last row of (5.6). We would like to use (4.15) on the first term, but due to the simple discontinuous evolution of \(\mathcal {T}_G\), \(u_{h,n}^- \notin V_{h,n+1}\). To handle this, we make use of the shift operator \(\mathscr {S}_{n+1}: V_{h, n} \rightarrow V_{h, n+1}\) defined by (4.29):
Using standard estimates, Lemma 4.4, and (3.1), the first term is
Using (4.15) on the second term in (5.8) and combining it with the other two terms in the last row of (5.6) we have
where we have first used the algebraic identity \((a - b)^2 = a^2 - 2ab + b^2\) and Lemma 4.1 to estimate the difference term from below by 0, then Lemma 4.5, (3.1), that \(t_{n+1} \lesssim t_{n}\) for \(n = 1, \ldots , N-1\), which follows from the temporal quasi-uniformity, and standard estimates. Collecting the estimates, we have
Kicking back the last term on the right-hand side, taking \(\varepsilon \) sufficiently small, and using Lemma 5.1, we may obtain
It is thus sufficient to estimate the time-derivative terms and the time jump terms on the left-hand side of (5.5) by the left-hand side of (5.12) to obtain (5.5). We proceed by taking \(v = (t - t_{n-1})\partial _tu_h\) in (5.3). The subsequent treatment is exactly the same as in the standard case, and yields
We proceed by showing an estimate for the time jump terms for \(n = 2, \ldots , N\). We would like to take \(v = [u_h]_{n-1} = u_{h, n-1}^+ - u_{h, n-1}^-\) in (5.3), but due to the simple discontinuous evolution of \(\mathcal {T}_G\), \(u_{h,n-1}^- \notin V_{h,n}\) as already pointed out, so we cannot make this choice. To handle this, we use the \(L^2({\Omega _0})\)-projection \(P_n\). By taking \(v = P_n[u_h]_{n-1}\) in (5.3) and using (4.8) and (4.15), we may obtain
We treat the terms separately, starting with the first. For \(n = 2, \ldots , N\), we use standard estimates, Lemma 4.4, and the spatiotemporal quasi-uniformity (3.1) to get
Using standard estimates, the second term in (5.14) is
Using the estimates (5.15) and (5.16) in (5.14), we may obtain, for \(n = 2, \ldots , N\), that
Finally we have all the partial results that are needed to show the desired stability estimate (5.5). Starting with the left-hand side of (5.5), first using (5.17), then applying Lemma 5.1 followed by (5.13), and finally using (5.12) concludes the proof of Lemma 5.2. \(\square \)
Theorem 5.1 may now be proven by deriving lower bounds for the left-hand sides of the auxiliary stability estimates. To do this, we use the Cauchy–Schwarz inequality to obtain
where \(\Vert w\Vert \) denotes a generic norm term. We also use that
6 Error analysis
To prove an a priori error estimate, we follow the methodology presented by Eriksson and Johnson [26, 27] and make only minor modifications to account for the CutFEM setting.
Theorem 6.1
(An optimal order a priori error estimate in \(\Vert \cdot \Vert _{{\Omega _0}}\) at the final time) Let u be the solution of (2.5) and let \(u_h\) be the finite element solution defined by (3.11). Then, for \(q = 0, 1\), we have that
where \(\Vert \cdot \Vert _{{\Omega _0}} = \Vert \cdot \Vert _{L^2({\Omega _0})}\), \(C_N = C(\log (t_N/k_N) + 1)^{1/2}\), where \(C > 0\) is a constant, \(k_n = t_n - t_{n-1}\), \(\Vert w \Vert _{{\Omega _0}, I_n} = \max _{t \in I_n} \Vert w \Vert _{{\Omega _0}}\), \(\partial _tu^{(2q+1)} = \partial ^{2q+1} u / \partial t^{2q+1}\), h is the largest diameter of a simplex in \(\mathcal {T}_0 \cup \mathcal {T}_G\), and \(D_x\) denotes the derivative with respect to space.
Proof
We use the interpolant \(\tilde{u} = \tilde{I}^n R_{n} u \in V_h\), where \(\tilde{I}^n\) is the temporal interpolation operator defined by (B.12) and \(R_n\) is the Ritz projection operator defined by (4.9), to split the error \(e = u - u_h\) into \(\rho = u - \tilde{u}\) and \(\theta = \tilde{u} - u_h\). Thus
For \(\rho \), we have from (B.12a) that for \(n = 1, \ldots , N\),
For \(\theta \), we note that since \(z_h \in V_h\), the Galerkin orthogonality (4.39) gives
Since \(\theta \in V_h\), the discrete dual problem (4.40) with \(z_{h,N}^+ = \theta _N^-\) gives
Combining (6.4) with (6.5), and using Lemma 4.6, we obtain the error representation
Treating the terms on the right-hand side just as in [26, 27], we obtain for \(q = 0\)
and for \(q=1\)
where \(F_q(u)\) is the factor with the \(\max \)-function. To obtain the last inequalities, we have used the stability estimate (5.2) with \(z_{h,N}^+ = \theta _N^-\). Thus, for \(q = 0, 1\)
We note that we may write the argument to the \(\max \)-function in \(F_q(u)\) as
We treat the terms separately, starting with the first for which we use Lemma 4.2:
The second term in (6.10) is
For the three terms in the first row of (6.12): we have used (6.11) on the first term; on the second term, we have first used the boundedness of \(\tilde{I}^n\) from Lemma B.3, and then applied (6.11); on the last term, we have used (B.13) from Lemma B.3. We move on to the third term in (6.10). Note that this term is only present for \(q = 1\). To treat it we use that: For \(\psi \in H^2({\Omega _0})\) and \(v \in V_{h, n}\), we have from (4.15), (4.9), and Corollary A.1 that
Taking \(v = -\Delta _{n}R_{n}\psi \) in (6.13) gives \(\Vert \Delta _{n}R_{n}\psi \Vert _{{\Omega _0}} \le \Vert \Delta \psi \Vert _{{\Omega _0}}\) which we use after applying Lemma B.3 to the third term in (6.10). Thus
Collecting the results, we get for \(q = 0, 1\)
We note from (6.3) that \(\Vert \rho _N^- \Vert _{{\Omega _0}} \le F_q(u)\). Combining this with (6.9) and using (6.15) concludes the proof of Theorem 6.1. \(\square \)
7 Numerical results
The implementation used to obtain the numerical results is freely available online at https://github.com/Carl-Lundholm/STCutFEMOverlapMesh.
Here we present numerical results for a problem in one spatial dimension on the unit interval with exact solution \(u(x, t) = \sin ^2(\pi x)\text {e}^{-t/2}\). We compute \(u_h\) for \(p=1\) and \(q = 0,1\). The right-hand side integrals have been approximated locally by quadrature over the space-time prisms: first quadrature in time, then quadrature in space. In space, three-point Gauss–Legendre quadrature has been used, thus resulting in a quadrature error \(= O(h^6)\). For dG(0) in time, the midpoint rule has been used, thus resulting in a quadrature error \(= O(k^2)\). For dG(1) in time, three-point Lobatto quadrature has been used, thus resulting in a quadrature error \(= O(k^4)\). The stabilization parameter \(\gamma = 10\).
For the error convergence study, both \(\mathcal {T}_0\) and \(\mathcal {T}_G\) are uniform meshes, with mesh sizes \(h_0\) and \(h_G\), respectively. The shape of \(\mathcal {T}_G\) is kept fixed to conveniently avoid introducing a change in \(h_G\). The temporal discretization is also uniform with time step k for each instance. The final time is set to \(T = 1\), the length of \(\mathcal {T}_G\) is 0.25, and the initial position of \(\mathcal {T}_G\) is the spatial interval [0.125, 0.125 + 0.25]. The error is \(\Vert e(T) \Vert _{L^2({\Omega _0})} = \Vert u(T) - u_{h, N}^-\Vert _{{\Omega _0}}\). The integral in the \(L^2\)-norm has been approximated by composite three-point Gauss–Legendre quadrature, thus resulting in a quadrature error \(= O(h^3)\). In the k-convergence study, the mesh sizes have been fixed at \(h = 1.7 \cdot 10^{-1}, 7 \cdot 10^{-2}, 10^{-3}\) for dG(0) and \(h = 1.5 \cdot 10^{-3}, 5 \cdot 10^{-4}, 5 \cdot 10^{-5}\) for dG(1). Analogously, in the h-convergence study, the time step has been fixed at \(k = 10^{-2}, 10^{-3}, 10^{-4}\) for dG(0) and \(k = 2 \cdot 10^{-1}, 8 \cdot 10^{-2}, 10^{-3}\) for dG(1). Figures 5 and 6 display error convergence plots for dG(0) and dG(1) in time with \(\mu =0.6\). The left plots show the error versus k and the right plots versus \(h = h_0 \ge h_G\). Besides the computed error for different fixed values of h or k, each plot contains a line segment that has been computed with the linear least squares method to fit the error data for the smallest fixed value of h or k. This line segment is referred to as the LLS of the error. Reference slopes are also included. In Table 1 we summarize the slope of the LLS of the error for different values of \(\mu \).
The numerical solutions presented in Fig. 7 have been computed for an equidistant space-time discretization: 22 nodes for \(\mathcal {T}_0\), 7 nodes for \(\mathcal {T}_G\) for all times, and 10 time steps on the interval (0, 3]. The length of \(\mathcal {T}_G\) has again been kept fixed at 0.25 and the velocity field \(\mu \) has for simplicity been slabwise constant at \(\mu |_{I_n} = \frac{1}{2}\sin (\frac{2 \pi t_n}{3})\).
8 Conclusions
We have presented a cut finite element method for a parabolic model problem on an overlapping mesh situation: one stationary background mesh and one discontinuously evolving, slabwise stationary overlapping mesh. We have applied the analysis framework presented in [26, 27] to the method with natural modifications to account for the CutFEM setting. The greatest difference and novelty in the presented analysis is the shift operator. The main results of the analysis are basic and strong stability estimates and an optimal order a priori error estimate. We have also presented numerical results for a parabolic problem in one spatial dimension that verify the analytic error convergence orders.
References
Nitsche, J.: Über ein Variationsprinzip zur Lösung von Dirichlet-Problemen bei Verwendung von Teilräumen, die keinen Randbedingungen unterworfen sind. In: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 36, pp. 9–15. Springer (1971)
Hansbo, A., Hansbo, P.: An unfitted finite element method, based on Nitsche’s method, for elliptic interface problems. Comput. Methods Appl. Mech. Eng. 191(47), 5537–5552 (2002)
Hansbo, A., Hansbo, P., Larson, M.G.: A finite element method on composite grids based on Nitsche’s method. ESAIM Math. Model. Numer. Anal. 37(03), 495–514 (2003)
Burman, E., Hansbo, P.: A unified stabilized method for Stokes’ and Darcy’s equations. J. Comput. Appl. Math. 198(1), 35–51 (2007)
Burman, E., Fernández, M.A.: Stabilized explicit coupling for fluid-structure interaction using Nitsche’s method. C. R. Math. Acad. Sci. Paris 345(8), 467–472 (2007)
Becker, R., Burman, E., Hansbo, P.: A Nitsche extended finite element method for incompressible elasticity with discontinuous modulus of elasticity. Comput. Methods Appl. Mech. Eng. 198(41), 3352–3360 (2009)
Massing, A., Larson, M.G., Logg, A., Rognes, M.E.: A stabilized Nitsche fictitious domain method for the Stokes problem. J. Sci. Comput. 61(3), 604–628 (2014)
Massing, A., Larson, M.G., Logg, A., Rognes, M.E.: A stabilized Nitsche overlapping mesh method for the Stokes problem. Numer. Math. 128(1), 73–101 (2014)
Johansson, A., Larson, M.G., Logg, A.: High order cut finite element methods for the Stokes problem. Adv. Model. Simul. Eng. Sci. 2(1), 1–23 (2015). https://doi.org/10.1186/s40323-015-0043-7
Dokken, J.S., Funke, S.W., Johansson, A., Schmidt, S.: Shape optimization using the finite element method on multiple meshes with Nitsche coupling. SIAM J. Sci. Comput. 41(3), A1923–A1948 (2019)
Johansson, A., Kehlet, B., Larson, M. G., Logg, A.: Multimesh finite element methods: Solving PDEs on multiple intersecting meshes. Comput. Methods Appl. Mech. Eng. (2019)
Lehrenfeld, C., Reusken, A.: Analysis of a Nitsche XFEM-DG discretization for a class of two-phase mass transport problems. SIAM J. Numer. Anal. 51(2), 958–983 (2013). https://doi.org/10.1137/120875260
Voulis, I., Reusken, A.: A time dependent Stokes interface problem: well-posedness and space–time finite element discretization. ESAIM: Math. Modell. Numer. Anal. 52(6), 2187–2213 (2018)
Lehrenfeld, C., Olshanskii, M.: An Eulerian finite element method for PDEs in time-dependent domains. ESAIM: Math. Modell. Numer. Anal. 53(2), 585–614 (2019)
Preuß, J.: Higher order unfitted isoparametric space–time FEM on moving domains. Master’s Thesis, GRO.data, University of Göttingen (2021). https://doi.org/10.25625/UACWXS
von Wahl, H., Richter, T., Lehrenfeld, C.: An unfitted Eulerian finite element method for the time-dependent Stokes problem on moving domains. IMA J. Numer. Anal. 42(3), 2505–2544 (2022)
Heimann, F., Lehrenfeld, C., Preuß, J.: Geometrically higher order unfitted space-time methods for PDEs on moving domains. SIAM J. Sci. Comput. 45(2), B139–B165 (2023). https://doi.org/10.1137/22M1476034
Badia, S., Dilip, H., Verdugo, F.: Space-time unfitted finite element methods for time-dependent problems on moving domains. Comput. Math. Appl. 135, 60–76 (2023)
Olshanskii, M.A., Reusken, A.: Trace finite element methods for PDEs on surfaces. In: Bordas, S.P.A., Burman, E., Larson, M.G., Olshanskii, M.A. (eds.) Geometrically Unfitted Finite Element Methods and Applications, vol. 121, pp. 211–258. Springer International Publishing, Cham (2017). https://doi.org/10.1007/978-3-319-71431-8_7
Sass, H.: Space–time trace finite element methods for partial differential equations on evolving surfaces. Ph.D. Dissertation, RWTH Aachen University, 2022, number: RWTH-2022-09895. https://publications.rwth-aachen.de/record/854968
Olshanskii, M.A., Reusken, A., Zhiliakov, A.: Tangential Navier–Stokes equations on evolving surfaces: analysis and simulations. Math. Models Methods Appl. Sci. 32(14), 2817–2852 (2022). https://doi.org/10.1142/S0218202522500658
Olshanskii, M., Reusken, A., Schwering, P.: An Eulerian finite element method for tangential Navier–Stokes equations on evolving surfaces. Math. Comput. (2023)
Larson, M. G., Logg, A., Lundholm, C.: Space–time CutFEM on overlapping meshes I: simple continuous mesh motion. Numerische Mathematik (2024)
Lundholm, C.: A space–time cut finite element method for a time-dependent parabolic model problem. Master’s Thesis, Chalmers University of Technology and University of Gothenburg (2015). https://odr.chalmers.se/items/c8f07fea-5b84-44c3-8409-d1bd69845b97
Lundholm, C.: Cut finite element methods on overlapping meshes: analysis and applications. Ph.D. Dissertation, Chalmers University of Technology and University of Gothenburg (2021). https://research.chalmers.se/en/publication/524200
Eriksson, K., Johnson, C.: Adaptive finite element methods for parabolic problems I: a linear model problem. SIAM J. Numer. Anal. 28(1), 43–77 (1991)
Eriksson, K., Johnson, C.: Adaptive finite element methods for parabolic problems II: optimal error estimates in \(L_\infty L_2 \) and \(L_\infty L_\infty \). SIAM J. Numer. Anal. 32(3), 706–740 (1995)
Ma, C., Zhang, Q., Zheng, W.: A fourth-order unfitted characteristic finite element method for solving the advection–diffusion equation on time-varying domains. SIAM J. Numer. Anal. 60(4), 2203–2224 (2022). https://doi.org/10.1137/22M1483475
Funding
Open access funding provided by Umea University.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: Analytic tools
Lemma A.1
(A jump identity) Let \(\omega _+, \omega _- \in \mathbb {R}\) and \(\omega _+ + \omega _- = 1\), let \([A]:= A_+ - A_-\), and \(\langle A \rangle := \omega _+A_+ + \omega _-A_-\). We then have
Proof
Using the definitions and evaluating both sides shows the identity. \(\square \)
Lemma A.2
(Partial integration in broken Sobolev spaces) For \(d = 1, 2\), or 3, let \(\Omega \subset \mathbb {R}^d\) be a bounded domain and let \(\Gamma \subset \Omega \) be a continuous manifold of codimension 1 that partitions \(\Omega \) into the subdomains \({\Omega _1}, \ldots , {\Omega _N}\). For \(\psi \in H^2(\Omega )\) and \(v \in H^1_0({\Omega _1}, \ldots , {\Omega _N})\), we have that
Proof
Using the partition of \(\Omega \) and Green’s first identity on the left-hand side gives interior terms and boundary terms. The interior terms are as we want them. For the boundary terms, only the \(\Gamma \)-terms remain since \(v|_{\partial \Omega } = 0\). Combining terms with common boundary, using Lemma A.1 and the regularity of \(\psi \) shows (A.2). \(\square \)
Consider the domain partition and its corresponding broken Sobolev space presented in the premise of Lemma A.2. We define the symmetric bilinear form \(\mathcal {A}\) that generalizes the appearence of \(A_{h, t}\) defined by (3.13) to this setting by
where we just let \(h_K^{-1}\) be some spatially dependent function of sufficient regularity and \({\Omega _O}\) be some union of subsets of subdomains. The specifics of \(h_K^{-1}\) and \({\Omega _O}\) are of course taken to be the natural ones when restricting \(\mathcal {A}\) to \(A_{h, t}\). For \(\psi \in H^2(\Omega )\), we have from regularity that \([\psi ]|_\Gamma = 0\) in \(L^2(\Gamma )\) and that \([\nabla \psi ]|_{{\Omega _O}} = 0\) since \((\nabla \psi )_+ = (\nabla \psi )_-\) on \({\Omega _O}\) for a non-discrete function such as \(\psi \). Using this, we combine \(\mathcal {A}\) with Lemma A.2 to get the following corollary:
Corollary A.1
(Partial integration in broken Sobolev spaces with bilinear forms \(\mathcal {A}\)) For \(d = 1, 2\), or 3, let \(\Omega \subset \mathbb {R}^d\) be a bounded domain and let \(\Gamma \subset \Omega \) be a continuous manifold of codimension 1 that partitions \(\Omega \) into the subdomains \({\Omega _1}, \ldots , {\Omega _N}\). For this setting, let the symmetric bilinear form \(\mathcal {A}\) be defined by (A.3). For \(\psi \in H^2(\Omega )\) and \(v \in H^1_0({\Omega _1}, \ldots , {\Omega _N})\), we have that
Lemma A.3
(A scaled trace inequality for domain-partitioning manifolds of codimension 1) For \(d = 1, 2\), or 3, let \(\Omega \subset \mathbb {R}^d\) be a bounded domain with diameter L, i.e., \(L = \text {diam}(\Omega ) = \sup _{x, y \in \Omega } |x - y|\). Let \(\Gamma \subset \Omega \) be a continuous manifold of codimension 1 that partitions \(\Omega \) into N subdomains. Then
Proof
If (A.5) holds for the case \(N = 2\), then that result may be applied repeatedly to show (A.5) for \(N > 2\). We thus assume that \(\Gamma \) partitions \(\Omega \) into two subdomains denoted \({\Omega _1}\) and \({\Omega _2}\) with diameters \(L_1\) and \(L_2\), respectively. From the regularity assumptions on v, we have for \(i = 1, 2\), that \(v \in H^1({\Omega _i})\) and thus
where we have used a standard scaled trace inequality. Using the triangle type inequality \(L \le L_1 + L_2\) and (A.6), the left-hand side of (A.5) is
which shows (A.5). \(\square \)
Let \(\Gamma _K = \Gamma _K(t) = K \cap \Gamma (t)\). For \(t \in [0, T]\), \(j \in \{0, G\}\), a simplex \(K \in \mathcal {T}_{j,\Gamma (t)} = \{K \in \mathcal {T}_j: K \cap \Gamma (t) \ne \emptyset \}\), and \(v \in H^1(K)\), we have from Lemma A.3 that
where \(h_K\) is the diameter of K. For \(v \in \mathcal {P}(K)\), we have the standard inverse estimate
Using (A.9) in (A.8), we get the following corollary:
Corollary A.2
(A discrete spatial local inverse inequality for \(\Gamma _K(t)\)) For \(t \in [0, T]\), \(j \in \{0, G\}\), \(K \in \mathcal {T}_{j,\Gamma (t)}\) with diameter \(h_K\), let \(\Gamma _K(t) = K \cap \Gamma (t)\). Then, for \(k \ge 0\), we have that
Lemma A.4
(A discrete spatial inverse inequality for \(\Gamma (t)\)) Let the mesh-dependent norm \(\Vert \cdot \Vert _{-1/2,h,\Gamma (t)}\) be defined by (4.2). Then, for \(t \in [0, T]\), we have that
Proof
To lighten the notation we omit the time dependence, which has no importance here anyways. We follow the proof of the corresponding inequality in [2] with some modifications. We use index \(j \in \{0, G \}\), such that, if \(j = 0\), then \(i = 1\) and if \(j = G\), then \(i = 2\), and let \(\Gamma _{K_j} = K_j \cap \Gamma \) and \(\mathcal {T}_{j,\Gamma } = \{K_j \in \mathcal {T}_j: K_j \cap \Gamma \ne \emptyset \}\). Note that for \(i=1, 2\),
which follows from \(\cup _{K_0 \in \mathcal {T}_{0,\Gamma }} \Gamma _{K_0} = \Gamma = \cup _{K_G \in \mathcal {T}_{G,\Gamma }} \Gamma _{K_G}\) and the inter-quasi-uniformity of the meshes. Since \(\partial _{n} v = n \cdot \nabla v\) and \(|\omega _i| |n| \le 1\), we have \(\Vert \omega _i (\partial _{n} v)_i \Vert _{\Gamma _{K_j}}^2 \le \Vert (\nabla v)_i \Vert _{\Gamma _{K_j}}^2\). Using this after (A.12), and followed by Corollary A.2, the left-hand side of (A.11) is
The resulting terms may be estimated by the right-hand side of (A.11). \(\square \)
Appendix B: Interpolation
For the definition of the spatial interpolation operator, we recall the discrete spaces \(V_{h,0}\) and \(V_{h,G}\). We define the spatial interpolation operators \(\pi _{h,0}: L^1({\Omega _0}) \rightarrow V_{h,0}\) and \(\pi _{h,G}: L^1(G) \rightarrow V_{h,G}\) to be the Scott–Zhang interpolation operators for the spaces \(V_{h,0}\) and \(V_{h,G}\), respectively, where the defining integrals are taken over entire simplices. We point out that the evolution of G makes \(\pi _{h,G}\) time-dependent, but since that does not matter here we omit it to lighten the notation. For \(t \in [0, T]\), we define the spatial interpolation operator \(I_{h,t}: L^1({\Omega _0}) \rightarrow V_h(t)\) by
The operator \(I_{h,t}\) is used in the proofs of Lemmas 4.2 and 4.4, where energy estimates of its interpolation error are used. We present these estimates in the following two lemmas:
Lemma B.1
(An interpolation error estimate in \(\left| \left| \left| \cdot \right| \right| \right| _{A_{h,t}}\)) Let \(\left| \left| \left| \cdot \right| \right| \right| _{A_{h,t}}\) and \(I_{h,t}\) be defined by (4.4) and (B.1), respectively. Then
Proof
To lighten the notation we omit the time dependence, which has no importance here anyways. Letting \(w = v - I_{h,t} v\), and using the definition of \(\left| \left| \left| \cdot \right| \right| \right| _{A_{h,t}}\), the square of the left-hand side of (B.2) is
Letting \(w_j = v - \pi _{h, j}v\), we treat each term in (B.3) separately, starting with the first:
Following the proof of Lemma A.4 and using (A.8), the second term is
The third term in (B.3) receives the same treatment, thus
The fourth term in (B.3) is
Summing up what we have, i.e., using (B.4)–(B.7) in (B.3), we get
where we have used standard local interpolation error estimates for Scott–Zhang interpolation operators. Taking the square root of both sides gives (B.2). \(\square \)
Lemma B.2
(An interpolation error estimate in \(\left| \left| \left| \cdot \right| \right| \right| _{\mathscr {A}_{n,m}}\)) For \(n = 1, \ldots , N\), let \(\left| \left| \left| \cdot \right| \right| \right| _{\mathscr {A}_{n,m}}\) and \(I_{h, n} = I_{h,t_n}\) be defined by (4.21) and (B.1), respectively. Then
Proof
Letting \(w = v - I_{h,n} v\), and plugging w into \(\left| \left| \left| \cdot \right| \right| \right| _{\mathscr {A}_{n,m}}^2\), we have
The second term is treated by following the proof of Lemma A.4. We partition \(\Gamma _{m} {\setminus } \Gamma _{n}\) into \(\grave{\Gamma }_{i}:= (\Gamma _{m} {\setminus } \Gamma _{n}) \cap {\Omega _{i,n}}\), use the interdependent indices i and j, and write \(\grave{\Gamma }_{i {K_j}} = K_j \cap \grave{\Gamma }_i\). Letting \(w_j = v - \pi _{h, j}v\), we have
where we have used (A.8) and standard local interpolation error estimates for Scott–Zhang interpolation operators. Using Lemma B.1 and (B.11) in (B.10) shows (B.9). \(\square \)
For \(q \in \mathbb {N}\) and \(n = 1, \ldots , N\), we define the temporal interpolation operator \(\tilde{I}^n: C(I_n) \rightarrow \mathcal {P}^{q}(I_n)\) by
and with the additional condition for \(q \ge 1\),
The operator \(\tilde{I}^n\) is used in the proof of Theorem 6.1 where an estimate of its interpolation error is used. We present this estimate in the following lemma:
Lemma B.3
(An interpolation error estimate in \(\Vert \cdot \Vert _{{\Omega _0}, I_n}\)) Let \(\tilde{I}^n\) be defined by (B.12). Then, for \(q = 0, 1\), for any function \(v: {\Omega _0} \times I_n \rightarrow \mathbb {R}\) with sufficient spatial and temporal regularity we have that \(\tilde{I}^n\) is bounded and that
where \(\Vert v \Vert _{{\Omega _0}, I_n} = \max _{t \in I_n} \Vert v \Vert _{{\Omega _0}}\), \(k_n = t_n - t_{n-1}\), and \(\partial _tv^{(q+1)} = \partial ^{q+1}v/\partial t^{q+1}\).
Proof
The proof is exactly as in [27] which we refer to for details. \(\square \)
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Larson, M.G., Lundholm, C. Space-time CutFEM on overlapping meshes II: simple discontinuous mesh evolution. Numer. Math. 156, 1055–1083 (2024). https://doi.org/10.1007/s00211-024-01413-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00211-024-01413-y