Abstract
The Klein-Gordon equation is a model for free particle wave function in relativistic quantum mechanics. Many numerical methods have been proposed to solve the Klein-Gordon equation. However, efficient high-order numerical methods that preserve energy and linear momentum of the equation have not been considered. In this paper, we propose high-order numerical methods to solve the Klein-Gordon equation, present the energy and linear momentum conservation properties of our numerical schemes, and show the optimal error estimates and superconvergence property. We also verify the performance of our numerical schemes by some numerical examples.
1. Introduction
The Klein-Gordon equation is a widely used model in relativistic quantum mechanics. It is used to describe the free particle wave function. Many numerical methods, including finite difference methods [1,2,3,4], finite element methods [5] and spectral methods [6,7], have been proposed to solve the Klein-Gordon equation. In particular, the authors in [2] proposed a simple second order centered difference in time and space, an explicit scheme to solve the Klein-Gordon equation. The finite difference schemes proposed in [1,4] used the same treatment for second order spatial and temporal derivatives, but different treatment for the source term of the equation. In [3], a finite difference method along with an operator splitting method was proposed to solve the equation on an unbounded domain. All of these finite difference schemes have second-order convergence in space and time. Some types of spectral methods were proposed in order obtain a higher order of convergence in space. In [6], a pseudo-spectral method was proposed for the spatial discretization, and Crank-Nicolson or leap-frog method was used for the temporal discretization. In [7], Legendre wavelets incorporated with a spectral method were used to solve Klein-Gordon and Sine-Gordon equations. As far as the family of finite element methods is concerned, Ref. [5] proposed Galerkin finite element methods for the Klein-Gordon equation with homogeneous Dirichlet boundary conditions. However, none of the aforementioned work focused on the conservation properties of energy and momentum. The advantage of high-order energy and linear momentum conserving methods is that they can lead to accurate and physically relevant solutions with relatively coarse mesh. Moreover, the structure-preserving property is a significant factor when judging the performance of numerical schemes [8].
In this paper, we propose high-order local discontinuous Galerkin (LDG) methods that have provable properties of energy and linear momentum conservation, optimal convergence and superconvergence. Discontinuous Galerkin (DG) methods belong to the family of finite element methods, and have drawn great attention since the work by Cockburn and Shu in [9,10,11,12]. LDG methods, as a special type of DG method, were then proposed to solve diffusion equations [13], partial differential equations with high spatial derivatives [14,15], and wave equations [16,17,18,19]. In this work, we propose new methods for the Klein-Gordon equation based on the local discontinuous Galerkin methods because LDG methods have some advantage of classical finite element methods. That is, it is easy to design LDG methods with arbitrary order of convergence, and it is suitable for mesh adaptivity and complex geometry. More importantly, DG methods can be designed to conserve mass and energy for certain systems of partial differential equations [20,21].
The outline of this paper is as follows. In Section 2, we present our semi-discrete LDG methods, prove the conservation properties of energy and linear momentum of the Klein-Gordon equation, and show the optimal convergence of our numerical solutions. All of the theoretical results from this section are based on our semi-discrete LDG schemes. In Section 3, we give rigorous proof about the superconvergence property of our numerical solution. In Section 4, we present two types of temporal discretizations and discuss their properties. In Section 5, we conclude this paper by performing some numerical experiments to test the optimal convergence, superconvergence and conservation properties. We can show that our numerical results are consistent with our theoretical results.
2. Local Discontinuous Galerkin Discretization
2.1. Semi-Discrete Local Discontinuous Galerkin Methods for the Klein-Gordon Equation
The original form of the Klein-Gordon equation is given by
where is the wave function, c is the speed of light, m is the mass and ℏ is the Planck constant. Applying the following transformation
to Equation (1), we have the non-dimensional Klein-Gordon equation
In this paper, we develop high-order numerical methods to solve Equation (3) using the method of lines. We first define the semi-discrete local discontinuous Galerkin scheme for a one-dimensional Klein-Gordon equation, and the multi-dimensional equation can be defined in the same manner. We consider the Klein-Gordon equation defined on a one-dimensional spatial domain with initial conditions , and a periodic boundary condition.
Before we present our numerical methods, we introduce the important notations that we will need later. We use to denote the -Sobolev space of order m whose equipped norm is represented by . We use instead of , when , and its corresponding norm is denoted by . Similarly, we use to represent the -Sobolev space of order m whose equipped norm is denoted by . When , we simply use to denote the norm. Suppose we partition the spatial domain I into N subintervals, each of which is denoted by for . Let be the endpoints of these subintervals, and for all j. For each j, let be the midpoint of each subinterval . The mesh size is given by , where . We define a piecewise polynomial space: , where is the space of polynomials of degree at most k. Note that the continuity of any function in is not required. For , we define and . We use and to denote the average and jump at , respectively.
In order to define local discontinuous Galerkin methods, we rewrite Equation (3) using an auxiliary variable q. Therefore, we have a system given by and . Our local discontinuous Galerkin methods for such a system can be defined as the following. We look for and , such that
for any . Here, is the so-called numerical flux which depends on and . Similarly, depends on and . The choice of numerical fluxes plays a great role in conservation properties, stability and convergence of the numerical schemes. In this paper, we take the following numerical fluxes
Alternatively, one can also choose , .
2.2. Conservation Properties
In this subsection, we show the conservation properties of our semi-discrete schemes (4) and (5). The energy and linear momentum of the Klein-Gordon equation are given by and , respectively. In the PDE level, the energy and linear momentum of the Klein-Gordon equation are conserved. Our numerical scheme also satisfies the conservation properties.
Theorem 1.
Proof.
Let and in our semi-discrete scheme (4). We then sum over all the subintervals and obtain
Here, we have used the periodic boundary condition of in the equation above. Next, we take a time derivative on both sides of Equation (5). We then let and and take the sum over all the subintervals . We can obtain
Here, we have used the periodic boundary condition of . We take the sum of Equations (8) and (9) and get the following equation:
It is easy to see that the equation above leads to the energy conservation Equation (7), and this concludes the proof. ☐
Theorem 1 shows the energy conserving property of our numerical schemes. A direct conclusion of Theorem 1 is that , where C is a constant that depends only on the initial data , and . Therefore, we have the following estimates: , and , which implies the stability of our schemes. We then present the conservation property of linear momentum.
Theorem 2.
Proof.
Let and in (4) and sum over all , we have
Let in (5) and we sum over all , we can get
We then take a t derivative on both sides of Equation (5), sum over all subintervals , and let , we have
Remark 1.
Theorem 2 shows that the linear momentum is conserved up to some combination of interior jumps of , and . In fact, both the linear momentum and energy can be conserved exactly, if we choose central fluxes in schemes (4) and (5), i.e., and for all j. This can be proved using the equalities and for . However, such a choice of numerical fluxes would lead to sub-optimal orders of convergence. That is, when we use piecewise-defined polynomials of degree k, the errors of u, q and are only of order k, instead of as in Theorem 3. In order to obtain the optimal accuracy, we choose alternating fluxes given by Equation (6).
2.3. Error Estimates
In this subsection, we present the error estimates of our semi-discrete schemes. Let u be the exact solution of the Klein-Gordon (3) and . We denote the error of u and q by and , respectively, where and are the numerical solutions to the semi-discrete schemes (4) and (5) with numerical flux (6). We then define the Gauss-Radau projections, denoted by and , as follows. For any function , the Gauss-Radau projection of v, i.e., , is a unique function in , such that
for any . Another kind of Gauss-Radau projection, , can be defined similarly. That is, , is a unique function in , such that
for all j. Since the standard projection will also be needed, we give its definition below. The projection of v, denoted by , is a unique function in , such that
Both Gauss-Radau and standard projections satisfy the following approximation properties. For any function , there exists a positive constant C such that
where can be , or . Here, C depends on when or , and it depends on when . Moreover, C is independent of h. Using Gauss-Radau projections, we can rewrite , where and . We also rewrite , where and . Based on the approximation property (19), we know that and , and are independent of the scheme.
Now, we are ready to present the error estimates of our semi-discrete schemes.
Theorem 3.
(Error Estimates) Let and be the numerical solutions to the schemes (4) and (5) with numerical flux (6), and u and q be the exact solutions to the Klein-Gordon Equation (3). If we take and , then the following error estimates hold:
where C is a positive constant that depends on t and exact solution, and is independent of the mesh size h.
Proof.
It is easy to show that the exact solution u and q also satisfy similar equations:
Note that we have used for any , as well as the fact that , due to the definition of Gauss-Radau projection. Similarly, subtracting (23) from (21), one can get
since .
Applying Cauchy-Schwartz inequality and the approximation property (19) to the formulation of , we can show that . In addition, due to the periodic boundary condition, we have
Combining the estimates about and , Equation (26) leads to
Therefore, we have
We integrate the equation above over time to obtain
Next, we estimate , and . Since , we have which leads to . In addition, . In order to estimate , we consider (5) at and get
Here, we have used the fact that . Since , Equation (33) leads to for any . Let , we have
which leads to . Combining all the estimates above, we have
Therefore, we obtain the error estimate of u as follows: . The error estimate of q can be obtained in the same manner. ☐
3. Superconvergence of Local Discontinuous Galerkin Discretization
In this section, we discuss the superconvergence property of our semi-discrete schemes. Before we present the main theorem, we give some important lemmas that will be used in the proof of the main theorem.
Lemma 1.
For any , let , where is a constant and for any fixed t. Let , and , , for . Then, the norm of the function satisfies the following inequality
Proof.
It is easy to show that (5) leads to
Here, we have used the fact that and . By applying integration by parts to the term , we can rewrite Equation (37) as
We then take in (38) to obtain
Since , we get
Thus,
Let be a piecewise linear polynomial on I, and on each subinterval . It is easy to show . Therefore, Equation (42) leads to
We cancel the term in the inequality above, and applying Theorem 3 to the resulting inequality, we can eventually get
☐
For convenience, let be any fixed time, we define , , , , and . Based on these definitions, we have the following estimate.
Lemma 2.
For any , let , where is a constant and for any fixed t. Letting , and , , for . Then, the norm of the function satisfies the following inequality:
Proof.
It is easy to show that (4) leads to
Here, we have used the fact that and . By applying integration by parts to the term , we can rewrite Equation (46) as
We then take time integral from t to to obtain
Let in (48), we have and
Since , we get
Thus,
Let be a piecewise linear polynomial on I, and on each subinterval . It is easy to show . Therefore, Equation (42) leads to
One can show that Theorem 3 leads to , , . Note that the constant C in this inequality also depends on t and . We then cancel the term in (52), and apply the estimates about , and to the resulting inequality, we can eventually get
☐
The next lemma provides some important estimates which will be used in the proof of superconvergence.
Lemma 3.
The following inequalities are satisfied
Proof.
We first consider (54). Let be a piecewise linear function such that when , for . Thus, . From Lemma 2, we obtain
Here, we used the fact that in the first equality above, and applied Lemma 1 in the last inequality above. This completes the proof of (54).
Next, we consider . Due to the definition of , we know and . In addition noting that , we thus have
Note that the last inequality in (57) is based on the estimates about and from Lemma 2, as well as the approximation property about and . ☐
Now, we are ready to present the main theorem about the superconvergence property of our scheme.
Theorem 4.
(Superconvergence) Let and be the numerical solutions to the schemes (4) and (5) with numerical flux (6), and u and q be the exact solutions to the Klein-Gordon Equation (3). If we take and , then the following error estimates hold:
where C is a positive constant that depends on t and the exact solution, and is independent from the mesh size h.
Proof.
From Equation (24), we get
By rewriting as , the equation above leads to
We take in the equality above and recall which implies ; thus, we can obtain
From Equation (5), we can show
Note that
Since and , Equation (62) leads to
We take the time integral from 0 to in the equation above, and get the following equation
Here, we have used the fact that , . The first two terms on the right side of Equation (64) can be estimated using Lemma 3. That is, . Since , there is . In addition, implies since . To sum up, Equation (64) becomes
Such an inequality indicates for any fixed , which concludes the proof of this theorem. ☐
4. Time Discretizations
In Section 2 and Section 3, we have defined our semi-discrete schemes and presented some conservation properties, error estimates and superconvergence properties. Here, we complete the definition of our fully-discrete schemes by providing two methods of time discretizations. That is, we consider explicit and implicit time discretizations for (4) and (5) as follows:
- Scheme 1:For , we look for , , such thatfor any .
- Scheme 2:For , we look for , , such thatfor any .
Here, and represent the numerical solutions at time , where is the time step. The initialization for both schemes is given as follows:
Note that Scheme 1 and Scheme 2 are explicit and implicit schemes, respectively. The property of both schemes are given in the following theorem.
Theorem 5.
Proof.
We first prove the result for Scheme 1. We rewrite Scheme 1 as
Let and in the equations above, and we take the sum of the resulting equations to get
Next, we consider the result for Scheme 2. We rewrite Scheme 2 as
Let and in the equations above, we can further derive
since
Remark 2.
Equation (68) implies the conservation of total energy in the fully-discrete sense. Here, is an approximation of , is an approximation of , and approximates .
5. Numerical Experiments
In this section, we demonstrate the theoretical findings in Section 2 and Section 3, including the optimal convergence rates of and , the superconvergence property of , and conservation properties of our scheme, by some numerical tests. We consider the following initial-boundary value problem:
The exact solution to the initial-boundary value problem is . We apply scheme 1 defined in Section 4 to solve the problem. The numerical results by scheme 2 in Section 4 are similar, and thus we skip the discussion.
We first estimate the convergence rates of , and . In these numerical experiments, we use a uniform grid with for various N. In order to observe the convergence order in space, we choose the time step size so that the error in space dominates. We compute the numerical solutions at using basis with . To estimate the convergence rate of , we take different values of h and compute . Suppose has a convergence rate of r, i.e., where C is a positive constant; then, . We use several points of with different h to fit a straight line whose slope is an approximation of the convergence rate r. The convergence rates of and can be obtained in the same manner. In Figure 1, we present the error of and in norm when we use basis. The empty circles represent the discrete numerical results and each red straight line represents the linear least square fitting of the empty circles. Figure 1a shows that the convergence rate of is approximately , which is consistent with the optimal convergence rate, i.e., with , as proved in Section 2. In addition, the results from Figure 1b verifies the convergence rate of 2 for . As for the convergence rate of , it is actually greater than . Similarly, from Figure 2 and Figure 3, we can observe the convergence rates of for and when and basis are used. Figure 2c shows that has the convergence rate of approximately 4 when we use basis, which indicates the order of convergence with . Figure 3c gives the convergence rate for the case of basis. We can see that is convergent at the rate of , which is a little over with . Based on the numerical results in Figure 1, Figure 2 and Figure 3, as well as the discussion above, we can draw the conclusion that our numerical results coincide with our rigorous proof about error estimates and the superconvergence property.
Figure 1.
versus , where E is the L2 error at T = 0.5 with P1 basis.
Figure 2.
versus , where E is the L2 error at T = 0.5 with P2 basis.
Figure 3.
versus , where E is the L2 error at T = 0.5 with P3 basis.
Next, we check the conservation properties of our schemes using a simulation over a long time. As indicated by Theorems 1 and 2 in Section 2.2, and Theorem 5 in Section 4, the conservation properties of energy and linear momentum are independent of the degree of polynomials. Here, we only present the long time simulation when basis is used. We still consider the initial-boundary value problem (73)–(75). We choose , and run the simulation up to . Using the exact solution , we can show that the linear momentum for all t. Numerically, we approximate the linear momentum using the discrete form of . That is, we compute for , and present the time history of the error in linear momentum in Figure 4b. We can observe that the error oscillates from to , and the magnitude of oscillations increase up to and then decrease from all the way to . Overall, the linear momentum is conserved up to the magnitude of . Theorem 2 implies that the rate of change for linear momentum depends on some jumps at interior interfaces, and the semi-discrete form of linear momentum is not conserved up to machine epsilon. However, our numerical results indicate that the quantity , although not equal to zero analytically, is not far away from machine epsilon numerically. Therefore, we can observe the conservation of linear momentum numerically. As for the conservation of total energy, we compute the discrete form of energy using for . Figure 4a shows the error in the total energy. We can observe that the total energy is conserved up to the magnitude of . Therefore, we have verified the energy conservation and linear momentum conservation through the numerical experiments.
Figure 4.
Time history of the error in the total energy and linear momentum with P2 basis and h = 0.1. (left) error in the total energy; (right) error in the linear momentum.
6. Conclusions
In this paper, high-order energy and linear momentum conserving methods are proposed for the Klein-Gordon equation. Our numerical methods are based on the local discontinuous Galerkin methods. By choosing alternating numerical fluxes (6), we can prove that the total energy of the equation is exactly conserved and the linear momentum is conserved up to some terms at element interface. Results from long time numerical simulations (up to ) indicate that the linear momentum is conserved up to the magnitude of . Moreover, such a choice of numerical fluxes leads to optimal convergence order of , and , and the superconvergence property. It is important to mention that the schemes proposed in this paper can be directly generalized to the Klein-Gordon equation with external potential. Moreover, the results from this paper shed light on the design of high-order structure-preserving methods for nonlinear coupling systems involving the Klein-Gordon equation, for example, the Klein-Gordon-Schrödinger equations and the Klein-Gordon-Zakharov equations, which is currently under investigation.
Acknowledgments
The author acknowledges the support from Augusta University. The author would also like to thank three anonymous reviewers for their insightful and constructive comments, which help to improve the quality of this paper.
Conflicts of Interest
The author declares no conflict of interest.
References
- Ablowitz, M.J.; Kruskal, M.D.; Ladik, J.F. Solitary wave collisions. SIAM J. Appl. Math. 1979, 36, 428–437. [Google Scholar] [CrossRef]
- Fucito, F.; Marchesoni, F.; Marinari, E.; Parisi, G.; Peliti, L.; Ruffo, S.; Vulpiani, A. Approach to equilibrium in a chain of nonlinear oscillators. J. Phys. 1982, 43, 707–713. [Google Scholar] [CrossRef]
- Han, H.; Zhang, Z. Split local absorbing conditions for one-dimensional nonlinear Klein-Gordon equation on unbounded domain. J. Comput. Phys. 2008, 227, 8992–9004. [Google Scholar] [CrossRef]
- Jimenez, S. Comportamiento de Ciertas Cadenas de Osciladores No Lineales. Ph.D. Thesis, Universidad Complutense de Madrid, Madrid, Spain, 1988. [Google Scholar]
- Kirby, R.C.; Kieu, T. Galerkin finite element methods for nonlinear Klein-Gordon equations. Math. Comput. 2013. submitted. [Google Scholar]
- Yang, L. Numerical Studies of the Klein-Gordon-Schrödinger Equations. Master’s Thesis, National University Singapore, Singapore, 2006. [Google Scholar]
- Yin, F.; Tian, T.; Song, J.; Zhu, M. Spectral methods using Legendre wavelets for nonlinear Klein/Sine-Gordon equations. J. Comput. Appl. Math. 2005, 275, 321–334. [Google Scholar] [CrossRef]
- Li, S.; Vu-Quoc, L. Finite difference calculus invariant structure of a class of algorithms for the nonlinear Klein-Gordon equation. SIAM J. Numer. Anal. 1995, 32, 1839–1875. [Google Scholar] [CrossRef]
- Cockburn, B.; Hou, S.; Shu, C.W. TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws IV: The multidimensional case. J. Comput. Phys. 1998, 141, 199–224. [Google Scholar] [CrossRef]
- Cockburn, B.; Lin, S.-Y.; Shu, C.-W. TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws III: One dimensional systems. J. Comput. Phys. 1989, 84, 90–113. [Google Scholar] [CrossRef]
- Cockburn, B.; Shu, C.-W. TVB Runge-Kutta local projection discontinuous Galerkin finite element method for scalar conservation laws II: General framework. Math. Comput. 1989, 52, 411–435. [Google Scholar]
- Cockburn, B.; Shu, C.-W. TVB Runge-Kutta local projection discontinuous Galerkin finite element method for scalar conservation laws V: Multidimensional systems. Math. Comput. 1989, 52, 411–435. [Google Scholar]
- Xu, Y.; Shu, C.-W. Local discontinuous Galerkin methods for high-order time-dependent partial differential equations. Commun. Comput. Phys. 2010, 7, 1–46. [Google Scholar]
- Yan, J.; Shu, C.-W. A Local Discontinuous Galerkin Method for KdV-type Equations. SIAM J. Numer. Anal. 2002, 40, 769–791. [Google Scholar] [CrossRef]
- Yan, J.; Shu, C.-W. Local Discontinuous Galerkin Methods for Partial Differential Equations with Higher Order Derivatives. J. Sci. Comput. 2002, 17, 27–47. [Google Scholar] [CrossRef]
- Chou, C.-S.; Sun, W.; Xing, Y.; Yang, H. Local discontinuous Galerkin methods for the Khokhlov-Zabolotskaya-Kuznetzov equation. J. Sci. Comput. 2017, 73, 593–616. [Google Scholar] [CrossRef]
- Levy, D.; Shu, C.-W.; Yan, J. Local discontinuous Galerkin methods for nonlinear dispersive equations. J. Comput. Phys. 2004, 196, 751–772. [Google Scholar] [CrossRef]
- Xing, Y.; Chou, C.-S.; Shu, C.-W. Energy conserving local discontinuous Galerkin methods for wave propagation problems. Inverse Probl. Imaging 2013, 7, 967–986. [Google Scholar] [CrossRef]
- Xu, Y.; Shu, C.-W. Local discontinuous Galerkin methods for two classes of two-dimensional nonlinear wave equations. Phys. D Nonlinear Phenom. 2005, 208, 21–58. [Google Scholar] [CrossRef]
- Cheng, Y.; Christlieb, A.J.; Zhong, X. Energy-conserving discontinuous Galerkin methods for the Vlasov-Maxwell system. J. Comput. Phys. 2014, 279, 145–173. [Google Scholar] [CrossRef]
- Yang, H.; Li, F. Discontinuous Galerkin methods for relativistic Vlasov-Maxwell system. J. Sci. Comput. 2017, 73, 1216–1248. [Google Scholar] [CrossRef]
© 2018 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).