Moving grids method has important applications in a variety of physical and engineering areas such as solid and fluid dynamics, combustion, heat transfer, material science, etc. This method is more efficient than the fixed grids and does not increase computing cost. We usually apply the finite element methods to the spatial domain, but choose difference methods with respect to the time variable for solving evolution partial differential equations. At the same time, different meshes of domain are used at different time level.
Several moving grids techniques were studied. Such as [1] considered the moving grids finite element method; [2] and [3] constructed and analyzed this method for the oil-water two-phase displacement problem; [4-8] analyzed the parabolic, Stokes problems, parabolic integro-differential equations, generalized nerve conductive equations and fractional diffusion equations with moving grids nonconforming finite element scheme respectively. But the analysis in the above studies relies on the regular condition or quasi-uniform assumption for meshes.
The Klein-Gordon equation is the most basic equation used in relativistic quantum mechanics and quantum field theory to describe a spin-zero particle. The equation is closely related to the physical problem and plays an important role in the study of soliton. In [9], authors studied the existence of a unique global solution under the condition that the parameter is small enough. In [10], a display difference scheme was established for one-dimensional Klein-Gordon equation of unbounded region, and the results of stability and convergence of the scheme were obtained by the energy analysis method. In [11], the numerical solution of one-dimensional Klein-Gordon equation was studied. However, the finite element method for the Klein-Gordon equation is rare.
In this paper, we mainly focus on the convergence theory, the finite element method of moving grids is introduced, and the Crank-Nicolson discrete scheme of the nonlinear Klein-Gordon equation is analyzed without requiring the subdivision to satisfy the regular hypothesis, and the corresponding optimal error estimation of the moving grid approach is derived. It is worth mentioning that, in the usual finite element method of moving meshes, it is necessary to use the Riesz projection to approximate the solution of the original problem, and this paper makes use of the particularity of the element structure, that is, $ u-\Pi u $ and the elements in the finite element space are orthogonal in the sense of energy mode, and the Riesz projection is used to simplify the proof process of the previous documents.
For the sake of convenience, like [12], let $ \Omega \subset R^{2} $ be a rectangular domain with boundary $ \partial\Omega $ parallel to the $ x $-axis or $ y $-axis in the plane, Let $ \Gamma_{h} $ be a family of rectangular subdivisions, i.e., $ \overline{\Omega} = \bigcup\limits_{K\in \Gamma_{h}}K $. For the general element $ K $, we denote the lengths of edges parallel to $ x $-axis and $ y $-axis by $ 2h_{x} $ and $ 2h_{y} $, respectively, and the barycenter of element $ K $ by $ (x_{K}, y_{K}) $, the four vertices of $ K $ are $ a_{1} = (x_{K}-h_{x}, y_{K}-h_{y}) $, $ a_{2} = (x_{K}+h_{x}, y_{K}-h_{y}) $, $ a_{3} = (x_{K}+h_{x}, y_{K}+h_{y}) $ and $ a_{4} = (x_{K}-h_{x}, y_{K}+h_{y}) $, respectively, and the four edges are $ l_{i} = \overline{a_{i}a_{i+1}} $ $ (i = 1, 2, 3, 4 $ (mod 4)), $ h_{K} = \max\limits_{K\in\Gamma_{h}}\{h_{x}, h_{y}\}, \ h = \max\limits_{K\in\Gamma_{h}}h_{K}. $
Let $ \hat{K} = [-1, 1]\times[-1, 1] $ be reference element on the $ \xi-\eta $ plane, the four vertices of $ \hat{K} $ are $ \hat{a}_{1} = (-1, -1) $, $ \hat{a}_{2} = (1, -1) $, $ \hat{a}_{3} = (1, 1) $ and $ \hat{a}_{4} = (-1, 1) $, respectively, $ \hat{l}_{i} = \overline{\hat{a}_{i}\hat{a}_{i+1}} $ $ (i = 1, 2, 3, 4 $ (mod4)) be the four edges of $ \hat{K} $.
We define the finite element $ (\hat{K}, \hat{P}, \hat{\sum}) $ (see [13])
where $ \hat{v}_{i} = \frac{1}{|\hat{l}_{i}|}\int_{\hat{l}_{i}}\hat{v}d\hat{s}, i = 1, 2, 3, 4, \hat{v}_{5} = \frac{1}{|\hat{K}|}\int_{\hat{K}}\hat{v}d\xi d\eta, \varphi(t) = \frac{1}{2}(3t^{2}-1). $
$ \forall\hat{v}\in H^{1}(\hat{K}), $ interpolation functions $ \hat{\Pi}\hat{v} $ can be expressed as
Lemma 2.1 [14] The interpolation operator $ \hat{\Pi} $ defined as $ (2.1) $ has the anisotropic property, i.e., for all $ \hat{\phi}\in H^{2}(\hat{K}) $ and $ \alpha = (a_{1}, a_{2}) $, when $ |\alpha| = 1, $ there holds
Here and later, we use $ C $ denotes a positive constant real number independent of $ h_{K} $ and $ \frac{h_{K}}{\rho_{K}}, $ possibly different at different occurrences.
Define the affine mapping $ F_{K}:\hat{K}\rightarrow K $ by
Then $ \forall K\in\Gamma_{h} $, the associated finite element spaces $ V_{h} $ can be defined as
where $ [v_{h}] $ stands for the jump of $ v_{h} $ across the edge $ F $ if $ F $ is an internal edge, and it is equal to $ v_{h} $ itself if $ F $ belongs to $ \partial \Omega $.
We define the following interpolations $ \Pi $ over spaces $ V_{h} $ as
It is easy to show, $ \|\cdot\|_{h} = (\sum\limits_{K\in {\mathcal{T}}_{h}}|\cdot|^{2}_{1, K})^{\frac{1}{2}} $ is the norm over $ V_{h} $.
We consider the nonlinear Klein-Gordon equation
where $ X = (x, y) $, $ \alpha>0 $, $ \gamma>0 $, $ g(u) $ satisfies the Lipschitz continuous conditionon on the variable $ u $, and has the second order bounded partial derivative.
Let $ u_{t} = Q $, $ (3.1) $ is equivalent to the following question
The variational formulation for problem $ (3.2) $ is written as: $ \forall v\in H_{0}^{1}(\Omega) $,
where $ u(0) = u(X, 0), Q(0) = Q(X, 0), a(u, v) = \gamma\int_{\Omega}\nabla u\nabla vdX $.
Then the approximation problem corresponding to $ (3.3) $ reads as: find $ u_{h}, Q_{h}\in V_{h}, \forall v_{h}\in V_h $, such that
where $ a_{h}(u_{h}, v_{h}) = \gamma\sum\limits_{K}\int_{K}\nabla u_{h}\cdot\nabla v_{h}dX. $
In this section we apply the idea of moving grids to problem $ (3.4) $ and develop the Crank-Nicolson discretization scheme for anisotropic finite element. Let $ 0 = t_{0}<t_{1}<\cdot \cdot \cdot< t_{N} = T $ be a partition of the time interval [0, T], $ \triangle t = \frac{T}{N}, \ t_{n} = n\triangle t \ (n = 0, 1, 2, \cdots, N) $, $ V^{h}_{n} = \{v (X, t_{n});v\in V_{h}\} $. We choose the approximating space $ S $ of $ u (X, t) $ in the following way: the approximation solution $ u^{h} (X, t)\in S $ is the piecewise linear function with respect to the time subdivisions $ 0 = t_{0}<t_{1}<\cdot \cdot \cdot< t_{N} = T $ based on $ u^{h} (x, t_{n})\in V^{h}_{n}\; (n = 0, 1, 2, \cdot\cdot\cdot, N) $.
Now, we introduce the Crank-Nicolson discretization scheme of anisotropic finite element to determine the function values $ u^{h}_{n} = u^{h}(X, t_{n}) $ as follows
where $ u^{h}_{n} = u^{h}(X, t_{n}), \ \ u^{h}_{n+\frac{1}{2}} = \frac{1}{2}(\widehat{u}^{h}_{n}+u^{h}_{n+1}), \ \ Q^{h}_{n+\frac{1}{2}} = \frac{1}{2}(\widehat{Q}^{h}_{n}+Q^{h}_{n+1}), \ \ f_{n+\frac{1}{2}} = \frac{1}{2}(f(X, t_{n})+f(X, t_{n+1})). $ $ (3.7), (3.8) $ implies that $ \widehat{u}^{h}_{n} = u^{h}_{n}, \widehat{Q}^{h}_{n} = Q^{h}_{n} $ when $ V^{h}_{n} = V^{h}_{n+1}. $ Furthermore, $ (3.7), (3.8) $ is a $ L^{2} $-projection modification scheme for the former space when the two spaces $ V^{h}_{n} $ and $ V^{h}_{n+1} $ have different meshes or different interpolation functions. $ (3.9) $ is the general trapezoid difference scheme. We get $ \widehat{u}^{h}_{n}, \widehat{Q}^{h}_{n} $ from $ u^{h}_{n}, Q^{h}_{n} $ in $ (3.7), (3.8) $ and get $ u_{n+1}^{h}, Q_{n+1}^{h} $ from $ \widehat{u}^{h}_{n}, \widehat{Q}^{h}_{n} $ in $ (3.9), (3.10) $. So by partial differential equation theory $ u^{h}_{n} $ and $ Q^{h}_{n} $ can be determined uniquely through $ (3.5) $–$ (3.10) $.
The main error between the solution $ u(X, t) $ and the approximation solution $ u^{h}(X, t) $ consists of three parts: the interpolation error with respect to the finite element method, the difference error with respect to the time, and the error of moving grids.
Lemma 4.1 [13] For anisotropic meshes, $ \forall u\in H^{2}(\Omega), $ then we have
here and later $ n = (n_{x}, n_{y}) $ denotes the outward unit normal vector to $ \partial K $.
Lemma 4.2 [13] $ \forall u\in H^{1}(\Omega), $ there hold $ a_{h}(u-\Pi u, v_{h}) = 0, \ \ \forall v_{h}\in V_h. $
Lemma 4.3 [13] $ \|v_{h}\|_0\leq C\|v_{h}\|_h, \ \ \ \forall\ v_{h}\in V_{h}. $
Lemma 4.4 Let $ u_{n} = u(X, t_{n}) $, $ \forall v_{h}\in V^{h}_{n+1}, $then there holds
where
Proof From $ (3.2) $, for all $ v\in V^{h}_{n+1} $,
Combining $ (4.2) $ and $ (4.4) $, we get
where $ \Gamma_{h}(u, v_{h}) = \sum\limits_{K}\int_{\partial K}\frac{\partial u}{\partial n}v_{h}ds $.
By Cauchy-Schwartz inequality and one-dimensional linear interpolation theory, we deduce that
Similarly,
Applying Lemma 4.1, we obtain
Then (4.3) comes from the combination of above inequalities. Let
Theorem 4.1 For the approximate solution $ u^h_{n}, Q^h_{n} $ and the solution $ u_{n}, Q_{n} $ of $ (3.5)-(3.10) $, the following optimal error estimate holds
Proof By definitions of $ \xi_{n}, \eta_{n}, \lambda_{n}, \theta_{n} $, combining $ (3.9) $ and $ (4.2) $, we have for all $ v_{h}\in V_{n+1}^{h}, $
Applying Lemma 4.2, we obtain $ a_{h} (\frac{\eta_{n+1}+\widehat{\eta}_{n}}{2}, v_{h} )\triangle t = 0. $ By $ (3.10) $, we have
Substituting $ (4.8) $ into $ (4.7) $ with $ v_{h} = \lambda_{n+1}+\widehat{\lambda}_{n} $, we deduce that
Applying Cauchy-Schwartz inequality and Young inequality to yield
Using Lemmas 4.3, we deduce that
By $ (4.3) $ and Young inequality, we have
Substituting $ (4.10)-(4.14) $ into $ (4.9) $, we get
On the other hand, by $ (3.8) $, we obtain
Choosing $ v_{h} = \widehat{\lambda}_{n} $ into $ (4.16) $, applying $ \varepsilon $-Cauchy inequality to yield
Similarly, by $ (3.7) $, we obtain
Substituting $ (4.17)-(4.18) $ into $ (4.15) $, we get
When there is no change between the two layers of the meshes,
We use $ M $ to represent the number of mesh changes and assume that $ M $ is a bounded number independent of $ h $ and $ \triangle t $. Assume that the former $ M $-level mesh changes, and the $ N-M $ layer mesh does not change, we have
Take $ n = 1, $ notice the selection of $ u_{1} $ and $ Q_{1} $, $ \|\lambda_{1}\|_{0} = \|\xi_{1}\|_{0} = 0 $, by (4.21), we obtain
when $ \triangle t $ is full small
Again by the $ \phi_{n} $, we obtain
Furthermore, we have
where $ C_{n-1} \ (n = 2, \cdots, M+1) $ are bounded number.
On both sides of (4.22) is multiplied by $ (\frac{1-C\triangle t}{1+C\triangle t})^{n} $, we have
that is
take $ \triangle t $ full small, by Gronwall inequalities, we have
Furthermore
Again
by Lemma 2.1 and the finite element interpolation theory, we obtain (4.6), the proof is completed.