A new framework of high-order unfitted finite element methods using ALE maps for moving-domain problems
Abstract
As a sequel to our previous work [C. Ma, Q. Zhang and W. Zheng, SIAM J. Numer. Anal., 60 (2022)], [C. Ma and W. Zheng, J. Comput. Phys. 469 (2022)], this paper presents a generic framework of arbitrary Lagrangian-Eulerian unfitted finite element (ALE-UFE) methods for partial differential equations (PDEs) on time-varying domains. The ALE-UFE method has a great potential in developing high-order unfitted finite element methods. The usefulness of the method is demonstrated by a variety of moving-domain problems, including a linear problem with explicit velocity of the boundary (or interface), a PDE-domain coupled problem, and a problem whose domain has a topological change. Numerical experiments show that optimal convergence is achieved by both third- and fourth-order methods on domains with smooth boundaries, but is deteriorated to the second order when the domain has topological changes.
keywords:
Arbitrary Lagrangian-Eulerian unfitted finite element (ALE-UFE) method, moving domain problems, high-order schemes. MSC: 65M60,76R99,76T991 Introduction
Multiphase flows with time-varying domains or free-surface fluids have an extremely wide range of applications in science and engineering. Transient deformations of material regions pose a great challenge to the design of high-order numerical methods for solving such problems. In terms of the relative position of a moving domain to its partition mesh, current numerical methods can be roughly classified into two regimes. In body-fitted methods, the mesh is arranged to follow the moving phase, and the implementation of boundary conditions becomes easy. In the popular arbitrary Lagrangian-Eulerian (ALE) approach [13, 5, 7, 6, 9, 14], the mesh velocity can be chosen independent of local fluid velocity. One needs to transform the problem from a moving domain to a fixed reference domain through an arbitrary mapping and further mesh the reference domain. The method can also be used in combination with space-time Galerkin formulations[23, 25]. However, these conveniences incur the cost of mesh regeneration and data migration across the entire computational domain at each time step. Another major concern of body-fitted methods is how to maintain high accuracy in the presence of abrupt motions or large deformations of the phase [24].
In the other regime of unfitted methods, the mesh for the bulk phase is fixed while the moving interface is allowed to cross the fixed mesh, resulting in cut cells near the interface where the degrees of freedom are doubled with additional penalty terms or basis functions are modified to enforce the interface conditions weakly. Unfitted methods may encounter significant challenges for dynamic interface problems. Since the computational domain is time-varying, traditional methods for time integration may not be applicable [8, 29]. To overcome this difficulty, the space-time method in [16] combines a discontinuous Galerkin technique in time with an extended finite element method. The immersed finite element method exploits the invariant degrees of freedom and uses backward Euler for the time discretization [10, 1]. Methods in [15, 19, 27, 4] extend the discrete solution at each time-step by using a ghost penalty, which enables the use of a backward differentiation formula. Most recently, von Wahl and Richter developed an error estimate for this Eulerian time-stepping scheme for a PDE on a moving domain, where the domain motion is driven by an ordinary differential equation (ODE) coupled to the PDE [26]. In addition, the characteristic approach is applied in [21, 20, 22] to develop high-order unfitted finite element methods and in [12] for convection-diffusion problems on time-dependent surfaces.
This paper is inspired by the ALE method, where the mesh velocity is typically derived from boundary motion, which allows the fluid to move with respect to the mesh. We exploit the ALE map to construct a backward flow map and then approximate the time derivative, which makes it easier to obtain high-order convergence rates even for large deformations. The basic idea behind is to replace the partial time derivative with a material derivative,
where is an arbitrary mapping that maps to , for any , and is the velocity of the moving domain. The arbitrary feature of the algorithm arises from the fact that this application dose not follow trajectories of bulk fluid particles, but only of boundary fluid particles. In particular, if coincides with the fluid velocity, the method turns out to be the unfitted characteristic finite element (UCFE) method proposed in [21, 22, 20]. Compared with the UCFE method, the proposed method – ALE-UFE has two advantages:
-
(i)
In the framework of unfitted finite element method, it is difficult to calculate the integration of the numerical solutions from early time steps at the present time step, since they do not belong to the present finite element space, especially in nonlinear problems where the moving interface depends on the solution of the equation. The ALE-UFE method overcomes this difficulty by choosing a simple ALE mapping to construct a backward flow map (see section 4.3).
-
(ii)
Since the construction of the ALE map requires only the position of the moving interface and not the internal variation of the region as in the UCFE approach, the ALE-UFE method can be applied to more models, including those where the moving region does not maintain the same volume (see section 6.1) and the topology changes (see section 6.4).
The main contributions of this work are summarized as follows.
-
(a)
Based on the heat equation in a time-evolving domain, we propose a new framework of designing high-order unfitted finite element methods with ALE maps. We prove the stability of the numerical solution in the energy norm and establish optimal error estimates, arising from both interface-tracking algorithms and spatial-temporal discretization of the equations.
-
(b)
The competitive performance of the ALE-UFE method is demonstrated by numerical experiments on largely deforming domains, including a PDE-domain coupled model, a two-fluid model with moving interface, and a problem with topologically changing domain. Optimal convergence of the method is obtained for domains with smooth boundaries or interface, but is deteriorated for domains with topological changes.
The rest of the paper is organized as follows. In section 2, we introduce the forward and backward flow maps. In section 3, we propose the ALE-UFE method for the heat equation on a moving domain, and establish the stability and error estimates of the numerical solution. A general framework of the ALE-UFE method is presented. In section 4, we apply the ALE-UFE method to a PDE-domain coupled problem. In section 5, the ALE-UFE method is applied to a two-phase flow problem. In section 6, we present numerical results to demonstrate optimal convergence of both the third- and fourth-order methods, and apply the method to more challenging problems.
Throughout this paper, vector-valued quantities and matrix-valued quantities are denoted by boldface symbols and blackboard bold symbols, respectively, such as and . The notation means that holds with a constant independent of sensitive quantities, such as the segment size for interface-tracking, the spatial mesh size , the time-step size , and the number of time steps . Moreover, we use the notations and to denote the inner product on and , respectively.
2 Flow maps
In this section, we introduce the forward boundary map for interface tracking and the backward flow map for time integration based on a given velocity field which has compact support in space. Throughout the theoretical analysis, we assume the velocity is smooth such that , with being the order of time integration.
2.1 Forward boundary map
Suppose the initial domain is bounded and has a -smooth boundary . The variation of the domain boundary has the form
(1) |
where is a forward boundary map, defined by
(2) |
The moving domain is surrounded by the boundary , i.e., . For theoretical analysis, we assume that is -smooth, thus is a diffeomorphism and has same topological properties as . Meanwhile, we also assume that is smooth for all .
Consider a uniform partition of the interval , given by , , where . Denote the forward boundary maps, the transient boundaries, and the transient domains at time , respectively, by
The well-posedness of (2) implies that : is one-to-one.
2.2 Backward flow map based on the ALE map
For fixed , we choose as a reference domain and are going to define a backward flow map and the corresponding fluid velocity by means of ALE map: for ,
(3) |
In practice, we only need the ALE map at discrete time steps. First we construct a discrete boundary map either by or by the closet point mapping (see [12]), for all . The backward flow map is defined by the solution to the harmonic equation
(4) |
The maximum principle implies that maps to . We then define a multi-step map from to , , by
(5) |
Let be the basis functions of Lagrange interpolation satisfying , with the Kronecker delta. Define the semi-discrete ALE map by
(6) |
Clearly . The artificial fluid velocity is defined by
(7) |
Remark 2.3.
The construction of the ALE map is not unique. For example, one can represent the motion of a domain by considering the domain as elastic or viscoelastic solid, and solve the problem by resorting to the equations of elastic dynamics.
3 The ALE-UFE method
The purpose of this section is to propose a high-order finite element method for solving PDEs on time-moving domains based on ALE map. For clearness, we first focus on the heat equation and will extend the result to more complex problems in sections 4–6.
3.1 The heat equation on a moving domain
Based on the forward boundary map and backward flow map presented in the previous section, we now design the numerical scheme for solving the heat equation on a time-evolving domain
(8) |
where is the time-varying domain, the moving boundary defined in (1), the tracer transported by the fluid, the initial value, and the source term distributed in and having a compact support.
By the chain rule and (3), the first equation of (8) can be written as
(9) |
From (9), is not necessarily differentiable in . This inspires us to construct a discrete ALE map in practice. The semi-discrete scheme is given by
(10) |
where , denote and , respectively, and stands for the -order time finite difference operator, given by
(11) |
Here denotes the BDF- finite difference operator defined by (cf. [18]) and
The coefficients for are listed in Table 1.
3.2 Interface-tracking approximation
Even the velocity of is known explicitly, we still need to approximate it with an approximate boundary due to computational complexity in practice. The approximate boundary can be constructed by either explicit algorithms such as front-tracking methods [17] and cubic MARS (Mapping and Adjusting Regular Semi-analytic sets) methods [28], or implicit algorithms such as level set methods [2]. The domain enclosed by is denoted by with being the parameter of approximation.
Let and , , denote the parametric representations of and , respectively. In order to get optimal error estimates, we make an assumption that the approximation of the boundary is of high order in the sense that
(12) |
For a rigorous proof of the error estimate, we refer to [21, section 3.2] where the cubic MARS method is used for interface tracking [28]. Using (12), we have the error estimate between the exact domain and the approximate domain
Remark 3.3.
Assumption (12) is used only for analysis. In practice, we require the Hausdorff distance between and to be small, i.e., .
3.4 Finite element spaces
First we define a -neighborhood of by
(13) |
It is easy to see (see Fig. 1). Let be an open square satisfying for all and . Let be the uniform partition of into closed squares of side-length . It generates two covers of and , respectively,
(14) | ||||
(15) |
The cover generates a fictitious domain . Let be the set of all edges in . The set of interior edges of boundary elements are denoted by
(16) |
Next we define the finite element spaces on and , respectively, as follows
where is the space of polynomials whose degrees are no more than for each variable. The space of piecewise regular functions over is defined by
(17) |
3.5 Construction of an approximate ALE map
Let denote the approximation of the inverse of . This is computed by solving (2) with the RK- scheme (the -order Runge-Kutta scheme) from to . For any , the point is calculated as follows:
(18) |
Here are the coefficients of the RK-() scheme, satisfying if , and is the number of stages. Recall from section 2.2 that maps to . We define its approximation by .
A discrete approximation of is defined by solving the discrete problem: find such that
(19) |
where and the bilinear forms are defined by
(20) | ||||
(21) | ||||
(22) | ||||
(23) |
In (22), denotes the normal derivative of on . In (23), is used to impose the Dirichlet boundary condition weakly with , denotes the -th order normal derivative of , and denotes the jump of across edge where are the two elements sharing .
Similar to (6), we define the fully discrete ALE map and artificial velocity by
(24) |
where and the multi-step backward flow map is defined by
(25) |
The recursive definition only needs to compute the one-step map at each .
3.6 The fully discrete scheme
Given the finite element function , we define the -order time finite difference operator as
(26) |
where and . Note that . The discrete approximation to problem (8) is to seek such that
(27) |
In view of (27), the stiffness matrix corresponding to has already been obtained when computing the discrete ALE map in (19). The -neighborhood is chosen to ensure that is well-defined for .
3.7 Well-posedness and error estimates
In this section, we show the well-posedness, stability, and error estimates of the discrete problems in the appendix. Firstly, we define the mesh-dependent norms
Clearly is a norm on . From [11], we have the following norm inequalities: for any ,
(28) |
Suppose is large enough. It is standard to prove the coercivity and continuity of the bilinear form (see [21]): for any and ,
By Corollary B.2, the artificial velocity is bounded. This gives the theorem.
Theorem 3.8.
There is a positive constant small enough such that the problem (27) has a unique solution for any .
Theorem 3.9.
For , one has for and . Suppose . The exact solution satisfies
(29) |
where . Assume is smooth in time such that
(30) |
where is the order of the BDF scheme and is independent of , , and . Since is the -order Lagrange interpolation of in , we have
(31) |
Theorem 3.10.
Suppose the assumptions in Theorem 3.9 hold and the initial solutions satisfy for . Then
(32) |
3.11 The ALE-UFE framework
Now we conclude the ALE-UFE framework for solving PDEs on varying domains. It consists of four steps.
1. Track the varying interface by the forward boundary map (2). 2. Construct a one-step backward flow map with (19), a discrete ALE map and an artificial velocity with (24), and a multi-step map with (25). 3. Define the finite difference operator in (26) by combining the BDF- scheme and the backward flow map. 4. Construct the fully discrete scheme as in (27).
The framework can be conveniently applied to various moving-domain problems. The operations in each step are adapted to a specific problem.
4 A domain-PDE-coupled problem
In this section we apply the ALE-UFE framework to a nonlinear problem where the moving domain depends on the solution. Unless otherwise specified, the finite element spaces and bilinear forms are defined in the same way as in the previous section. We consider the following model:
(35) |
where is the domain surrounded by a varying boundary , i.e. . The Neumann boundary condition can be viewed as an applied force on , such as a surface tension of fluids [20]. For simplicity, we treat it as a given function.
4.1 Flow maps
The variation of has the form of (1), namely , and the forward boundary map is defined by
(36) |
Note that is the solution of the problem. Based on an ALE map , , the equation in (35) can be written as follows
(37) |
where . Here, the unknown variables are the flow velocity and the moving boundary . Equation (36) governs the evolution of the boundary through the forward boundary map and Equation (37) governs the dynamics of the fluid through an ALE map. They form a nonlinear system. We adopt semi-implicit BDF schemes for solving them: is computed explicitly at each time step, while the update of is done implicitly. The semi-discrete scheme reads as follows,
(38) | |||
(39) |
where the coefficients , are listed in Table 2 (cf. [3]), , and . Here is the inverse of . From (38), an explicit forward map on the boundary is defined by
4.2 Surface tracking algorithm via forward boundary map
In practice, we construct a discrete approximation to for surface tracking. Suppose that the approximate boundary , the discrete solutions , and the approximate backward boundary maps have been obtained for . We use the information to construct the forward boundary map , explicitly, as follows
(40) |
Let be the set of control points on the initial boundary . Suppose that the arc length of between and equals to for , where and is the arc length of . For all , suppose we are given with the set of control points and the parametric representation of , which satisfies
The set are obtained by (40) and satisfy . We adopt the surface-tracking method in [22, Algorithm 3.1 ] to construct a smooth boundary with cubic spline interpolation.
4.3 Construction of an approximate ALE map
Since ALE maps depend on boundary motions, the first task is to construct an approximation of the inverse map , denoted by without causing confusions. The backward flow map in (40) will also be used to construct at the next time step. The construction of consists of two steps.
Step 1. Construct an approximation of . Let and let be the number of control points in the interior of , which divide the curve into segments, namely,
(41) |
For each , we take nodal points quasi-uniformly on with (see Fig. 2(a)). Let be the reference interval. The two isoparametric transforms are defined as
(42) |
where satisfies and . They define a homeomorphism from to :
(43) |
Define , and . We obtain a homeomorphism : which is defined piecewisely as follows (see Fig. 2(b))
(44) |
Step 2. Construct the backward flow map . It is easy to see that is the -order Lagrange interpolation of . It is natural to use the inverse of to approximate . Finally, we define the backward flow map by , where is the projection defined by for any .
4.4 The discrete scheme
5 A two-phase problem
In this section, we focus on a two-phase model with a time-varying interface. Let be an open square with boundary . For any , let and be two time-varying sub-domains of occupied by two immiscible fluids, respectively. We assume and . Consider the linear interface problem:
(45) |
where denotes the jump of across , the viscosities are positive constants, and is the unit normal on pointing to . The interface is driven by and has the same form as (1). We treat the model as two free-boundary problems which are coupled with the interface conditions.
5.1 Finite element spaces
Suppose we have obtained the approximate interface by using some interface-tracking algorithm mentioned previously. Let be an approximate domain of such that . Define . Similar to the single phase case, we define
(46) |
Let be the uniform partition of into closed squares of side-length . It generates the covers of , and the cover of
We define . Clearly . Define
The mesh is shown in Fig. 3. We define the finite element spaces
5.2 Discrete ALE map and fully discrete scheme
The ALE-UFE framework is used to each phase of the interface problem, and leads to the fully discrete scheme by coupling the discrete formulations of both phases with interface conditions.
First we construct ALE maps piecewise. The discrete ALE map , are exactly the same as and defined in section 3.5. To construct , we let be the solution satisfying and
(47) |
where and is defined in section 3.5. Then we define and .
Next we use the backward flow maps to discretize the time derivatives
The discrete scheme is to find such that
for all with , where
Moreover, and are bilinear forms which combine the two phases
where is a positive penalty coefficient and is the unit outward normal to from to . Here we have used the average operator
6 Numerical experiments
In this section, we demonstrate the ALE-UFE method with all the models in the previous sections. Throughout the section, we choose . To simplify computations, we set the pre-calculated initial values by the exact solution, namely, , for .
6.1 One-phase linear problem
In this section, we consider a one-phase problem where the velocity of the moving boundary is given by an analytic function. The exact solution is set by . The right-hand side and the boundary values in (8) are set by . The mesh of the evolution domain is shown in Fig. 4. The boundary is varying according to
The initial boundary is a circle centered at with radius . The numerical error is measured by

Numerical results for are shown in Tables 3. Optimal convergence rates are obtained for both the third- and fourth-order methods. Although the location of the boundary is given explicitly, the UCFE method in [21] is not applicable in this case due to the lack of flow velocity inside the domain and the absence of moving domains that maintain the same volume. Therefore, the ALE-UFE method has a wider range of applications than the UCFE mehtod.
rate | rate | |||
---|---|---|---|---|
1/16 | 6.16e-03 | - | 1.91e-3 | - |
1/32 | 7.94e-04 | 2.95 | 1.25e-4 | 3.93 |
1/64 | 1.00e-04 | 2.98 | 9.97e-6 | 3.97 |
1/128 | 1.25e-05 | 2.99 | 5.01e-7 | 3.98 |
6.2 Nonlinear problem
Now we demonstrate the ALE-UFE method with a nonlinear problem where the boundary motion is specified by the solution. We require to check the accuracy of interface-tracking. The exact solution is set by
The initial domain is a disk with radius and centered at . The domain is stretched into an inverted U shape at and returns to its initial shape at (see Fig. 5).

The source term and the Neumann condition of (35) are given by
Define the boundary-tracking errors
Here is the reference domain computed with the finest grid and the smallest time step. Approximation errors are computed on the numerically tracked domain
Tables 4 and 5 show that optimal convergence rates are obtained for the numerical solutions and the boundary-tracking algorithm as (or ) approaches .
rate | rate | rate | rate | |||||
---|---|---|---|---|---|---|---|---|
1/32 | 1.11e-04 | - | 4.06e-04 | - | 1.21e-03 | - | 1.40e-03 | - |
1/64 | 1.20e-05 | 3.21 | 4.42e-05 | 3.19 | 1.65e-04 | 2.88 | 1.71e-04 | 3.03 |
1/128 | 1.41e-06 | 3.08 | 5.50e-06 | 3.00 | 2.13e-05 | 2.95 | 2.11e-05 | 3.01 |
1/256 | 1.72e-07 | 3.03 | 6.88e-07 | 3.00 | 2.67e-06 | 2.99 | 2.63e-06 | 3.00 |
rate | rate | rate | rate | |||||
---|---|---|---|---|---|---|---|---|
1/32 | 4.72e-05 | - | 2.34e-04 | - | 4.05e-04 | - | 4.48e-04 | - |
1/64 | 4.14e-06 | 3.51 | 1.47e-05 | 3.99 | 3.93e-05 | 3.36 | 3.84e-05 | 3.54 |
1/128 | 2.82e-07 | 3.87 | 4.39e-07 | 5.06 | 2.73e-06 | 3.85 | 2.78e-06 | 3.78 |
1/256 | 1.80e-08 | 3.96 | 2.76e-08 | 3.99 | 1.75e-07 | 3.96 | 1.86e-07 | 3.90 |
6.3 Two-phase flow

We use the cubic MARS algorithm in [28] to track the interface and construct and . The initial domain is a disk of radius at . The flow velocity is set by
The domain is stretched into a snake-like region at (see Fig. 6). The viscosities are set by and . The exact solution is set by
The numerical error is measured by , where
Convergence orders for and are shown in Table 6. For such a large deformation of the domain, the method still yields optimal convergence rates.
rate | rate | |||
---|---|---|---|---|
1/16 | 6.05e-03 | - | 7.87e-3 | - |
1/32 | 8.78e-04 | 2.78 | 5.17e-5 | 3.92 |
1/64 | 1.15e-04 | 2.92 | 3.27e-6 | 3.97 |
1/128 | 1.47e-05 | 2.97 | 2.07e-7 | 3.97 |
6.4 Domain with topological change
Finally we consider the domain having a topological change. Its boundary is given by the level set of the function
where and are the centers of the two circles. The finial time is set by which satisfies . The evolution of the domain is shown in Fig. 7.

rate | rate | |||
---|---|---|---|---|
1/16 | 4.95e-05 | - | 6.37e-4 | - |
1/32 | 1.21e-05 | 2.03 | 1.52e-4 | 2.02 |
1/64 | 3.06e-06 | 1.98 | 4.36e-5 | 1.85 |
1/128 | 7.80e-07 | 1.98 | 1.09e-5 | 2.00 |
The exact solution is . In the implementation of the ALE map, we choose by the closet point mapping. Again we compute the - and -errors of the solution on the approximate domain . Since the evolution of the domain is discontinuous, the assumption in (30) does not hold anymore. Table 7 shows that the convergence rate deteriorates into second order.
7 Conclusions
An arbitrary Lagrangian-Eulerian unfitted finite element (ALE-UFE) method has been presented for solving PDEs on time-varying domains. High-order convergence is obtained by adopting BDF schemes and ALE maps for time integration and unfitted finite element method for spatial discretization. The method is applied to various models, including a varying interface problem, a PDE-domain coupled problem, and a problem with topologically changing domain. The ALE-UFE method has the potential for solving a variety of moving-domain problems, such as fluid dynamics and FSI problems. These will be our future work.
Appendix A Useful estimates of the ALE mapping
Lemma A.1.
Suppose and is given by (2). The Jacobi matrices , , of ALE maps admit
Proof.
Since the computations and numerical analysis are performed on the approximate domain , which is different from the exact one in general, we have to extend from to the fictitious domain .
Lemma A.2.
There exits an extension of , denoted by , such that
(50) |
Moreover, the Jacobi matrix satisfies
Appendix B Useful estimates of the discrete ALE map
Lemma B.1.
Let be the Jacobi matrix of . Upon hidden constants independent of , and , there hold
(54) |
Proof.
Since , multiplying both sides of (4) by and using , we have
(55) |
For convenience, let be the Lagrange interpolation operator and define
It is easy to see that . Subtracting (55) from (19), one has
(56) |
For any , Poincar inequality and (28) show
(57) |
Since , by [21, Lemma A4] and (57), we have
(58) |
Since the approximate boundary satisfies , and is the -order approximation to , there holds
(59) |
From the trace inequality, inverse estimate, and (59), we have
(60) |
Insert (58) and (60) into (56). By Lemma 3.8 and interpolation error estimates, we obtain
(61) |
Thus together with (28) and (61), one has
(62) |
These yield . Since , inverse estimates imply
(63) |
Let . From (63) and (53), we have
Corollary B.2.
Let be defined in (24) and write and for . Then and
(65) | |||
(66) |
Proof.
Lemma B.3.
Assuming satisfies (54) and , there exits a constant independent of such that, for any , and ,
(68) | ||||
(69) | ||||
(70) |
Appendix C The stability of numerical solutions
Since the computational domain is time-varying, we have to deal with the issue that for when proving the stability and convergence of the discrete solution. To overcome this difficulty, we introduce a modified Ritz projection operator proposed in [21] which satisfies
(71) |
where . It satisfies
(72) |
C.1 Proof of Theorem 3.9
Proof.
We only prove the theorem for . The proofs for other cases are similar. The rest of the proof is parallel to the proof of [21, Theorem 5.2], we just sketch the proof and omit details.
Step1: Selection of a particular test function. Write . Since , we choose as a test function, the discrete problem for has the form
(73) |
where , we have used [18, Section 2 and Appendix A], and
The trace inequality and inverse estimates show . For any , by the definitions of and the Cauchy-Schwarz inequality, one has
(74) |
Since is bounded with and , we infer from (72) and the Cauchy-Schwarz inequality that
Step2: Estimate of . We deduce from the inverse estimates and Lemma B.3 that
(75) | ||||
(76) | ||||
(77) |
Note that . It is easy to see from Lemma B.3 that
(78) |
Step3: Application of Gronwall’s inequality. Substituting (74)–(78) into (73), using , , applying (28), and taking the sum of the inequalities over , we end up with
after careful calculation, where is related to the initial solutions, . From [18, Table 2.2], we know (). Finally, we choose small enough such that and large enough such that . Then the proof is finished by using Gronwall’s inequality. ∎
References
- [1] S. Adjerid and K. Moon, An immersed discontinuous Galerkin method for acoustic wave propagation in inhomogeneous media, SIAM J. Sci. Comput., 41 (2019), pp. A139–A162.
- [2] A. M. Andrew, Level set methods and fast marching methods, Cambridge University Press, Cambridge, UK, 2 ed., 1999.
- [3] U. M. Ascher and S. J. Ruuth, and B. T. Wetton, Implicit-explicit methods for time-dependent partial differential equations, SIAM J. Numer. Anal., 32(1995), pp. 797-823.
- [4] E. Burman, S. Frei, and A. Massing, Eulerian time-stepping schemes for the non-stationary stokes equations on time-dependent domains, Numer. Math., 150 (2022), pp. 423–478.
- [5] J. Donea, S. Giuliani, and J. P. Halleux, An arbitrary lagrangian-eulerian finite element method for transient dynamic fluid-structure interactions, Comput. Methods Appl. Mech. Engrg., 33 (1982), pp. 689–723.
- [6] C. Farhat, P. Geuzaine, and C. Grandmont, The discrete geometric conservation law and the nonlinear stability of ALE schemes for the solution of flow problems on moving grids, J. Comput. Phys., 174 (2001), pp. 669–694.
- [7] L. Formaggia and F. Nobile, A stability analysis for the arbitrary Lagrangian Eulerian formulation with finite elements, East-West J. Math., 7 (1999), pp. 105–132.
- [8] T. P. Fries and A. Zilian, On time integration in the XFEM, Internat. J. Numer. Methods Engrg., 79 (2009), pp. 69–93.
- [9] P. Geuzaine, C. Grandmont, and C. Farhat, Design and analysis of ALE schemes with provable second-order time-accuracy for inviscid and viscous flow simulations, J. Comput. Phys., 191 (2003), pp. 206–227.
- [10] R. Guo, Solving parabolic moving interface problems with dynamical immersed spaces on unfitted meshes: fully discrete analysis, SIAM J. Numer. Anal., 59 (2021), pp. 797–828.
- [11] J. Guzmán and M. Olshanskii, Inf-sup stability of geometrically unfitted Stokes finite elements, Math. Comp., 87 (2018), pp. 2091–2112.
- [12] P. Hansbo, M. G. Larson, and S. Zahedi, Characteristic cut finite element methods for convection–diffusion problems on time dependent surfaces, Comput. Methods Appl. Mech. Engrg., 293 (2015), pp. 431–461.
- [13] C. W. Hirt, A. A. Amsden, and J. L. Cook, An arbitrary lagrangian-eulerian computing method for all flow speeds, J. Comput. Phys., 14 (1974), pp. 227–253.
- [14] T. J. Hughes, W. K. Liu, and T. K. Zimmermann, Lagrangian-Eulerian finite element formulation for incompressible viscous flows, Comput. Methods Appl. Mech. Engrg., 29 (1981), pp. 329–349.
- [15] C. Lehrenfeld and M. Olshanskii, An Eulerian finite element method for PDEs in time-dependent domains, ESAIM Math. Model. Numer. Anal., 53 (2019), pp. 585–614.
- [16] C. Lehrenfeld and A. Reusken, Analysis of a nitsche XFEM-DG discretization for a class of two-phase mass transport problems, SIAM J.Numer. Anal., 51 (2013), pp. 958–983.
- [17] C. Y. Li, S. V. Garimella, and J. E. Simpson, Fixed-grid front-tracking algorithm for solidification problems, part I: Method and validation, Numerical Heat Transfer, Part B: Fundamentals, 43 (2003), pp. 117–141.
- [18] J. Liu, Simple and efficient ALE methods with provable temporal accuracy up to fifth order for the Stokes equations on time varying domains, SIAM J. Numer. Anal., 51 (2013), pp. 743–772.
- [19] Y. Lou and C. Lehrenfeld, Isoparametric unfitted BDF–finite element method for PDEs on evolving domains, SIAM J. Numer. Anal., 60 (2022), pp. 2069–2098.
- [20] C. Ma, T. Tian, and W. Zheng, High-order unfitted characteristic finite element methods for moving interface problem of Oseen equations, J. Comput. Appl. Math., 425 (2023), 115028.
- [21] C. Ma, Q. Zhang, and W. Zheng, A fourth-order unfitted characteristic finite element method for solving the advection-diffusion equation on time-varying domains, SIAM J. Numer. Anal., 60 (2022), pp. 2203–2224.
- [22] C. Ma and W. Zheng, A fourth-order unfitted characteristic finite element method for free-boundary problems, J. Comput. Phys., 469 (2022), 111552.
- [23] A. Masud and T. J. Hughes, A space-time Galerkin/least-squares finite element formulation of the Navier-Stokes equations for moving domain problems, Comput. Methods Appl. Mech. Engrg., 146 (1997), pp. 91–126.
- [24] T. Richter, Fluid-structure interactions: models, analysis and finite elements, Springer, 2017.
- [25] T. E. Tezduyar, M. Behr, S. Mittal, and J. Liou, A new strategy for finite element computations involving moving boundaries and interfaces—the deforming-spatial-domain/space-time procedure: II. computation of free-surface flows, two-liquid flows, and flows with drifting cylinders, Comput. Methods Appl. Mech. Engrg., 94 (1992), pp. 353–371.
- [26] H. von Wahl and T. Richter, Error analysis for a parabolic PDE model problem on a coupled moving domain in a fully Eulerian framework, SIAM J. Numer. Anal., 61 (2023), pp. 286–314.
- [27] H. von Wahl, T. Richter, and C. Lehrenfeld, An unfitted Eulerian finite element method for the time-dependent Stokes problem on moving domains, IMA J. Numer. Anal., 42 (2022), pp. 2505–2544.
- [28] Q. Zhang, Fourth-and higher-order interface tracking via mapping and adjusting regular semianalytic sets represented by cubic splines, SIAM J. Sci. Comput., 40 (2018), pp. A3755–A3788.
- [29] P. Zunino, Analysis of backward Euler/Extended finite element discretization of parabolic problems with moving interfaces, Comput. Methods Appl. Mech. Engrg., 258 (2013), pp. 152–165.