Next Article in Journal
Numerical Solutions of Variable-Coefficient Fractional-in-Space KdV Equation with the Caputo Fractional Derivative
Next Article in Special Issue
Understanding Dynamics and Bifurcation Control Mechanism for a Fractional-Order Delayed Duopoly Game Model in Insurance Market
Previous Article in Journal
Macro- and Micromechanical Assessment of the Influence of Non-Plastic Fines and Stress Anisotropy on the Dynamic Shear Modulus of Binary Mixtures
Previous Article in Special Issue
Power Law Kernel Analysis of MHD Maxwell Fluid with Ramped Boundary Conditions: Transport Phenomena Solutions Based on Special Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Analysis of Local Discontinuous Galerkin Method for the Time-Fractional Fourth-Order Equation with Initial Singularity

School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, China
Fractal Fract. 2022, 6(4), 206; https://doi.org/10.3390/fractalfract6040206
Submission received: 7 March 2022 / Revised: 30 March 2022 / Accepted: 31 March 2022 / Published: 7 April 2022
(This article belongs to the Special Issue Fractional Dynamics 2021)

Abstract

:
In this paper, efficient methods seeking the numerical solution of a time-fractional fourth-order differential equation with Caputo’s derivative are derived. The solution of such a problem has a weak singularity near the initial time t = 0 . The Caputo time-fractional derivative with derivative order α ( 0 , 1 ) is discretized by the well-known L1 formula on nonuniform meshes; for the spatial derivative, the local discontinuous Galerkin (LDG) finite element method is used. Based on the discrete fractional Gronwall’s inequality, we prove the stability of the proposed scheme and the optimal error estimate for the solution, i.e., ( 2 α ) -order accurate in time and ( k + 1 ) -order accurate in space, when piece-wise polynomials of degree at most k are used. Moreover, a second-order and nonuniform time-stepping scheme is developed for the fractional model. The scheme uses the L 2 - 1 σ formula for the time fractional derivative and the LDG method for the space approximation. The stability and temporal optimal second-order convergence of the scheme are also shown. Finally, some numerical experiments are presented to confirm the theoretical results.

1. Introduction

In this paper, we consider the local discontinuous Galerkin (LDG) finite element method for the following time-fractional fourth-order problem with periodic boundary condition
C D 0 , t α u + c 1 u x + c 2 u x x + c 3 u x x x + c 4 u x x x x = f ( x , t ) , ( x , t ) D = ( 0 , L ) × ( 0 , T ] , u ( x , 0 ) = u 0 ( x ) , x Ω = ( 0 , L ) ,
where c 1 , c 2 , c 3 and c 4 > 0 are arbitrary constants. Without loss of generality, we assume that c 1 > 0 and c 3 > 0 ; however, we do not require the sign of c 2 to be positive or negative. The source term f ( x , t ) and the initial value u 0 ( x ) are given functions. The term C D 0 , t α u represents the Caputo fractional derivative of order α ( 0 < α < 1 ) with respect to t, which is [1,2],
C D 0 , t α u ( x , t ) = 0 t ω 1 α ( t s ) s u ( x , s ) d s with ω β ( t ) = t β 1 / Γ ( β ) ,
in which the operator s denotes the partial derivative with respect to s, and Γ ( · ) is the usual gamma function.
Time-fractional partial differential equations with fourth-order spatial derivatives have been widely used in various fields, such as bridge slabs, airplane wings, floor system and window glass (e.g., [2,3,4,5]). On the assumption that the analytical solution is sufficiently smooth, many numerical methods have been devised for this kind of problem. In [6], a fully discrete LDG scheme was proposed to solve the time-fractional fourth-order equation and was proven to be stable and convergent with order O ( τ α h k + 1 + τ 2 α + τ α / 2 h k + 1 / 2 + h k + 1 ) , where k is the degree of piece-wise polynomial, and τ and h are the temporal and spatial stepsizes, respectively.
Soon after, Guo et al. [7] showed that the order of convergence for the LDG method presented in [6] can be improved to the optimal order O ( τ 2 α + h k + 1 ) . Liu et al. [8] presented a mixed finite element method for the time-fractional fourth-order problem, and the stability as well as the convergence were proven. Zhang and Pu [9] solved the fourth-order fractional sub-diffusion equation by applying the L 2 - 1 σ formula for the time variable and employing a compact operator to approximate the spatial fourth-order derivative. The unconditional stability and convergence were proven using the discrete energy method.
Cui [10] studied the convergence of a compact finite difference scheme for the time-fractional fourth-order equation. Fei and Huang [11] analyzed the Galerkin–Legendre spectral method for the distributed-order time-fractional fourth-order partial differential equation. In [12], a space-time spectral-Galerkin method was presented for the fourth-order time-fractional partial integro-differential equation with a weakly singular kernel.
Note that, in most of the numerical methods mentioned above, the convergence analysis requires that solution u of problem (1) be smooth enough with respect to t, and then the expected accuracy can be achieved. However, from a practical application point of view, this requirement is unrealistic, because the solution u of a time-fractional differential equation usually exhibits a weak initial singularity, that is, t u ( x , t ) and /or t 2 u ( x , t ) blows up as t 0 + , although u ( x , t ) is continuous on [ 0 , T ] , see, e.g., [13,14,15,16,17,18,19,20,21,22]. However, to the authors’ knowledge, there is little discussion on numerical methods and related numerical analysis that take into account the possible initial singularity of time-fractional fourth-order problems (1).
The main objective of this paper is to study two types of time discretization schemes combined with the LDG method in the spatial direction for solving problem (1) with an initial singularity. The first scheme is to approximate the Caputo time-fractional derivative with the L1 formula on nonuniform meshes, to discretize the spatial derivative with the LDG method, and then a fully discrete numerical scheme is obtained. With the help of the discrete fractional Gronwall inequality, we show that the scheme is numerically stable and yields the optimal error estimate (i.e., ( 2 α ) th-order accurate in time and ( k + 1 ) th-order accurate in space when piece-wise polynomials of up to k are used).
However, no matter how the mesh is divided, the accuracy of this approach in the time direction is at most ( 2 α ) . In order to construct a numerical scheme with higher accuracy in the time direction, we consider another formula to discretize the Caputo time-fractional derivative, namely the L 2 - 1 σ formula, while, in the spatial direction, we still use the LDG method to approximate it. This method is then shown to be stable and convergent and to achieve second-order accuracy in the time direction.
The rest of the paper is organized as follows. In Section 2, we introduce some notations, definitions and projections that will be used in the following numerical analysis. Furthermore, the semi-discrete LDG scheme is presented in this section. In Section 3, a fully discrete numerical scheme based on the L1 formula in the time direction and the LDG method in the spatial direction is proposed for the time-fractional fourth-order Equation (1), and its stability analysis and error estimate are rigorously discussed. In Section 4, a higher-order numerical scheme is constructed, and the stability and convergence of the scheme are likewise demonstrated. In Section 5, numerical examples are provided to illustrate the theoretical statements. The last section includes some concluding remarks.

2. Preliminaries

Let us start by presenting the notations, definitions and projections used in this paper.

2.1. Tessellation and Function Space

Let T h = { I j = ( x j 1 2 , x j + 1 2 ) } j = 1 N be the partition of Ω , where x 1 2 = 0 and x N + 1 2 = L are the two boundary endpoints. For each cell I j , the cell center and cell length are denoted by x j = ( x j 1 2 + x j + 1 2 ) / 2 and h j = x j + 1 2 x j 1 2 , respectively. We use h = max j h j to denote the length of the largest cell. Throughout this paper, it is assumed that T h is a quasi-uniform mesh; namely, there exists a fixed positive constant ρ independent of h such that ρ h h j h for any j = 1 , , N , when h goes to zero. Define the finite element space
V h = v L 2 ( Ω ) : v | I j P k ( I j ) , j = 1 , , N ,
where P k ( I j ) denotes the space of polynomials of degree no more than k on the cell I j . Note that the functions in this space are allowed to have discontinuities across element interfaces. As usual, we use u j + 1 2 and u j + 1 2 + to represent the left and right limits of u at the cell interface x j + 1 2 , respectively. At each point x j + 1 2 , the jump of a possibly discontinuous function u is denoted as
[ [ u ] ] j + 1 2 = u j + 1 2 + u j + 1 2 .
It is clear that V h belongs to the following broken Sobolev space:
H l ( T h ) = u L 2 ( Ω ) : u | I j H l ( I j ) , j = 1 , , N ,
equipped with the norm u l = u H l ( T h ) = j = 1 N u H l ( I j ) 2 1 2 , where u H l ( I j ) is the standard Sobolev l norm, i.e., u H l ( I j ) = s = 0 l D s u L 2 ( I j ) 2 1 2 . In particular, if l = 0 , we use an unmarked norm · to represent the usual L 2 norm on Ω .
To end this subsection, we list some inverse properties of the finite element space V h . For any v h V h , there exists a positive constants μ independent of v h and h, such that
( v h ) x μ h 1 v h , v h Γ h μ h 1 v h .
Here and below, Γ h is the union of all cell boundary points, and for any w H 1 ( T h ) , the L 2 norm on Γ h is defined by
w Γ h j = 1 N ( w j + 1 2 ) 2 + ( w j 1 2 + ) 2 1 / 2 .

2.2. The Semi-Discrete LDG Scheme

As usual, we first introduce some auxiliary variables approximating various order derivatives of the solution and rewrite Equation (1) into a first-order system,
C D 0 , t α u + c 1 u x + c 2 q x + c 3 p x + c 4 r x = f ,
r = p x ,
p = q x ,
q = u x .
Then, the semi-discrete LDG scheme is as follows: t ( 0 , T ] , find u h , q h , p h , r h V h , such that for any v h , ρ h , ϕ h , ψ h V h and j = 1 , , N , it holds that
I j C D 0 , t α u h v h d x = c 1 H j ( u h , v h ) + c 2 H j + ( q h , v h ) + c 3 H j + ( p h , v h ) + c 4 H j + ( r h , v h ) + I j f v h d x ,
I j r h ρ h d x = H j ( p h , ρ h ) ,
I j p h ϕ h d x = H j + ( q h , ϕ h ) ,
I j q h ψ h d x = H j ( u h , ψ h ) ,
where
H j ± ( v , w ) = I j v w x d x v j + 1 2 ± w j + 1 2 + v j 1 2 ± w j 1 2 + .
Notice that the periodic boundary conditions are considered, i.e., ζ 1 2 = ζ N + 1 2 and ζ 1 2 + = ζ N + 1 2 + for ζ = u h , q h , p h , r h .
Denote, by ( v , w ) = j = 1 N I j v w d x , the inner product in L 2 ( Ω ) . Summing up the variational formulations (5) over j = 1 , 2 , , N , we can write the semi-discrete LDG scheme (5a)–(5d) in the global form: find u h , q h , p h , r h V h , such that for any v h , ρ h , ϕ h , ψ h V h , it holds that
( C D 0 , t α u h , v h ) = H ( φ h ; v h ) + L ( r h , v h ) + ( f , v h ) ,
( r h , ρ h ) = H ( p h , ρ h ) ,
( p h , ϕ h ) = H + ( q h , ϕ h ) ,
( q h , ψ h ) = H ( u h , ψ h ) .
Here, H ± ( v h , w h ) = j = 1 N H j ± ( v h , w h ) , φ h = ( u h , q h , p h ) , and
H ( φ h ; v h ) = c 1 H ( u h , v h ) + c 2 H + ( q h , v h ) + c 3 H + ( p h , v h ) ,
L ( r h , v h ) = c 4 H + ( r h , v h ) .
Using the definitions of the above operators, the following lemmas can be obtained, and the proof is straightforward (refer to [23]).
Lemma 1.
For any v h , w h V h , it holds that
H ± ( v h , v h ) = ± 1 2 [ [ v h ] ] 2 ,
H ( w h , v h ) = H + ( v h , w h ) ,
where [ [ v h ] ] 2 = j = 1 N [ [ v h ] ] j 1 2 2 .
Lemma 2.
Suppose ( u h , q h , p h , r h ) V h × V h × V h × V h satisfy (7b)–(7d), then we have
L ( r h , u h ) = c 4 p h 2 .
Lemma 3.
For any v h , w h V h , it holds that
| H ± ( w h , v h ) | ( w h ) x + μ h 1 [ [ w h ] ] v h ,
| H ± ( w h , v h ) | ( v h ) x + μ h 1 [ [ v h ] ] w h .
Lemma 4.
Suppose ( u h , q h , p h , r h ) V h × V h × V h × V h satisfy (7b)–(7d), then
( u h ) x + μ h 1 [ [ u h ] ] C μ q h ,
( q h ) x + μ h 1 [ [ q h ] ] C μ p h ,
q h 2 u h p h ,
where C μ is a positive constant that is independent of h but may depend on the inverse constant μ.
Lemma 4 presents the important relationships between the primal and auxiliary variables, which are crucial to the stability analysis.

2.3. Projection and Interpolation Property

In what follows, we define the elliptic projection. For any function u, q = u x , p = q x , and r = p x , the elliptic projection is the unique solution ( U h , Q h , P h , R h ) V h × V h × V h × V h such that, for any v h , ρ h , ϕ h , ψ h V h ,
L ( R h , v h ) = L ( r , v h ) ,
( R h , ρ h ) = H ( P h , ρ h ) ,
( P h , ϕ h ) = H + ( Q h , ϕ h ) ,
( Q h , ψ h ) = H ( U h , ψ h ) .
In addition, since u h is determined as an additive constant in the elliptic problem with periodic boundary conditions, to ensure that (12a)–(12d) is well-defined, we assume [24]
( u U h , 1 ) = 0 .
By referring to Lemma 4.2 in [23], it can be found that the elliptic projection defined above exists uniquely and satisfies the following approximation properties.
Lemma 5.
For any function u, q = u x , p = q x , r = p x with the smoothness assumption
u k + 1 + q k + 1 + p k + 1 + r k + 1 C .
Let U h , Q h , P h , R h V h be the elliptic projection (12), we have
u U h + q Q h + p P h + r R h C h k + 1 ,
where C is a constant depending on the regularity of u but is independent of h.

3. Nonuniform L1–LDG Scheme

In this section, we propose a fully discrete numerical scheme to solve the time-fractional fourth-order Equation (1), hereafter referred to as the nonuniform L1–LDG scheme, which discretizes the Caputo time-fractional derivative using the L1 formula on nonuniform meshes and the LDG method to discretize the spatial derivative.

3.1. The Fully Discrete Numerical Scheme and Its Stability

For a given finite time T > 0 , denote t n = T ( n / M ) r , and let n = 0 , 1 , , M be the mesh points, where r 1 . Let τ n = t n t n 1 , n = 1 , , M be the time mesh sizes. If r = 1 , then the mesh is uniform.
The well-known L 1 approximation on the nonuniform meshes to the Caputo derivative is given by [22]
C D 0 , t α u ( x , t n ) Υ t α u ( x , t n ) : = d n , 1 Γ ( 2 α ) u n d n , n Γ ( 2 α ) u 0 + 1 Γ ( 2 α ) i = 1 n 1 u n i ( d n , i + 1 d n , i ) ,
where d n , i = [ ( t n t n i ) 1 α ( t n t n i + 1 ) 1 α ] / τ n i + 1 for i = 1 , , n . Throughout this paper, we denote u n = u ( x , t n ) if no confusion appears.
Denote a n k ( n ) = d n , n k + 1 / Γ ( 2 α ) for k = 1 , , n , and
P n k ( n ) = 1 a 0 ( k ) 1 , k = n , j = k + 1 n ( a j k 1 ( j ) a j k ( j ) ) P n j ( n ) , 1 k n 1 .
Then, from ([19] Lemma 2.1), the coefficient { P n k ( n ) } satisfies the property that
k = 1 n P n k ( n ) ( t n ) α / Γ ( 1 + α ) .
The nonuniform L1 scheme (15) can be written as Υ t α u n = i = 1 n a n i ( n ) ( u i u i 1 ) for n = 1 , , M . For simplicity, we denote
R 1 n = C D 0 , t α u ( x , t n ) Υ t α u ( x , t n ) .
Lemma 6
([22]). Assume that t l u ( x , t ) C t l α for l = 0 , 1 , 2 . Then,
R 1 n C n min { 2 α , r α } .
Lemma 7
([19]). Assume that u ( x , · ) C 2 ( ( 0 , T ] ) and t l u ( x , t ) C t l α for l = 0 , 1 , 2 , and then
j = 1 n P n j ( n ) | R 1 j | C α 1 T α M r α + r 2 1 α 4 r 1 T α M min { r α , 2 α } , n 1 .
Let u h n , q h n , p h n , r h n V h be the approximation of u ( x , t n ) , q ( x , t n ) , p ( x , t n ) , r ( x , t n ) , respectively. Then, the fully discrete nonuniform L1–LDG scheme for problem (1) is as follows: find u h n , q h n , p h n , r h n V h such that, for any v h , ρ h , ϕ h , ψ h V h , it holds that
( Υ t α u h n , v h ) = H ( φ h n ; v h ) + L ( r h n , v h ) + ( f n , v h ) ,
( r h n , ρ h ) = H ( p h n , ρ h ) ,
( p h n , ϕ h ) = H + ( q h n , ϕ h ) ,
( q h n , ψ h ) = H ( u h n , ψ h ) .
Now, we turn to the stability analysis of scheme (18). We first introduce the following discrete fractional Gronwall inequality.
Lemma 8
([25]). For any finite time t M = T > 0 and a given nonnegative sequence ( λ l ) l = 0 M 1 , assume that there exists a constant λ, independent of time-steps, such that λ l = 0 M 1 λ l . Suppose that the grid function { u n | n 0 } satisfies
Υ t α ( v n ) 2 l = 1 n λ n l ( v l ) 2 + ϕ n v s . n + ( ψ n ) 2 , 1 n M ,
where { ϕ n , ψ n | 1 n M } are nonnegative sequences. If the maximum time-step τ M ( 2 Γ ( 2 α ) λ ) 1 α , it holds that, for 1 n M ,
v n 2 E α , 1 ( 2 λ t n α ) v 0 + max 1 k n j = 1 k P k j ( k ) ϕ j + Γ ( 1 α ) max 1 k n { t k α / 2 ψ k } .
Here, E α , 1 ( z ) = k = 0 z k Γ ( k α + 1 ) is the Mittag–Leffler function.
Lemma 9
([26]). Let the functions u n = u ( x , t n ) be in L 2 ( Ω ) for n = 0 , 1 , , M . Then, one has the following inequality
( Υ t α u n , u n ) 1 2 Υ t α u n 2 .
Theorem 1.
If the graded mesh satisfies the maximum time-step condition τ M 2 π A Γ ( 2 α ) 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 1 / α , then, for n = 1 , , M 1 , the solution u h n of the fully discrete nonuniform L1–LDG scheme (18) satisfies
u h n 2 E α , 1 3 c 2 2 c 4 + 27 c 3 4 16 c 4 3 + 2 t n α u h 0 + Γ ( 1 α ) max 1 j n t j α / 2 f j .
Proof. 
Choosing the test function in (18a) as v h = u h n and using Lemma 2, we obtain
( Υ t α u h n , u h n ) + c 4 p h n 2 = c 1 H ( u h n , u h n ) + c 2 H + ( q h n , u h n ) + c 3 H + ( p h n , u h n ) + ( f n , u h n ) .
It follows from Lemma 1 that
c 1 H ( u h n , u h n ) = c 1 1 2 [ [ u h n ] ] 2 0 .
By the Cauchy–Schwarz inequality and (18c), one has
c 2 H + ( q h n , u h n ) = c 2 ( p h n , u h n ) ϵ 4 p h n 2 + c 2 2 ϵ u h n 2 .
Applying Lemma 1, the equality (18d) and Lemma 4, we find
c 3 H + ( p h n , u h n ) = c 3 H ( u h n , p h n ) = c 3 ( q h n , p h n ) ϵ 4 p h n 2 + c 3 2 ϵ q h n 2 ϵ 4 p h n 2 + c 3 2 ϵ u h n p h n ϵ 2 p h n 2 + c 3 4 ϵ 3 u h n 2 .
Substituting (22)–(24) into (21), we arrive at
( Υ t α u h n , u h n ) + c 4 p h n 2 3 ϵ 4 p h n 2 + c 2 2 ϵ + c 3 4 ϵ 3 u h n 2 + ( f n , u h n ) .
Therefore, if we take ϵ = 4 3 c 4 and use the Cauchy–Schwarz inequality again, then
( Υ t α u h n , u h n ) 3 c 2 2 4 c 4 + 27 c 3 4 64 c 4 3 u h n 2 + f n u h n .
By using the Young’s inequality together with Lemma 9, we obtain the estimate
Υ t α u h n 2 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 u h n 2 + f n 2 .
Therefore, applying Lemma 8 with v n = u h n , ϕ n = 0 , ψ n = f n , λ 0 = 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 , and λ j = 0 for 1 j M 1 , we have
u h n 2 E α , 1 3 c 2 2 c 4 + 27 c 3 4 16 c 4 3 + 2 t n α u h 0 + Γ ( 1 α ) max 1 j n t j α / 2 f j ,
provided that the maximum time-step τ M 3 c 2 2 c 4 + 27 c 3 4 16 c 4 3 + 2 Γ ( 2 α ) 1 / α . This completes the proof. □

3.2. Error Estimate of the Nonuniform L1–LDG Scheme

We are now ready to show the optimal error estimate of scheme (18). Assume that the solution u of time-fractional fourth-order problem (1) satisfies
u L ( 0 , T ] ; H k + 4 ( Ω ) , t l u ( x , t ) C ( 1 + t α l ) for 0 < t T and l = 0 , 1 , 2 .
Theorem 2.
Let u n be the exact solution of Equation (1) that satisfies the smoothness assumption (28), and u h n be the numerical solution of the nonuniform L1–LDG scheme (18). Then, for n = 1 , 2 , , M , the following estimate holds
u n u h n C M min { 2 α , r α } + h k + 1 ,
where C is a positive constant independent of M and h.
Proof. 
For any t > 0 , denote
( e u n , e q n , e p n , e r n ) = ( u n u h n , q n q h n , p n p h n , r n r h n ) .
Let ( U h n , Q h n , P h n , R h n ) be the elliptic projection defined in (12) at time t = t n . Then, we divide the error e ς n in the form
e ς n = ξ ς n η ς n ,
for ς = u , q , p , r , where
( ξ u n , ξ q n , ξ p n , ξ r n ) = ( U h n u h n , Q h n q h n , P h n p h n , R h n r h n ) , ( η u n , η q n , η p n , η r n ) = ( U h n u n , Q h n q n , P h n p n , R h n r n ) .
In order to obtain the error equation of the fully discrete numerical scheme, we need to present the weak formulation of (4) at t n , which is,
( C D 0 , t α u n , v ) = H ( φ n ; v ) + L ( r n , v ) + ( f n , v ) ,
( r n , ρ ) = H ( p n , ρ ) ,
( p n , ϕ ) = H + ( q n , ϕ ) ,
( q n , ψ ) = H ( u n , ψ ) ,
where φ n = ( u n , q n , p n ) and v , ρ , ϕ , ψ are test functions. Then, we can find the error equation by subtracting (18) from (33) that, for any v h , ρ h , ϕ h , ψ h V h and n = 1 , , M ,
( C D 0 , t α u n Υ t α u h n , v h ) = H ( e φ n ; v h ) + L ( e r n , v ) ,
( e r n , ρ h ) = H ( e p n , ρ h ) ,
( e p n , ϕ h ) = H + ( e q n , ϕ h ) ,
( e q n , ψ h ) = H ( e u n , ψ h ) ,
where e φ n = ( e u n , e q n , e p n ) . According to the definition (12) of elliptic projection and (33b)–(33d), we obtain
0 = L ( η r n , v h ) ,
( η r n , ρ h ) = H ( η p n , ρ h ) ,
( η p n , ϕ h ) = H + ( η q n , ϕ h ) ,
( η q n , ψ h ) = H ( η u n , ψ h ) .
Therefore, we have from (34a) and (35a) that
( C D 0 , t α u n Υ t α u h n , v h ) = H ( ξ φ n ; v h ) + L ( ξ r n , v h ) H ( η φ n ; v h ) .
Here, ξ φ n = ( ξ u n , ξ q n , ξ p n ) and η φ n = ( η u n , η q n , η p n ) . By using (8), (35c) and (35d), the above equation can be further written as
( C D 0 , t α u n Υ t α u h n , v h ) = c 1 ( η q n , v h ) + c 2 ( η p n , v h ) c 3 H + ( η p n , v h ) + H ( ξ φ n ; v h ) + L ( ξ r n , v h ) ,
Substituting (31) into (34b)–(34d) and using (35b)–(35d), we obtain
( ξ r n , ρ h ) = H ( ξ p n , ρ h ) ,
( ξ p n , ϕ h ) = H + ( ξ q n , ϕ h ) ,
( ξ q n , ψ h ) = H ( ξ u n , ψ h ) .
Taking v h = ξ u n in (37a), we obtain the following identity
( C D 0 , t α u n Υ t α u h n , ξ u n ) = c 1 ( η q n , ξ u n ) + c 2 ( η p n , ξ u n ) c 3 H + ( η p n , ξ u n ) + H ( ξ φ n ; ξ u n ) + L ( ξ r n , ξ u n ) .
From Lemma 2, we arrive at
L ( ξ r n , ξ u n ) = c 4 ξ p n 2 .
It has been shown in ([23], Lemma 9) that
ξ q n C ξ p n .
By the similar argument to prove inequality (11) in Lemma 3 (refer ([27], Lemma 3.3) for similar analysis), we can find
| H + ( η p n , ξ u n ) | ( ξ u n ) x + μ h 1 [ [ ξ u n ] ] η p n .
Then, combine (40)–(41) and Lemma 4 to obtain
| c 3 H + ( η p n , ξ u n ) | C h k + 1 ( ξ u n ) x + μ h 1 [ [ ξ u n ] ] C h k + 1 ξ q n C h k + 1 ξ p n ,
where we have used the interpolating property (14) in the first inequality.
Note that
H ( ξ φ n ; ξ u n ) = c 1 H ( ξ u n , ξ u n ) + c 2 H + ( ξ q n , ξ u n ) + c 3 H + ( ξ p n , ξ u n ) ,
by (8). A simple application of Lemma 1 leads to
c 1 H ( ξ u n , ξ u n ) = c 1 2 [ [ ξ u n ] ] 2 0 .
Using the Cauchy–Schwarz inequality and (37c), one finds
c 2 H + ( ξ q n , ξ u n ) = c 2 ( ξ p n , ξ u n ) ϵ 1 4 ξ p n 2 + c 2 2 ϵ 1 ξ u n 2 ,
where ϵ 1 is a positive constant. We next estimate c 3 H + ( ξ p n , ξ u n ) . It follows from Lemma 1 and (37d) that
H + ( ξ p n , ξ u n ) = H ( ξ u n , ξ p n ) = ( ξ q n , ξ p n ) .
Then, applying the Cauchy–Schwarz inequality, Young’s inequality and Lemma 4, we have that
c 3 H + ( ξ p n , ξ u n ) ϵ 1 4 ξ p n 2 + c 3 2 ϵ 1 ξ q n 2 ϵ 1 4 ξ p n 2 + c 3 2 ϵ 1 ξ u n ξ p n ϵ 1 2 ξ p n 2 + c 3 4 ϵ 1 3 ξ u n 2 .
Substituting (44)–(46) into (43), we arrive at
H ( ξ φ n ; ξ u n ) 3 ϵ 1 4 ξ p n 2 + c 2 2 ϵ 1 + c 3 4 ϵ 1 3 ξ u n 2 .
Combining (38), (39), (42), and (47) together and utilizing the Cauchy–Schwarz inequality, we conclude that
( C D 0 , t α u n Υ t α u h n , ξ u n ) + c 4 ξ p n 2 c 1 η q n + c 2 η p n ξ u n + C h k + 1 ξ p n + 3 ϵ 1 4 ξ p n 2 + c 2 2 ϵ 1 + c 3 4 ϵ 1 3 ξ u n 2 C h 2 k + 2 + 1 2 + 3 ϵ 1 4 ξ p n 2 + 1 2 + c 2 2 ϵ 1 + c 3 4 ϵ 1 3 ξ u n 2 .
As a consequence, if we take ϵ 1 = 2 3 c 4 , then
( C D 0 , t α u n Υ t α u h n , ξ u n ) C h 2 k + 2 + 1 2 + 3 c 2 2 2 c 4 + 27 c 3 4 8 c 4 3 ξ u n 2 .
Note that R 1 n = C D 0 , t α u n Υ t α u n . Thus, by (49) and (31), we obtain
( Υ t α ξ u n , ξ u n ) = ( Υ t α η u n , ξ u n ) ( R 1 n , ξ u n ) + C h 2 k + 2 + 1 2 + 3 c 2 2 2 c 4 + 27 c 3 4 8 c 4 3 ξ u n 2 ,
which, together with Lemma 9 and interpolation property (14), yields
Υ t α ξ u n 2 2 + 3 c 2 2 c 4 + 27 c 3 4 4 c 4 3 ξ u n 2 + 2 C h 2 k + 2 + 2 R 1 n ξ u n .
Applying Lemma 8 with λ 0 = 2 + 3 c 2 2 c 4 + 27 c 3 4 4 c 4 3 , λ j = 0 for 1 j M 1 , v n = ξ u n , ϕ n = 2 R 1 n , and ψ n = 2 C h k + 1 , we find from (51) that
ξ u n 2 E α , 1 4 + 6 c 2 2 c 4 + 27 c 3 4 2 c 4 3 t n α ( 2 max 1 k n j = 1 k P k j ( k ) R 1 j + 2 C Γ ( 1 α ) max 1 k n { t k α 2 h k + 1 } ) ,
provided that the maximum time-step τ M 4 + 6 c 2 2 c 4 + 27 c 3 4 2 c 4 3 Γ ( 2 α ) 1 / α . From Lemma 7, we have
ξ u n C M min { r α , 2 α } + h k + 1 .
Then, the desired estimate can be obtained using together interpolation property (14) and the triangle inequality. □
Remark 1.
In (44), we can obtain
c 1 H ( ξ u n , ξ u n ) C ξ u n 2 + c 4 4 ξ p n 2 ,
if c 1 < 0 . Since
c 1 2 [ [ ξ u n ] ] 2 C ξ q n 2 C ξ u n ξ p n C ξ u n 2 + c 4 4 ξ p n 2 ,
owing to Lemma 4, (37b)–(37d) and Young’s inequality.
From Theorem 2, it can be concluded that the optimal order of convergence (i.e., ( 2 α ) th-order accurate in time and ( k + 1 ) -order accurate in space) for the solution can be obtained if we use nonuniform L1 formula in the temporal direction and the LDG method in space. However, the numerical solution generated by scheme (18) will be limited to being ( 2 α ) -order accurate in time even if the solution is sufficiently smooth. Therefore, developing high-order numerical algorithms for the time-fractional fourth-order problem (1) is also indispensable and will be studied in the next section.

4. Nonuniform L 2 - 1 σ –LDG Scheme

In the section, based on the LDG method in the spatial direction and L 2 - 1 σ approximation in the time direction, we propose a fully discrete numerical scheme (called the nonuniform L 2 - 1 σ –LDG scheme for brevity) with high temporal accuracy to solve the time-fractional fourth-order Equation (1).

4.1. The Fully Discrete Numerical Scheme and Its Stability

For a given finite time T > 0 , let t n = T ( n / M ) r , n = 0 , 1 , , M be the mesh points, r 1 . Denote τ n = t n t n 1 , and let n = 1 , , M be the time mesh sizes. For σ [ 0 , 1 ] , we set t n + σ = t n + σ τ n + 1 , u n + σ = u ( x , t n + σ ) , and u n , σ = σ u n + 1 + ( 1 σ ) u n for n = 0 , 1 , , M 1 .
The nonuniform L 2 - 1 σ approximation to Caputo’s fractional derivative at t n + σ ( n = 0 , 1 , , M 1 ) is given by [28]
C D 0 , t α u ( x , t n + σ ) = 1 Γ ( 1 α ) 0 t n + σ u ( x , s ) s d s ( t n + σ s ) α = 1 Γ ( 1 α ) k = 1 n t k 1 t k u ( x , s ) s d s ( t n + σ s ) α + 1 Γ ( 1 α ) t n t n + σ u ( x , s ) s d s ( t n + σ s ) α g n , n u n + 1 j = 0 n ( g n , j g n , j 1 ) u j : = t α u n + σ ,
where g 0 , 0 = τ 1 1 a 0 , 0 , g n , 1 = 0 , and for n 1 ,
g n , j = τ j + 1 1 ( a n , 0 b n , 0 ) , j = 0 , τ j + 1 1 ( a n , j + b n , j 1 b n , j ) , 1 j n 1 , τ j + 1 1 ( a n , n + b n , n 1 ) , j = n .
a n , n = 1 Γ ( 1 α ) t n t n + σ ( t n + σ s ) α d s = σ 1 α Γ ( 2 α ) τ n + 1 1 α , n 0 , a n , j = 1 Γ ( 1 α ) t j t j = 1 ( t n + σ s ) α d s , n 1 , 0 j n 1 , b n , j = 2 Γ ( 1 α ) ( t j + 2 t j ) t j t j + 1 ( t n + σ s ) α ( s t j + 1 / 2 ) d s , n 1 , 0 j n 1 .
Denote A n + 1 j n + 1 , σ = g n , j , t u j + 1 = u j + 1 u j for 0 j n , and 0 n M 1 . Then, for n = 0 , 1 , , M 1 , it holds that
t α u n + σ = j = 0 n A n + 1 j n + 1 , σ t u j + 1 .
Referring to Ref. [29], we introduce the discrete convolution kernel P n + 1 j n + 1 , σ ,
P 1 n + 1 , σ = 1 A 1 n + 1 , σ , P n + 1 j n + 1 , σ = 1 A 1 j + 1 , σ i = j + 1 n A i j i + 1 , σ A i j + 1 i + 1 , σ P n + 1 i n + 1 , σ .
Moreover, it was proven in [25] that
j = i n P n + 1 j n + 1 , σ A j i + 1 j + 1 , σ = 1 , for 0 i n M 1 .
j = 0 n P n + 1 j n + 1 , σ ω 1 + m α α ( t j + 1 ) π A ω 1 + m α ( t n + 1 ) , for 0 n M 1 and m = 0 , 1 ,
where π A is a positive constant.
Let q = u x , p = q x , r = p x , and then the weak form of the time-fractional fourth-order Equation (1) at t n + σ is formulated as
( C D 0 , t α u ) n + σ , v = H ( φ n , σ ; v ) + L ( r n , σ , v ) + ( R 2 n + σ , v ) + ( f n + σ , v ) ,
( r n , σ , ρ ) = H ( p n , σ , ρ ) ,
( p n , σ , ϕ ) = H + ( q n , σ , ϕ ) ,
( q n , σ , ψ ) = H ( u n , σ , ψ ) ,
where v , ρ , ϕ , ψ are test functions; φ n , σ = ( u n , σ , q n , σ , p n , σ ) ; the bilinear operators H ± and L are defined in (6) and (9), respectively; H ( φ n , σ ; v ) has been given in (8); and
R 2 n + σ = c 1 ( u x n , σ u x n + σ ) + c 2 ( q x n , σ q x n + σ ) + c 3 ( p x n , σ p x n + σ ) + c 4 ( r x n , σ r x n + σ ) .
The LDG method introduced in Section 2 is used for spatial discretization. Then, the fully discrete nonuniform L 2 - 1 σ –LDG approximation scheme for (1) reads as: find u h n , σ , q h n , σ , p h n , σ , r h n , σ V h such that, for all v h , ρ h , ϕ h , ψ h V h , it holds that
t α u h n + σ , v h = H ( φ h n , σ ; v h ) + L ( r h n , σ , v h ) + ( f n + σ , v h ) ,
( r h n , σ , ρ h ) = H ( p h n , σ , ρ h ) ,
( p h n , σ , ϕ h ) = H + ( q h n , σ , ϕ h ) ,
( q h n , σ , ψ h ) = H ( u h n , σ , ψ h ) .
Below, we study the stability of the nonuniform L 2 - 1 σ –LDG scheme (58). The following lemmas play a key role in proving the stability for the nonuniform meshes.
Lemma 10
([25]). For any finite time t M = T > 0 and a given nonnegative sequence ( λ l ) l = 0 M 1 , assume that there exists a constant Λ, independent of time-steps, such that l = 0 M 1 λ l Λ . Let σ = 1 α / 2 and suppose that the grid function { v n + 1 | n 0 } satisfies
i = 0 n A n + 1 i n + 1 , σ t ( v i + 1 ) 2 i = 0 n λ n i ( v i , σ ) 2 + ϕ n + 1 v n , σ + ( ψ n + 1 ) 2 , 0 n M 1 ,
where { ϕ n + 1 , ψ n + 1 | 0 n M 1 } are nonnegative sequences. If the maximum time-step τ M ( 2 π A Γ ( 2 α ) Λ ) 1 / α , it holds that, for 0 n M 1 ,
v n + 1 2 E α , 1 ( 2 π A Λ t n + 1 α ) v 0 + max 0 i n j = 0 i P i j + 1 i + 1 , σ ϕ j + π A Γ ( 1 α ) max 0 j n { t j + 1 α / 2 ψ j + 1 } .
Lemma 11
([26]). Suppose σ = 1 α / 2 . For any function u n + 1 ( 0 n M 1 ) , we have the following inequality
( t α u n + σ , u n , σ ) 1 2 t α ( u 2 ) n + σ .
Theorem 3.
If the graded mesh satisfies the maximum time-step condition τ M 2 π A Γ ( 2 α ) 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 1 / α , then, for n = 0 , 1 , , M 1 , the solution u h n + 1 of the fully discrete nonuniform L 2 - 1 σ –LDG scheme (58) satisfies
u h n + 1 2 E α , 1 π A 3 c 2 2 c 4 + 27 c 3 4 16 c 4 3 + 2 t n + 1 α u h 0 + π A Γ ( 1 α ) max 0 j n { t j + 1 α / 2 f j + σ } .
Proof. 
Taking the test function v h = u h n , σ in (58a) and applying Lemma 2, we obtain
( t α u h n + σ , u h n , σ ) + c 4 p h n , σ 2 = H ( φ h n , σ ; u h n , σ ) + ( f n + σ , u h n , σ ) .
Similar to that in the proof of (26), we can use the Cauchy–Schwarz inequality to obtain
( t α u h n + σ , u h n , σ ) 3 c 2 2 4 c 4 + 27 c 3 4 64 c 4 3 u h n , σ 2 + f n + σ u h n , σ .
A combination of Lemma 11 and (60) leads to
t α ( u h 2 ) n + σ 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 u h n , σ 2 + f n + σ 2 .
It thus follows from Lemma 10 with λ 0 = 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 , λ j = 0 for 1 j M 1 , v n , σ = u h n , σ , ϕ n + 1 = 0 , and ψ n + 1 = f n + σ that
u h n + 1 2 E α , 1 π A 3 c 2 2 c 4 + 27 c 3 4 16 c 4 3 + 2 t n + 1 α u h 0 + π A Γ ( 1 α ) max 0 j n { t j + 1 α / 2 f j + σ } ,
provided that the maximum time-step τ M 2 π A Γ ( 2 α ) 3 c 2 2 2 c 4 + 27 c 3 4 32 c 4 3 + 1 1 / α . The proof is completed. □

4.2. Error Estimate of the Nonuniform L 2 - 1 σ –LDG Scheme

In this section, we study the error analysis of fully discrete nonuniform L 2 - 1 σ –LDG scheme (58) for Equation (1). Assume that the exact solution u ( x , t ) of (1) is sufficiently smooth, i.e.,
u L ( 0 , T ] ; H k + 4 ( Ω ) , t l u ( x , t ) C ( 1 + t α l ) for 0 < t T and l = 0 , 1 , 2 , 3 .
Lemma 12
([30]). Suppose σ = 1 α / 2 . Then, for any function v ( t ) C 3 ( 0 , T ] , one has
( C D 0 , t α v ) n + σ Υ t α v n + σ C t n + σ α ψ v n + σ + max 1 s n { ψ v n , s } for n = 0 , 1 , , M 1 ,
where
ψ v n + σ = τ n + 1 3 α t n + σ α sup s ( t n , t n + 1 ) | v ( s ) | for n = 1 , 2 , , M 1 , ψ v n , 1 = τ 1 α sup s ( 0 , t 1 ) s 1 α | ( I 2 , 1 v ( s ) ) v ( s ) | for n = 1 , 2 , , M 1 , ψ v n , s = τ n + 1 α τ i 2 ( τ i + τ i + 1 ) t i α sup s ( t i 1 , t i + 1 ) | v ( s ) | for 2 i n M 1 ,
and I 2 , 1 v ( s ) is the quadratic polynomial that interpolates to v ( s ) at the points t s 1 , t s and t s + 1 .
Lemma 13
([30]). Suppose that v ( t ) C [ 0 , T ] C 3 ( 0 , T ] satisfies the condition (62). Then, we have
ψ v n + σ C M min { r α , 3 α } for n = 0 , 1 , , M 1 , ψ v n , s C M min { r α , 3 α } for s = 1 , , M 1 , n 1 .
In Section 3.2, we gave the convergence analysis of the nonuniform L1–LDG scheme, and the same idea can be used for the nonuniform L 2 - 1 σ –LDG scheme. However, the proof will be somewhat complicated. Along a similar line, we can easily establish the error equation by subtracting (58) from (57) that, for any v h , ρ h , ϕ h , ψ h V h and n = 0 , 1 , , M 1 ,
( C D 0 , t α u ) n + σ t α u h n + σ , v h = H ( e φ n , σ ; v h ) + L ( e r n , σ , v h ) + ( R 2 n + σ , v h ) ,
( e r n , σ , ρ h ) = H ( e p n , σ , ρ h ) ,
( e p n , σ , ϕ h ) = H + ( e q n , σ , ϕ h ) ,
( e q n , σ , ψ h ) = H ( e u n , σ , ψ h ) ,
where e φ n , σ = ( e u n , σ , e q n , σ , e p n , σ ) , e u n , σ , e q n , σ , e p n , σ , and e r n , σ are the errors with the decompositions
( e u n + 1 , e q n + 1 , e p n + 1 , e r n + 1 ) = ( u n + 1 u h n + 1 , q n + 1 q h n + 1 , p n + 1 p h n + 1 , r n + 1 r h n + 1 ) = ( ξ u n + 1 η u n + 1 , ξ q n + 1 η q n + 1 , ξ p n + 1 η p n + 1 , ξ r n + 1 η r n + 1 ) .
Here,
( ξ u n + 1 , ξ q n + 1 , ξ p n + 1 , ξ r n + 1 ) = ( U h n + 1 u h n + 1 , Q h n + 1 q h n + 1 , P h n + 1 p h n + 1 , R h n + 1 r h n + 1 ) , ( η u n + 1 , η q n + 1 , η p n + 1 , η r n + 1 ) = ( U h n + 1 u n + 1 , Q h n + 1 q n + 1 , P h n + 1 p n + 1 , R h n + 1 r n + 1 ) ,
and ( U h n + 1 , Q h n + 1 , P h n + 1 , R h n + 1 ) is the elliptic projection defined in (12).
Theorem 4.
Assume that the solution u of the problem (1) satisfies the condition (62) and C D 0 , t α u L ( ( 0 , T ] ; H k + 1 ( Ω ) ) . Let u h n be the numerical solution of the fully discrete LDG scheme (58). Suppose σ = 1 α / 2 and the nonuniform mesh satisfies the maximum time-step condition τ M 4 π A Γ ( 2 α ) 1 / α , then for n = 1 , 2 , , M , the following estimate holds
u n u h n C M min { r α , 2 } + h k + 1 ,
where C is a positive constant independent of M and h.
Proof. 
Substituting (64) into (63) and denoting ζ n + σ = ( C D 0 , t α u ) n + σ t α u n + σ , we observe that
t α ξ u n + σ , v h = t α η u n + σ , v h ( ζ n + σ , v h ) + ( R 2 n + σ , v h ) + H ( ξ φ n , σ ; v h ) H ( η φ n , σ ; v h ) + L ( ξ r n , σ , v h ) L ( η r n , σ , v h ) ,
( ξ r n , σ , ρ h ) ( η r n , σ , ρ h ) = H ( ξ p n , σ , ρ h ) + H ( η p n , σ , ρ h ) ,
( ξ p n , σ , ϕ h ) ( η p n , σ , ϕ h ) = H + ( ξ q n , σ , ϕ h ) + H + ( η q n , σ , ϕ h ) ,
( ξ q n , σ , ψ h ) ( η q n , σ , ψ h ) = H ( ξ u n , σ , ψ h ) + H ( η u n , σ , ψ h ) ,
in which ξ φ n , σ = ( ξ u n , σ , ξ q n , σ , ξ p n , σ ) and η φ n , σ = ( η u n , σ , η q n , σ , η p n , σ ) . By the definition (12) of elliptic projection, we have
0 = L ( η r n , σ , v h ) ,
( η r n , σ , ρ h ) = H ( η p n , σ , ρ h ) ,
( η p n , σ , ϕ h ) = H + ( η q n , σ , ϕ h ) ,
( η q n , σ , ψ h ) = H ( η u n , σ , ψ h ) .
Then, Equations (65a)–(65d) become
t α ξ u n + σ , v h = t α η u n + σ , v h ( ζ n + σ , v h ) + ( R 2 n + σ , v h ) + H ( ξ φ n , σ ; v h ) H ( η φ n , σ ; v h ) + L ( ξ r n , σ , v h ) ,
( ξ r n , σ , ρ h ) = H ( ξ p n , σ , ρ h ) ,
( ξ p n , σ , ϕ h ) = H + ( ξ q n , σ , ϕ h ) ,
( ξ q n , σ , ψ h ) = H ( ξ u n , σ , ψ h ) .
Setting v h = ξ u n , σ in (67a) and using Lemma 2, we arrive at
t α ξ u n + σ , ξ u n , σ + c 4 ξ p n , σ 2 = t α η u n + σ , ξ u n , σ ( ζ n + σ , ξ u n , σ ) + ( R 2 n + σ , ξ u n , σ ) + H ( ξ φ n , σ ; ξ u n , σ ) H ( η φ n , σ ; ξ u n , σ ) .
By an analysis similar to that in the proof of (47), we have that
| H ( ξ φ n , σ ; ξ u n , σ ) | 3 ϵ 3 4 ξ p n , σ 2 + c 2 2 ϵ 3 + c 3 4 ϵ 3 3 ξ u n , σ 2 ,
where ϵ 3 is a positive constant. Employing the definition of operator H ( · ; · ) and applying (66c)–(66d), it is easy to see that
H ( η φ n , σ ; ξ u n , σ ) = c 1 H ( η u n , σ , ξ u n , σ ) + c 2 H + ( η q n , σ , ξ u n , σ ) + c 3 H + ( η p n , σ , ξ u n , σ ) = c 1 ( η q n , σ , ξ u n , σ ) c 2 ( η p n , σ , ξ u n , σ ) + c 3 H + ( η p n , σ , ξ u n , σ ) .
Similar to that in the proof of (42), we can derive
| c 3 H + ( η p n , σ , ξ u n , σ ) | C h k + 1 ξ p n , σ .
Then, a simple use of the Cauchy–Schwarz inequality and interpolation property (14) yields
| H ( η φ n , σ ; ξ u n , σ ) | C h k + 1 ξ u n , σ + C h k + 1 ξ p n , σ .
Combining (68), (69) and (72), we can derive
t α ξ u n + σ , ξ u n , σ + c 4 ξ p n , σ 2 t α η u n + σ + ζ n + σ + R 2 n + σ ξ u n , σ + C h 2 k + 2 + 3 ϵ 3 4 + c 4 2 ξ p n , σ 2 + c 2 2 ϵ 3 + c 3 4 ϵ 3 3 + 1 ξ u n , σ 2 .
Thus, if we take ϵ 3 = 2 c 4 3 , inequality (73) reduces to
t α ξ u n + σ , ξ u n , σ + c 4 ξ p n , σ 2 t α η u n + σ + ζ n + σ + R 2 n + σ ξ u n , σ + 3 c 2 2 2 c 4 + 27 c 3 4 8 c 4 3 + 1 ξ u n , σ 2 + C h 2 k + 2 .
From interpolation property (14), we have
t α η u n + σ = t α ( u U h ) n + σ ( C D 0 , t α ( u U h ) ) n + σ + ( C D 0 , t α ( u U h ) ) n + σ C ζ n + σ 1 + C h k + 1 ( C D 0 , t α u ) n + σ k + 1 .
Next, we estimate max 0 n M 1 t n + σ α R 2 n + σ . When n = 0 , since u L ( 0 , T ] ; H k + 4 ( Ω ) , there exists a constant C such that t σ α R 2 n + σ C t 1 α C M r α . When n 1 , by using ([30], Lemma 9) and (62), we have
t n + σ α R 2 n + σ C t n + σ α τ n + 1 2 t n α 2 C ( n + 1 ) r α M r α M 2 r n r α 2 M r α + 2 r C ( n / M ) 2 r α 2 M 2 ,
where, in the second step, the estimate τ n + 1 C T M r n r 1 ( n = 0 , 1 , , M 1 ) has been applied. As a consequence,
t n + σ α R 2 n + σ C M 2 , n = 1 , 2 , , M 1 , r 1 / α , C M 2 α , n = 1 , 2 , , M 1 , 1 r < 1 / α ,
which, together with the case of n = 0 , leads to
max 0 n M 1 t n + σ α R 2 n + σ C M min { r α , 2 } .
Then, it follows from Lemmas 12 and 13 that
t α η u n + σ + ζ n + σ + R 2 n + σ C ζ n + σ 1 + C h k + 1 ( C D 0 , t α u ) n + σ k + 1 + t n + σ α t n + σ α R 2 n + σ C t n + σ α max 1 n M 1 t n + σ α ζ n + σ 1 + t n + σ α R 2 n + σ + C h k + 1 C t n + σ α C max 0 n M 1 ψ u n + σ 1 + max 1 s n ψ u n , s 1 + M min { r α , 2 } + C h k + 1 C t n + σ α M min { r α , 3 α } + M min { r α , 2 } + C h k + 1 C t n + σ α M min { r α , 3 α } + C h k + 1 .
Substituting (77) into (74) and using Lemma 11, we easily obtain
t α ( ξ u 2 ) n + σ C t n + σ α M min { r α , 3 α } + C h k + 1 ξ u n , σ + 3 c 2 2 2 c 4 + 27 c 3 4 8 c 4 3 + 1 ξ u n , σ 2 + C h 2 k + 2 .
By virtue of Lemma 10 and (56), it yields that
ξ u n + 1 2 E α , 1 ( 2 C π A t n + 1 α ) ( max 0 i n j = 0 i P i j + 1 i + 1 , σ 2 C t j + σ α M min { r α , 3 α } + C h k + 1 + π A Γ ( 1 α ) max 0 j n C t j + 1 α / 2 h k + 1 ) C max 0 i n j = 0 i P i j + 1 i + 1 , σ ω 1 α ( t j + 1 ) M min { r α , 2 } + h k + 1 + C h k + 1 C M min { r α , 2 } + C h k + 1 ,
provided that the maximum time-step τ M 2 π A Γ ( 2 α ) 3 c 2 2 2 c 4 + 27 c 3 4 8 c 4 3 + 1 1 / α . Finally, we complete the proof of Theorem 4 by combining the above inequality with interpolation property (14) and the triangle inequality. □

5. Numerical Examples

The purpose of this section is to numerically validate the efficiency of schemes (18) and (58) for solving the time-fractional fourth-order Equation (1) with initial singularity. All the algorithms were implemented using MATLAB R2016a, and were run in a 3.10 GHz PC with 16 GB RAM and a Windows 10 operating system.
Example 1.
Consider the problem (1) with c 1 = c 3 = c 4 = 1 , c 2 = 1 , Ω = ( 0 , 1 ) , T = 1 , u 0 ( x ) = 0 , and the periodic boundary condition in use. In this case, the source term
f ( x , t ) = Γ ( α + 1 ) + 6 t 3 α Γ ( 4 α ) sin ( 2 π x ) + 2 π ( t α + t 3 ) cos ( 2 π x ) + 4 π 2 ( t α + t 3 ) sin ( 2 π x ) 8 π 3 ( t α + t 3 ) cos ( 2 π x ) + 16 π 4 ( t α + t 3 ) sin ( 2 π x ) .
The analytical solution is given by u ( x , t ) = ( t α + t 3 ) sin ( 2 π x ) . This solution displays a weak singularity at t = 0 .
To solve Example 1, we apply the nonuniform L1–LDG scheme (18) with r = ( 2 α ) / α in computation. The L 2 -norm errors and temporal convergence orders of the numerical solution u h n for α = 0.4 , 0.6 , 0.8 and different time-steps are listed in Table 1. The convergence orders of α = 0.4 and 0.6 are close to ( 2 α ) , which is consistent with the theoretical prediction in Theorem 2. However, the accuracy of α = 0.8 is slightly lower. In Table 2 and Table 3, for fixed M = 4000 and r = ( 2 α ) / α , we observe that the spatial convergence order for (18) is ( k + 1 ) , which is in agreement with the theoretical analysis. The numerical solutions of the scheme (18) for different α are given in Figure 1, Figure 2 and Figure 3. Figure 4 depicts the L 2 -norm errors versus N between the numerical solution and the exact solution for different α at t = 1 . The graphs show good agreement between the two solutions.
Example 2.
The purpose of this example is to investigate the accuracy and efficiency of the proposed nonuniform L 2 - 1 σ –LDG method (57). For simplicity, the equation in Example 1 is still regarded as a test problem, but it is solved by the scheme (57). The L 2 -norm errors at time t = 1 and convergence orders in the temporal direction with different α and r are shown in Table 4, Table 5 and Table 6. The orders of convergence displayed indicate that the order of convergence is O ( M min { r α , 2 } ) , which coincides with Theorem 4. From Table 5 and Table 6, we can also see that the grading parameter r 2 / α yields the temporal optimal second-order accuracy. Then, we refine the spatial step size with a fixed temporal step size M = 2000 . The L 2 -norm errors at time t = 1 and convergence orders in the spatial direction are shown in Table 7. The results imply that the algorithm (57) has an accuracy of O ( h k + 1 ) in space.

6. Concluding Remarks

In this paper, we studied the numerical algorithms for the time-fractional fourth-order equation with an initial singularity. In the temporal direction, two types of finite difference schemes were proposed and analyzed, including the nonuniform L1 scheme and nonuniform L 2 - 1 σ scheme. In the spatial direction, the LDG method was utilized. Detailed proofs of L 2 stability and optimal error estimates for the schemes were derived using the discrete fractional Gronwall-type inequalities. Finally, some numerical examples were presented to verify the theoretical results.

Funding

This work was supported by the National Natural Science Foundation of China (NSFC) under grant No. 12101266.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All the data were computed using our algorithms.

Conflicts of Interest

The author declares no conflict of interest. The funder had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Li, C.P.; Cai, M. Theory and Numerical Approximations of Fractional Integrals and Derivatives; SIAM: Philadelphia, PA, USA, 2019. [Google Scholar]
  2. Podlubny, I. Fractional Differential Equations; Academic Press: New York, NY, USA, 1999. [Google Scholar]
  3. Du, Y.; Liu, Y.; Li, H.; Fang, Z.; He, S. Local discontinuous Galerkin method for a nonlinear time-fractional fourth-order partial differential equation. J. Comput. Phys. 2017, 344, 108–126. [Google Scholar] [CrossRef]
  4. Ji, C.; Sun, Z.; Hao, Z. Numerical algorithms with high spatial accuracy for the fourth-order fractional sub-diffusion equations with the first Dirichlet boundary conditions. J. Sci. Comput. 2015, 3, 1148–1174. [Google Scholar] [CrossRef]
  5. Zhang, H.; Yang, X.; Xu, D. A high-order numerical method for solving the 2D fourth-order reaction-diffusion equation. Numer. Algor. 2019, 80, 849–877. [Google Scholar] [CrossRef]
  6. Wei, L.; He, Y. Analysis of a fully discrete local discontinuous Galerkin method for time-fractional fourth-order problems. Appl. Math. Model. 2014, 38, 1511–1522. [Google Scholar] [CrossRef]
  7. Guo, L.; Wang, Z.; Vong, S. Fully discrete local discontinuous Galerkin methods for some time-fractional fourth-order problems. Int. J. Comput. Math. 2016, 93, 1665–1682. [Google Scholar] [CrossRef]
  8. Liu, Y.; Fang, Z.; Li, H.; He, S. A mixed finite element method for a time-fractional fourth-order partial differential equation. Appl. Math. Comput. 2014, 243, 703–717. [Google Scholar] [CrossRef]
  9. Zhang, P.; Pu, H. A second-order compact difference scheme for the fourth-order fractional sub-diffusion equation. Numer. Algor. 2017, 76, 573–598. [Google Scholar] [CrossRef]
  10. Cui, M. Compact difference scheme for time-fractional fourth-order equation with first Dirichlet boundary condition. East Asian J. Appl. Math. 2019, 9, 45–66. [Google Scholar] [CrossRef]
  11. Fei, M.; Huang, C. Galerkin-Legendre spectral method for the distributed-order time fractional fourth-order partial differential equation. Int. J. Comput. Math. 2019, 97, 1183–1196. [Google Scholar] [CrossRef]
  12. Fakhar-Izadi, F. Fully spectral-Galerkin method for the one- and two-dimensional fourth-order time-fractional partial integro-differential equations with a weakly singular kernel. Numer. Methods Partial Differ. Equ. 2022, 38, 160–176. [Google Scholar] [CrossRef]
  13. Hosseini, V.R.; Koushki, M.; Zou, W.N. The meshless approach for solving 2D variable-order time-fractional advection-diffusion equation arising in anomalous transport. Eng. Comput. 2021. [Google Scholar] [CrossRef]
  14. Huang, C.; Stynes, M.; An, N. Optimal L(L2) error analysis of a direct discontinuous Galerkin method for a time-fractional reaction-diffusion problem. BIT Numer. Math. 2018, 58, 661–690. [Google Scholar] [CrossRef]
  15. Jin, B.; Lazarov, R.; Zhou, Z. Numerical methods for time-fractional evolution equations with nonsmooth data: A concise overview. Comput. Methods Appl. Mech. Engrg. 2019, 346, 332–358. [Google Scholar] [CrossRef] [Green Version]
  16. Kopteva, N. Error analysis of the L1 method on graded and uniform meshes for a fractional-derivative problem in two and three dimensions. Math. Comp. 2019, 88, 2135–2155. [Google Scholar] [CrossRef]
  17. Li, C.P.; Li, D.X.; Wang, Z. L1/LDG method for the generalized time-fractional Burgers equation. Math. Comput. Simulat. 2021, 187, 357–378. [Google Scholar] [CrossRef]
  18. Li, C.P.; Wang, Z. Numerical methods for the time fractional convection-diffusion-reaction equation. Numer. Func. Anal. Opt. 2021, 42, 1115–1153. [Google Scholar] [CrossRef]
  19. Liao, H.; Li, D.; Zhang, J. Sharp error estimate of nonuniform L1 formula for linear reaction-subdiffusion equations. SIAM J. Numer. Anal. 2018, 56, 1112–1133. [Google Scholar] [CrossRef]
  20. Lyu, P.; Vong, S. Second-order and nonuniform time-stepping schemes for time fractional evolution equations with time-space dependent coefficients. J. Sci. Comput. 2021, 89, 49. [Google Scholar] [CrossRef]
  21. Nikan, O.; Avazzadeh, Z.; Machado, J.A.T. Numerical study of the nonlinear anomalous reaction-subdiffusion process arising in the electroanalytical chemistry. J. Comput. Sci. 2021, 53, 101394. [Google Scholar] [CrossRef]
  22. Stynes, M.; O’Riordan, E.; Gracia, J.L. Error analysis of a finite difference method on graded mesh for a time-fractional diffusion equation. SIAM J. Numer. Anal. 2017, 55, 1057–1079. [Google Scholar] [CrossRef]
  23. Wang, H.; Zhang, Q.; Shu, C.-W. Stability analysis and error estimates of local discontinuous Galerkin methods with implicit-explicit time-marching for the time-dependent fourth order PDEs. ESAIM Math. Model. Numer. Anal. 2017, 51, 1931–1955. [Google Scholar] [CrossRef]
  24. Dong, B.; Shu, C.-W. Analysis of a local discontinuous Galerkin methods for linear time-dependent fourth-order problems. SIAM J. Numer. Anal. 2009, 47, 3240–3268. [Google Scholar] [CrossRef]
  25. Ren, J.; Liao, H.; Zhang, J.; Zhang, Z. Sharp H1-norm error estimates of two time-stepping schemes for reaction-subdiffusion problems. J. Comput. Appl. Math. 2021, 389, 113352. [Google Scholar] [CrossRef]
  26. Alikhanov, A. A new difference scheme for the time fractional diffusion equation. J. Comput. Phys. 2015, 280, 424–438. [Google Scholar] [CrossRef] [Green Version]
  27. Wang, H.; Shu, C.-W.; Zhang, Q. Stability and error estimates of the local discontinuous Galerkin method with implicit-explicit time-marching for nonlinear convection-diffusion problems. Appl. Math. Comput. 2015, 272, 237–258. [Google Scholar] [CrossRef] [Green Version]
  28. Liao, H.; McLean, W.; Zhang, J. A second-order scheme with nonuniform time steps for a linear reaction-subdiffusion problem. Commun. Comput. Phys. 2021, 30, 567–601. [Google Scholar] [CrossRef]
  29. Liao, H.; McLean, W.; Zhang, J. A discrete Gronwall inequality with applications to numerical schemes for subdiffusion problems. SIAM J. Numer. Anal. 2019, 57, 218–237. [Google Scholar] [CrossRef]
  30. Chen, H.; Stynes, M. Error analysis of a second-order method on fitted meshes for a time-fractional diffusion problem. J. Sci. Comput. 2019, 79, 624–647. [Google Scholar] [CrossRef]
Figure 1. The numerical solution the scheme (18) for Example 1 with α = 0.4 , N = 8 , M = 4000 , r = ( 2 α ) / α and T = 1 .
Figure 1. The numerical solution the scheme (18) for Example 1 with α = 0.4 , N = 8 , M = 4000 , r = ( 2 α ) / α and T = 1 .
Fractalfract 06 00206 g001
Figure 2. The numerical solution by the scheme (18) for Example 1 with α = 0.6 , N = 8 , M = 4000 , r = ( 2 α ) / α , and T = 1 .
Figure 2. The numerical solution by the scheme (18) for Example 1 with α = 0.6 , N = 8 , M = 4000 , r = ( 2 α ) / α , and T = 1 .
Fractalfract 06 00206 g002
Figure 3. The numerical solution by the scheme (18) for Example 1 with α = 0.8 , N = 8 , M = 4000 , r = ( 2 α ) / α and T = 1 .
Figure 3. The numerical solution by the scheme (18) for Example 1 with α = 0.8 , N = 8 , M = 4000 , r = ( 2 α ) / α and T = 1 .
Fractalfract 06 00206 g003
Figure 4. L 2 -norm errors versus N with different values of α , M = 4000 , r = ( 2 α ) / α , k = 1 and T = 1 .
Figure 4. L 2 -norm errors versus N with different values of α , M = 4000 , r = ( 2 α ) / α , k = 1 and T = 1 .
Fractalfract 06 00206 g004
Table 1. The L 2 -norm errors and corresponding temporal convergence orders for Example 1 with T = 1 , by the scheme (18) with M = N and r = ( 2 α ) / α .
Table 1. The L 2 -norm errors and corresponding temporal convergence orders for Example 1 with T = 1 , by the scheme (18) with M = N and r = ( 2 α ) / α .
α = 0.4 α = 0.6 α = 0.8
M ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
3202.24 × 10−5*11.793.16 × 10−5*17.264.11 × 10−5*32.11
6407.66 × 10−61.5546.201.75 × 10−50.8560.552.69 × 10−50.61131.45
12803.06 × 10−61.32198.908.53 × 10−61.04247.781.58 × 10−50.77546.24
25601.14 × 10−61.421.32 × 1033.90 × 10−61.131.05 × 1038.96 × 10−60.822.11 × 103
51204.05 × 10−71.491.11 × 1041.67 × 10−61.224.30 × 1044.82 × 10−60.895.80 × 103
Table 2. The L 2 -norm errors and corresponding spatial convergence orders for Example 1 with T = 1 , by the scheme (18) with M = 4000 , r = ( 2 α ) / α and k = 1 .
Table 2. The L 2 -norm errors and corresponding spatial convergence orders for Example 1 with T = 1 , by the scheme (18) with M = 4000 , r = ( 2 α ) / α and k = 1 .
α = 0.4 α = 0.6 α = 0.8
N ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
83.86 × 10−2*43.23.86 × 10−2*130.683.86 × 10−2*131.23
169.32 × 10−32.0548.969.32 × 10−32.05144.609.32 × 10−32.05144.72
322.30 × 10−32.0255.942.30 × 10−32.02187.882.30 × 10−32.02170.32
645.71 × 10−42.0170.675.71 × 10−42.01215.645.71 × 10−42.01215.34
1281.42 × 10−42.01124.491.42 × 10−42.01310.241.42 × 10−42.01309.78
Table 3. The L 2 -norm errors and corresponding spatial convergence orders for Example 1 with T = 1 , by the scheme (18) with M = 4000 , r = ( 2 α ) / α and k = 2 .
Table 3. The L 2 -norm errors and corresponding spatial convergence orders for Example 1 with T = 1 , by the scheme (18) with M = 4000 , r = ( 2 α ) / α and k = 2 .
α = 0.4 α = 0.6 α = 0.8
N ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
82.86 × 10−3*108.242.86 × 10−3*139.642.86 × 10−3*66.67
163.57 × 10−43.00143.793.57 × 10−43.00124.513.57 × 10−43.0059.16
324.46 × 10−53.00214.654.46 × 10−53.00203.554.46 × 10−53.00104.89
645.58 × 10−63.00253.465.58 × 10−63.00168.076.07 × 10−62.88234.49
Table 4. The L 2 -norm errors and corresponding temporal convergence orders for Example 2 with T = 1 , by the scheme (57) with N = 2000 and r = 1 .
Table 4. The L 2 -norm errors and corresponding temporal convergence orders for Example 2 with T = 1 , by the scheme (57) with N = 2000 and r = 1 .
α = 0.4 α = 0.6 α = 0.8
M ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
84.35 × 10−2*1.863.03 × 10−2*1.731.34 × 10−2*1.73
163.32 × 10−20.393.522.03 × 10−20.583.468.05 × 10−30.743.48
322.52 × 10−20.4016.091.34 × 10−20.607.424.63 × 10−30.806.91
641.91 × 10−20.4044.958.80 × 10−30.6114.282.62 × 10−30.8214.27
1281.44 × 10−20.4188.865.76 × 10−30.6130.281.46 × 10−30.8430.04
2561.09 × 10−20.4096.783.75 × 10−30.6266.127.96 × 10−40.88124.61
Table 5. The L 2 -norm errors and corresponding temporal convergence orders for Example 2 with T = 1 , by the scheme (57) with N = 2000 and r = 2 / α .
Table 5. The L 2 -norm errors and corresponding temporal convergence orders for Example 2 with T = 1 , by the scheme (57) with N = 2000 and r = 2 / α .
α = 0.4 α = 0.6 α = 0.8
M ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
87.31 × 10−2*1.765.78 × 10−2*5.154.38 × 10−2*5.23
162.47 × 10−21.573.531.66 × 10−21.8010.311.16 × 10−21.9210.38
327.06 × 10−31.8115.484.41 × 10−31.9120.772.96 × 10−31.9720.87
641.88 × 10−31.9143.151.13 × 10−31.9642.937.50 × 10−41.9842.60
1284.84 × 10−41.9689.742.87 × 10−41.9889.821.89 × 10−41.9990.16
2561.23 × 10−41.98195.207.26 × 10−51.98197.984.77 × 10−51.99195.35
Table 6. The L 2 -norm errors and corresponding temporal convergence orders for Example 2 with T = 1 , by the scheme (57) with N = 2000 and r = ( 3 α ) / α .
Table 6. The L 2 -norm errors and corresponding temporal convergence orders for Example 2 with T = 1 , by the scheme (57) with N = 2000 and r = ( 3 α ) / α .
α = 0.4 α = 0.6 α = 0.8
M ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
89.97 × 10−2*1.837.66 × 10−2*5.045.19 × 10−2*5.14
163.77 × 10−21.403.622.32 × 10−21.7210.191.40 × 10−21.9010.22
321.14 × 10−21.7317.986.27 × 10−31.8920.053.58 × 10−31.9620.85
643.11 × 10−31.8837.181.62 × 10−31.9541.649.06 × 10−41.9842.06
1288.08 × 10−41.9489.394.12 × 10−41.9888.552.28 × 10−41.9988.94
2562.06 × 10−41.97175.391.04 × 10−41.99169.035.76 × 10−51.98109.57
Table 7. The L 2 -norm errors and corresponding spatial convergence orders for Example 2 with T = 1 , by the scheme (57) with M = 2000 , r = ( 3 α ) / α and k = 1 .
Table 7. The L 2 -norm errors and corresponding spatial convergence orders for Example 2 with T = 1 , by the scheme (57) with M = 2000 , r = ( 3 α ) / α and k = 1 .
α = 0.4 α = 0.6 α = 0.8
N ErrorOrderTime(s)ErrorOrderTime(s)ErrorOrderTime(s)
83.86 × 10−2*975.253.86 × 10−2*1.22 × 1033.86 × 10−2*1.73 × 103
169.32 × 10−32.05969.189.32 × 10−32.051.16 × 1039.32 × 10−32.05689.66
322.30 × 10−32.02939.202.30 × 10−32.021.70 × 1032.30 × 10−32.02686.89
645.74 × 10−42.00945.525.72 × 10−42.011.82 × 1035.72 × 10−42.01733.29
1281.46 × 10−41.971.44 × 1031.44 × 10−41.992.63 × 1031.43 × 10−42.00761.07
2563.90 × 10−51.904.71 × 1033.72 × 10−51.951.45 × 1033.65 × 10−51.97800.52
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, Z. Numerical Analysis of Local Discontinuous Galerkin Method for the Time-Fractional Fourth-Order Equation with Initial Singularity. Fractal Fract. 2022, 6, 206. https://doi.org/10.3390/fractalfract6040206

AMA Style

Wang Z. Numerical Analysis of Local Discontinuous Galerkin Method for the Time-Fractional Fourth-Order Equation with Initial Singularity. Fractal and Fractional. 2022; 6(4):206. https://doi.org/10.3390/fractalfract6040206

Chicago/Turabian Style

Wang, Zhen. 2022. "Numerical Analysis of Local Discontinuous Galerkin Method for the Time-Fractional Fourth-Order Equation with Initial Singularity" Fractal and Fractional 6, no. 4: 206. https://doi.org/10.3390/fractalfract6040206

Article Metrics

Back to TopTop