Constructive a priori error estimates for a full discrete approximation of periodic solutions for the heat equation
Takuma Kimura, Teruya Minamoto, Mitsuhiro T. Nakao

TL;DR
This paper develops constructive a priori error estimates for a fully discrete numerical method solving the heat equation with periodic boundary conditions, enhancing the understanding of solution accuracy.
Contribution
It introduces new a priori error estimates specifically tailored for full discrete approximations of periodic heat equation solutions.
Findings
Provides rigorous error bounds for the numerical scheme.
Demonstrates the effectiveness of the estimates through analysis.
Improves reliability of numerical simulations for periodic heat problems.
Abstract
We consider the constructive a priori error estimates for a full discrete numerical solution of the heat equation with time-periodic condition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Constructive a priori error estimates for a full discrete approximation of periodic solutions for the heat equation
Takuma Kimura
Teruya Minamoto
Mitsuhiro T. Nakao
Department of Information Science, Saga University, Saga 840-8502, Japan
Faculty of Science and Engineering, Waseda University, Tokyo 169-8555, Japan
Abstract
We consider the constructive a priori error estimates for a full discrete numerical solution of the heat equation with time-periodic condition. Our numerical scheme is based on the finite element semidiscretization in space direction combining with an interpolation in time by using the fundamental matrix for the semidiscretized problem. We derive the optimal order and error estimates, which play an important role in the numerical verification method of exact solutions for the nonlinear parabolic equations. Several numeriacl examples which confirm us the optimal rate of convergence are presented.
keywords:
Parabolic problem; Periodic solutions; Finite element method; Constructive a priori error estimates
MSC:
35B10 , 35K05 , 65M15 , 65M60
1 Introduction
Many works have been done concerning the error estimates for the approximate solutions of linear parabolic initial boundary value problems. Particularly, in [4], [2], they treated the time-periodic problems of the heat equation. On the other hand, recently, there are many results on the numerical enclosing the closed orbits corresponding to the periodic solutions by mainly using spectral techniques, [12],[3] etc., as part of the study in dynamical systems. In their works, the spectral properties for the simple operator restricted to the rectangular domains are effectively used. In the present paper, we consider the finite element approach instead the spectral method. Such a technique seems to be more complicated and the error estimates are not so easy compared with spectral method. But, there is no limit to the shape of the domain at all. The method we describe here basically extends the results of the previous paper [7] to the time-periodic problem of a heat equation.
In the followings, we use the time-dependent Sobolev spaces with associated norms of the form . For example, , then
[TABLE]
also use the notation such that for short and so on. For other notations and properties of function spaces, see e.g. [1], [11].
2 Problem and basic properties
In this section, we introduce the time-periodic problem and give the basic properties of the solution.
We consider the following heat equation with time-periodic condition:
[TABLE]
where is a positive constant, and a convex polygonal or polyhedral domains. Also we define and assume that . On the existence and uniqueness of solution for (1), see e.g. [1], [11].
Now, for any and , we define the evolution operator as a solution of the following equation. Namely, satisfies
[TABLE]
Next, consider the solution satisfying the following parabolic problem with homogeneous initial condition
[TABLE]
Then note that by using the notation in semigroup theory, e.g., [8], we can rewrite (3) as follows:
[TABLE]
Taking notice that, using a solution of (2) for an appropriately chosen initial function and in (3), the solution of (1) can be represented as . Namely, we have
[TABLE]
Now, by the well known arguments using spectral theory in [1] or semigroup approches in [8], for the minimal eigenvalue of on , it holds that for the spaces or
[TABLE]
where . Then, from the periodic condition, we have by (4)
[TABLE]
Hence, from the contraction property of due to the estimates (5), the invertibility of the operator follows and the initial value is determined by
[TABLE]
Furthermore, by the fact that is a solution of (3), it is readily seen that, by (5) and (7) (cf. in the proof of Lemma 4.2 of [7]):
[TABLE]
where is a Poincaré constant on . Also, if we use the fact that and the estimates (Lemma 4.2 in [7]), we have another estimates as follows:
[TABLE]
By the similar arguments, from (5), (7) and the following estimates (cf. in the proof of Lemma 4.1 of [7])
[TABLE]
we have the bound for as
[TABLE]
The following lemma can be similarly obtained.
Lemma 2.1**.**
For the solution of (1), it holds that
[TABLE]
Proof. As in the proof of Lemma 4.1 in [7] we have
[TABLE]
Integrating this on , by taking notice of the periodic condition, yields (11).
Similarly, from the proof of Lemma 4.2 in [7] we get
[TABLE]
which proves (12) by combining with the estimates (9).
3 Semidiscrete approximation
In the present section, we define the semidiscrete approximation by the finite element method and derive the constructive error estimates. These results play important and essential roles in the error estimates for a full-discretization of the problem (1).
Let be a finite dimensional subspace in spatial direction with and let be a piecewise linear Lagrange type finite element space in time direction with . Also define V:=H^{1}\bigl{(}J;L^{2}(\Omega)\bigr{)}\cap L^{2}\bigl{(}J;H_{0}^{1}(\Omega)\bigr{)}\cap\{u~{}|~{}u(0)=u(T)\;\text{in}\;H_{0}^{1}(\Omega)\}.
Now, let be an -projection satisfying
[TABLE]
with the following assumptions on the approximation property:
[TABLE]
Here C.
Now, we define the semidiscrete projection P_{h}:V\to H^{1}\bigl{(}J;S_{h}(\Omega)\bigr{)}\equiv V^{1}\bigl{(}J;S_{h}(\Omega)\bigr{)}\cap\{v_{h}(0)=v_{h}(T)\} by the following weak form:
[TABLE]
Note that implies the semidiscrete approximation of a solution for (1) with given function . Therefore, we denote by , i.e., in the below.
Next we consider the constructive error estimates for defined by (18).
For any and , we define the semidiscrete evolutional operator by the solution \phi_{h}\in H^{1}\bigl{(}(0,t);S_{h}(\Omega)\bigr{)} of the following equation. Namely, corresponds to a semidiscretization of the solution defined by (2).
[TABLE]
Here, means the discretization of a weak Laplacian on and (19a) is equivalent to the following variational form:
[TABLE]
Similarly, as an semidiscretization for (3), we consider a solution \psi_{h}\in H^{1}\bigl{(}(0,t);S_{h}(\Omega)\bigr{)} of the following equation
[TABLE]
where means the -projection of to . Also by using the similar symbol and arguments as in the previous section we get the following expression:
[TABLE]
Here, note that we can numerically compute the norm by matrix norm computations to confirm it is actually less than one, namely, contraction map on . On the actual estimation of , see Remark 4.1 in the next section. And we can also compute the following inverse operator norm for
[TABLE]
Thus, from the definition and discrete analog to the previous section, we have and obtain the following estimates:
[TABLE]
Now, in order to get the error estimates for the semidisctrete approximation defined by (18) or equivalently by (22) for the problem (1), first we consider the constructive error estimates for the semidiscretization of the nonhomogeneous parabolic initial boundary value problem with initial condition of the form :
[TABLE]
Let be a semidiscrete approximation of (25) given by the following weak form:
[TABLE]
Here, is an appropriate approximation of . Then we have the following estimates for solutions of (25) and (26).
Lemma 3.1**.**
[TABLE]
Proof. @These results are obtained by the similar arguments to that in the proofs for Lemma 4.1-4.4 in [7] with some additional considerations.
First, by the same argument to derive (13), we have
[TABLE]
which implies (27). Next, by the similar manner of getting (14) in the proof of Lemma 2.1, we have
[TABLE]
Thus integrating both sides in yields the estimates (28).
We now take for in (26a) and integrate it in , we have
[TABLE]
which proves the assertion (29). Finally, the estimates (30) can be easily derived by the argument analogous to proving (28).
Also, setting , we obtain the following two kinds of error estimates, which are obtained similar arguments in the proof of Theorem 4.6 in [7].
Theorem 3.2**.**
The following estimates for hold:
[TABLE]
also -estimates at ,
[TABLE]
Proof. Applying the same arguments in the proof of Theorem 4.6 in [7], we have
[TABLE]
Integrating this on , from (31) and (32), we get
[TABLE]
which yields the desired conclusions (33) and (34).
4 Full-discrete approximation and error estimates
In this section, we define the full-discrete approximation of solutions for the problem (1) by using an interpolation procedure in time direction for the spatial discretized solution. We also show a computational scheme for this full discretization by the effective use of the fundamental matrix for an ODE system corresponding to semidiscretized problem. The constructive and optimal order and error estimates are established, which are main results in the present paper.
4.1 A full discretizaion scheme
Now, defining the interpolation operator in time direction by
[TABLE]
we define the full discrete projection P_{h}^{k}:V\to V_{k}^{1}\bigl{(}J;S_{h}(\Omega)\bigr{)}\equiv S_{h}\otimes V_{k}^{1} as
[TABLE]
which corresponds to the full discretization of (1).
In order to present the actual computation procedure of the above full discretization scheme, we first consider a representation of the semidiscretization defined in (18). Let be a basis of and define the matrices , by
[TABLE]
respectively. Since they are symmetric and positive definite, we get the Cholesky decomposition as and , respectively. Also note that there exists a vector valued function satisfying
[TABLE]
where .
Thus by using Cthe semidiscretization (18) is equivalently presented as ODEs:
[TABLE]
where with For simplicity we denote as . Then note that using the fundamental matrix of the equation (37a), we can represent (37) as
[TABLE]
Therefore, assuming that the invertibility of Cfrom (38a) Cwe have
[TABLE]
which yields the following expression of the solution of (38) F
[TABLE]
Hence, we obtain
[TABLE]
Thus the full discrete approximation for the solution of (1) can be numerically computed by using this procedure.
Remark 4.1:
For any , using the definition (36), by some simple consideration on the norm for the element , we have readily seen that
[TABLE]
where means the matrix 2-norm. This immediately yields the estimate of in (23).
4.2 error estimates
In this subsecton, we present an error estimate in the sense on for the full discretization (35). Denoting again the semidiscrete projection defined in (18) as , the semidiscrete approximation for (1) is written by
[TABLE]
In order to obtain the desired estimates, we use the following decomposition
[TABLE]
The second term of the above is estimated by using the standard interpolation estimates, e.g., [10], we have from (29) and (24)
[TABLE]
Furthermore, using an inverse estimation constant , which makes possible to bound the norm by the norm in , we get
[TABLE]
Note that using the definition of the operator , we have by (40)
[TABLE]
Therefore, using defined by (3), we have
[TABLE]
which implies
[TABLE]
Note that, for any , setting
[TABLE]
[TABLE]
then and are solutions corresponding to (25) and (26), respectively.
Hence, setting , the right-hand side of (45) coincides with . Therefore, we have
[TABLE]
By the argument in the section 2, we have the following estimates
[TABLE]
Next, applying the error estimates (34) in Theorem 3.2 with taking notice of , by using (24) we have
[TABLE]
Therefore, from (46)-(48), we obtain
[TABLE]
where
[TABLE]
On the other hand, we have by (33) in Theorem 3.2
[TABLE]
Thus, from the estimates (10), (24) and (49), we obtain the following estimation for the semidiscrete solution:
[TABLE]
where we set as
[TABLE]
Combining (43) and (51) with (41), we have the following desired error estimates.
Theorem 4.1**.**
Let be a full-discrete approximation defined by (35) for the periodic solution of the heat equation (1). Then, it holds that
[TABLE]
Here, the constant is defined in (51).
4.3 error estimates
In this subsection, we consider the error estimates in the sense for the full-discrete approximation , which enable us higher order estimates than the error bound in Theorem 4.1. As in the previous subsection, we use a semidiscrete approximation with decomposition (41). Note that, if we take as , then by applying the estimates (42), we immediately obtain estimates for the latter term in (41). Hence, it suffices to derive the estimates for the former part.
Theorem 4.2**.**
It holds that
[TABLE]
where is the same constant defined in the estimates (51).
Proof. @For any function , where , let be a solution of (1) with the right-hand side . Here, is a variable such that . Then satisfies the following weak form:
[TABLE]
Particularly, taking in (54) and transform the variable as , we have
[TABLE]
Integrating both sides of the above in on yields that
[TABLE]
Taking notice of the periodic condition, observe that
[TABLE]
Therefore, by the definition of and (55) we have for any
[TABLE]
Moreover, by the similar derivation process of (42) using (29) in the previous subsection and Lemma 2.1, we obtain
[TABLE]
Furthermore, for any , taking to apply the approximation properties (16) and (17), by considering the estimates in Lemma 2.1, we have
[TABLE]
and
[TABLE]
Therefore, combining (57)-(59) with (51), we have the estimates
[TABLE]
which proves the theorem by (42).
5 Numerical examples
In this section, we show several numerical examples which confirm us the optimal rate of convergence. We used the interval arithmetic toolbox INTLAB 11 [9] with MATLAB R2012a on an Intel Xeon W2155 (3.30 GHz) with CentOS 7.4.
Here, we only consider , and , then the lower bound of eigenvalue of on can be taken as . Furthermore, we set to be the problem (1) have the exact solution . Here, is a given constant. Since the exact solutions are known, the upper bounds of the exact errors for approximate solutions can be validated in the a posteriori sense.
We used the finite dimensional subspaces and spanned by piecewise linear basis functions with uniform mesh size and , respectively. Therefore, the constants can be taken as , , , and , respectively. We set then Theorem 4.1 and 4.2 are and error estimates . In Figure 1-2, the a priori error estimates and the exact errors of this example are shown. These Figures show the estimates presented in Theorem 4.1-4.2 give the optimal order estimates.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Barbu, Partial differential equations and boundary value problems, Kluwer Academic Publishers, the Netherland , 1998.
- 2[2] C. Bernardi, Numerical approximation of a periodic linear parabolic problem, SIAM Journal on Numerial Analysis, 19 (1982), 1196-1207.
- 3[3] J.-L. Figueras, M. Gameiro, J.-P. Lessard and R. de la Llave. A framework for the numerical computation and a posteriori verification of invariant objects of evolution equations. SIAM Journal on Applied Dynamical Systems 16(2), 1070-1088, 2017.
- 4[4] A. Hansbo, Error estimates for the numerical solution of a time-periodic linear parabolic problem, BIT 31, 664-685, 1991.
- 5[5] M.T. Nakao, T. Kinoshita and T. Kimura: On a posteriori estimates of inverse operators for linear parabolic initial-boundary value problems, Computing , 94, 151-162, 2012.
- 6[6] M.T. Nakao, K. Hashimoto, Y. Watanabe: A numerical method to verify the invertibility of linear elliptic operators with applications to nonlinear problems, Computing , 75, 1–14, 2005.
- 7[7] M. T. Nakao, T. Kimura, T. Kinoshita, Constructive a priori error estimates for a full discrete approximation of the heat equation, SIAM Journal on Numerial Analysis, 51 (2013), 1525-1541.
- 8[8] A.Pazy, Semigroups of Linear Operators and Applications to Partial Differential Equations, Springer, New York , 1983.
