Abstract
A new moving mesh scheme based on the Lagrange–Galerkin method for the approximation of the one-dimensional convection–diffusion equation is studied. The mesh movement is prescribed by a discretized dynamical system for the nodal points. This system is related to the velocity and diffusion coefficient in the convection–diffusion equation such that the nodal points follow the convective flow of the model. It is shown that under a restriction of the time step size the mesh movement cannot lead to an overlap of the elements and therefore an invalid mesh. Using a piecewise linear approximation, optimal error estimates in the \(\ell ^\infty (L^2) \cap \ell ^2(H_0^1)\) norm are proved in case of both, a first-order backward Euler method and a second-order two-step method in time. These results are based on new estimates of the time dependent interpolation operator derived in this work. Preservation of the total mass is verified for both choices of the time discretization. Numerical experiments are presented that confirm the error estimates and demonstrate that the proposed moving mesh scheme can circumvent limitations that the Lagrange–Galerkin method on a fixed mesh exhibits.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Apart from their application in fluid flow problems convection–diffusion equations have recently been extensively used in the modeling of chemical and biological processes such as pollutant transport, immune system dynamics and cancer growth, see e.g. [2, 28]. In many of these applications, migration of cells or transport of solutes in fluids are involved, which leads to convection-dominant problems. In these cases the Galerkin finite element scheme can produce oscillating solutions. Hence, a plethora of extended and alternative numerical methods have been developed to perform stable computation, e.g., upwind methods [3, 23, 34] and characteristics methods [17, 18, 30, 35]. Among the latter ones the Lagrange–Galerkin (LG) method has been shown to be an effective and efficient method to deal with convection-dominated problems, see for example [4,5,6, 19, 20, 31, 32]. Not only the convection-dominant nature but also the rich dynamics of the biological applications, which include traveling waves and aggregation phenomena, pose a challenge for the numerical schemes. Different approaches related to mesh adaptation have been recently proposed to improve the accuracy in these cases, including a mass-transport approach for the one-dimensional problem [12] and adaptive mesh refinement [1, 25].
The application of the LG method to convection–diffusion problems offers the advantage that the time step size is not constrained by traditional CFL-type conditions. However, it is important to note that while a time step restriction is indeed necessary, this restriction is not directly proportional to the spatial discretization, as is typically the case with CFL conditions. This flexibility has motivated the use of the LG method in solving the Navier–Stokes equations and models of viscoelastic fluid flow, to name only a few [26, 27, 29]. Various LG methods have been proposed for convection–diffusion problems: Some have been concerned with higher order approximations in time using single- and multi-step methods, e.g., [4, 5, 7]. Others have focused on maintaining the mass balance on the discrete level, e.g. [16, 32]. In [20, 32] such mass-preserving LG schemes of first- and second-order in time have been proposed and error estimates have been provided. As the LG scheme relies on an upwind-interpolation of the numerical solution that follows the velocity field backwards in time a promising approach is to introduce mesh movement along the velocity field. From a computational point of view this might ease the identification of the upwind points and reduce the interpolation error.
Different kinds of moving mesh methods have been considered to numerically solve convection–diffusion problems. A common approach is the redistribution of mesh cells according to a monitor function that depends on local features of the numerical solution or an a posteriori error estimator, see e.g. [1]. In other approaches separate moving mesh PDEs and transformations obtained from the solution of the Monge–Kantorovich problem are used, see [22, 33]. In the context of hyperbolic balance laws and fluid dynamics a variety of schemes, which also entail mesh movement, has been derived from the Lagrangian formulation of the problem, such as the hydrodynamic GLACE scheme [11] and the arbitrary Lagrangian–Eulerian finite element method [13, 36]. In this context high order of accuracy has been achieved by adopting high order essentially non-oscillatory reconstructions, see e.g., [9, 14]. In some applications error estimates have been derived taking the movement of the mesh into account, e.g. [15, 21]. We consider here a Lagrangian grid approach based on a dynamical system for the nodal points that both exhibits significant benefits over static grids in numerical simulations and allows for an error analysis of the extended LG scheme.
In this work we are concerned with a moving mesh approach within LG schemes of first- and second-order in time and corresponding error estimates. We introduce the Lagrange–Galerkin Moving Mesh (LGMM) schemes, which combine the LG schemes derived in [20, 32] with a moving mesh, in order to improve the performance and efficiency over the original LG schemes with fixed mesh. The mesh movement we consider is inspired by [12]; although we focus on the one-dimensional case in this work our mesh movement is expressed in a form suitable for higher dimensional cases. We derive a condition under which the mesh movement is applicable. We generalize the mass-conservation property and stability results from the static grid versions of the schemes to the new LGMM schemes. Based on the idea of temporal derivatives on deforming grids in [24] we derive bounds for the time derivative of the dynamic interpolation operator, which then allow us to prove optimal error estimates for the LGMM scheme on piecewise linear elements in the \(\ell ^\infty (L^2) \cap \ell ^2(H_0^1)\) norm. Moreover, we present numerical experiments that verify the error estimates. They further show that in case of aggregation the LGMM method eliminates oscillations of the numerical solution that the LG method produces.
The rest of the paper is organized as follows: In Sect. 2 we present the mass-preserving LG schemes of first- and second-order in time for the convection–diffusion problem. This scheme is equipped with a mesh moving technique in Sect. 3, for which we state various properties. In Sects. 4 and 5, we provide the main results concerned with the mass-conservation property, the stability, and the error estimates for the schemes of order one and two, respectively, which are afterwards proven in Sect. 6. To show the advantages of the LGMM schemes, two numerical simulations are given in Sect. 7, followed by the conclusions in Sect. 8.
2 Lagrange–Galerkin Schemes
2.1 Statement of the Problem
Let \(\Omega =(a,b)\) be a bounded interval in \(\mathbb {R}\). We denote by \(\Gamma {:}{=}\partial \Omega \) the two point boundary of \(\Omega \) and by T a positive constant. In this paper we use the Lebesgue spaces \(L^2(\Omega ),L^{\infty }(\Omega )\) and the Sobolev spaces \(W^{m,p}(\Omega ),W^{1,\infty }_0(\Omega ),H^m(\Omega ),H^1_0(\Omega )\), for \(m\in \mathbb {N}\cup \{0\}\) and \(p\in [1,\infty ]\). We use the notation \((\cdot ,\cdot )\) to represent the \(L^2(\Omega )\) inner products for both scalar and vector-valued functions. The norm in \(L^2(\Omega )\) is simply denoted as \( \Vert \cdot \Vert {:}{=}\Vert \cdot \Vert _{L^2(\Omega )}\). For any normed space Y with norm \( \Vert \cdot \Vert _Y\), we define the function spaces \(H^m(0,T;Y)\) and \(C^0(0,T;Y)\) consisting of Y-valued functions in \(H^m(0,T)\) and \(C^0([0,T])\), respectively. For the two real numbers \(t_0<t_1\) we introduce the function space
with the norm
and set \(Z^m{:}{=}Z^m(0,T)\). We often omit \(\Omega \) and [0, T] if there is no confusion and write, e.g., \(C^0(L^\infty )\) in place of \(C^0([0,T];L^\infty (\Omega ))\). Although we are concerned with a one-dimensional domain we use the general notations \(\nabla {:}{=}\partial _x\), \(\nabla \cdot {:}{=}\partial _x\), \(\Delta {:}{=}\partial _x^2\), and \(\frac{\partial }{\partial n} {:}{=}n \partial _x\) to refer to spatial derivatives in order to allow for a straightforward application of the multi-dimensional theory for LG schemes. We use c and C (with or without subscript or superscript) to denote generic positive constant independent of discretization parameters and solutions.
We consider a convection–diffusion problem, in which we aim to find \(\phi :\Omega \times (0,T) \rightarrow \mathbb {R}\) such that
where \(u:\Omega \times (0,T)\rightarrow \mathbb {R}\), \(f:\Omega \times (0,T)\rightarrow \mathbb {R}\), \(g:\Gamma \times (0,T)\rightarrow \mathbb {R}\) and \(\phi ^0:\Omega \rightarrow \mathbb {R}\) are given functions, \(n:\Gamma \rightarrow \{ \pm 1\}\) is the outward unit normal vector and \(\nu >0\) is the diffusion coefficient.
Let \(\Psi {:}{=}H^1(\Omega )\) and \(\Psi '\) be the dual space of \(\Psi \). The weak formulation corresponding to problem (1) is to find \(\{\phi (t)=\phi (\cdot ,t)\in \Psi ; t\in (0,T)\}\) such that for \(t\in (0,T)\) the variational equality
holds in addition to \(\phi (0)=\phi ^0\). The bilinear forms \(a_0(\cdot ,\cdot )\) and \(a_u(\cdot ,\cdot )=a_1(\cdot ,\cdot \,;u)\) and for \(t \in (0,T)\) in (2) are defined such that by
and \(F(t)\in \Psi '\) is a functional given by
for \(f(t)=f(\cdot ,t)\in L^2(\Omega )\) and \(g(t)=g(\cdot ,t)\in L^2(\Gamma )\).
By substituting \(1\in \Psi \) into \(\psi \) in (2), and integrating over (0, t), we derive the mass balance identity
that holds for all \(t\in (0,T)\). This property is desired to be maintained also at the discrete level, which is indeed achieved by the Lagrange–Galerkin schemes of first- and second-order in time proposed in [32] and [20], respectively.
2.2 The First-Order Lagrange–Galerkin Scheme
Let \(\Delta t > 0\) be a time step size, \(t^n {:}{=}n\Delta t\) for \(n\in \mathbb {N}\cup \{0\}\) an equidistant discretization of the time domain and \(N_T {:}{=}\lfloor {T/\Delta t}\rfloor \). For a function \(\rho \) defined in \(\Omega \times (0,T)\) and \(0\le t^n\le T\) the function \(\rho (\cdot ,t^n)\) in \(\Omega \) is denoted by \(\rho ^n\). Let \(\mathcal {T}_h^n{:}{=}\{K^n\},\) \(n\in \{0,\ldots ,N_T\}\) be a time-dependent partition of \(\bar{\Omega }\) with \(K^n\) representing an element in \(\mathcal {T}_h^n\). Let \(h{:}{=}\max _{n=0,\dots ,N_T}\max _{K^n\in \mathcal {T}_h^n} \text {diam} (K^n)\) denote the global mesh size. Let \(\Psi _h^n \subset \Psi \) be a time varying finite element space defined by
where \(P_1(K^n)\) is the space of linear polynomial functions on \(K^n\in \mathcal {T}_h^n\). Details about the spaces \(\Psi _h^n\) and \(\mathcal {T}_h^n\) are discussed in Sect. 3.1, the rest of this section as well as Sect. 2.3 address the first- and second-order schemes assuming \(\Psi _h^n\) is known.
For a given velocity \(v:\Omega \rightarrow \mathbb {R}\), we define the upwind point of x with respect to v and \(\Delta t\) using the mapping \(X_1(v,\Delta t):\Omega \rightarrow \mathbb {R}\),
With respect to the velocity u we define the mapping \(X_1^n: \Omega \rightarrow \mathbb {R}\) and its corresponding Jacobian \(\gamma ^n: \Omega \rightarrow \mathbb {R}\) by
Suppose an approximate function \(\phi _h^0\in \Psi ^0_h\) of \(\phi ^0\) is given. In the first-order Lagrangian moving mesh scheme we look for \(\{\phi _h^n\in \Psi _h^n;\ n=1,\dots ,N_T\}\) such that for \(n = 1,\ldots , N_T\) it holds
The functional \(F^n\in (\Psi _h^n)^\prime \) on the right hand side of (4) is defined by
2.3 The Second-Order Lagrange–Galerkin Scheme
To obtain a higher order discretization in time we define the additional mapping \(\tilde{X}_1^n:\Omega \rightarrow \mathbb {R}\) and its Jacobian \(\tilde{\gamma }^n:\Omega \rightarrow \mathbb {R}\) by
Suppose an approximation \(\phi _h^0\in \Psi ^0_h\) of \(\phi ^0\) is given. Then the second-order Lagrangian moving mesh scheme aims to find \(\{\phi _h^n\in \Psi _h^n;\ n=1,\dots ,N_T\}\) satisfying
In the following, we rewrite scheme (5) as
where, for a series \(\{\rho ^n\}_{n=0}^{N_T} \subset \Psi \), the function \(\mathcal {A}_{\Delta t} \rho ^n: \Omega \rightarrow \mathbb {R}\) is given by
We introduce some discrete norms in the following. Let Y be a normed space, \(m\in \{0,\dots ,N_T\}\) be an integer, and \(\{\rho ^n\}^{N_t}_{n=0}\subset Y\). We define the norms \( \Vert \cdot \Vert _{\ell ^\infty _m (Y)}\) and \( \Vert \cdot \Vert _{\ell ^2_m(Y)}\) by
Additionally, we define the following norm over the time varying finite element spaces
If there is no confusion we omit the subscript i.e, \( \Vert \rho \Vert _{\ell ^\infty _1(Y)} {=}{:}\Vert \rho \Vert _{\ell ^\infty (Y)}\) and \( \Vert \rho \Vert _{\ell ^2_1(Y)} {=}{:}\Vert \rho \Vert _{\ell ^2(Y)}\).
3 Moving Mesh Method for the Lagrange–Galerkin Scheme
3.1 Moving Mesh
In this section the construction and evolution of the partitions \(\mathcal {T}_h^n\) is considered. To this end a moving mesh is employed that in this work is defined as follows.
Definition 1
For a given partition \(\{t^n:~n=0,\dots ,N_T\}\) of the time domain [0, T] a moving mesh of \(\Omega \times [0, T]\) is a set of points \(\{P_i^n:~i=1,\dots ,N_p,~n=0,\dots ,N_T\} \subset \bar{\Omega }\) that satisfy the monotonicity condition
We refer to \(N_p \in \mathbb {N}\) as the number of moving mesh points.
A moving mesh allows us to define the partitions introduced in Sect. 2.2 more precisely as
and therefore determines the nodal points of the finite element spaces \(\Psi _h^n\) for \(n\in \{0, \dots , N_T\}\). We note that for any fixed \(i\in \{1, \dots , N_p\}\) the series \(\{P_i^n\}_{n=0}^{N_T}\) can be considered a time discrete trajectory of the moving point \(P_i\). For our analysis we define the velocities of the moving mesh points as
which allow us to introduce the time continuous point trajectories
In addition, for \(t\in [0,T]\) we define w(x, t) as an extension of \(w^n_i\), by
Note that \(w \in C^0([0,T];W^{1,\infty }_0(\Omega ))\). Also the basis functions of the finite element spaces \(\Psi _h^n\) can be naturally extended using the trajectories (9): for \(i\in \{1,\dots , N_p\}\) let \(\psi _i(\cdot , t)\) denote the unique function on \(\Omega \) that is affine linear restricted to the intervals \([P_j(t), P_{j+1}(t)]\) for \(j\in \{1, \dots , N_p -1 \}\) and satisfies \(\psi _i(P_j(t), t) = \delta _{ij}\). Then clearly \(\{ \psi _i(\cdot , t^n):~i=1,\dots ,N_p \}\) is a basis of \(\Psi _h^n\).
3.2 Moving Mesh Method
In this section we propose a moving mesh method that is used to obtain a moving mesh in the sense of Definition 1 and therefore determines the finite element spaces \(\Psi _h^n\) as described in Sect. 3.1. Suppose that the points \(P_1^0\), ..., \(P_{N_P}^0\) are given and the monotonicity condition (7) is satisfied for \(n=0\). The method we propose determines the position of the points \(P_i^n\) iteratively by employing a time discretization of the dynamical system
with initial data \({\tilde{P}}_i(0)=P_i^0\) for \(i\in \{1, \dots , N_p\}\). Here, \(\nabla \) refers to the gradient with respect to the spatial variables, and the parameter \(\nu _M\ge 0\) accounts for regularization of the moving mesh. The dynamical system (11) generalizes the mass transport approach from [8, 12]: If \(d=1\), \(f=0\) and \(\nu _M=\nu \) hold it provides a semi-discrete scheme for the convection–diffusion equation (1a) in terms of the inverse cumulative distribution function of the state \(\phi \). Applying it to the nodal points and assuming an exact solution of (1a) yields an equidistribution of the mass of the solution, i.e. \(\int _{{\tilde{P}}_i(t)}^{{\tilde{P}}_{i+1}(t)} \phi \, dx = Const\) for all \(i\in \{1, \dots , N_p-1\}\) and \(t\ge 0\). By employing (11) in our LG scheme we aim to follow the mass movement due to convection and diffusion with the moving mesh. Note that in this setting the approach can also be used if \(f\ne 0\), in which case a parameter \(\nu _M\ne \nu \) might yield more accurate results.
Applying a linearly implicit time discretization to the continuous problem (11) gives rise to our moving mesh method: find \(\{P_i^n:~i=1,\dots ,N_p,~n=0,\dots ,N_T\}\) such that for \(n=1,\dots ,N_T\) it holds
The discretization has been constructed making use of the fact that for \(d=1\) it holds
The method is inspired by [12] and can be extended to higher dimensions in a straightforward way. In the case \(\nu _M= 0\), the transition from \(P_i^{n-1}\) to \(P_i^n\) due to (12) and the transition from \(P_i^{n-1}\) to \(X_1(u^{n-1}, \Delta t)(P_i^{n-1})\) describe movements in opposite directions. In particular, if the velocity field u is smooth we have \( P_i^{n-1} \approx X_1^n(P_i^n)\). Hence, a reduction of the computational costs to identify \(X_1^n(P_i^n)\) as well as a decrease of the corresponding interpolation error in the scheme are expected. The main idea of the LGMM method is, to combine the LG schemes (4) and (6) with the moving mesh method (12).
Remark 1
While the moving mesh method (12) leads to a well defined set of nodal points \(\{P_i^n:~i=1,\dots ,N_p,~n=0,\dots ,N_T\}\) it is not clear whether they constitute a moving mesh in the sense of Definition 1 since the condition (7) might not be satisfied.
Remark 2
To obtain the nodal points \(P_1^n,\dots , P_{N_p}^n\) from \(P_1^{n-1},\dots , P_{N_p}^{n-1}\) according to (12a) and (12b) a sparse linear system is solved. In general, the coefficient matrix of this system is not symmetric.
In fact we show that the method (12) results in a moving mesh for a suitable choice of \(\Delta t\), see Sect. 1. The other theoretical results we show in this work assume a given moving mesh. While it is important that a positive distance between neighbor points is maintained in the moving mesh, it needs to be also verified that this distance does not become too large. In particular, with respect to the error estimates that we present in the following section we are interested in the situation that the global mesh size h tends to 0. This can be realized by employing an equidistant mesh of size \(h_0\) at the initial time that is iteratively decreased by increasing the number of moving points and ensuring that the distance between neighboring points does not exceed \(C h_0\) over all time instances for a fixed constant \(C>0\). In practice, positive \(\nu _M\) in scheme (12) has resulted in a control over the maximal point distance. Next, we state several results concerning the moving mesh method (12). We begin by formulating the following hypotheses.
Hypothesis 1
The function u satisfies \(u\in C^0([0,T];W^{1,\infty }_0(\Omega ))\).
Hypothesis 2
The nodal points of the finite element spaces \(\Psi _h^0, \dots \Psi _h^{N_T}\) are given by a moving mesh.
Hypothesis 3
The solution \(\phi \) of problem (1) satisfies \(\phi \in Z^3 \cap H^2 (0,T;H^2(\Omega )) \cap H^1 (0,T;H^3(\Omega ))\).
Theorem 1
(Non-overlapping condition for the moving mesh method) Suppose that Hypothesis 1 holds true. Let \(C_0\in [0,1)\) be fixed, the set of nodal points \(\{P^n_i:~i=1,\dots ,N_p,~n=1,\dots ,N_T\}\) be given by method (12), and
then the set of nodal points describes a moving mesh, i.e., it holds that for any \(n\in \{0,\dots ,N_T\}\)
Proof
Refer to Sect. 6.1.1. \(\square \)
Remark 3
Suppose that the nodal points of the finite element spaces \(\Psi _h^0, \dots \Psi _h^{N_T}\) are governed by the moving mesh method (12) then Hypothesis 2 is implied by condition (13) due to Theorem 1.
Next, we state two results that are necessary in order to derive the error estimates for the LGMM schemes. For \(f\in C^0(\bar{\Omega }), t\in [0,T]\), and the time dependent P1-basis functions \(\psi _i(x, t)\) for \(i\in \{1,\dots , N_p\}\) we define the time dependent Lagrange interpolation of f by
We also denote the difference operator \(\bar{D}_{\Delta t} f {:}{=}\frac{f^n - f^{n-1}}{\Delta t}\).
Theorem 2
Let \(\{\phi (t)=\phi (\cdot ,t)\in \Psi ; t\in (0,T)\}\) be the solution of problem (1). Suppose that Hypothesis 2 and Hypothesis 3 hold true. Then assuming \(w \in C^0(W^{1,\infty }_0(\Omega ))\) the following results hold.
-
i)
There exists a positive constant \(C=C(\Vert w \Vert _{C^0(L^\infty )})\) independent of \(\Delta t\) and h such that
$$\begin{aligned} \left\| \bar{D}_{\Delta t}(\Pi ^n_h\phi ^n) - \frac{1}{\Delta t} \int _{t^{n-1}}^{t^{n}} \Pi _h(t) \frac{\partial \phi }{\partial t} (\cdot , t) dt \right\| \le \frac{C h}{\sqrt{\Delta t}} \Vert \phi \Vert _{L^2(t^{n-1},t^n ; H^2(\Omega ))}. \end{aligned}$$(16a) -
ii)
For a positive constant \(C^\prime = C^\prime (\Vert w \Vert _{C^0(W^{1,\infty })})\) independent of \(\Delta t\) and h it holds
$$\begin{aligned} \left\| \bar{D}_{\Delta t}(\Pi ^n_h\phi ^n) - \frac{1}{\Delta t} \int _{t^{n-1}}^{t^{n}} \Pi _h(t) \frac{\partial \phi }{\partial t} (\cdot , t) dt \right\| _{\Psi ^\prime } \le C h^2 \Vert \phi \Vert _{H^1(H^3)}. \end{aligned}$$(16b)
Proof
Refer to Sect. 6.1.2. \(\square \)
Remark 4
In the case of a fixed mesh (velocity \(w=0\)), the bounds on the right hand side of (16b) and (16a) are zero.
Corollary 1
Let \(\{\phi (t)=\phi (\cdot ,t)\in \Psi ; t\in (0,T)\}\) be the solution of problem (1). Suppose that Hypothesis 2 and Hypothesis 3 hold true. Define \(\eta (t){:}{=}\phi (t)-\Pi _h (t) \phi (t)\). Then for \(w \in C^0(W^{1,\infty }_0(\Omega ))\) there exist positive constants \(C=C(\Vert w \Vert _{C^0(L^\infty )})\) and \(C^\prime =C^\prime (\Vert w \Vert _{C^0(W^{1,\infty })})\) independent of \(\Delta t\) and h such that the following bounds hold
Proof
Refer to Sect. 6.1.3. \(\square \)
4 Results For The First-Order LGMM Scheme
In this section we state results for the scheme introduced in Sect. 2.2. We start by stating the following hypothesis.
Hypothesis 4
The time step size \(\Delta t\) satisfies the condition \(\Delta t |u|_{C^0(W^{1,\infty })}\le 1/8\).
Remark 5
Hypothesis 4 is not a CFL condition since the mesh size h is not included in the inequality. The time step size \(\Delta t\) can be chosen independently of h.
Proposition 1
(Mass preserving property of the first-order LGMM Scheme) Suppose that Hypotheses 1, 2 and 4 hold true. Let \(\{\phi ^n_h\}_{n=1}^{N_T}\) be the solution of the numerical scheme (4) for a given initial datum \(\phi _h^0\). Then it holds for \(n=0,1,\dots ,N_T\) that
Proposition 2
(Stability of the first-order LGMM scheme) Suppose that Hypotheses 1, 2 and 4 hold true. Let \(F\in H^1(0,T;\Psi ')\) be given. For the given function \(\phi ^0_h \in \Psi _h\), let \(\{\phi ^n_h\}^{N_T}_{n=1} \subset \Psi _h\) be the numerical solutions of scheme (4). Then there exists a constant \(C>0 \) independent of h and \(\Delta t\) such that
Proofs of Proposition 1 and Proposition 2
The proof of the two propositions follows directly from Theorem 1 and Theorem 2 in [32], respectively. For convenience we provide the proofs in Appendix D.1 and Appendix E.1. \(\square \)
Remark 6
The mass-preserving and stability properties of the first-order Lagrange-Galerkin scheme with fixed mesh (Theorem 1 and Theorem 2 of [32]) are maintained in the first-order LGMM scheme.
Theorem 3
(Error estimates for the first-order LGMM scheme) Suppose that Hypotheses 1, 2, 4, and 3 hold true. Let \(F\in H^1(0,T;\Psi ')\) be given. Assuming the initial datum \(\phi ^0_h=\Pi ^0_h\phi ^0\in \Psi _h\) let \(\{\phi (t)=\phi (\cdot ,t)\in \Psi ; t\in (0,T)\}\) be the solution of problem (1) and \(\{\phi ^n_h\}_{n=1}^{N_T}\) the numerical solutions of scheme (4). Then there exists a constant \(C>0 \) independent of h and \(\Delta t\) such that
Proof
Refer to Sect. 6.2. \(\square \)
Remark 7
Using the bound (17a) instead of (17b) in the proof of Theorem 3 a first order bound that requires lower regularity of \(\phi \) is obtained. Namely, under the assumptions of Theorem 3 there exists a constant \(C>0\) independent of h and \(\Delta t\) such that
5 Results For The Second-Order LGMM Scheme
The results in this section concern the second-order scheme introduced in Sect. 2.3.
Proposition 3
(Mass preserving property of the second-order LGMM scheme) Suppose that Hypotheses 1, 2 and 4 hold true. Let \(\{\phi ^n_h\}_{n=1}^{N_T}\) be the solution of the numerical scheme (6) for a given initial datum \(\phi _h^0\). Then, we have the following.
(i) It holds for \(n=1,2,\dots ,N_T\) that
(ii) Assume \(f=g=0\) additionally. Then, it holds for \(n=1,2,\dots ,N_T\) that
Proposition 4
(Stability for the Second-Order LGMM Scheme) Suppose that Hypotheses 1, 2 and 4 hold true. Let \(F\in H^1(0,T;\Psi ')\) be given. For a given function \(\phi ^0_h \in \Psi _h\) let \(\{\phi ^n_h\}^{N_T}_{n=1} \subset \Psi _h\) be the numerical solutions of scheme (6). Then, there exists a constant \(C>0\) independent of h and \(\Delta t\) such that
Proofs of Proposition 3 and Proposition 4
The proof of both propositions follows from Theorem 1 and Theorem 2 in [20], respectively. For convenience we provide the proofs in Appendices D.2 and E.2. \(\square \)
Remark 8
Also in case of the second-order Lagrange–Galerkin scheme the mass-preserving and stability properties of the fixed mesh method (Theorem 1 and Theorem 2 of [20]) are maintained in the LGMM scheme.
Theorem 4
(Error Estimates the Second-Order LGMM Scheme) Suppose that Hypotheses 1, 2, 4, and 3 hold true. Let \(F\in H^1(0,T;\Psi ')\) be given. For a given function \(\phi ^0_h=\Pi ^0_h\phi ^0\in \Psi _h\) let \(\{\phi (t)=\phi (\cdot ,t)\in \Psi ; t\in (0,T)\}\) be the solution of problem (1) and \(\{\phi ^n_h\}_{n=1}^{N_T}\) be the numerical solutions of scheme (6). Then, there exists a constant \(C>0 \) independent of h and \(\Delta t\) such that
Proof
Refer to Sect. 6.3. \(\square \)
Remark 9
In analogy to Remark 7 in the proof of Theorem 4 the bound (17a) can be used instead of (17b) to obtain a first order bound that requires lower regularity of \(\phi \). Namely, under the assumptions of Theorem 4 there exists a constant \(C>0\) independent of h and \(\Delta t\) such that
Remark 10
In case of a static mesh the error estimate (24) is consistent with [20, Theorem 3 (ii)] except for the dependence on \(\Vert \phi \Vert _{H^1(H^3)}\). Taking into account Remark 4 the exact literature result can easily be recovered. The same is true for the relation between the error estimate (20) and [32, Theorem 3].
6 Proofs
In this section we provide proofs for the results stated in Sects. 3, 4 and 5.
6.1 Proofs of the Results Regarding the Moving Mesh
6.1.1 Proof of Theorem 1
We show property (14) inductively. Hence, suppose \(P^{n-1}_i < P^{n-1}_j;\) \( i < j;\) \( i,j\in \{1,\dots ,N_p\}\), we show that (14) holds true. Let \(h^{n-1}_i{:}{=}P^{n-1}_{i+1}-P^{n-1}_i\) for \(i \in \{1,\dots ,N_p-1\}\). It is sufficient to show that \(h^{n}_i > 0\) for \(i \in \{1,\dots ,N_p-1\}\). Shifting the index i in scheme (12a), we have
By subtracting (12a) from (25) we obtain
Rearranging the terms it follows for \(i=2,\dots ,N_p-2\)
Using (13) we derive a lower bound of the right hand side in (26) as follows:
Note that from (12a) for \(i=2\) we have
and from (12b) follows \(P^{n-1}_1=a\), which implies \( \frac{P^{n}_1-P^{n-1}_1}{\Delta t}=0\). Therefore, it holds
Similarly, from (12a) for \(i=N_p-1\) we have
and from (12b) we obtain \(P^{n-1}_{N_p}=b\), which implies \( \frac{P^{n}_{N_p}-P^{n-1}_{N_p}}{\Delta t}=0\). Therefore, we have
Proceeding as in (27) positivity of the right hand sides in both (28) and (29) follows. Combining (28), (26) and (29) yields a linear system with unknown variables \(h^{n}_1\), ..., \(h^n_{N_p-1}\) and a strictly diagonally dominant coefficient matrix, which is thus an M-matrix. Since an M-matrix A has the property that \(Ax>0\) implies \(x>0\), the solution of the linear system is positive, i.e., \(h^{n}_{1}\), ...,\(h^n_{N_p-1} > 0\), hence (14) follows. \(\square \)
6.1.2 Proof of Theorem 2
First, we state the following lemma, which plays an important role in the proof of Theorem 2. The proof of the lemma is given in Appendix A.
Lemma 1
Let \(\{\phi (t)=\phi (\cdot ,t)\in \Psi ; t\in (0,T)\}\) be the solution of problem (1) and suppose that Hypothesis 2 holds true. For \(x\in \bar{\Omega }\) and \(t\in [t^{n-1},t^n]\) we define
where \(P_i(t)\) for \(i\in \{1,\dots ,N_p\}\) are the nodal point positions defined in (9) and \(\psi _i(x,t)\) for \(i\in \{1,\dots ,N_p\}\) denote the time extended P1 basis functions. We assume \(x\in [P_k(t), P_{k+1}(t)]\) for a \(k\in {\{1,\dots ,N_p -1\}}\). Then I(x, t) can be expressed as
Proof of Theorem 2
We first define the interpolation operators
Then we rewrite their difference as
The rest of the proof concerns the last integral in (31). Without loss of generality let \(t\in [t^{n-1},t^n]\) and \(x\in K_k(t) {:}{=}[P_k(t), P_{k+1}(t)]\). For brevity we introduce the notations:
We’re now in the position to show i). Due to the Taylor expansions
we obtain the identity
By using Lemma 1, we substitute (32) into (31), and through a change of variable, we proceed to compute
By taking the \(L^2\)-norm over \(\Omega \) and applying the Cauchy–Schwartz inequality on the right hand side, we obtain
where the dynamic index \({\tilde{k}}={\tilde{k}}(x,t)\) is defined such that \(x\in K_{{\tilde{k}}}(t)\). To complete the proof, we take the square root and divide both sides of (33) by \(\Delta t\), obtaining (16a).
Next, we proof (ii). Therefore, we first rewrite and then further expand the last double integral in (32) as follows
Additionally we introduce the Taylor expansion
By using Lemma 1 and substituting the above expressions into (31) we compute
We proceed by estimating the (\(\Psi ^\prime \))-norm, i.e., \(\Vert A^n\Vert _{\Psi ^\prime }\le \Vert A^n_1\Vert _{\Psi ^\prime } + \Vert A^n_2\Vert _{\Psi ^\prime } + \Vert A^n_3\Vert _{\Psi ^\prime }\). The following bounds hold
and their detailed proofs are provided in Appendix B. Combining all the bounds, we obtain the estimate
which completes the proof of (16b). \(\square \)
6.1.3 Proof of Corollary 1
We first recall an error estimate for the Lagrange interpolation that follows from [10, Theorem 4.4.20].
Lemma 2
We suppose that Hypothesis 2 holds true and fix \(t\in [0, T]\). Let \(\Pi _h=\Pi _h(t)= \sum _{i=1}^{N_p} f(P_i(t))\psi _i(x,t)\) be the Lagrange interpolation operator at time t and \(v \in H^2(\Omega )\). Then there exists a constant \(C>0\) independent of h such that
Proof of Corollary 1
We show (17a) and assume \(t\in [t^{n-1},t^n]\). By applying the bound (16a) from Theorem 2, Cauchy-Schwartz’s inequality, as well as Lemma 2, we obtain the estimate,
To complete the proof, we divide both sides of (38) by \(\Delta t\) and obtain (17a). The bound (17b) is obtained repeating the above estimates in the \(\Psi ^\prime \)-norm, using (16b) instead of (16a) and embedding \(L^2\) in \(\Psi ^\prime \). \(\square \)
6.2 Proof of Theorem 3
To prove Theorem 3, we first state the following lemma.
Lemma 3
(Evaluation of composite functions [20, 32]) Let a be a function in \(W^{1,\infty }_0(\Omega )^d\) satisfying \(\Delta t \Vert a \Vert _{1,\infty }\le 1/4\) and consider the mapping \(X_1(a,\Delta t)\) defined in (4). Then, the following inequalities hold.
Proof of Theorem 3
We define the terms
By substituting the error \(e^n_h\) in the numerical scheme (4), we obtain the following expression:
where the residual on the right hand side is given by
To obtain an estimate on \(\Vert R_1\Vert \), we follow the error estimate framework for the convection–diffusion problem on a static mesh (details are given in Appendix C.1), which gives us
In case of linear elements in one dimension that are considered here we have \(R_3^n=0\) as is shown in Appendix C.3. To compute a bound for \(R^n_2\) we rewrite it as
Then, using (39c) and (39a), noting that thanks to Hypothesis 1 it holds \(1-\gamma ^n \le c_2 \Delta t\), employing (17b), Lemma 2 and embedding \(L^2(\Omega )\) in \(H^1(\Omega )^\prime \), we obtain the following
Hence, by taking the \(\ell ^2\)-norm
By combining the estimates (41), (43), and taking into account the fact \( R^n_3 =0\), we get
as estimate for the total residual, where \(C>0\) is independent of h and \(\Delta t\). Lastly, we apply the stability result from Proposition 2 to problem (40) by substituting \(\phi \) in (19) with \(e^n_h=\phi ^n_h - \Pi ^n_h \phi ^n\), initial value \(e^0_h=0\) and RHS term \(F^n\) as \(R^n_h\). We use the bound (44) to obtained the error estimates (20). \(\square \)
6.3 Proof of Theorem 4
First, we state the following lemma which provides the estimates of the first time step error. The proof is given in Appendix F.
Lemma 4
Suppose that Hypotheses 1, 2, 4, and 3 hold true. Then, it holds that
Proof of Theorem 4
We substitute \(e^n_h\) in the numerical scheme (5) and obtain the following equations for the error:
where the residual \(R^n_h,R^n_1,R^n_2,\) and \(R^n_3\) are given as in the proof of Theorem 3, cf., Sect. 6.2, while the residual on the right hand side of (47) is given by:
To obtain an estimate for \( \Vert \tilde{R}_1 \Vert \), we follow the error estimate framework for the general convection–diffusion problem on uniform mesh (details are given in Appendices C.2 and C.3), which gives us
and as we have shown in Appendix C.3 it holds \(R_3^n=0\). Next, we compute an estimate for \( \Vert \tilde{R}_2 \Vert _{(\Psi _h^n)^\prime }\). For \(n \ge 2\) it holds
where the last inequality follows from Lemma 2 and Theorem 2. Taking the \(\ell ^2\)-norm in the previous estimate we obtain
Combining the bounds (48) and (49) and taking into account the fact \( R_3 =0\), it follows
where \(C>0\) is independent of h and \(\Delta t\). Finally, from the stability result of Proposition 4 and using \(e^0_h=0\), we get
which implies the error estimate (24). We employ Lemma 4 for the estimates of the first time step error such that there is no loss of convergence order. \(\square \)
7 Numerical Experiments
In this section, we present two numerical experiments using the second order LGMM scheme (6) combined with the moving mesh method (12) that show the benefits of the new scheme and verify the error estimate from Theorem 4. As initial data we take \(\phi _h^0=\Pi _h^0 \phi ^0\) from the examples below. To compute the integrals that occur in the scheme we employ the Gauss quadrature of order nine. Since linear finite element spaces are used in our proposed scheme we do not consider higher order quadrature formulae as proposed e.g., in [7]. The linear system appearing in (6) and (12) are iteratively solved using the conjugate gradient (CG) method and successive over-relaxation (SOR) method, respectively. In all experiments we start with an equidistant mesh at the initial time, i.e., for a given \(h_0>0\) the points \(P^0_1,\dots , P_{N_p}^{0}\) are such that
The numerical results obtained by the new LGMM scheme are compared to analogous results by the LG scheme with static mesh, which can be interpreted as LGMM scheme with points satisfying \(P_j^n=P_j^0\) for all \(i\in \{1,\dots , N_p\}\) and \(n\in \{1,\dots ,N_T\}\) in addition to (51).
Example 1
We consider the domain \(\Omega = (-1,1)\), final time \(T=0.5\) and velocity field \(u(x,t) = 1+\sin (t-x)\) in problem (1). No force field is assumed in this example as we set \(f=0\), and for the boundary conditions we set \(g=0\). We take the initial value \(\phi ^0=\phi (\cdot , 0)\) according to the exact solution
We solve Example 1 with diffusion coefficient set to \(\nu =0.01\) and \(\nu =0.0001\). In the moving mesh method (12) we set \(\nu _M=\nu \). The integer N determines the discretization of the domain as we choose the initial mesh size \(h_0=2/N\). The time step size is linearly coupled to the initial mesh size through the relation \(\Delta t = 4 h_0\). In this example, since the velocity u does not satisfy Hypothesis 1, i.e.,\(u_{\vert \Gamma } \ne 0\), the non-overlapping condition (cf. Theorem 1) might not be met at the boundary. In this case, we allow the nodal points \(\{P_i^n\}_{i=1}^{N_p}\) to extend beyond the domain.
In Fig. 1 we show the solution of the LGMM scheme for \(N=512\) and \(\nu =0.01\) in terms of the functions \(\phi ^n_h\) together with the corresponding local mesh or partition sizes \(h_i^n=P_{i+1}^n-P_i^n\) for \(i=1,\dots , N_P\) with respect to their distribution over the computational domain. Clearly, the LGMM scheme maintains a high resolution, i.e., small mesh sizes, in the region, where \(\phi _h\) is large, whereas regions with small \(\phi _h\) are partly significantly lower resolved.
Tables 1, 2, 3 and 4 show the errors and the corresponding experimental orders of convergence (EOC)Footnote 1 of both the LGMM and the LG scheme of second-order after (initial) grid refinement, i.e., iteratively increasing N. In the tables we consider discretization errors with respect to \(L^2(\Omega )\), \(H^1(\Omega )\) and the loss of total mass, defined as:
where \(\Vert \phi \Vert _{\ell ^2(H_0^1)} {:}{=}\Vert \nabla \phi \Vert _{\ell ^2(L^2})\) and \(\Pi _h\) denotes the time dependent Lagrange interpolation operator at time instance \(t^n\) given as a mapping \(\Pi _h(t^n):C^0(\bar{\Omega })\rightarrow \Psi _h^n\). Due to Theorem 4 and the coupling between \(\Delta t\) and h we expected experimental convergence order 2 in both the \(\ell ^\infty (L^2)\) and the \(\ell ^2(H_0^1)\) (semi-) norm. While the EOCs in the tables mostly support this expectation a decrease in case of higher mesh resolutions for the LG scheme is visible. In the case \(\nu =0.01\) this occurs in \(\ell ^2(H_0^1)\) and becomes more significant also in \(\ell ^\infty (L^2)\) in the case \(\nu =0.0001\). The LGMM scheme does not suffer from this decrease in EOC and provides in the affected cases more accurate numerical solution in terms of both norms. The tables further exhibit a low relative loss of mass as \(E_\mathrm{{mass}}\) is of low magnitude even for coarse grids and further decreases as the mesh is refined. While the mesh movement of the LGMM scheme leads to slightly larger \(E_\mathrm{{mass}}\) on fine meshes in comparison to the LG scheme if \(\nu =0.01\) the loss of mass for the LGMM scheme is significantly smaller than for the LG scheme if \(\nu =0.0001\).
Remark 11
-
1.
Readers might find some of the EOC result of Example 1 for \(N=2048, 4096\) to be unusual. In fact, we observed that the “strange” errors in Example 1 are due to numerical integration errors. In the current computation, we used a numerical integration formula of degree 9. When we use a numerical integration formula of degree 21, we achieve EOCs of approximately 2. Therefore, we can say that our LGMM scheme reduces numerical integration errors, particularly when using high-degree quadrature formulas. We provide a grid convergence study using numerical integration of degree 21 in Appendix G.1.
-
2.
The theoretical analysis does not require the restriction \( g = 0\). We provide an additional example similar to Example 1 with a non-zero boundary condition in Appendix G.2.
Example 2
We consider the domain \(\Omega = (-1,1)\), final time \(T=2\), velocity field \(u(x,t) = \sin (2\pi x)\) and diffusion coefficient \(\nu = 10^{-5}\) in problem (1). Again we take \(f=0\) and \(g=0\). The initial datum is set to \(\phi ^0(x) = \exp [- 100(1 - \cos (x))]\).
We solve Example 2 using scheme (6) combined with the moving mesh method (12), using the parameter \(\nu _M=\nu \), an initial uniform mesh satisfying (51) for \(h_0=2/1024\) and the fixed time step size \(\Delta t = 10^{-4}\), which satisfies condition (13) during the computation. Again the results by the new LGMM scheme are compared to the LG scheme with static mesh. Comparing Figs. 2 and 3, we can observe that while the uniform mesh scheme leads to an oscillating solution, the LGMM scheme is capable to capture the aggregation phenomena. This simulation shows the advantage of the proposed LGMM scheme in capturing sharp spike pattern as observed in bio-medical applications.
8 Conclusion
In this work, we have equipped the mass-preserving Lagrange–Galerkin scheme of second-order in time with a moving mesh method giving rise to the LGMM scheme, which is capable of numerically solving convection–diffusion problems in one space dimension. We also establish the stability and error estimates of the proposed numerical scheme, the latter being with respect to the \(\ell ^\infty (L^2 )\cap \ell ^2(H_0^1)\) -norm, of order \(O(\Delta t+h^2)\) if the one-step method is used in time and of order \(O(\Delta t^2+h^2)\) if the two-step scheme is used in time. We show numerical results which support the proved error estimates. To this end we have derived a new estimate for the time dependent interpolation operator, which we then embedded in the error estimate framework for the Lagrange–Galerkin method. The numerical simulations also show that the proposed LGMM scheme is capable to capture aggregation phenomena. We believe that the LGMM scheme can be extended to the cases \(d = 2, 3\); though this extension may not be straightforward for all element types used in the spatial discretization. While we anticipate that our method will perform well with P1 triangular elements, more complex elements or those employing higher-order interpolation, such as P2, may require additional considerations or modifications to ensure efficiency of the method. In forthcoming research we consider extensions of our scheme to multidimensional problems as well as applications to real-world problems, especially from biology such as immune system dynamics and cancer growth, in which diffusion and aggregation play crucial roles.
Availability of Data and Materials
Not applicable.
Notes
The EOC is computed by the formula \(\text {EOC}=\log _2(E^1/E^2)\) with \(E^1\) and \(E^2\) denoting the corresponding error in two consecutive lines of the table.
References
Acharya, S., Moukalled, F.H.: An adaptive grid solution procedure for convection–diffusion problems. J. Comput. Phys. 91(1), 32–54 (1990). https://doi.org/10.1016/0021-9991(90)90003-J
Anderson, A.R.A., Chaplain, M.A.J., Newman, E.L., Steele, R.J.C., Thompson, A.M.: Mathematical modelling of tumour invasion and metastasis. Comput. Math. Methods Med. 2(2), 129–154 (2000). https://doi.org/10.1080/10273660008833042
Baba, K., Tabata, M.: On a conservative upwind finite element scheme for convective diffusion equations. RAIRO Anal. Numér. 15(1), 3–25 (1981)
Benítez, M., Bermúdez, A.: Numerical analysis of a second order pure Lagrange–Galerkin method for convection–diffusion problems. Part I: Time discretization. SIAM J. Numer. Anal. 50(2), 858–882 (2012). https://doi.org/10.1137/100809982
Benítez, M., Bermúdez, A.: Numerical analysis of a second order pure Lagrange–Galerkin method for convection–diffusion problems. Part II: Fully discretized scheme and numerical results. SIAM J. Numer. Anal. 50(6), 2824–2844 (2012). https://doi.org/10.1137/100809994
Bermejo, R., Saavedra, L.: Modified Lagrange–Galerkin methods of first and second order in time for convection–diffusion problems. Numer. Math. 120(4), 601–638 (2012). https://doi.org/10.1007/s00211-011-0418-8
Bermejo, R., Saavedra, L.: Modified Lagrange–Galerkin methods to integrate time dependent incompressible Navier–Stokes equations. SIAM J. Sci. Comput. 37(6), B779–B803 (2015). https://doi.org/10.1137/140973967
Blanchet, A., Calvez, V., Carrillo, J.A.: Convergence of the mass-transport steepest descent scheme for the subcritical Patlak–Keller–Segel model. SIAM J. Numer. Anal. 46(2), 691–721 (2008)
Boscheri, W., Dumbser, M.: Arbitrary-Lagrangian–Eulerian one-step WENO finite volume schemes on unstructured triangular meshes. Commun. Comput. Phys. 14(5), 1174–1206 (2013)
Brenner, S.C., Scott, L.R.: The Mathematical Theory of Finite Element Methods, Texts in Applied Mathematics, vol. 15, 3rd edn. Springer, New York (2008). https://doi.org/10.1007/978-0-387-75934-0
Carré, G., Del Pino, S., Després, B., Labourasse, E.: A cell-centered Lagrangian hydrodynamics scheme on general unstructured meshes in arbitrary dimension. J. Comput. Phys. 228(14), 5160–5183 (2009)
Carrillo, J.A., Kolbe, N., Lukáčová-Medvid’ová, M.: A hybrid mass transport finite element method for Keller–Segel type systems. J. Sci. Comput. 80(3), 1777–1804 (2019). https://doi.org/10.1007/s10915-019-00997-0
Česenek, J., Feistauer, M., Horáček, J., Kučera, V., Prokopová, J.: Simulation of compressible viscous flow in time-dependent domains. Appl. Math. Comput. 219(13), 7139–7150 (2013)
Cheng, J., Shu, C.W.: A high order ENO conservative Lagrangian type scheme for the compressible Euler equations. J. Comput. Phys. 227(2), 1567–1596 (2007)
Chrysafinos, K., Walkington, N.J.: Lagrangian and moving mesh methods for the convection diffusion equation. M2AN Math. Model Numer. Anal. 42(1), 25–55 (2008). https://doi.org/10.1051/m2an:2007053
Colera, M., Carpio, J., Bermejo, R.: A nearly-conservative high-order Lagrange–Galerkin method for the resolution of scalar convection-dominated equations in non-divergence-free velocity fields. Comput. Methods Appl. Mech. Eng. 372, 113366, 24 (2020). https://doi.org/10.1016/j.cma.2020.113366
Colera, M., Carpio, J., Bermejo, R.: A nearly-conservative, high-order, forward Lagrange–Galerkin method for the resolution of scalar hyperbolic conservation laws. Comput. Methods Appl. Mech. Eng. 376, 113654, 28 (2021). https://doi.org/10.1016/j.cma.2020.113654
Douglas, J., Jr., Russell, T.F.: Numerical methods for convection-dominated diffusion problems based on combining the method of characteristics with finite element or finite difference procedures. SIAM J. Numer. Anal. 19(5), 871–885 (1982). https://doi.org/10.1137/0719063
Ewing, R., Russell, T.: Multistep Galerkin methods along characteristics for convection–diffusion problems. In: Vichnevetsky, R., Stepleman, R. (eds.) Advances in Computer Methods for Partial Differential Equations IV, pp. 28–36. IMACS (1981)
Futai, K., Kolbe, N., Notsu, H., Suzuki, T.: A mass-preserving two-step Lagrange-Galerkin scheme for convection–diffusion problems. J. Sci. Comput. 92(2), 37 (2022). https://doi.org/10.1007/s10915-022-01885-w
Gelinas, R.J., Doss, S.K., Miller, K.: The moving finite element method: applications to general partial differential equations with multiple large gradients. J. Comput. Phys. 40(1), 202–249 (1981). https://doi.org/10.1016/0021-9991(81)90207-2
Huang, W., Russell, R.D.: Adaptive Moving Mesh Methods. Applied Mathematical Sciences, vol. 174. Springer, New York (2011). https://doi.org/10.1007/978-1-4419-7916-2
Hughes, T.J.R., Franca, L.P., Balestra, M.: Errata: “A new finite element formulation for computational fluid dynamics. V. Circumventing the Babuška-Brezzi condition: a stable Petrov–Galerkin formulation of the Stokes problem accommodating equal-order interpolations’’. Comput. Methods Appl. Mech. Eng. 62(1), 111 (1987). https://doi.org/10.1016/0045-7825(87)90092-2
Jimack, P.K., Wathen, A.J.: Temporal derivatives in the finite-element method on continuously deforming grids. SIAM J. Numer. Anal. 28(4), 990–1003 (1991). https://doi.org/10.1137/0728052
Kolbe, N., Sfakianakis, N.: An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models. J. Comput. Appl. Math. 416, 114442 (2022). https://doi.org/10.1016/j.cam.2022.114442
Lukáčová-Medvi’ová, M., Mizerová, H., Notsu, H., Tabata, M.: Numerical analysis of the Oseen-type Peterlin viscoelastic model by the stabilized Lagrange-Galerkin method. Part I: A nonlinear scheme. ESAIM Math. Model. Numer. Anal. 51(5), 1637–1661 (2017). https://doi.org/10.1051/m2an/2016078
Lukáčová-Medvi’ová, M., Mizerová, H., Notsu, H., Tabata, M.: Numerical analysis of the Oseen-type Peterlin viscoelastic model by the stabilized Lagrange-Galerkin method. Part II: A linear scheme. ESAIM Math. Model. Numer. Anal. 51(5), 1663–1689 (2017). https://doi.org/10.1051/m2an/2017032
McRae, G.J., Goodin, W.R., Seinfeld, J.H.: Numerical solution of the atmospheric diffusion equation for chemically reacting flows. J. Comput. Phys. 45(1), 1–42 (1982). https://doi.org/10.1016/0021-9991(82)90101-2
Notsu, H., Tabata, M.: Error estimates of a stabilized Lagrange–Galerkin scheme for the Navier–Stokes equations. ESAIM Math. Model. Numer. Anal. 50(2), 361–380 (2016). https://doi.org/10.1051/m2an/2015047
Pironneau, O.: Finite Element Methods for Fluids. Wiley, Chichester (1989)
Rui, H., Tabata, M.: A second order characteristic finite element scheme for convection–diffusion problems. Numer. Math. 92(1), 161–177 (2002). https://doi.org/10.1007/s002110100364
Rui, H., Tabata, M.: A mass-conservative characteristic finite element scheme for convection–diffusion problems. J. Sci. Comput. 43(3), 416–432 (2010). https://doi.org/10.1007/s10915-009-9283-3
Sulman, M., Williams, J.F., Russell, R.D.: Optimal mass transport for higher dimensional adaptive grid generation. J. Comput. Phys. 230(9), 3302–3330 (2011). https://doi.org/10.1016/j.jcp.2011.01.025
Tabata, M.: A finite element approximation corresponding to the upwind finite differencing. Mem. Numer. Math. 4, 47–63 (1977)
Tabata, M., Uchiumi, S.: A genuinely stable Lagrange–Galerkin scheme for convection–diffusion problems. Jpn. J. Ind. Appl. Math. 33(1), 121–143 (2016). https://doi.org/10.1007/s13160-015-0196-2
Takashi, N., Hughes, T.J.: An arbitrary Lagrangian–Eulerian finite element method for interaction of fluid and a rigid body. Comput. Methods Appl. Mech. Eng. 95(1), 115–138 (1992)
Acknowledgements
N.K. thanks the German Science Foundation (DFG) for the financial support through the projects 461365406, 525842915 and 320021702/GRK2326 and further acknowledges the support by the ERS Open Seed Fund of RWTH Aachen University through project OPSF781.
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix
A Proof of Lemma 1
In the following, we assume \(t\in [t^{n-1}, t^n]\) and \(x\in [P_k(t), P_{k+1}(t)]\) and use the notations \(\phi _{k}=\phi (P_{k}(t),t)\) and \(\phi _{k+1}=\phi (P_{k+1}(t),t)\). By our choice of t and x the linear basis functions evaluate as
Hence, we note the identity
and obtain the time derivatives
Employing the fact that due to (9) it holds \(P^{\prime }_i(t)=w^n_i\) we compute
where (52) has been used in the last step. This concludes the proof of Lemma 1. \(\square \)
B Bounds in the \(\Psi ^\prime \)-Norm
In this appendix we compute estimates for \(\Vert A^n_1\Vert _{\Psi ^\prime }, \Vert A^n_2\Vert _{\Psi ^\prime }\), and \(\Vert A^n_3\Vert _{\Psi ^\prime }\). To this end we take \(v \in H_0^1(\Omega )\) satisfying \(\Vert v \Vert _{H^1} \le 1\). We start by showing the estimate (34) on \(\Vert A^n_1\Vert _{\Psi ^\prime }\) and therefore define for \(k\in \{1,\dots ,N_p-1\}\) the average \(v_k{:}{=}\frac{1}{h_k}\int _{K_k} v(x)\, dx\) and the function
for brevity of notation. Then we estimate
where we have used the Cauchy-Schwartz inequality, the Poincaré inequality as well as the following bound and identities
Hence, we obtain the estimate
To show the estimate (35) on \(\Vert A^n_2\Vert _{\Psi ^\prime }\) we note that the bound
holds and compute
Embedding \(L^2(\Omega )\) in \(\Psi ^\prime \), we thus obtain the estimate
Lastly, to show (36) we define
and note the bounds
which allow us to estimate
where we have used the Cauchy–Schwartz inequality. Hence, we obtain
which implies (36). \(\square \)
C Residual bounds
In this part of the appendix we derive the bounds for the residual terms that are used in the proofs of Theorems 3 and 4 in Sects. 6.2 and 6.3.
1.1 C.1 Bound for the Term \(R_1\) in (40)
To derive an estimate for \(R^n_1\) we write \(R^n_1=I^n_1+I^n_2\), where
We first consider the term \(I_1^n\). The computation
shows that we can write this term in the form
Using the Cauchy-Schwartz inequality, we estimate
Hence, it holds
Let \(y{:}{=}x-s_1u^n(x)\Delta t\) and \(\tau {:}{=}t^n-s_1\Delta t\). Then, by a change of variable, we have
By taking the square root, we obtain
On the other hand, we note that \(\frac{(1-\gamma ^n)}{\Delta t} = \nabla \cdot u^n + \mathcal {O}(\Delta t)\), which using (39b) leads to
By combining the estimates of \(I^n_1\) and \(I^n_2\), we have
where \(C_6>0\) is independent of h and \(\Delta t\). \(\square \)
1.2 C.2 Bound for the Term \(\tilde{R}_1\) in (47)
First, we note that \(\gamma ^n\) and \(\tilde{\gamma }^n\) can be written as
Therefore, the term \(\tilde{R}^n_1\) in (47) is recasted as
Proceeding in analogy to C.2, let \(y(x, s)=y(x,s;n):\;=x-u^n(x)(1-s)\Delta t\) and \(t(s)=t(s;n):\;=t^{n-1}+s \Delta t\). Then, the terms \(I^n_1\) and \(I^n_2\) can be expressed in terms of the integrals
Now, we can estimate
and similarly
By combining the bounds of \(I^n_1\) and \(I^n_2\) and taking the \(\ell ^2\)-norm over all time instances, we obtain
where \(C_8>0\) is independent of h and \(\Delta t\). \(\square \)
1.3 C.3 Bound for the Term \(R^n_3\) in (40) and (47)
We compute an estimate for \(R^n_3\) in \((\Psi _h^n)^\prime \). To this end let \(v_h\in \Psi _h^n\) be such that \(\Vert v_h\Vert _{H_1} =1\) and further let \(K_i=[P_i(t^n), P_{i+1}(t^n)]\) for all \(i\in \{1,\dots , N_p-1\}\). Then we have, employing the fact that for \(v_h \in \Psi _h^n\) the function \(\nabla v_h |_{K_i}\) is constant
Hence, it follows that \(R^n_3=0\in (\Psi _h^n)^\prime \). \(\square \)
D Proofs of the Mass Preserving Properties
To prove Proposition 1 and 3 we first state anotherproposition that will be used in the proofs.
Proposition 5
([20, 32]) Suppose that Hypotheses 1, 2 and 4 hold true. Then it holds that \(X^n_1(\Omega )=\tilde{X}^n_1(\Omega )=\Omega \) and \(1/2 \le \gamma ^n, \tilde{\gamma }^n\le 3/2\) for \(n=0,\dots ,N_T\).
1.1 D.1 Proof of Proposition 1
Suppose that Hypotheses 1, 2 and 4 hold true. By Proposition 5 and a change of variable \(y=X_1^n(x)\), it holds for all \(\rho \in \Psi , n=1,\dots ,N_T\) that
We prove the theorem by induction. Let \(m\in \{2,\dots ,N_T\}\) and assume that (18) holds true for \(n=m-1\). By substituting \(1 \in \Psi _h\) into \(\psi _h\) in the scheme (4), we obtain
which proves (18). \(\square \)
1.2 D.2 Proof of Proposition 3
Suppose that Hypothesis 1, 2 and 4 holds true. By Proposition 5 and a change of variable \(y=\tilde{X}_1^n(x)\), it holds for all \(\rho \in \Psi , n=1,\dots ,N_T\) that
We prove (i) of the proposition by induction. Let \(m\in \{2,\dots ,N_T\}\) and assume that (21) holds true for \(n=m-1\). By substituting \(1 \in \Psi _h\) into \(\psi _h\) in scheme (6), we obtain
which implies (21).
We prove (ii). As \(f=g=0\), the identity \(\int _\Omega \phi _h^1 dx = \int _\Omega \phi _h^0 dx\) holds from scheme (6) with \(n=1\), which implies similarly, \(\int _\Omega \phi _h^2 dx = \int _\Omega \phi _h^0 dx\) from the scheme with \(n=2\). Using the same argument for all n, we obtain (22). \(\square \)
E Proofs of the Stability Results
1.1 E.1 Proof of Proposition 2
We substitute \(\phi ^n_h \in \Psi _h\) into the numerical scheme (4) and obtain
By Young’s inequality, the functional on the right hand side of (53) can be estimated as
Let the first term on the left hand side of (53) be denoted by \(I_n\), then the following lower bound holds
Since \(\gamma ^n-1=\mathcal {O}(\Delta t)\) it holds
Then, \(I_n\) can be written as
By substituting (55) and (54) into (53) we obtain
To complete the proof we apply the Gronwall inequality to (56) and get
where the constant \(C>0\) is independent of \(\Delta t\) and h. \(\square \)
1.2 E.2 Proof of Proposition 4
First we state the following lemma that will be used in the last part of the proof.
Lemma 5
(Gronwall’s Inequality [20]) Let \(a_0\), \(a_1\) and \(a_2\) be non-negative numbers such that \(a_1 \ge a_2\), let further \(\Delta t \in (0, 3/(4a_0)]\) and \(\{x_n\}_{n\ge 0}, \{y_n\}_{n\ge 1}, \{z_n\}_{n\ge 2} \), \(\{b_n\}_{n\ge 2}\) be non-negative sequences. Suppose that
is satisfied. Then it holds that
Proof of Proposition 4
For \(n \ge 2\), note that the scheme (5b) can be written as
where \(I^n_h \in (\Psi _h^n)^\prime \) is given by
for \(n\in \{2,\dots ,N_T\}\). By substituting \(\phi ^n_h \in \Psi _h\) as \(\psi _h\) into (6) we have
The first term of the left hand side can thereby be estimated as
Conversely, the terms on the right hand side can be estimated as
Then, by combining the above estimates (60) can be rewritten as
To complete the proof of Proposition 4, we apply the Gronwall inequality from Lemma 5 and obtain
where \(C>0\) is independent of \(\Delta t\) and h. By combining this estimate with Proposition 2, the proof of Proposition 4 is completed. \(\square \)
F Proof of Lemma 4
Proof
Recalling the calculation of \(||R^n_1||_{(\Psi ^n_h)'}\), cf. C.1, the bound of \(||R^n_2||_{(\Psi ^n_h)'}\) from (42), and taking into account the fact \(R^n_3=0\), it holds that
By substituting \(e^1_h\) into \(\psi _h\) in (40), dropping the positive term \(a_0(e^1_h,e^1_h)\), taking into account \(e^0_h=0\), \(\langle R^1_h,e^1_h\rangle \le \Vert R^1_h\Vert \Vert e^1_h\Vert \), and using (61), we get
Similarly, substituting \(e^1_h\) into \(\psi _h\) in (40), taking into account \(e^0_h=0\), \(\langle R^1_h,e^1_h\rangle \le \Vert R^1_h\Vert \Vert e^1_h\Vert \), and using (61), we get
which implies (45).\(\square \)
G Additional Numerical Results
1.1 G.1 Example 1 with Higher Order Integration Formula
We simulate Example 1 using the Gauss quadrature formula of degree 21. As we can see in Tables 5 and 6, we achieve an EOC of approximately 2. While the LG scheme yields slightly more accurate results in \(\ell ^2(H^1_0)\) on fine grids we note that a similar accuracy is obtained by the LGMM scheme using the lower order integration formula, which has smaller computational cost.
1.2 G.2 Example of Non-zero Boundary Condition Problem
We consider the domain \(\Omega = (0,1)\), final time \(T=0.5\), diffusion coefficient \(\nu =0.0001\), and velocity field \(u(x,t) = \sin (\pi x)\) in problem 1. We take the Neumann boundary conditions as
We set the external force f and the initial value \(\phi ^0\) appropriately so that the following exact solution is
The integer N determines the discretization of the domain as we choose the initial mesh size \(h_0=1/N\). The time step size is linearly coupled to the initial mesh size through the relation \(\Delta t = 4 h_0\). Tables 7 and 8 show the numerical convergence of both the LGMM and the LG schemes in this example and again confirm our theoretical results. Since the mass of the exact solution at \(t=T\) is 0, we introduce another suitable error for the mass defined by
which is also relatively low.
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
Putri, K.S., Mizuochi, T., Kolbe, N. et al. Error Estimates for First- and Second-Order Lagrange–Galerkin Moving Mesh Schemes for the One-Dimensional Convection–Diffusion Equation. J Sci Comput 101, 37 (2024). https://doi.org/10.1007/s10915-024-02673-4
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-024-02673-4
Keywords
- Finite element method
- Lagrange–Galerkin scheme
- Moving mesh method
- Error estimate
- Convection–diffusion system